#include <bits/stdc++.h>
using namespace std;

int a[100]; // 非递减 
int n;

// [L, R]
// 第1个大于等于x的位置 STL lower_bound [L, R)
int bSearch(int a[], int n, int x)
{
    int l = 0, r = n - 1;

    while (l <= r)
    {
        int m = l + (r - l) / 2;
        if (a[m] >= x)
        {
            r = m - 1;
        }
        else // a[m] < x
        {
            l = m + 1;
        }
    }
    return l;
}

int bSearch2(int a[], int n, int x)
{
    int l = 0, r = n - 1;
    int ans = n; // 找不到的情况 
    while (l <= r)
    {
        int m = l + (r - l) / 2;
        if (a[m] >= x)
        {
            ans = m;
            r = m - 1;
        }
        else // a[m] < x
        {
            l = m + 1;
        }
    }
    return ans;
}

int main()
{
    cin >> n;
    for (int i = 0; i < n; i ++)
        cin >> a[i];
    int x;
    cin >> x;
    cout << bSearch(a, n, x) << endl;
    cout << bSearch2(a, n, x) << endl;

    return 0;
}