192B Walking in the Rain

# include <cstdio>
# include <algorithm>

# define N 1005

using namespace std;

int n, a
;
int f
;

void init(void)
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
}

void solve(void)
{
f[1] = a[1], f[2] = min(f[1], a[2]);
for (int i = 3; i <= n; ++i)
{
f[i] = max(min(f[i-2], a[i]), min(f[i-1], a[i]));
}
printf("%d\n", f
);
}

int main()
{
init();
solve();

return 0;
}