Harryxun/stf_run huggingface dataset:
import cmath
import math
import itertools
n=int(input())
a=[]
b=[]
#偏角ソートの方が楽
for i in range(n):
    x,y=map(int,input().split())
    a.append(complex(x,y))
    b.append(cmath.phase(a[i]))
#a.sort(key=cmath.phase)
m=0
#math.piに注意
for i in range(n):
    if a[i]!=complex(0,0):
        za,zb=complex(0,0),complex(0,0)
        zc,zd=complex(0,0),complex(0,0)
        for j in range(n):
            p=cmath.phase(a[j]/a[i])
            if -math.pi<=p<=0:
                za+=a[j]
            if 0<=p<=math.pi:
                zb+=a[j]
        m=max([m,abs(za),abs(zb)])
        if i!=n-1:
            for j in range(n):
                p=cmath.phase(a[j]/((a[i]+a[i+1])/2))
                if -math.pi<=p<=0:
                    zc+=a[j]
                if 0<=p<=math.pi:
                    zd+=a[j]
            m=max([m,abs(zc),abs(zd)])

print(m)


### FIXED CODE ###

import cmath
import math
n=int(input())
a=[]
b=[]
#偏角ソートの方が楽
for i in range(n):
    x,y=map(int,input().split())
    a.append(complex(x,y))
    b.append(cmath.phase(a[i]))
#a.sort(key=cmath.phase)
ma=0
#math.piに注意
for i in range(n):
    z=a[i]
    c=b[i]-math.pi/2
    d=b[i]+math.pi/2
    l=max([c,-math.pi])
    r=min([d,math.pi])
    #(0,0)の時は偏角が0になってしまうし、除く
    #あとは-piとpiどっちになるか→piになる
    if a[i]!=complex(0,0):
        for j in range(n):
            if j!=i:
                #境界条件の場合分けがむずい
                if l<=b[j]<=r or (c<=-math.pi and c+2*math.pi<=b[j]<=math.pi) or (d>=math.pi and -math.pi<=b[j]<=d-2*math.pi):
                    z+=a[j]
    ma=max([abs(z),ma])
m=0
#math.piに注意
for i in range(n):
    if a[i]!=complex(0,0):
        za,zb=complex(0,0),complex(0,0)
        for j in range(n):
            p=cmath.phase(a[j]/a[i])
            if -math.pi<=p<=0:
                za+=a[j]
            if 0<=p<=math.pi:
                zb+=a[j]
        m=max([m,abs(za),abs(zb)])
        if i!=n-1 and a[i]+a[i+1]!=0:
            zc,zd=complex(0,0),complex(0,0)
            for j in range(n):
                p=cmath.phase(a[j]/((a[i]+a[i+1])/2))
                if -math.pi<=p<=0:
                    zc+=a[j]
                if 0<=p<=math.pi:
                    zd+=a[j]
            m=max([m,abs(zc),abs(zd)])

print(max([m,ma]))
n,k=map(int,input().split())
m=[]
for i in range(n):
  d=int(input())
  a=list(map(int,input().split()))
  for i in a:
    m=m.append(i)
j=set(m)
print(n-len(j))
  
  

### FIXED CODE ###

N,K=map(int,input().split())
B=[]
for i in range(K):
  D=int(input())
  A=list(map(int,input().split()))
  for j in A:
    B.append(j)
print(N-len(set(B)))
r,d,x=map(int,input().split())
print(x for _ in range(10) x=r*x-d)

### FIXED CODE ###

r,d,x = map(int,input().split())

for i in range(10):
      ans = r*x-d
      print(ans)
      x = ans
N = raw_input()
N = int(N)

a = {}
for i in range(N):
	s_input = raw_input()
	s_input = int(s_input)
	if s_input in a:
		del a[s_input]
	else:
		a[s_input] += 1

print(len(a))

### FIXED CODE ###

N = raw_input()
N = int(N)

num10 = N/10
num1 = N - num10*10

if num10 == 9 or num1 == 9:
	print('Yes')
else:
	print('No')
A, B, C = map(int, input().split)
print(min(C, B//A)

### FIXED CODE ###

A, B, C = map(int, input().split())
print(min(C, B//A))
N,K = map(int, input().split())
list = [int(input()) for i in range(N)]
max(list())
list.sort()
print(min(list[i+K-1] - list[i] for i in range(N-K+1)))

### FIXED CODE ###

N, K = map(int, input().split())
h = [int(input()) for i in range(N)]
h.sort()
print(min(h[i+K-1] - h[i] for i in range(N-K+1)))
a, b= map(int, input().split())

c=a+b
d=a-b
e=a*b

print(max[c, d, e])

### FIXED CODE ###

a, b= map(int, input().split())
 
c=a+b
d=a-b
e=a*b
 
f=max([c, d, e])
 
print(f)
N = int(input())
A = [list(map(int, input().split())) for i in range(N)]

A.sort()
grid = {}
for i in range(N):
    for j in range(i+1,N):
        if (A[j][0] - A[i][0], A[j][1] - A[i][1]) not in grid:
            grid[A[j][0] - A[i][0], A[j][1] - A[i][1]] = 1
        else:
            grid[A[j][0] - A[i][0], A[j][1] - A[i][1]] += 1

print(N - max(grid.values()))

### FIXED CODE ###

N = int(input())
A = [list(map(int, input().split())) for i in range(N)]

if N == 1:
    print(1)
    exit()
A.sort()
grid = {}
for i in range(N):
    for j in range(i+1,N):
        if (A[j][0] - A[i][0], A[j][1] - A[i][1]) not in grid:
            grid[A[j][0] - A[i][0], A[j][1] - A[i][1]] = 1
        else:
            grid[A[j][0] - A[i][0], A[j][1] - A[i][1]] += 1

print(N - max(grid.values()))
n, y = list(map(int, input().split()))

for i in y:
  for j in y:
    for k in y:
      if i / 10000  + j / 5000 + k / 1000 == 0 and i + j + k == n:
        print(i, j , k)
      else:
        print(-1, -1, -1)

### FIXED CODE ###

n, y = list(map(int, input().split()))
ans = 0

for i in range(n+1):
    a1 = 10000 * i
    for j in range(n+1-i):
        a2 = 5000 * j
        k = n- (i+j)
        a3 = k*1000
        if a1 + a2 + a3  == y and i + j + k == n:
            print(i, j , k)
            ans += 1
            exit(0)
    if ans == 1:
        break
if ans == 0:
    print(-1, -1, -1)
N=int(input())

A=list(map(int,input().split()))
answer=0

for i in range(N):
  if A[i]==i+1:
    if A[i+1]!=i+1 and i!=N-1:
      A[i],A[i+1]=A[i+1],A[i]
      answer+=1
    else:
      A[i],A[i-1]=A[i-1],A[i]
      answer+=1
print(answer)

### FIXED CODE ###

N=int(input())

A=list(map(int,input().split()))
answer=0

for i in range(N):
  if A[i]==i+1:
    if i!=N-1 and A[i+1]!=i+1:
      A[i],A[i+1]=A[i+1],A[i]
      answer+=1
    else:
      A[i],A[i-1]=A[i-1],A[i]
      answer+=1
print(answer)
# -*- coding: utf-8 -*-
import math


A, B, C, D = map(int,input().split())

lcm = C * D // math.gcd(C, D)

maxC = B // C
maxD = B // D
maxlcm = B // lcm

minC = (A-1) // C
minD = (A-1) // D
minlcm = (A-1) // lcm

lcmB = (maxC + maxD - maxlcm)
lcmA = (minC + minD - minlcm)

print((B-A+1)-(lcmB-lcmA))


### FIXED CODE ###

# -*- coding: utf-8 -*-
import fractions

A, B, C, D = map(int,input().split())

lcm = C * D // fractions.gcd(C, D)

maxC = B // C
maxD = B // D
maxlcm = B // lcm

minC = (A-1) // C
minD = (A-1) // D
minlcm = (A-1) // lcm

lcmB = (maxC + maxD - maxlcm)
lcmA = (minC + minD - minlcm)

print((B-A+1)-(lcmB-lcmA))
a=input
b=input

print(a*b)

print(2a+2b)


### FIXED CODE ###

a,b=map(int,input().split())
print(a*b,2*(a+b))
a,b=map(input().split())
ans=a*(a-1)/2+b*(b-1)/2
print (ans)

### FIXED CODE ###

a,b=map(int,input().split())
print (a*(a-1)//2+b*(b-1)//2)
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Thu Aug  8 23:12:25 2019

@author: kohei
"""

N = input()

A = N.split()[0]
B = N.split()[1]
C = N.split()[2] 

print(C-A+B)

### FIXED CODE ###


N = input()

A = int(N.split()[0])
B = int(N.split()[1])
C = int(N.split()[2]) 

D = A-B

if D<C:
    print(C-D)

else:
    print(0)
n, k = [int(x) for x in input().split()]
l = [int(y) for y in input().split()]

l.sort()

print(l[-1]+l[-2]+l[-3])


### FIXED CODE ###

n, k = [int(x) for x in input().split()]
l = [int(y) for y in input().split()]

l.sort()

print(sum(l[-k:]))
n=int(input())
xy=[[] for i in range(n)]
ans=0
a=[0]*n
for i in range(n):
  a[i]=int(input())
  for j in range(a[i]):
    x,y=map(int,input().split())
    xy[i].append([x,y])
for i in range(2**n):
  temp=[0]*n
  for j in range(n):
    if ((i >> j) & 1):
      temp[j]=1
  count=True
  for j in range(n):
    for k in range(a[j]):
      if temp[j]==1:
        p=xy[j][k][0]
        if temp[p]!=xy[j][k][0]:
          count=False
      else:
        p=xy[j][k][0]
        if temp[p]==xy[j][k][0]:
          count=False     
  if count==True:
    ans=max(ans,sum(temp))
print(ans)

### FIXED CODE ###

n=int(input())
xy=[[] for i in range(n)]
ans=0
a=[0]*n
for i in range(n):
  a[i]=int(input())
  for j in range(a[i]):
    x,y=map(int,input().split())
    xy[i].append([x,y])
for i in range(2**n):
  temp=[0]*n
  for j in range(n):
    if ((i >> j) & 1):
      temp[j]=1
  count=True
  for j in range(n):
    for k in range(a[j]):
      if temp[j]==1:
        p=xy[j][k][0]-1
        if temp[p]!=xy[j][k][1]:
          count=False
          break
  if count==True:
    ans=max(ans,sum(temp))
print(ans)
N     = 100

M     = [[0 for i in range(N)] for j in range(N)]
color = [0 for i in range(N)]
d     = [0 for i in range(N)]
f     = [0 for i in range(N)]
tt    = 0

###
def dfs_visit(u):
    color[u] = 1
    tt = tt + 1
    d[u] = tt

    for v in range(n):
        if M[u][v] == 0:
            continue
        if color[v] == 0:
            dfs_visit(v)
    color[u] = 2
    tt = tt + 1
    f[u] = tt

###
def dfs():
    for u in range(n):
        color[u] = 0
    tt = 0

    for u in range(n):
        if color[u] == 0:
            dfs_visit(u)

    for u in range(n):
        print "%d %d %d" %(u + 1, d[u], f[u])

### MAIN
n = input()

for i in range(n):
    for j in range(n):
        M[i][j] = 0

for i in range(n):
    Num = map(int, raw_input().split())
    u = Num[0]
    k = Num[1]
    u = u - 1
    for j in range(k):
        v = Num[j]
        v = v - 1
        M[u][v] = 1

dfs()

### FIXED CODE ###

n = input()

d     = [0 for i in range(n)]
f     = [0 for i in range(n)]
G     = [0 for i in range(n)]
M     = [[0 for i in range(n)] for j in range(n)]
color = [0 for i in range(n)]
tt    = [0]
WHITE = 0
GRAY  = 1
BLACK = 2

def dfs_visit(u):
    color[u] = GRAY
    tt[0] = tt[0] + 1
    d[u] = tt[0]
    for v in range(n):
        if M[u][v] == 0:
            continue
        if color[v] == WHITE:
            dfs_visit(v)
    color[u] == BLACK
    tt[0] = tt[0] + 1
    f[u] = tt[0]

def dfs():
    for u in range(n):
        if color[u] == WHITE:
            dfs_visit(u)
    for u in range(n):
        print "%d %d %d" %(u + 1, d[u], f[u])

### MAIN
for i in range(n):
    G = map(int, raw_input().split())
    for j in range(G[1]):
        M[G[0]-1][G[2+j]-1] = 1

dfs()
s = input()
k = int(input())
subs = []
for i in range(len(s)):
    for j in range(len(s)):
        if j > i:
            if s[i:j] not in subs:
                subs.append(s[i:j])
            # print(i,j)

subs.append(s)

print(sorted(subs)[k-1])

### FIXED CODE ###

s = input()
k = int(input())
subs = []
for i in range(len(s)):
    for j in range(5):
        if s[i:i+j+1] not in subs:
            subs.append(s[i:i+j+1])
subs = sorted(subs)
# print(subs)
print(subs[k-1])
N,M=int(input().split())

number=0
for i in range(N):
  v=int(input())
  if v < 1/(4*M):
    number=number
  else:
    number = number+1
if number >= M:
  print("Yes")
else:
  print("No")

### FIXED CODE ###

N,M=input().split()
N,M=[int(N),int(M)]
 
a = list(map(int,input().strip().split()))[:N]
  
number=0
total=0
for i in range(N):
  v=a[i]
  total=total+v
for i in range(N):
  v=a[i]
  if v < (1/(4*M))*total:
    number=number
  else:
    number = number+1
if number >= M:
  print("Yes")
else:
  print("No")
s1=input()
s2=input()
s3=input()
x=s1[0]
s1.lstrip(x)
y=1
while y>0:
    if x=="a":
        x=s1[0]
        s1=s1[1:]
        if x=="a" and len(s1)==0:
            print("A")
            exit()
    elif x=="b":
        x=s2[0]
        s2=s2[1:]
        if x=="b" and len(s2)==0:
            print("B")
            exit()
    else:
        x=s3[0]
        s3=s3[1:]
        if x=="c" and len(s3)==0:
            print("C")
            exit()



### FIXED CODE ###

s1=input()
s2=input()
s3=input()
x=s1[0]
s1=s1[1:]
while (len(s1)!=0 or x!="a") and (len(s2)!=0 or x!="b") and (len(s3)!=0 or x!="c") :
    if x=="a":
        x=s1[0]
        s1=s1[1:]
 
    elif x=="b":
        x=s2[0]
        s2=s2[1:]
  
    else:
        x=s3[0]
        s3=s3[1:]
    
if len(s1)==0 and x=="a":
    print("A")
elif len(s2)==0 and x=="b":
    print("B")
else:
    print("C")
pow(x,3)

### FIXED CODE ###

x = int(input())
print(x**3)
print("ABC"*(int(input()<1200))or"ARC")

### FIXED CODE ###

print("ABC"*(int(input())<1200)or"ARC")
N,K = [int(x) for x in input().split()]
S = list(input())

#K番目の文字を小文字に変える
S[K-1] = S[K-1].lower()

#リストを文字列に変換する
answer = ''.join(replace)

print(answer)

### FIXED CODE ###

N,K = [int(x) for x in input().split()]
S = str(input())
replace = list(S)

for i in range(N):
    if i == K - 1:
       replace[i] = replace[i].lower()

answer = ''.join(replace)

print(answer)
def f(x):
    if dp[x] != -1:
        return dp[x]

    t = 0
    for v in V[x]:
        t = max(t, f(v)+1)

    dp[x] = t
    return t

n, m = map(int, input().split())

dp = [-1]*n
V = [[] for _ in range(n)]

for _ in range(m):
    x, y = map(int, input().split())
    V[x-1].append(y-1)

t = 0
for i in range(n):
    t = max(t, f(i))

print(t)


### FIXED CODE ###

from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

n, m = map(int, input().split())

dp = [-1 for _ in range(n)]
V = [[] for _ in range(n)]

for _ in range(m):
    x, y = map(int, input().split())
    V[x-1].append(y-1)

def f(x):
    if dp[x] != -1:
        return dp[x]

    t = 0
    for v in V[x]:
        t = max(t, f(v)+1)

    dp[x] = t
    return dp[x]

t = 0
for i in range(n):
    t = max(t, f(i))

print(t)
import re

n = int(raw_input())
a = map(int, re.split("\s", raw_input()))
left = 0
right = 0
mask = 10**9 + 7

pow = [0]*n+2

tmp = 1
for i in range(1, n+2):
        tmp *= i
        pow[i] = tmp

for i in range(0, n + 1):
        x = a.index(a[i])
        if a[i] in a[x+1:]:
                left = i
                right = a[x+1:].index(a[i]) + x + 1
                break

for i in range(1, n + 2):
        ans = (pow[n + 1] / (pow[i] * pow[n + 1 - i]))
        x = (pow[left + n - right] / (pow[i - 1] * pow[left + n - right - i + 1]))
        print (ans - x) % mask


### FIXED CODE ###

# -*- coding: utf-8 -*-

import re

x = raw_input()
x = map(int, re.split("\s", x))
x.sort()

print x[0] + x[1]
while True:
    data = int(input())
    if data == '0':
        break

    print([str[i] for i in data])

### FIXED CODE ###

while True:
    data = input()
    if data == '0':
        break
 
    print(sum([int(i) for i in data]))
#python3
from itertools import count
n,x=map(int, input().split())
l=[int(i) for i in input().split()]
ans=0
d=0
for i in range(len(l)+1):
  if d>x: 
    break
  d=d+l[i]
  ans=i
print(i)

### FIXED CODE ###

#python3
n,x=map(int, input().split())
l=[int(i) for i in input().split()]
d=0
c=1
for i in range(n):
  d=d+l[i]
  if d<=x:
    c+=1
print(c)
def calc(x):
  return 1 + calc(x // 2)

h = int(input())

print(calc(h))

### FIXED CODE ###

def calc(x):
  if x == 0:
    return 0;
  return 1 + calc(x // 2) * 2

h = int(input())

print(calc(h))
S = input()
T = input()
l = len(T)
L = len(S)
max_ans = -1
for i in range(l):
   for j in range(l-i):
      ans = 0
      if T[i+j] == S[j]:
         ans += 1
   max_ans = max(max_ans, ans)
for i in range(L - l):
   for j in range(l):
      ans = 0
      if T[j] == S[j+i]:
         ans += 1
      max_ans = max(max_ans, ans)
for i in range(l):
    for j in range(i):
       if T[i-j] == S[L-j]:
          ans +=1
       max_ans = max(max_ans, ans)
print(l - max_ans)

### FIXED CODE ###


import random, string
S = input()
T = input()
l = len(T)
L = len(S)
max_ans = -1
for i in range(L):
   ans = 0
   if i + l > L:
      continue
   for j in range(l):
      if T[j] == S[i + j]:
            ans += 1
   max_ans = max(max_ans, ans)
print(l - max_ans)
a,b = input().split()

print(a * b)

### FIXED CODE ###

a, b = map(int,input().split())

print(a*b)
N = int(input())
A, B = np.array([[int(x) for x in input().split()] for _ in range(2)])

print((A.cumsum() + (B.sum() - B.cumsum() + B)).max())

### FIXED CODE ###

N = int(input())
A = [[int(x) for x in input().split()] for _ in range(2)]
ans=0
for i in range(N):
    reg = sum(A[0][:N-i]) + sum(A[1][N-i-1:])
    ans = max(ans, reg)
print(ans)
sum = 0
while 1:
   x, y = map(int, raw_input().split())
   sum = sum + 1
   a = max(x, y)
   b = min(x, y)
   if x == y == '0':
      break
   print '%s %s' %(b, a)

### FIXED CODE ###

while 1:
   x, y = map(int, raw_input().split())
   if x == 0 and y == 0:
      break
   elif x > y:
      print '%s %s' % (y,x)
   else:
      print '%s %s' % (x,y)
import decimal
a,b = list(map(int, input().split()))

print(int(a * b))

### FIXED CODE ###

import decimal
a,b = input().split()
print(int(decimal.Decimal(a) * decimal.Decimal(b)))
#include<iostream>
#include<string>
#include<list>
#include<map>
#include<vector>
#include<cmath>
#include<unordered_map>
using namespace std;

using lli = long long int;


int main(void){
	lli N,A,B,C,D;
	cin >> N >> A >> B >> C >> D;
	--A,--B,--C,--D;
	string S;
	cin >> S;
	for (int i = A; i < max(C,D); ++i) {
		if (S.substr(i, 2) == "##") {
			cout << "No" << endl;
			return 0;
		}
	}
	if (D > C) {
		cout << "Yes" << endl;
		return 0;
	}
	auto X=vector<lli>(S.size());
	X[0] = S[0] == '#' ? 0 : 1;
	for (size_t i = 1; i < N; ++i) {
		X[i] = (S[i] == '#') ? 0 : (X[i-1] + 1);
	}
	for (auto i = A; i < D; ++i) {
		if (X[i] >= 3) {
			cout << "Yes" << endl;
			return 0;
		}
	}
	cout << "No" << endl;
}

### FIXED CODE ###

import itertools as it
import collections as col
import heapq
import sys
sys.setrecursionlimit(10**9)

N,A,B,C,D=map(int, input().split())
A-=1
B-=1
C-=1
D-=1
S=list(input())

for i in range(A,C):
    if S[i] == '#' and S[i+1] == '#':   
        print('No')
        exit()

for i in range(B,D):
    if S[i] == '#' and S[i+1] == '#':   
        print('No')
        exit()

if C < D:
    print('Yes')
    exit()

X=[-1]*N
X[B-1] = 0 if S[B-1] == '#' else 1
for i in range(B,D+2):
    X[i] = 0 if S[i] == '#' else (X[i-1] + 1)
    if X[i] >= 3:
        print('Yes')
        exit()
print('No')
n = int(input())
height_lst = list(map(int,input().split()))
flag = True

if n==1:
    print('Yes')
else:
    if height_lst[0]==1:
        height1 = 1
    elif height_lst[0]>1:
        height1 = height_lst[i]-1

    for i in range(1,n):
        height = height_lst[i]
        if height==1:
            possible_lst = [1]
        elif height>1:
            possible_lst = [height-1,height]

        if max(possible_lst)<height1:
            flag = False
            break
        else:
            if min(possible_lst)>=height1:
                height1 = min(possible_lst)
            else:
                height1 = max(possible_lst)

if flag:
    print('Yes')
else:
    print('No')

### FIXED CODE ###

n = int(input())
height_lst = list(map(int,input().split()))
flag = True

if n==1:
    print('Yes')
else:
    if height_lst[0]==1:
        height1 = 1
    elif height_lst[0]>1:
        height1 = height_lst[0]-1

    for i in range(1,n):
        height = height_lst[i]
        if height==1:
            possible_lst = [1]
        elif height>1:
            possible_lst = [height-1,height]

        if max(possible_lst)<height1:
            flag = False
            break
        else:
            if min(possible_lst)>=height1:
                height1 = min(possible_lst)
            else:
                height1 = max(possible_lst)

    if flag:
        print('Yes')
    else:
        print('No')
a,b,c=map(int,input().split())

x=[a,b,c]

x.sort()

print(x[0]*x[1]/2]

### FIXED CODE ###

a,b,c=map(int,input().split())
 
x=[a,b,c]
 
x.sort()
 
print(int(x[0]*x[1]/2))
s = input()
cnt = 0
cnt_list = []
for i in range(len(s)):
  if s[i] == "A" or "C" or "G" or "T":
    cnt +=1
  else:
    cnt_list.append(cnt)
  cnt = 0
print(max(cnt_list))
    

### FIXED CODE ###

s = input()
acgt = ["A","C","G","T"]
cnt = 0
cnt_list = []
for i in range(len(s)):
    if s[i] in acgt:
        cnt +=1
        if s[-1] in acgt:
            cnt_list.append(cnt)
    else:
        cnt_list.append(cnt)
        cnt = 0
print(max(cnt_list))
N = int(input())
a = list(map(int,input().split()))
c = [0]*(max(a)+1)
max_num = 0
for i in a:
  c[i] += 1
for x in range(1,max(a)+1):
  if max_num < (c[x-1]) + (c[x]) + (c[x+1]):
      max_num = (c[x-1]) + (c[x]) + (c[x+1])
print(max_num)


### FIXED CODE ###

from collections import Counter

N = int(input())
a = list(map(int,input().split()))
c = Counter(a)
max_num = 0

for x in range(max(a)+1):
      max_num = max(max_num,(c[x] + c[x+1] + c[x+2]))
print(max_num)
mn = input().split()
ob = input().split()

n = int(mn[0])
m = int(mn[1])

votes = 0

for i in range(n):
    ob[i] = int(ob[i])
    votes += ob[i]

ob.sort(reverse=true)

line = votes/4/m

ans = 0

for i in range(m):
    if ob[i] <= line:
        ans += 1

if ans == 0:
    print("Yes")
else:
    print("No")


### FIXED CODE ###

mn = input().split()
ob = input().split()

n = int(mn[0])
m = int(mn[1])

votes = 0

for i in range(n):
    ob[i] = int(ob[i])
    votes += ob[i]

ob.sort(reverse = True)

line = votes/4/m

ans = 0

for i in range(m):
    if ob[i] < line:
        ans += 1

if ans == 0:
    print("Yes")
else:
    print("No")
x=input()

if x>0.5:
  print(0)
elif x<0.5:
  print(1)


### FIXED CODE ###

x=int(input())

if x==0:
  print(1)
elif x==1:
  print(0)
import random 
S = input()
T = input()
a = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
if T == S + random.coice(a) 
  print(if T == S + random.coice(a) "YES"  else: print("NO"))
  
    
    
    

### FIXED CODE ###


    
s = input()
t = input()

if t[:-1] == s:
    print("Yes")
else:
    print("No")
n,m=map(int,input().split())
l=[0]*(n+1)
miss=[0]*(n+1)
for _ in range(m):
    p,s=input().split()
    p=int(p)
    if l[p]==0:
        if s=='AC':
            l[p]+=1
        else:
            miss[p]+=1
for i in range(m):
    if l[i]==0 and miss[i]!=0:
        miss[i]=0
a=l.count(1)
b=sum(miss)
print(a,b)

### FIXED CODE ###

n,m=map(int,input().split())
l=[0]*(n+1)
miss=[0]*(n+1)
for _ in range(m):
    p,s=input().split()
    p=int(p)
    if l[p]==0:
        if s=='AC':
            l[p]+=1
        else:
            miss[p]+=1
for i in range(1,n+1):
    if l[i]==0 and miss[i]!=0:
        miss[i]=0
a=l.count(1)
b=sum(miss)
print(a,b)
def to_str(symbol, num):
    return '{0} {1}'.format(symbol, num)

if __name__ == '__main__':
    symbols = ['S','H','C','D']
    cards = [to_str(x,y) for x in symbols for y in range(1,14)]
    n = int(input())
    if n == 52: return None
    for i in range(n):
        cards.remove(input())
    print('\n'.join(cards))

### FIXED CODE ###

import sys

def to_str(symbol, num):
    return '{0} {1}'.format(symbol, num)

if __name__ == '__main__':
    symbols = ['S','H','C','D']
    cards = [to_str(x,y) for x in symbols for y in range(1,14)]
    n = int(input())
    if n == 52: sys.exit()
    for i in range(n):
        cards.remove(input())
    print('\n'.join(cards))
from sys import setrecursionlimit
from math import log2, floor
from operator import or_
from functools import reduce

setrecursionlimit(100000)

n = int(input())
a = list(map(int, input().split()))

bl = [0 for _ in range(floor(log2(max(a)))+1)]
for ai in a :
    aj = ai
    for i in range(floor(log2(ai))+1) :
        if aj & 1 == 1 :
            bl[i] += 1
        aj >>= 1

ans = reduce(or_, map(lambda x : x&1, bl))
if ans :
    print("No")
else :
    print("Yes")

### FIXED CODE ###

from math import log2, floor
from operator import or_
from functools import reduce

n = int(input())
a = list(map(int, input().split()))

if max(a) == 0 :
    bl = [0]
else :
    bl = [0 for _ in range(floor(log2(max(a)))+1)]
for ai in a :
    aj = ai
    if ai == 0 :
        pass
    else :
        for i in range(floor(log2(ai))+1) :
            if aj & 1 == 1 :
                bl[i] += 1
            aj >>= 1

ans = reduce(or_, map(lambda x : x&1, bl))
if ans :
    print("No")
else :
    print("Yes")
N,X = (input().split())
L = list(map(int, input().split()))
x = int(X)
position = 0
count = 0
while position <= x:
    position += L[count]
    count += 1
print(count)


### FIXED CODE ###

n, x = list(map(int, input().split()))
li = list(map(int, input().split()))

ans = 1
pos = 0
for i in range(n):
	pos = pos + li[i]
	if pos <= x:
		ans += 1
print(ans)
import functools
 
 
@functools.lru_cache()
def f(n):
    if n == 0:
        return 2
    elif n == 1:
        return 1
    else:
        return f(n-1)+f(n-2)
 
print(f(int(input())

### FIXED CODE ###

import functools


@functools.lru_cache()
def f(n):
    if n == 0:
        return 2
    elif n == 1:
        return 1
    else:
        return f(n - 1) + f(n - 2)


print(f(int(input())))