题解 | 小猫排队

import math
import sys
from collections import *
from functools import lru_cache
from itertools import *
from math import *
import heapq
import bisect
import random
from array import array
from datetime import *
from functools import *
# sys.setrecursionlimit(1 << 25)
import copy

INF = 10 ** 18

# input = lambda : sys.stdin.readline()
if 1:
    input = lambda: sys.stdin.readline().strip()


    def I():
        return input()


    def II():
        return int(input())


    def MII():
        return map(int, input().split())


    def FI():
        return float(input())


    def MFI():
        return map(float, input().split())


    def LMI():
        return list(map(int, input().split()))


    def LI():
        return list(input().split())


    def LFI():
        return list(map(float, input().split()))


    def MSI():
        return map(str, input().split())


n = II()
a = LMI()
x = II()
cnt = []
for i in range(n - 1,-1,-1):
    if a[i] > x:
        cnt.append(i + 1)

i = 1
j = n + 1
while i <= j:
    if i - 1 < len(cnt):
        if cnt[i - 1] >= i:
            j = cnt[i - 1]
    i += 1
print(i - 1)