Harryxun/stf_run huggingface dataset:
x, n = map(int, input().split())
if n != 0:
  n = list(map(int, input().split()))
  min_n = min(n)
  max_n = max(n)
  ans = []
  for i in range(1, max(x - min_n, max_n - x) + 1):
    if n.count(x + i) == 0:
      ans.append(x + i)

    if n.count(x - i) == 0:
      ans.append(x - i)
    
    if ans != []:
      break

  print(min(ans))
else:
  print(x)

### FIXED CODE ###

x, n = map(int, input().split())
if n != 0:
  n = list(map(int, input().split()))
  ans = []
  for i in range(101):
    if n.count(x + i) == 0:
      ans.append(x + i)

    if n.count(x - i) == 0:
      ans.append(x - i)
    
    if ans != []:
      break

  print(min(ans))
else:
  print(x)
# -*- coding: utf-8 -*-
import sys
from collections import defaultdict
R,C,K=map(int, sys.stdin.readline().split())

value=defaultdict(lambda: 0)
value=[ [0 for _ in range(C+1)] for __ in range(R+1) ]
for _ in range(K):
    r,c,v=map(int, sys.stdin.readline().split())
    value[r][c]=v

dp0=[0]*(C+1)
dp1=[0]*(C+1)
dp2=[0]*(C+1)
dp3=[0]*(C+1)

#初期化
for c in range(1,C+1):
    dp0[c]=0
dp1[1]=value[(1,1)]

for r in range(1,R+1):
    for c in range(2,C+1):
        #今のマスにアイテムがある場合
        if 0<value[r][c]:
            #今のマスまでで1個取得=max(左のマスまでで1個取得, 今のマスで0個取得+v )
            dp1[c]=max( dp1[c-1], dp0[c])
            #今のマスまでで2個取得=max(左のマスまでで2個取得, 左のマスまでで1個取得+v)
            dp2[c]=max( dp2[c-1], dp1[c-1])
            #今のマスまでで3個取得=max(左のマスまでで3個取得, 左のマスまでで2個取得+v)
            dp3[c]=max( dp3[c-1], dp2[c-1])
        #今のマスにアイテムがない場合
        else:
            dp1[c]=dp1[c-1]
            dp2[c]=dp2[c-1]
            dp3[c]=dp3[c-1]
        
    #上の行にアイテムをコピー
    #for c in range(1,C+1):
    #    dp0[c]=max(dp0[c],dp1[c],dp2[c],dp3[c])
    #dp1=defaultdict(lambda: float("-inf")) 
    #dp2=defaultdict(lambda: float("-inf")) 
    #dp3=defaultdict(lambda: float("-inf")) 

print dp0[C]

### FIXED CODE ###

# -*- coding: utf-8 -*-
import sys
from collections import defaultdict
R,C,K=map(int, sys.stdin.readline().split())

value=defaultdict(lambda: 0)
value=[ [0 for _ in range(C+1)] for __ in range(R+1) ]
for _ in range(K):
    r,c,v=map(int, sys.stdin.readline().split())
    value[r][c]=v

dp0=[0]*(C+1)
dp1=[0]*(C+1)
dp2=[0]*(C+1)
dp3=[0]*(C+1)

#dp1[1]=value[1][1]

for r in range(1,R+1):
    for c in range(1,C+1):
        dp0[c]=max( dp0[c-1], dp0[c] )
        dp1[c]=max( dp1[c-1], dp1[c] )
        dp2[c]=max( dp2[c-1], dp2[c] )
        dp3[c]=max( dp3[c-1], dp3[c] )
        #今のマスにアイテムがある場合
        if 0<value[r][c]:
            dp3[c]=max( dp3[c-1], dp2[c]+value[r][c] )
            dp2[c]=max( dp2[c-1], dp1[c]+value[r][c] )
            dp1[c]=max( dp1[c-1], dp0[c]+value[r][c] )

    #上の行にアイテムをコピー
    for c in range(1,C+1):
        dp0[c]=max( dp0[c], dp1[c], dp2[c], dp3[c] )
    dp1=[0]*(C+1)
    dp2=[0]*(C+1)
    dp3=[0]*(C+1)

print dp0[C]
#coding:utf-8

if __name__ == "__main__":
    num = int(input())
    money = []
    mtype = []
    for p in range(num):
        m_tmp, mt_tmp = input().split()
        money.append(float(m_tmp))
        mtype.append(mt_tmp)
    
    total = 0
    for m, mt in zip(money, mtype):
        if mt == "JPY":
            total += m
        else:
            total += mt * 380000.0
    
    print(total)

### FIXED CODE ###

#coding:utf-8

if __name__ == "__main__":
    num = int(input())
    money = []
    mtype = []
    for p in range(num):
        m_tmp, mt_tmp = input().split()
        money.append(float(m_tmp))
        mtype.append(mt_tmp)
    
    total = 0
    for m, mt in zip(money, mtype):
        if mt == "JPY":
            total += m
        else:
            total += m * 380000.0
    
    print(total)
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
A3 = list(map(int,input().split()))
N = int(input())
listb = [input() for i in range(N)]

for item in listb:
    for i in range(3):
        if A1[i] == item:
            A1[i] = 0
    for j in range(3):
        if A2[j] == item:
            A2[j] = 0
    for k in range(3):
        if A3[k] == item:
            A3[k] = 0
if sum(A1) == 0 or sum(A2) == 0 or sum(A3) == 0:
    print('Yes')
    exit()
for i in range(3):
    if A1[i] == A2[i] and A2[i] == A3[i]:
        print('Yes')
        exit()
if A1[1] == A2[2] == A3[3] or A1[3] == A2[2] == A3[1]:
    print('Yes')
    exit()
print('No')

### FIXED CODE ###

A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
A3 = list(map(int,input().split()))
N = int(input())
listb = [int(input()) for i in range(N)]

for item in listb:
    for i in range(3):
        if A1[i] == item:
            A1[i] = 0
    for j in range(3):
        if A2[j] == item:
            A2[j] = 0
    for k in range(3):
        if A3[k] == item:
            A3[k] = 0
if sum(A1) == 0 or sum(A2) == 0 or sum(A3) == 0:
    print('Yes')
    exit()
for i in range(3):
    if A1[i] == A2[i] and A2[i] == A3[i]:
        print('Yes')
        exit()
if A1[0] == A2[1] == A3[2] or A1[2] == A2[1] == A3[0]:
    print('Yes')
    exit()
print('No')
userinput = input("")
userlist = userinput.split(" ")
H = int(user[0])
A = int(user[1])
numberkill = 0
if H <= 10000 and A <= 1000:
  while H > 0:
    H = H - A
    numberkill = +1
  if H < 0:
    numberkill = +1
    print(numberkill)
  else:
    print(numberkill)
else:
  print("")

### FIXED CODE ###

firstinput = input("")
firstinputsplit = firstinput.split(" ")
H = int(firstinputsplit[0])
N = int(firstinputsplit[1])
kill = 0
if H <= 10000 and N <= 10000:
    while H > 0:
        H = H - N
        kill = kill + 1
    print(kill)
else:
    print(H)
while True:
  print(" ".join([str(i) for i in range(10000)]))
  

### FIXED CODE ###

ν=int(input())
τ=list(map(int,input().split()))
α=list(map(int,input().split()))

τ.append(0)
α.append(0)
ρ=1
μ=10**9+7

for ι in range(ν):
  ε=10**10
  if τ[ι]>τ[ι-1]:
    ε=min(1,ε)
    if α[ι]<τ[ι]:
      ε=0
  if α[ι]>α[ι+1]:
    ε=min(1,ε)
    if α[ι]>τ[ι]:
      ε=0
  if τ[ι]<τ[ι-1] or α[ι]<α[ι+1]:
    ε=0
  ε=min(ε,α[ι],τ[ι])
  ρ=(ρ*ε)%μ
print(ρ)
n = int(input())
a = list(map(int, input().split()))
Count = 0
while(1):
    count = 0
    for i in range(n):
        if a[i] % 2 == 0:
            count += 1
    if count != n:
        break
    for i in range(n):
        a[i] /= 2
    Count += 1
print(Count)


### FIXED CODE ###

a = int(input())
b = int(input())
c = int(input())
x = int(input())

comb = []
count = 0

for i in range(a + 1):
    for j in range(b + 1):
        for k in range(c + 1):
                comb.append([i, j, k])
for i in range(len(comb)):
    if (x == 500*comb[i][0] + 100*comb[i][1] + 50*comb[i][2]) and \
        (a >= comb[i][0]) and (b >= comb[i][1]) and (c >= comb[i][2]):
        count += 1

print(count)
import math
from scipy.special import factorial, poch
ppp=10**9+7
x,y =map(int, input().split())
a=[-(x-2*y)//3,-(-2*x+y)//3]
b=[-(x-2*y)%3,-(-2*x+y)%3]
if b[0]==0 and b[1]==0:
    print(math.factorial(a[0]+a[1])//math.factorial(a[0])//math.factorial(a[1])%ppp)
    
else:
    print(0)

### FIXED CODE ###

X,Y = map(int, input().split())

mod=10 ** 9 + 7
def binomial(n,k):
    x=1
    y=1
    for i in range(k):
        x=x*(n-i)%mod
        y=y*(i+1)%mod
    return x*pow(y,mod-2,mod)%mod

if (2*X-Y)%3==0 and  (2*Y-X)%3==0:
    a=(2*X-Y)//3
    b=(2*Y-X)//3
    if a<0 or b<0:
        print(0)        
    else:
        print(binomial(a+b,a)%mod)
else:
    print(0)
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
list = [a, b, c, d, e]
if max(lis) - min(lis) <= k:
    print('Yay!')
else:
    print(':(')

### FIXED CODE ###

a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e - a <= k:
    print('Yay!')
else:
    print(':(')
N ,M = map(int,input().split())
cnt = [0]*M
C = [0]*M
for i in range(M):
    s, c = map(int,input().split())
    if cnt == 1 and C[s-1] != c:
        cnt[s-1] += 1
    elif cnt[s-1] == 1 and C[s-1] == c:
        pass
    else:
        cnt[s-1] += 1
        C[s-1] = c
if max(cnt)>=2 or C[0] == 0 :
    print(-1)
else:
    print("".join(map(str,C)))

### FIXED CODE ###

N ,M = map(int,input().split())
cnt = [0]*N
C = [0]*N
C[0] = 1
for i in range(M):
    s, c = map(int,input().split())
    if cnt == 1 and C[s-1] != c:
        cnt[s-1] += 1
    elif cnt[s-1] == 1 and C[s-1] == c:
        pass
    else:
        cnt[s-1] += 1
        C[s-1] = c
if N ==1 and C[0] == 0:
    print(0)
elif N ==1 and M == 0:
    print(0)
elif max(cnt)>=2 or C[0] == 0 :
    print(-1)
else:
    print("".join(map(str,C)))
N=int(input())
l=map(int,input().split())
a=1
if N%2==0:
  if int(N/2)!=set(l):
    a=0
else:
  if l.count(0)!=1 or N!=2*len(set(l))+1:
    ans=0
if ans:
  print(2**(N//2)%(10**9+7))

### FIXED CODE ###

N=int(input())
l=list(map(int,input().split()))
a=1
if N%2==0:
    if len(l)!=len(set(l))*2:
        a=0
else:
    if l.count(0) == 1:
        l.remove(0)
        if len(l) != 2*len(set(l)):
            a = 0
    else:
        a=0
if a:
      print((2**(N//2))%(10**9+7))
else:
      print(0)
a,b = int(input().split())
c = a-b*2
if c <= 0:
  print(0)
else :
  print c

### FIXED CODE ###

a,b = map(int,input().split())
c = a-b*2
if c <= 0:
  print(0)
else :
  print(c)
zn,m = map(int,input().split())
ab = [list(map(int,input().split())) for _ in range(n)]
ab.sort(key = lambda x:x[0])
ans = 0
for i in range(n):
  while ab[i][1] > 0 and m> 0:
    m -= 1
    ab[i][1] -= 1
    ans += ab[i][0]
    
print(ans)
  

### FIXED CODE ###

n,m = map(int,input().split())
ab = [list(map(int,input().split())) for _ in range(n)]
ab.sort(key = lambda x:x[0])
ans = 0
for i in range(n):
  while ab[i][1] > 0 and m> 0:
    m -= 1
    ab[i][1] -= 1
    ans += ab[i][0]
    
print(ans)
s=input()
ans = 0
for i in range(len(s)//2+1):
	if s[i] != s[len(s)-1-i]:
    	ans+=1
        
print(ans)

### FIXED CODE ###

s=input()
ans = 0
for i in range(len(s)//2):
 if s[i] != s[len(s)-1-i]:
  ans+=1

print(ans)
import collections
import math
import sys
input = sys.stdin.readline

def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

N = int(input())
L = list(map(int, input().split()))
M = set(L)
K = collections.Counter(L)
ans = 0

for i in M:
    ans += combinations_count(K[i], 2) 

for i in range(N):
    B = K[L[i]]    
    if B == 2:
        print(ans - 1)
    elif B > 2:
        print(ans -combinations_count(B,2) +combinations_count(B-1,2))
    else:
        print(ans)

### FIXED CODE ###

N = int(input())
L = [int(i) for i in input().split()]
C = [0 for i in range(N)]
for i in L:
    C[i-1] += 1
res = 0

for i in range(N):
    res += C[i]*(C[i]-1)//2
# 合計最初に出す
for i in range(N):
    j = L[i]-1
    print(res - C[j]*(C[j]-1)//2 + (C[j]-1)*(C[j]-2)//2)
n = int(input())
print(r**2)

### FIXED CODE ###

n = int(input())
print(n**2)
a = input().split()
a = [int(i) for i in a]
c = input().split()
c = [int(i) for i in c]

def dacao(b):
	aller = [0]
	sumer = 0
	for i in b:
		sumer += i
		aller.append(sumer)
		
	superlist = dict()
	for i in range(len(b)):
		for j in range(i + 1, len(b) + 1):
			temp = bin(aller[j] - aller[i])[::-1]
			x = []
			for k in range(len(temp)):
				if temp[k] == '1':
					x.append(k)
			for m in x:
				try:
					superlist[m].append(aller[j] - aller[i])
				except:
					superlist[m] = [aller[j] - aller[i]]
				
	for i in sorted(superlist)[::-1]:
		if len(superlist[i]) >= a[1]:
			li = list(map(lambda x : x - 2**i, superlist[i]))
			return li, i
			break
		return [], -1
			
def cao(b):
	aller = [0]
	sumer = 0
	superlist = dict()
	for i in b:
		temp = bin(i)[::-1]
		x = []
		for k in range(len(temp)):
			if temp[k] == '1':
				x.append(k)
		for m in x:
			try:
				superlist[m].append(i)
			except:
				superlist[m] = [i]
				
	for i in sorted(superlist)[::-1]:
		if i == 0:
			return [], -1
		if len(superlist[i]) >= a[1]:
			li = list(map(lambda x : x - 2**i, superlist[i]))
			return li, i
		return [],-1

sumx = 0
gan1, gan2 = dacao(c)
while gan2 != -1:
	sumx += 2**gan2
	gan1, gan2 = cao(gan1)
	
print(sumx)

### FIXED CODE ###

a = input().split()
a = [int(i) for i in a]
b = input().split()
b = [int(i) for i in b]

def cao(aller, i):
	dicter = dict()
	for m in aller:
		for n in m:
			if n < i:
				try:
					dicter[n].append(m)
				except:
					dicter[n] = [m]
	for i in sorted(dicter)[::-1]:
		if len(dicter[i]) >= a[1]:
			return dicter[i], i
	return [], -1
	
aller = [0]
sumer = 0
for i in b:
	sumer += i
	aller.append(sumer)
	
superlist = dict()
for i in range(len(b)):
	for j in range(i + 1, len(b) + 1):
		temp = bin(aller[j] - aller[i])[::-1]
		x = []
		for k in range(len(temp)):
			if temp[k] == '1':
				x.append(k)
		for m in x:
			try:
				superlist[m].append(x)
			except:
				superlist[m] = [x]
						
for i in sorted(superlist)[::-1]:
	if len(superlist[i]) >= a[1]:
		li = superlist[i]
		sumer = 2 ** i
		gan1, gan2 = cao(li, i)
		while gan2 != -1:
			sumer += 2**gan2
			gan1,gan2 = cao(gan1,gan2)
		print(sumer)
		break
(n,),*d=[list(map(int,c.split()))for c in open(0)]
for i in range(n-1):t=0;exec("for j in range(i,n-1):c,s,f=d[j];t=[t+(f-t%f)%f,s][t<s]+c")print(t)
print(0)

### FIXED CODE ###

#!/usr/bin/env python3
(n,), *d = [list(map(int, c.split())) for c in open(0)]
n -= 1
for i in range(n):
    t = 0
    for j in range(i, n):
        c, s, f = d[j]
        t = (s if t < s else t if t % f == 0 else t + f - t%f) + c
    print(t)
print(0)
"""
keyword: 二分探索

初めにLをソートして、a<b<cとしてa,bを決めたとき、a+b>cとなるようなcの個数を計算する
cの最大値を求めるには二分探索が高速
さらに、二分探索の探索範囲の左端は、前のループで求めたcの最大値で十分である（∵前のループのa+b <= 今ループのa+b）ことを考慮すれば、さらに高速化できる

pythonでTLE, pypyでAC
"""

import sys
sys.setrecursionlimit(10**6)

n = int(input())
L = list(map(int, input(s).split()))

L.sort()
ans = 0

for i in range(n-2):
    l_prev = 0 # 前のループで求めたcの最大値を覚えておく
    for j in range(i+1,n-1):
        ab = L[i]+L[j]
        if not l_prev:
            l = j; r = n
        else:
            l = l_prev; r = n
        while l+1 < r:
            c = (l+r)//2
            if L[c] < ab:
                l = c
            else:
                r = c
        ans += l-j
        l_prev = l
        
print(ans)

### FIXED CODE ###

"""二分探索"""

import sys
sys.setrecursionlimit(10**6)

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

L.sort()
ans = 0

for i in range(n-2):
    for j in range(i+1,n-1):
        l = j; r = n
        while l+1 < r:
            c = (l+r)//2
            if L[c] < L[i]+L[j]:
                l = c
            else:
                r = c
        ans += l-j
        
print(ans)
# -*- coding: utf-8 -*-
a,b,c = map(int,input().split())
if b-a = c-b:
  print("YES")
else:
  print("NO")

### FIXED CODE ###

# -*- coding: utf-8 -*-
a,b,c = map(int,input().split())
if b-a == c-b:
  print("YES")
else:
  print("NO")
import itertools

h, w = map(int, input().split())
s = [list(input()) for _ in range(h)]

for i in range(w):
    for j in range(h):
        cnt=0
        if s[i][j]!="#":
            for dx,dy in itertools.product([-1,0,1],repeat=2):
                x=i+dx
                y=j+dy
                if x<0 or x>=w:
                    continue
                if y<0 or y>=h:
                    continue
                if s[x][y]=="#":
                    cnt+=1
            s[i][j]=str(cnt)

for i in range(h):
    print(''.join(s[i]))


### FIXED CODE ###

import itertools

h, w = map(int, input().split())
s = [list(input()) for _ in range(h)]

for i in range(h):
    for j in range(w):
        cnt = 0
        if s[i][j] != "#":
            for dx, dy in itertools.product([-1, 0, 1], repeat=2):
                y = i+dy
                x = j+dx
                if y < 0 or y >= h:
                    continue
                if x < 0 or x >= w:
                    continue
                if s[y][x] == "#":
                    cnt += 1
            s[i][j] = str(cnt)

for i in range(h):
    print(''.join(s[i]))
#include <bits/stdc++.h>
#include <stdio.h>
 
using namespace std;
typedef long long int ll;
 
int dh[4] = {1,0,-1,0};
int dw[4] = {0,1,0,-1};
int ddx[20] = {1,1,-1,-1,2,2,2,2,2,1,1,0,0,-1,-1,-2,-2,-2,-2,-2};
int ddy[20] = {1,-1,1,-1,2,1,0,-1,-2,2,-2,2,-2,2,-2,2,1,0,-1,-2};
 
int main()
{
    int dh[4] = {1,0,-1,0};
    int dw[4] = {0,1,0,-1};
  	int ddx[20] = {1,1,-1,-1,2,2,2,2,2,1,1,0,0,-1,-1,-2,-2,-2,-2,-2};
  	int ddy[20] = {1,-1,1,-1,2,1,0,-1,-2,2,-2,2,-2,2,-2,2,1,0,-1,-2};
  	
    int r,c;
    cin >> r >> c;
    int sy,sx,gy,gx;
    cin >> sy >> sx;
  	cin >> gy >> gx;
    sy--,sx--,gy--,gx--;
    vector<vector<char>>v(r,vector<char>(c,'.'));
    for(int i = 0; i < r; i++) for(int j = 0; j < c; j++) cin >> v[i][j];
    vector<vector<int>>dist(r,vector<int>(c,10000000));
    dist[sy][sx] = 0;
    queue<pair<int,int>>que;
    que.push(pair(sy,sx));
  
    while(!que.empty())
    {
        pair<int,int>p;
        p = que.front();
        que.pop();
        int y = p.first;
        int x = p.second;
        for(int i = 0; i < 4; i++)
        {
            int ny = y + dh[i];
            int nx = x + dw[i];
            if(ny >= r || ny < 0 || nx >= c || nx < 0) continue;
            if(dist[ny][nx] <= dist[y][x]) continue;
            if(v[ny][nx] == '#') continue;
            dist[ny][nx] = dist[y][x];
            que.push(pair(ny,nx));
        }
      
      	for(int i = 0; i < 20; i++)
        {
            int ny = y + ddy[i];
            int nx = x + ddx[i];
            if(ny >= r || ny < 0 || nx >= c || nx < 0) continue;
            if(dist[ny][nx] <= dist[y][x]+1) continue;
            if(v[ny][nx] == '#') continue;
            dist[ny][nx] = dist[y][x] + 1;
            que.push(pair(ny,nx));
        }
      	
      
    }
  	if (dist[gy][gx] == 10000000)
    {
      printf("-1");
    }
  	else
    {
    	cout << dist[gy][gx] << endl;
    }
}

### FIXED CODE ###

import math

n,x,t = map(int,input().split())

print(math.ceil(n/x) * t)
'''input
3
4
1 2 3 6
1
8
2
1 1
'''
# A coding delight
from sys import stdin
from collections import defaultdict


# main starts
n = int(stdin.readline().strip())
s = stdin.readline().strip()
t = stdin.readline().strip()
ans = []
for i in range(n):
	ans.append(s[i])
	ans.append(t[i])
print(''.join(ans))

### FIXED CODE ###

'''input
2
ip cc
'''
# A coding delight
from sys import stdin
from collections import defaultdict


# main starts
n = int(stdin.readline().strip())
s, t = stdin.readline().split()
ans = []
for i in range(n):
	ans.append(s[i])
	ans.append(t[i])
print(''.join(ans))
n = int(input())
ans = 0
for i in range(1, n+1):
    if n%2 == 1:
        cnt = 0
        for j in range(1, j+1):
            if i%j == 0:
                cnt += 1
        if cnt == 8:
            ans += 1
print(ans)

### FIXED CODE ###

n = int(input())
ans = 0
for i in range(1, n+1):
    cnt = 0
    if i%2 == 1:
        for j in range(1, i+1):
            if i%j == 0:
                cnt += 1
        if cnt == 8:
            ans += 1
print(ans)
n, m = map(int, input().split())
a = [0]*m
for i in range(m):
    a[i] = int(input())
mod = 10**9 + 7

dp = [0]*(n+1)
dp[0] = 1
if a[0] != 1:
    dp[1] = 1
else:
    dp[1] = 0
for i in range(1, m):
    dp[a[i]] = -1
for i in range(n-1):
    if dp[i+2] == -1:
        dp[i+2] = 0
    elif dp[i+2] == 0:
        dp[i+2] = (dp[i+1] + dp[i]) % mod
print(dp[n] % mod)

### FIXED CODE ###

n, m = map(int, input().split())
a = [0]*m
for i in range(m):
    a[i] = int(input())
mod = 10**9 + 7

dp = [-1]*(n+1)
dp[0] = 1
dp[1] = 1
for i in range(m):
    dp[a[i]] = 0
#print(dp)
for i in range(n-1):
    if dp[i+2] == -1:
        dp[i+2] = (dp[i+1] + dp[i]) % mod
    elif dp[i+2] == 0:
        dp[i+2] = 0
#print(dp)
print(dp[n] % mod)
print(imput()[::-1])


### FIXED CODE ###

print(input()[::-1])
n=int(input())
h=[int(i) for i in input().split()]
inf=10**10
dp=[inf]*n
def rec(i):
  if dp[i]<inf:
    return dp[i]
  elif i==0:
    return 0
  res=inf
  res=min(inf,rec(i-1)+abs(h[i]-h[i-1]))
  if i>1:
    res=min(res,rec(i-2)+abs(h[i]-h[i-2]))
  dp[i]=res
  return res
print(rec(n-1))


### FIXED CODE ###

n=int(input())
h=[int(i) for i in input().split()]
dp=[0]*n
dp[1]=abs(h[1]-h[0])
for i in range(1,n-1):
  dp[i+1]+=min(dp[i]+abs(h[i+1]-h[i]),dp[i-1]+abs(h[i+1]-h[i-1]))
print(dp[n-1])
x=int(split(input()," "))
a=x[0]
b=x[1]
print(str(a*b)+' '+str(2*(a+b)))

### FIXED CODE ###

a,b=list(map(int,input().split()))
print(str(a*b)+' '+str(2*(a+b)))
s,t=input(),input()
dp=[[0]*(len(t)+1) for i in range(len(s)+1)]
for i in range(len(s)+1):
    for j in range(len(t)+1):
        if i<len(s):
            dp[i+1][j]=max(dp[i+1][j],dp[i][j])
        if j<len(t):
            dp[i][j+1]=max(dp[i][j+1],dp[i][j])
        if i<len(s) and j<len(t):
            dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+(s[i]==t[j]))
ans=""
def move(i,j):
    global dp,ans
    if dp[i][j]==0:return
    if dp[i][j]>dp[i-1][j-1] and s[i-1]==t[j-1]:
        ans=s[i-1]+ans
        if dp[i-1][j-1]!=0:
            move(i-1,j-1)
    else:
        if dp[i][j]==dp[i][j-1]:
            move(i,j-1)
        else:
            move(i-1,j)
move(len(s),len(t))
print(ans)

### FIXED CODE ###

from sys import setrecursionlimit
setrecursionlimit(10**7)
s,t=input(),input()
dp=[[0]*(len(t)+1) for i in range(len(s)+1)]
for i in range(len(s)+1):
    for j in range(len(t)+1):
        if i<len(s):
            dp[i+1][j]=max(dp[i+1][j],dp[i][j])
        if j<len(t):
            dp[i][j+1]=max(dp[i][j+1],dp[i][j])
        if i<len(s) and j<len(t):
            dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+(s[i]==t[j]))
ans=""
def move(i,j):
    global dp,ans
    if i==0 or j==0:
        return
    elif dp[i][j]>dp[i-1][j-1] and s[i-1]==t[j-1]:
        ans=s[i-1]+ans
        move(i-1,j-1)
    else:
        if dp[i][j]==dp[i][j-1]:
            move(i,j-1)
        else:
            move(i-1,j)
move(len(s),len(t))
print(ans)
from sys import stdin
stdin = open('sample.txt')


def main():
    N = int(stdin.readline().rstrip())
    S = stdin.readline()
    count = 0
    s1 = []
    for i, x in enumerate(S):
        if x == 'W':
            count += 1
        s1.append(count)
    count = 0
    s2 = []
    for i, x in enumerate(S[::-1]):
        if x == 'E':
            count += 1
        s2.append(count)
    s2.reverse()

    result = N
    for i in range(N):
        count = 0
        idx = i - 1
        if idx >= 0:
            count += s1[idx]
        idx = i + 1
        if idx < N:
            count += s2[idx]
        result = min(result, count)

    print(result)


if __name__ == '__main__':
    main()


### FIXED CODE ###

from sys import stdin


def main():
    N = int(stdin.readline().rstrip())
    S = stdin.readline()
    count = 0
    s1 = []
    for i, x in enumerate(S):
        if x == 'W':
            count += 1
        s1.append(count)
    count = 0
    s2 = []
    for i, x in enumerate(S[::-1]):
        if x == 'E':
            count += 1
        s2.append(count)
    s2.reverse()

    result = N
    for i in range(N):
        count = 0
        idx = i - 1
        if idx >= 0:
            count += s1[idx]
        idx = i + 1
        if idx < N:
            count += s2[idx]
        result = min(result, count)

    print(result)


if __name__ == '__main__':
    main()
d=float(input())
t=float(input())
s=float(input())
    
if (int(d/t)) <= s:
    print ('Yes')
    
else:
    print ('No')



### FIXED CODE ###

#輸入字串並分隔，以list儲存
str_in = input()
num = [int(n) for n in str_in.split()]
num =list(map(int, str_in.strip().split()))  
#print(num) #D,T,S

#若T<(D/S)->遲到
if num[1] > (num[0]/num[2]):
    print("Yes")
elif num[1] == (num[0]/num[2]):
    print("Yes")
else:
    print("No")