// #include using namespace std; #define fi first #define se second #define all(x) x.begin(), x.end() #define lch (o << 1) #define rch (o << 1 | 1) typedef double db; typedef long long ll; typedef unsigned int ui; typedef pair pint; typedef tuple tint; const int N = 2e5 + 5; const int INF = 0x3f3f3f3f; const ll INF_LL = 0x3f3f3f3f3f3f3f3f; int f[N][2]; int a[N]; int main() { ios::sync_with_stdio(0); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { f[i][1] = f[i - 1][0] + 1; if (a[i - 1] < a[i]) f[i][1] = max(f[i][1], f[i - 1][1] + 1); f[i][0] = max(f[i - 1][0], f[i - 1][1]); } cout << max(f[n][0], f[n][1]); return 0; }