{
    int n, prev, current, i = 0, i1, i2, dist, dist_old;
    cin >> n;
    prev = n;
    current = n;
    int loc_max = 0;
    for (int k = n; n != 0; k++)
    {
        i = i + 1;
        prev = current;
        current = n;
        cin >> n;
        if (n == 0) {
            break;
        }
        if (current > prev && current > n) {
            loc_max++;
            if (loc_max == 2) {
                i2 = i;
                dist = i2 - i1;
                dist_old = dist;
            }
            if (loc_max >= 3) {
                i2 = i;
                dist = i2 - i1;
                if (dist > dist_old) {
                    dist = dist_old;
                }
                else if (dist <= dist_old) {
                    dist = dist;
                }
                dist_old = dist;
            }
            i1 = i;
        }
    }
    if (loc_max >= 2) {
        cout << dist;
    }
    else {
        cout << 0;
    }
    return 0;
}