func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long int MOD = 1e9 + 7;   int32_t main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     long long int n;     cin >> n;     long long int a[n];     for (long long int i = 0; i < n; i++) {       cin >> a[i];     }     if (n == 1) {       cout << 1 <<   n ;       return 0;     }     long long int pre[n + 5];     long long int suf[n + 5];     long long int ans = 1;     pre[0] = 1;     suf[n - 1] = 1;     for (long long int i = 1; i < n; i++) {       if (a[i] > a[i - 1]) {         pre[i] = pre[i - 1];         pre[i]++;       } else {         pre[i] = 1;       }       ans = max(pre[i], ans);     }     for (long long int i = n - 2; i >= 0; i--) {       if (a[i] < a[i + 1]) {         suf[i] = suf[i + 1];         suf[i]++;       } else {         suf[i] = 1;       }       ans = max(pre[i], ans);     }     for (long long int i = 1; i + 1 < n; i++) {       if (a[i + 1] - a[i - 1] >= 2) {         ans = max(ans, 1 + pre[i - 1] + suf[i + 1]);       }       ans = max(ans, 1 + pre[i - 1]);       ans = max(ans, 1 + suf[i + 1]);     }     ans = max(ans, 1 + suf[1]);     ans = max(ans, 1 + pre[n - 2]);     cout << ans <<   n ;     return 0;   }   