1
#include <cstdio>
2
#include <cstring>
3
#include <algorithm>
4
using namespace std;
5
int f[300005][2][2], a[300005];
6
bool change[300005];
7
int main()
8
{
9
    int n;
10
    scanf("%d", &n);
11
    for (int i = 1; i <= n; i++)
12
        scanf("%d", a + i);
13
    a[0] = -1;
14
    int ans = 0;
15
    f[1][0][0] = 1;
16
    f[1][0][1] = 0;
17
    f[1][1][1] = 1;
18
    f[1][1][0] = 0;
19
    for (int i = 2; i <= n; i++)
20
    {
21
        f[i][0][0] = 1;
22
        f[i][0][1] = 1;
23
        f[i][1][1] = 1;
24
        f[i][1][0] = 0;
25
        if (a[i] > a[i - 1])
26
        {
27
            f[i][0][0] = f[i - 1][0][0] + 1;
28
            f[i][0][1] = f[i - 1][0][1] + 1;
29
        }
30
        if (f[i - 1][1][1] == f[i - 2][0][0] + 1)
31
        {
32
            if(a[i] > a[i - 2] + 1)
33
            {
34
                f[i][0][1] = max(f[i][0][1], f[i - 1][1][1] + 1);
35
            }
36
        }
37
        else
38
        {
39
            f[i][0][1] = max(f[i][0][1], f[i - 1][1][1]);
40
        }
41
        f[i][1][1] = max(f[i][1][1], f[i - 1][0][0] + 1);
42
        ans = max(ans,max(f[i][0][0],max(f[i][0][1],f[i][1][1])));
43
    }
44
    printf("%d",ans);
45
}