Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
v = [int(_) for _ in input().split()]
x = v[::2]
y = v[1::2]
if len(set(x)) == 1 and len(set(y)) == 1:
    if x[0] == y[0]:
        print(len(y))
    else:
        print(0)
elif len(set(x)) != 0 and len(set(y)) == 1:
    u = sorted([[x[i],x.count(x[i])] for i in range(len(x))],key=lambda t:-t[1])
    max1 = u[0][1]
    moji1 = u[0][0]
    max2 = 0
    moji2 = 0
    for i in range(len(x)):
        if u[i][0] != moji1:
            moji2 = u[i][0]
            max2 = u[i][1]
            break
    if moji1 != y[0]:
        print(len(x) - max1)
    else:
        print(len(x) - max2)
elif len(set(y)) != 0 and len(set(x)) == 1:
    v = sorted([[y[i],y.count(y[i])] for i in range(len(y))],key=lambda t:-t[1])
    max3 = v[0][1]
    moji3 = v[0][0]
    max4 = 0
    moji4 = 0
    for i in range(len(y)):
        if v[i][0] != moji3:
            moji4 = v[i][0]
            max4 = v[i][1]
            break
    if moji3 != y[0]:
        print(len(x) - max3)
    else:
        print(len(x) - max4)
else:
    u = sorted([[x[i],x.count(x[i])] for i in range(len(x))],key=lambda t:-t[1])
    max1 = u[0][1]
    moji1 = u[0][0]
    max2 = 0
    moji2 = 0
    for i in range(len(x)):
        if u[i][0] != moji1:
            moji2 = u[i][0]
            max2 = u[i][1]
            break
    v = sorted([[y[i],y.count(y[i])] for i in range(len(y))],key=lambda t:-t[1])
    max3 = v[0][1]
    moji3 = v[0][0]
    max4 = 0
    moji4 = 0
    for i in range(len(y)):
        if v[i][0] != moji3:
            moji4 = v[i][0]
            max4 = v[i][1]
            break
    if moji1 != moji3:
        print(n - max1 - max3)
    else:
        print(min(n-max1-max4,n-max2-max3))

Fixed submission:
import collections

n = int(input())
v = [int(_) for _ in input().split()]

v_even = v[::2]
v_odd = v[1::2]

a_even = collections.Counter(v_even)
a_odd = collections.Counter(v_odd)

li_even = a_even.most_common()
li_odd = a_odd.most_common()

if li_even[0][0] != li_odd[0][0]:
    print(n - li_even[0][1] - li_odd[0][1])
else:
    if len(li_even) != 1 and len(li_odd) != 1:
        print(min(n - li_even[0][1] - li_odd[1][1],n - li_even[1][1] - li_odd[0][1]))
    elif len(li_even) != 1 and len(li_odd) == 1:
        print(int(n/2) - li_even[1][1])
    elif len(li_even) == 1 and len(li_odd) != 1:
        print(int(n/2) - li_odd[1][1])
    else:
        print(int(n/2))
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())

if a == 2 or b == 2;
	print('No')
else:
	print('Yes')

Fixed submission:
a,b = map(int,input().split())
 
if a == 2 or b == 2:
	print('No')
else:
	print('Yes')
Buggy python submission (verdict: Runtime Error):
import math
N,X = map(int,input().split())
x = [int(_) for _ in input().split()]
y = [x[i]-X for i in range(N)]
ans = 0
for i in range(N):
    ans = math.gcd(ans,y[i])
print(ans)

Fixed submission:
import fractions as f
N,X = map(int,input().split())
x = [int(_) for _ in input().split()]
y = [abs(x[i]-X) for i in range(N)]
ans = 0
for i in range(N):
    ans = f.gcd(ans,y[i])
print(ans)
Buggy python submission (verdict: Runtime Error):
import numpy as np
x1,y1,x2,y2 = map(int,input().split())
v = np.array([x1,y1])
w = np.array([x2,y2])
u = w - v
T = np.array([[0,-1],[1,0]])
v1 = np.matmul(T,u) + w
v2 = np.matmul(T,v1 - w) + v1
print(v1[0],v1[1],v2[0],v2[1])

Fixed submission:
u,v,x,y = map(int,input().split())
[p,q] = [x-(y-v),y+(x-u)]
[r,s] = [p-(q-y),q+(p-x)]
print(p,q,r,s)
Buggy python submission (verdict: Runtime Error):
N = int(input())
if N == 0:
    print(0)
else:
    li = []
    ind = 0
    while N != 0:
        if N % 2**(ind + 1) == 0:
            li.insert(0,0)
            ind += 1
        else:
            li.insert(0,1)
            N -= (-2)**(ind)
            ind += 1            
x = ''.join([str(li[i]) for i in range(len(li))])
print(x)

Fixed submission:
N = int(input())
if N == 0:
    print(0)
else:
    li = []
    ind = 0
    while N != 0:
        if N % 2**(ind + 1) == 0:
            li.insert(0,0)
            ind += 1
        else:
            li.insert(0,1)
            N -= (-2)**(ind)
            ind += 1            
    x = ''.join([str(li[i]) for i in range(len(li))])
    print(x)
Buggy python submission (verdict: Runtime Error):
S,T = map(str,input().split())
ans = False
for i in range(len(S)):
    if list(S) == [list(T)[(i+j)%(len(T))] for j in range(len(T))]:
        ans = True
if ans:
    print('Yes')
if not ans:
    print('No')

Fixed submission:
S = input()
T = input()
ans = False
for i in range(len(S)):
    if list(S) == [list(T)[(i+j)%(len(T))] for j in range(len(T))]:
        ans = True
if ans:
    print('Yes')
if not ans:
    print('No')
Buggy python submission (verdict: Runtime Error):
if a+b <= 2*c:
    print(a*x+b*y)
else:
    if x>=y:
        if a <= 2*c:
            print(y*(2*c)+a*(x-y))
        else:
            print(2*c*x)
    else:
        if b<= 2*c:
            print(x*2*c+b*(y-x))
        else:
            print(2*c*y)

Fixed submission:
a,b,c,x,y = map(int,input().split())


if a+b <= 2*c:
    print(a*x+b*y)
else:
    if x>=y:
        if a <= 2*c:
            print(y*(2*c)+a*(x-y))
        else:
            print(2*c*x)
    else:
        if b<= 2*c:
            print(x*2*c+b*(y-x))
        else:
            print(2*c*y)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
ans = [i for i in range(a,b+1) if i in range(a,min(a+k,b+1)) or i in range(max(a,b-k+1),b+1)]
for i in range(len(ans)):
    print(ans[i])

Fixed submission:
a,b,k = map(int,input().split())
if b-a <= 2 * k - 1:
    for i in range(a,b+1):
        print(i)
else:
    for i in range(a,a+k):
        print(i)
    for i in range(b-k+1,b+1):
        print(i)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
ans = [i for i in range(a,b+1) if i in range(a,a+k) or i in range(b-k+1,b+1)]
for i in range(len(ans)):
    print(ans[i])

Fixed submission:
a,b,k = map(int,input().split())
if b-a <= 2 * k - 1:
    for i in range(a,b+1):
        print(i)
else:
    for i in range(a,a+k):
        print(i)
    for i in range(b-k+1,b+1):
        print(i)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,k = map(int,input().split())
ans = [i for i in range(a,b+1) if i in range(a,a+k) or i in range(b-k+1,b+1)]
for i in range(len(ans)):
    print(ans[i])

Fixed submission:
a,b,k = map(int,input().split())
if b-a <= 2 * k - 1:
    for i in range(a,b+1):
        print(i)
else:
    for i in range(a,a+k):
        print(i)
    for i in range(b-k+1,b+1):
        print(i)
Buggy python submission (verdict: Runtime Error):
if n == 1 and m == 1:
    print(1)
if n != 1 and m == 1:
    print(m-2)
if n == 1 and m != 1:
    print(n-2)
if n != 1 and m != 1:
    print((n-2)*(m-2))

Fixed submission:
n,m = map(int,input().split())

if n == 1 and m == 1:
    print(1)
if n != 1 and m == 1:
    print(n-2)
if n == 1 and m != 1:
    print(m-2)
if n != 1 and m != 1:
    print((n-2)*(m-2))
Buggy python submission (verdict: Runtime Error):
a,b = int(input().split())
if a*b % 2 ==0:
  print(Even)
else:
  print(Odd)

Fixed submission:
a,b = (int(j) for j in input().split())
if a*b % 2 == 0:
  print('Even')
else:
  print('Odd')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(_) for _ in input().split()]

res = 0

for i in set(a):
    tmp = a.count(i)
    if tmp < i:
        res += tmp
    else:
        res += tmp - i

print(res)

Fixed submission:
import bisect
n = int(input())
a = [int(_) for _ in input().split()]
a.sort()

res = 0

for i in set(a):
    tmp = bisect.bisect_right(a,i)-bisect.bisect_left(a,i)
    if tmp < i:
        res += tmp
    else:
        res += tmp - i

print(res)
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
x = [int(_) for _ in input().split()]
res = 0
for i in range(n):
  res += min(x[i],abs(k-x[i]))
print(res*2)

Fixed submission:
n = int(input())
k = int(input())
x = [int(_) for _ in input().split()]
res = 0
for i in range(n):
  res += min(x[i],abs(k-x[i]))
print(res*2)
Buggy python submission (verdict: Runtime Error):
s = input()
s =input()
ab = [chr(97+i) for i in range(26)]
res = 'None'
for i in ab:
    if i not in s:
        res = i
        break
print(res)

Fixed submission:
s =input()
ab = [chr(97+i) for i in range(26)]
res = 'None'
for i in ab:
    if i not in s:
        res = i
        break
print(res)
Buggy python submission (verdict: Runtime Error):
r,g,b = input().split()
if int(r+g+b)%4==0: print('YES')
else print('NO')

Fixed submission:
r,g,b = input().split()
if int(r+g+b)%4==0: print('YES')
else: print('NO')
Buggy python submission (verdict: Runtime Error):
s=input()
s[5]=' '
s[13]=' '
print(s)

Fixed submission:
s=input()
print(s[0:5]+' '+s[6:13]+' '+s[14:19])
Buggy python submission (verdict: Runtime Error):
k,s=map(int,input().split())
res=0
for i in range(k+1):
  for j in range(K+1):
    if 0<=s-i-j and s-i-j<=k:res+=1
print(res)

Fixed submission:
k,s=map(int,input().split())
res=0
for i in range(k+1):
  for j in range(k+1):
    if 0<=s-i-j and s-i-j<=k:res+=1
print(res)
Buggy python submission (verdict: Time Limit Exceeded):

N = int(input())
#N,K = map(int, input().split())
dct = {}
for z in range(N):
    x = input()
    if x in dct.keys():
        dct[x] += 1
    else:
        dct[x] = 1
mx = dct[max(dct, key=dct.get)]
ans = []
for key in dct.keys():
    if dct[key] == mx:
        ans.append(key)
ans.sort()
for elem in ans:
    print(elem)


Fixed submission:
N = int(input())
#N,K = map(int, input().split())
dct = {}
mx = 0
for z in range(N):
    x = input()
    try:
        dct[x] += 1
    except:
        dct[x] = 1
    mx = max(mx, dct[x])
keys = list(dct.keys())
ans = []
for key in keys :
    if dct[key] == mx:
        ans.append(key)
ans.sort()
for elem in ans:
    print(elem)
Buggy python submission (verdict: Runtime Error):
from math import gcd
a,b = map(int, input().split())
#print((a*b)//gcd(a,b))


Fixed submission:
from fractions import gcd
a,b = map(int, input().split())
print((a*b)//gcd(a,b))

Buggy python submission (verdict: Runtime Error):
import math
a,b = map(int, input().strip().split())
print((a*b)//int(math.gcd(a,b)))


Fixed submission:
from fractions import gcd
a,b = map(int, input().split())
print((a*b)//gcd(a,b))

Buggy python submission (verdict: Runtime Error):
from math import gcd
a,b = map(int, input().split())
print((a*b)//gcd(a,b))


Fixed submission:
from fractions import gcd
a,b = map(int, input().split())
print((a*b)//gcd(a,b))

Buggy python submission (verdict: Runtime Error):
from math import gcd
a,b = map(int, input().split())
print((a*b)//gcd(a,b))

Fixed submission:
from fractions import gcd
a,b = map(int, input().split())
print((a*b)//gcd(a,b))
Buggy python submission (verdict: Runtime Error):
N,X = map(int,input().split())
for i in range(max(−1000000,X-N+1),min(X+N,1000001)):
    print(i)

Fixed submission:
N,X = map(int,input().split())
for i in range(max(-1000000,X-N+1),min(X+N,1000001)):
    print(i)

Buggy python submission (verdict: Runtime Error):
N,X = map(int,input().split())
for i in range(max(−1000000,X-N+1),max(X+N,1000001)):
    print(i)

Fixed submission:
N,X = map(int,input().split())
for i in range(max(-1000000,X-N+1),min(X+N,1000001)):
    print(i)
Buggy python submission (verdict: Time Limit Exceeded):
T = int(input())
dct ={}
for z in range(T):
    s = list(input())
    s.sort()
    s = "".join(s)
    if s in dct.keys():
        dct[s] += 1
    else:
        dct[s] = 1
v = 0
for elem in dct.values():
    v += (elem*(elem-1))//2
print(v)

Fixed submission:
T = int(input())
dct ={}
for z in range(T):
    s = "".join(sorted(input()))
    if s in dct:
        dct[s] += 1
    else:
        dct[s] = 1
v = 0
for elem in dct.values():
    v += (elem*(elem-1))//2
print(v)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
lst = []
count = 0
for z in range(N):
    lst.append(sorted(input()))
for i in range(N):
    for j in range(i+1,N):
        if lst[i] == lst[j]:
            count += 1
print(count)

Fixed submission:
T = int(input())
dct ={}
for z in range(T):
    s = "".join(sorted(input()))
    if s in dct:
        dct[s] += 1
    else:
        dct[s] = 1
v = 0
for elem in dct.values():
    v += (elem*(elem-1))//2
print(v)
Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int, input().split())
lst = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
    mn = 999999999999999999
    for j in range(1,K+1):
        if i-j >= 0:
            mn = min(mn,dp[i - j] + abs(lst[i] - lst[i - j]))
        else:
            break
    dp[i] = mn
print(dp[-1])


Fixed submission:
N,K = map(int, input().split())
lst = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
    mn = 999999999999999999
    for j in range(max(i-K,0), i):
        mn = min(mn,dp[j] + abs(lst[i] - lst[j]))
    dp[i] = mn
print(dp[-1])

Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int, input().split())
lst = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
    mn = 999999999999999999
    for j in range(max(i-K,0), i):
        mn = min(mn,dp[j] + abs(lst[i] - lst[j]))
    dp[i] = mn
print(dp[-1])

Fixed submission:
N,K = map(int, input().split())
lst = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
    mn = 999999999999999999
    for j in range(max(i-K,0), i):
        mn = min(mn,dp[j] + abs(lst[i] - lst[j]))
    dp[i] = mn
print(dp[-1])

Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int, input().split())
lst = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
    mn = 999999999999999999
    for j in range(1,K+1):
        if i-j >= 0:
            mn = min(mn,dp[i - j] + abs(lst[i] - lst[i - j]))
        else:
            break
    dp[i] = mn
print(dp[-1])

Fixed submission:
N,K = map(int, input().split())
lst = list(map(int, input().split()))
dp = [0 for i in range(N)]
for i in range(1,N):
    mn = 999999999999999999
    for j in range(max(i-K,0), i):
        mn = min(mn,dp[j] + abs(lst[i] - lst[j]))
    dp[i] = mn
print(dp[-1])
Buggy python submission (verdict: Runtime Error):
N,K = map(int, input().split())
lst = []
for z in range(K):
    lst.append(input())
lst.sort()
print("".join(lst))

Fixed submission:
N,K = map(int, input().split())
lst = []
for z in range(N):
    lst.append(input())
lst.sort()
print("".join(lst))
Buggy python submission (verdict: Runtime Error):
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    s = input()
    if s == 'SUN':
        print(7)
    if s == "MON":
        print(6)
    if s == "TUE":
        print(5)
    if s == "WED":
        print(4)
    if s == "THU":
        print(3)
    if s == "FRI":
        print(2)
    if s == "SAT":
        print(1)
    return


# B
def B():
    al = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
    n = I()
    s = S()
    for i in range(len(s)):
        ni = (al.index(s[i]) + n) % 26
        s[i] = al[ni]
    print(''.join(s))
    return


# C
def C():
    a, b, x = LI()
    l = [a * (10 ** (i - 1)) + b * i for i in range(1, 11)]
    p = 0
    for i in range(10):
        if x < l[i] and i == 0:
            print(0)
            return
        if l[i] <= x and i == 9:
            print(10 ** 9)
            return
        elif l[i] <= x < l[i + 1]:
            p = i + 1
            break
    if (x - b * p) // a >= 10 ** p:
        print(10 ** p - 1)
    else:
        print((x - b * p) // a)
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    C()

    return


# Solve
if __name__ == "__main__":
    C()


Fixed submission:
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    s=input()
    if s=='SUN':
        print(7)
    if s=="MON":
        print(6)
    if s=="TUE":
        print(5)
    if s=="WED":
        print(4)
    if s=="THU":
        print(3)
    if s=="FRI":
        print(2)
    if s=="SAT":
        print(1)
    return


# B
def B():
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    A()
    return


# Solve
if __name__ == "__main__":
    A()
Buggy python submission (verdict: Runtime Error):
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    s = input()
    if s == 'SUN':
        print(7)
    if s == "MON":
        print(6)
    if s == "TUE":
        print(5)
    if s == "WED":
        print(4)
    if s == "THU":
        print(3)
    if s == "FRI":
        print(2)
    if s == "SAT":
        print(1)
    return


# B
def B():
    al = list("ABCDEFGHIJKLMNOIQRSTUVWXYZ")
    n = I()
    s = S()
    for i in range(len(s)):
        ni = (al.index(s[i]) + n) % 26
        s[i] = al[ni]
    print(''.join(s))
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    B()
    return


# Solve
if __name__ == "__main__":
    B()


Fixed submission:
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    s = input()
    if s == 'SUN':
        print(7)
    if s == "MON":
        print(6)
    if s == "TUE":
        print(5)
    if s == "WED":
        print(4)
    if s == "THU":
        print(3)
    if s == "FRI":
        print(2)
    if s == "SAT":
        print(1)
    return


# B
def B():
    al = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
    n = I()
    s = S()
    for i in range(len(s)):
        ni = (al.index(s[i]) + n) % 26
        s[i] = al[ni]
    print(''.join(s))
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    B()
    return


# Solve
if __name__ == "__main__":
    B()
Buggy python submission (verdict: Runtime Error):
    a=[]
    for i in range(1, 10):
        for j in range(i+1, 10):
            a.append(i*j)
    n=int(input())
    if n in a:
        print("Yes")
    else:
        print("No")

Fixed submission:
a = []
for i in range(1, 10):
    for j in range(i, 10):
        a.append(i * j)
n = int(input())
if n in a:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import sys
import math
from collections import defaultdict, deque
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    return


# B
def B():
    return


# C
def C():
    n = I()
    for i in range(int(n ** 0.5), 0, -1):
        if n % i == 0:
            print(i + n // i - 2)
            return
    return


# D
def D():
    a,b,x=LI()
    if (x <= a**2*b/2):
        print(math.degrees(math.atan(x/a/b/b)))
    else:
        print(math.degrees(math.atan(a**3/(a**2*b-x))))
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    D()
    return


# Solve
if __name__ == "__main__":
    D()


Fixed submission:
import sys
import math
from collections import defaultdict, deque
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    return


# B
def B():
    return


# C
def C():
    n = I()
    for i in range(int(n ** 0.5), 0, -1):
        if n % i == 0:
            print(i + n // i - 2)
            return
    return


# D
def D():
    a, b, x = LI()
    if (x <= a * a * b / 2):
        print(math.degrees(math.atan(a * b * b / x / 2)))
    else:
        print(math.degrees(math.atan(2 * (a * a * b - x) / a ** 3)))
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    D()
    return


# Solve
if __name__ == "__main__":
    D()
Buggy python submission (verdict: Runtime Error):
import sys


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


# A
def A():


# B
def B():
    n, k = LI()
    h = LI()
    ans = 0
    for i in h:
        if i >= k:
            ans += 1
    print(ans)


# C
def C():


# D
def D():


# E
def E():


# F
def F():


# Solve
if __name__ == "__main__":
    B()


Fixed submission:
import sys


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


sys.setrecursionlimit(1000000)
mod = 1000000007


# A
def A():
    return


# B
def B():
    n, k = LI()
    h = LI()
    ans = 0
    for i in h:
        if i >= k:
            ans += 1
    print(ans)
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Solve
if __name__ == "__main__":
    B()

Buggy python submission (verdict: Runtime Error):
import sys


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


# A
def A():


# B
def B():
    n,k=LI()
    h=LI()
    ans=0
    for i in h:
        if i>=k:
            ans+=1;
    print(ans)

# C
def C():


# D
def D():


# E
def E():


# F
def F():


# Solve
if __name__ == "__main__":
    B()

Fixed submission:
import sys


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


sys.setrecursionlimit(1000000)
mod = 1000000007


# A
def A():
    return


# B
def B():
    n, k = LI()
    h = LI()
    ans = 0
    for i in h:
        if i >= k:
            ans += 1
    print(ans)
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Solve
if __name__ == "__main__":
    B()