Harryxun/stf_run huggingface dataset:
S=input()[::-1]
def a(s):
    if s:
        if s[:5]=='maerd':
            return a(s[5:])
        elif s[:5]=='esare':
            return a(s[5:])
        elif s[:6]=='resare':
            return a(s[6:])
        elif s[:7]=='remaerd':
            return a(s[7:])
        else:
            return False
    else:
        return True
print(a(S))

### FIXED CODE ###

s,f=input()[::-1],-1
while f<0:
    if s:
        if s[:5]=='maerd':
            s=s[5:]
        elif s[:5]=='esare':
            s=s[5:]
        elif s[:6]=='resare':
            s=s[6:]
        elif s[:7]=='remaerd':
            s=s[7:]
        else:
            f=0
    else:
        f=1
print(['NO','YES'][f])
# F - LIS on Tree
import bisect

INF = 10**18

n = int(input())
a = list(int(x) for x in input().split())
g = [[] for _ in range(n)]
for i in range(n-1):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    g[u].append(v)
    g[v].append(u)

def dfs(now, par):
    idx = bisect.bisect_left(dp, a[now])    
    tmp = dp[idx]
    dp[idx] = a[now]
    #print(dp)
    #print('now',now)
    # 親のLIS以上であれば、その値で更新
    if ans[par] <= idx:
        ans[now] = idx
    # そうでなければ親のLISを引き継ぐ
    else:
        ans[now] = ans[par]

    for i in g[now]:
        #print('i',i)
        if i!=par:
            # 次にみる頂点と、自分（親）の情報を渡す
            dfs(i, now)
    dp[idx] = tmp

ans = [0] * n
dp = [-INF] + [INF] * (n+1)
dfs(0,-1)
for a in ans:
    print(a)

### FIXED CODE ###

# F - LIS on Tree
import bisect
import sys
sys.setrecursionlimit(10**7)

INF = 10**18

n = int(input())
a = list(int(x) for x in input().split())
g = [[] for _ in range(n)]
for _ in range(n-1):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    g[u].append(v)
    g[v].append(u)

def dfs(now, par):
    idx = bisect.bisect_left(dp, a[now])    
    tmp = dp[idx]
    dp[idx] = a[now]
    # 親のLIS以上であれば、その値で更新
    if ans[par] <= idx:
        ans[now] = idx
    # そうでなければ親のLISを引き継ぐ
    else:
        ans[now] = ans[par]

    for i in g[now]:
        if i!=par:
            # 次にみる頂点と、自分（親）の情報を渡す
            dfs(i, now)
    dp[idx] = tmp

ans = [0] * n
dp = [-INF] + [INF] * n
dfs(0, -1)
for a in ans:
    print(a)
a, b, c = map(int, input().spulit())

if a <= b*c:
  print("Yes")
else:
  print("No")

### FIXED CODE ###

d,t,s=map(int,input().split())
if d<=t*s:
    print("Yes")
else:
    print("No")
n = int(input())
c = list(input())
cnt = 0

for i in range(n):
    if c[i] == 'W':
        for j in range(n-1,0,-1 ):
            if c[j] == 'R':
                if i < j:
                    c[i] = 'R'
                    c[j] = 'W'
                    cnt += 1
                    print(i, j)
                    print(c)
                break
print(cnt)

### FIXED CODE ###

n = int(input())
c = input()
cnt = 0
ans = 0

for i in range(n):
    if c[i] == 'R':
        cnt += 1
    
for j in range(cnt):
    if c[j] == 'W':
        ans += 1
        
print(ans)
# -*- coding: utf-8 -*-
N = int(input())
A = int(input())
B = int(input())

outValue = 0
for n in range(N+1):
    inputList = [int(c) for c in str(n)]
    if A <= sum(inputList) and sum(inputList) <= B:
        outValue += n

print(outValue)


### FIXED CODE ###

# -*- coding: utf-8 -*-
strList = list(map(int, input().split()))

N = strList[0]
A = strList[1]
B = strList[2]

outValue = 0
for n in range(N+1):
    strList = [int(c) for c in str(n)]
    if A <= sum(strList) <= B:
        outValue += n

print(outValue)
n, m, k = list(map(int, input().split()))

c = m * ((m-1) ** (n-1))

s = c


for i in range(1, k+1):
    if i > 0:
        c = c * (n-i) // (i * (m-1))
    s += c 

print(s % 998244353)

### FIXED CODE ###

import math

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

MOD=998244353

fact = [0] * (n+1)
inv = [0] * (n+1)
factinv = [0] * (n+1)

fact[0]=fact[1]=1
inv[1]=1
factinv[0]=factinv[1]=1

for i in range(2,n+1):
    fact[i] = fact[i-1] * i % MOD
    inv[i] = MOD - (( inv[MOD % i] *  (MOD // i)) % MOD )
    factinv[i] = factinv[i-1] * inv[i] % MOD

def cbn(n, k, fact, factinv, MOD):
    return fact[n] * factinv[n-k] * factinv[k] % MOD

def power(x, n, MOD):
    if n == 0:
        return 1
    elif n % 2 == 0:
        return power(x*x % MOD , n // 2, MOD) % MOD
    else:
        return x * power(x * x % MOD, n // 2, MOD) % MOD

s = 0
for i in range(k+1):
    s += cbn(n-1, i, fact, factinv, MOD) * m * power(m-1, n-1-i, MOD)

print(s % MOD)
n = int(input())
A = sorted(map(int, input().split()))
nux = A[-1]+1
ans = 0
table = [True]*nux
for i, s in enumerate(A):
    if table[s] == False:
        continue
    if i == n-1:
        ans += 1
    if A[i+1] != s:
        ans += 1
    b = 1
    while b*s <= nux:
        table[b*s] = False
        b += 1
print(ans)


### FIXED CODE ###

n = int(input())
A = list(map(int, input().split()))
nux = max(A)
B = set(A)
A.sort()
ans = 0
table = [True]*(nux+1)
for ii, s in enumerate(A):
    if table[s] == False:
        continue
    if ii == n-1:
        ans += 1
    elif A[ii+1] != s:
        ans += 1
    i = 1
    while i*s <= nux:
        table[i*s] = False
        i += 1

print(ans)
n = int(input())
bin_n = bin(n)
ranges = []

def base_minus2(m, i, s):
    tmp = s
    if i == 1:
        return tmp + str(m%2)
    for j in range(i-1, -1, -1):
        if m >= ranges[j-1][0] and m <= ranges[j-1][1]:
            print(ranges[j-1], j)
            tmp += "1"
            print(tmp)
            return base_minus2(m-(-2)**j, j, tmp)
        else:
            tmp += "0"

if n == 0:
    print("0")
elif n == 1:
    print("1")
else:
    for i in range(1, 30):
        min_r = sum([(-2)**j for j in range(1, i, 2)]) + (-2)**i
        max_r = sum([(-2)**j for j in range(0, i, 2)]) + (-2)**i
        ranges.append([min_r, max_r])

    result = base_minus2(n, 30, "")
    print(result.lstrip("0"))


### FIXED CODE ###

n = int(input())
bin_n = bin(n)
ranges = []

def base_minus2(m, i, s):
    tmp = s
    if i == 1:
        return tmp + str(m%2)
    for j in range(i-1, -1, -1):

        if m >= ranges[j-1][0] and m <= ranges[j-1][1]:
            tmp += "1"
            return base_minus2(m-(-2)**j, j, tmp)
        else:
            if j == 0:
                return tmp + str(m%2)
            else:
                tmp += "0"


if n == 0:
    print("0")
elif n == 1:
    print("1")
else:
    for i in range(1, 60):
        min_r = sum([(-2)**j for j in range(1, i, 2)]) + (-2)**i
        max_r = sum([(-2)**j for j in range(0, i, 2)]) + (-2)**i
        ranges.append([min_r, max_r])

    result = base_minus2(n, 60, "")
    print(result.lstrip("0"))
def main():
    x = int(input())
    tmp = [0] * 100
    for i in range(100):
        tmp[i] = i**5
    for i in range(100):
        a = x-tmp[i]
        if abs(a) in tmp:
            print(int(a**0.2),i*(a//abs(a)))
            return
if __name__=='__main__':
    main()


### FIXED CODE ###

import math
def main():
    x = int(input())
    tmp = [0] * 1000
    for i in range(1000):
        tmp[i] = i**5
    for i in range(1000):
        a = x+tmp[i]
        if abs(a) in tmp:

            print(int(a**0.2),i)
            return

        a = x - tmp[i]
        if abs(a) in tmp:

            print(int(a**0.2),-i)
            return

if __name__=='__main__':
    main()
a=[]
while True:
 n=input()
 if n=='0 ? 0':break
 a.append(n)
for s in a:
 b=al(''.join(s.split()))
 print(b)

### FIXED CODE ###

while 1:
 a=input()
 if'?'in a:break
 print(int(eval(a)))
import numpy as np,math,itertools

a=[int(i) for i in input()]
b=a[1]
c=a[2]
d=a[0]
print(max([10*d+b+c,d+10*b+c]))

### FIXED CODE ###

import numpy as np,math,itertools

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

print(max([10*a+b+c,a+10*b+c,a+b+10*c]))
N, W = map(int, input().split())
items = [list(map(int, input().split())) for _ in range(N)]

dp = [[0 for _ in range(W+10)] for _ in range(N+10)]
for i, (item_weight, item_value) in enumerate(items):  # i番目の品
    for total_weight in range(W):                      # 重さの合計
        dp[i+1][total_weight] = max(dp[i][total_weight], dp[i+1][total_weight])
        dp[i+1][total_weight + item_weight] = \
            max(dp[i][total_weight] + item_value, dp[i+1][total_weight + item_weight])
          
print(dp[N][W])

### FIXED CODE ###

N, W = map(int, input().split())
items = [list(map(int, input().split())) for _ in range(N)]

dp = [[0 for _ in range(W+10)] for _ in range(N+10)]

for i, (item_weight, item_value) in enumerate(items):
    for total_weight in range(W+1):
        if (total_weight-item_weight) >= 0:
            dp[i+1][total_weight] = max(dp[i][total_weight-item_weight] + item_value, dp[i+1][total_weight])
        dp[i+1][total_weight] = max(dp[i+1][total_weight], dp[i][total_weight])
        
print(dp[N][W])
# coding: utf-8
# Your code here!
X,Y,Z,K=map(int,input().split())
A=(list(map(int,input().split())))
B=(list(map(int,input().split())))
C=sorted(list(map(int,input().split())))

ans=max(A)+max(B)+max(C)

temp=[]
for a in A:
    for b in B:
        temp.append(a+b)

temp.sort()

dif=[temp[i]-temp[i+1] for i in range(len(temp)-1)[::-1]]
dif_c=[C[i]-C[i+1] for i in range(len(C)-1)[::-1]]

dif=dif[:K]

temp=[]
for d in dif:
    for dc in dif_c:
        temp.append(d+dc)
temp.sort()
temp=temp[::-1]
for k in range(K):
    print(ans)
    ans+=temp[k]

print(temp)


### FIXED CODE ###

# coding: utf-8
# Your code here!
X,Y,Z,K=map(int,input().split())
A=(list(map(int,input().split())))
B=(list(map(int,input().split())))
C=sorted(list(map(int,input().split())))

ans=max(A)+max(B)+max(C)

temp=[]
for a in A:
    for b in B:
        temp.append(a+b)

temp.sort()

dif=[temp[i]-temp[-1] for i in range(len(temp))[::-1]]
dif_c=[C[i]-C[-1] for i in range(len(C))[::-1]]

dif=dif[:K]

temp=[]
for d in dif:
    for dc in dif_c:
        temp.append(ans+d+dc)
temp.sort()
temp=temp[::-1]

for k in range(K):
    print(temp[k])
import bisect
import numpy

n, m, k = map(int, input().split(" "))
a = list(map(int, input().split(" ")))
b = list(map(int, input().split(" ")))

cost_a = numpy.insert(numpy.cumsum(a), 0, 0)
cost_b = numpy.insert(numpy.cumsum(b), 0, 0)

ans = 0
j =  len(cost_b)
for i in range(len(cost_a)):
    for j in range( j, 0, -1):
        if cost_a[i] + cost_b[j] <= k:
            ans  = i + j if ans < i + j else ans
            break
print(ans)

### FIXED CODE ###


import bisect
import numpy

n, m, k = map(int, input().split(" "))
a = list(map(int, input().split(" ")))
b = list(map(int, input().split(" ")))

cost_a = numpy.insert(numpy.cumsum(a), 0, 0)
cost_b = numpy.insert(numpy.cumsum(b), 0, 0)

ans = 0
j =  len(cost_b) -1
for i in range(len(cost_a)):
    for j in range(j, -1, -1):
        if cost_a[i] + cost_b[j] <= k:
            ans  = i + j if ans < i + j else ans
            break
print(ans)
A,B,K=map(int,input().split())
i=0
j=1
a=[]
if A%j==0 and B%j==0:
    a.append(j)
    j+=1
print(a[-K])

### FIXED CODE ###

A,B,K=map(int,input().split())
i=0
j=1
a=[]
while j<=max(A,B):
    if A%j==0 and B%j==0:
        a.append(j)
    j+=1
print(a[-K])
def getInts():
    return [ int(x) for x in input().split() ]

def f(B):
    return (X + B**5 ) ** (1/float(5))

[X] = getInts()

BP = 0
BN = 0
while not f(BP).is_integer() and not f(BN).is_integer():
    BP += 1
    BN -= 1

if f(BP).is_integer():
    print(str(int(f(BP))) + " " + str(BP))
else:
    print(str(int(f(BN))) + " " + str(BN))


### FIXED CODE ###

from collections import deque

def getInts():
    return [ int(x) for x in input().split() ]

def f(A,B):
    return A**5 - B**5

[X] = getInts()
Q = deque([(0,0)])
V = set()
A, B = 0,0
r = []
while not r:
    (A,B) = Q.pop()
    l = [(A+1,B),(A,B+1),(A+1,B+1)]
    l = filter(lambda x: x not in V, l)
    for each in l:
        V.add(each)
        Q.appendleft(each)
    
    r = list(filter(lambda x: f(*x)==X, [(A,B), (A,-B), (-A,B), (-A, -B)]))

print(r[0][0], r[0][1])
n,k = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
print(sum[:k])

### FIXED CODE ###

n,k = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
print(sum(a[:k]))
N,D =map(int,input().split())

x = D * 2 + 1

pre_answer = - (-N // X)
print(int(pre_answer))


### FIXED CODE ###

import math
N,D =map(int,input().split())

X = D * 2 + 1

pre_answer = N / X
print(math.ceil(pre_answer))
a,b = map(int,input().split())

count_p = 0
count = 0

if b = 1:
    print(count)

while True:
    if count == 0:
        count_p += a
    
    else:
        count_p += a-1
    
    count += 1
    
    if count_p >= b:
        break

print(count)
    

### FIXED CODE ###

S = input()
T = input()

count = 0

for i in range(3):
    if S[i] == T[i]:
        count +=1

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

def recur(step):
  if step == N:
    return 1
  
  elif step in A or step > N:
    return 0
  
  else:
    ret1 = recur(step + 1) 
    ret2 = recur(step + 2) 
    return ret1 + ret2
    
print(recur(0) % (10 ** 9 + 7) )
    

### FIXED CODE ###

N,M = map(int, input().split())
A = [int(input()) for a in range(M)]
A = set(A)
	
DP = [0] * (N + 1)	
DP[0] = 1

mod = (10 ** 9) + 7

for i in range(1,N+1):
	if i in A:
		DP[i] = 0
	else:
		DP[i] = DP[i-1] + DP[i-2]

print(DP[N] % (mod))
a, b = input().split()
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

### FIXED CODE ###

a, b = input().split()
if int(a)*int(b) % 2 == 0:
    print("Even")
else:
    print("Odd")
# -*- coding: utf-8 -*-
n = int(input())
ln = list(map(int, input().replace('W', '0 ').replace('E', '1 ').split()))

# 先頭だけ先に計算（do-while相当）
w_sum = 0                           # 西側で振り返る人
sum_min = e_sum = sum(ln) - ln[0]   # 東側で振り返る人

for i in range(1, n-1):
    #sum_min = min(sum_min, sum(ln[i+1:n]) + (i - sum(ln[0:i])))
    w_sum += 1 if ln[i-1] == 0 else 0
    e_sum -= ln[i]
    sum_min = min(sum_min, w_sum + e_sum)

# 末尾も個別に計算
else:
    w_sum += 1 if ln[n-1] == 0 else 0
    sum_min = min(sum_min, w_sum)

print(sum_min)


### FIXED CODE ###

# -*- coding: utf-8 -*-
A, B = map(int, input().split())
print(max(A + B, A - B, A * B))
a,b=map(int, input().split())

m=a-2b

if m>=0:
  print(m)
else:
  print(0)

### FIXED CODE ###

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

m=a-2*b

if m>=0:
  print(m)
else:
  print(0)
import math
from functools import reduce

number = input().split(" ")
A = int(number[0])
B = int(number[1])

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

print(lcm(A, B))

### FIXED CODE ###

import fractions

number = input().split(" ")
A = int(number[0])
B = int(number[1])

def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)

print(lcm(A, B))
import math
x = int(input())
ans = (int(math.sqrt(X)))**2
for i in range(1,int(math.sqrt(x)+2)):
  for j in range(2,10):
    if i ** j <= x and i**j > ans:
      ans = i**j
    else:
      break
print(ans)

### FIXED CODE ###

import math
X = int(input())
n = (int(math.sqrt(X)))**2
for b in range(2, int(math.sqrt(X))+2):
    for p in range(1, 10):
        if (b**p > n) and (b**p <= X):
            n = b**p
print(n)
h, w = map(int,input().split())
grid = [list(map(int,input().split())) for i in range(h)]
out = []
for i in range(h):
    for j in range(w):
        ii, ij, nii, nij = 0, 0, 0, 0
        ii = i
        ij = j if i%2==0 else w-1-j
        if (i%2==0 and ij==w-1) or (i%2==1 and ij==0): nii = i+1
        else: nii = i
        if i%2==0 and ij<w-1: nij = ij+1
        elif i%2==1 and ij>0: nij = ij-1
        else: nij = ij
        if grid[ii][ij]%2==1 and nii<w:
            grid[ii][ij] -= 1
            grid[nii][nij] += 1
            out.append([ii+1,ij+1,nii+1,nij+1])
print(len(out))
for i in out:
    print(i[0],i[1],i[2],i[3])

### FIXED CODE ###

h, w = map(int,input().split())
grid = [list(map(int,input().split())) for i in range(h)]
out = []
for i in range(h):
    for j in range(w):
        ii, ij, nii, nij = 0, 0, 0, 0
        ii = i
        ij = j if i%2==0 else w-1-j
        if (i%2==0 and ij==w-1) or (i%2==1 and ij==0): nii = i+1
        else: nii = i
        if i%2==0 and ij<w-1: nij = ij+1
        elif i%2==1 and ij>0: nij = ij-1
        else: nij = ij
        if grid[ii][ij]%2==1 and nii<h:
            grid[ii][ij] -= 1
            grid[nii][nij] += 1
            out.append([ii+1,ij+1,nii+1,nij+1])
print(len(out))
for i in out:
    print(i[0],i[1],i[2],i[3])
n = input()
cur = 0

for x in n:
  cur += int(x)
  if cur % 9 == 0:
    print("Yes")
    else:
      print("No")

### FIXED CODE ###

n = input()
cur = 0

for x in n:
    cur += int(x)

if cur % 9 == 0:
    print("Yes")
else:
    print("No")
import sys 
L,R = map(int, input().split())

if R-L >= 2019:
    print(0)
    sys.exit()
elif R-L == 1:
    print((i*j)%2019)
    sys.exit()

ans = 100*100

for i in range(L,R):
    for j in range(i+1,R):
        number = (i*j)%2019
        ans = min(ans,number)

print(ans)  

### FIXED CODE ###

import sys 
L,R = map(int, input().split())

if R-L >= 2019:
    print(0)
    sys.exit()
elif R-L == 1:
    print((R*L)%2019)
    sys.exit()

ans = 4000

for i in range(L,R):
    for j in range(i+1,R+1):
        number = (i*j)%2019
        ans = min(ans,number)

print(ans)
_ = input()
 s = input()
 place_holder = s[0]
 count = 1
 for letter in s[1:]:
     if place_holder == letter:
         continue
     else:
         place_holder = letter
         count += 1

### FIXED CODE ###

_ = input()
s = input()
place_holder = s[0]
count = 1
for letter in s[1:]:
    if place_holder == letter:
        continue
    else:
        place_holder = letter
        count +=1
print(count)
h,w,m=map(int,input().split())

H=[0]*h
W=[0]*w
li_h=[]
li_w=[]

for i in range(m):
    h1,w1=list(map(int,input().split()))
    li_h.append(h1)
    li_w.append(w1)
    H[h1-1]+=1
    W[w1-1]+=1


h_flag=0
w_flag=0

if H.count(max(H))==1:
    ans_h=max(H)
    h_flag+=1

if W.count(max(W))==1:
    ans_w=max(W)
    w_flag+=1

if h_flag==1 and w_flag==1:
    print(max(H)+max(W))



else:
    if h_flag==1:
        for i in range(m):
            if li_w[i]==max(H):
                if li_h[i]==0:
                    print(max(H)+max(W))
                    h_flag+=1:
        else:
             h_flag==1:
             print(max(H)+max(W)-1)                   
                
            


    elif w_flag==1:
        for i in range(m):
            if li_h[i]==max(W):
                if li_w[i]==0:
                    print(max(H)+max(W))
                    w_flag+=1:
        else:
             w_flag==1:
             print(max(H)+max(W)-1)       



### FIXED CODE ###

h,w,m=map(int,input().split())
table=[]
H=[0]*h
W=[0]*w
li_h=[]
li_w=[]

for i in range(m):
    h1,w1=list(map(int,input().split()))
    table.append((h1-1,w1-1))
    H[h1-1]+=1
    W[w1-1]+=1

h_flag=0
w_flag=0

Hm=max(H)
Wm=max(W)

Hh=[i for i, x in enumerate(H) if x == Hm]
Ww=[i for i, x in enumerate(W) if x == Wm]

cnt=0

for (h, w) in table:
    if H[h] == Hm and W[w] ==  Wm:
        cnt += 1

if cnt<len(Hh)*len(Ww):
    print(Hm+Wm)
else:
    print(Hm+Wm-1)
n,k = map(int,input().split())



for i in range(k):
    if i > n-k+1:
        print(ans2)

    else:
        total = 1
        total2 = 1
        total3 = 1
        for j in range(i+1):
            total *= n-k+1-j
            total2 *= j+1
            total3 = int(total/total2)
            
        ww = (i+1)**(k-i-1)
        ans = ww * total3

        ans2 = ans % 1000000007

        print(ans2)
    


### FIXED CODE ###

n,k = map(int,input().split())
mod = 10**9+7

a = [1 for i in range(2010)]

memo = 1
for i in range(1,2001):
    memo *= i
    a[i] = memo



for i in range(1,k+1):
    if not((n-k+2 > i)):
        print(0)

    else:
        memo1 = a[n-k+1]*a[k-1]
        memo2 = a[i]*a[n-k+1-i]*a[i-1]*a[k-i]

        ans2 = memo1//memo2
        print(ans2%mod)
import math
n, p = [int(i) for i in input().split()]
max_x = int(p**(1/n))
ans = 1
if n >= p:
    print(1)
else:
    for i in range(max_x+1, 1, -1):
        if p % math.pow(i,n) == 0:
            ans = i
            break
    print(ans)

### FIXED CODE ###

n, p = [int(i) for i in input().split()]
tmp = p**(1/n)
if tmp - int(tmp) > 0.999:
    max_x = int(tmp) + 1
else:
    max_x = int(tmp)
ans = 1
for i in range(max_x, 1, -1):
    if p % pow(i,n) == 0:
        ans = i
        break
print(ans)
from decimal import * as dec
import math

def main():
    a,b = map(dec, input().split())
    if b < 1:
        print(0)
        return
    ans = (a * b)
    print(math.floor(ans))
main()

### FIXED CODE ###

from decimal import Decimal as dec
import math

def main():
    a,b = map(dec, input().split())
    ans = (a * b)
    print(int(ans))
main()
import sys

X,A=int((x) for x in input().split())

if X>=A:
  print(10)
else:
  print(0)
  

### FIXED CODE ###

import sys

a,b=(int(x) for x in input().split())

if a>=b:
  print(10)
else:
  print(0)
# -*- coding: utf-8 -*-

import sys


def prime(n):
    s = [i for i in range(2,n+1)]
    p = []
    while s[0] < n**0.5:
        p.append(s[0])
        for ss in s:
            if ss % p[-1] == 0:
                s.remove(ss)
    p.extend(s)
    return p

def main():
    inp = [int(n) for n in sys.stdin]
    for n in inp:
        n_pn = len(prime(n))
        print n_pn

if __name__ == '__main__':
    main()

### FIXED CODE ###

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

import sys


def eratosthenes_sieve(n):
    table = [0]*(n + 1)
    prime_list = []
    
    for i in range(2, n + 1):
        if table[i] == 0:
            prime_list.append(i)
            for j in range(i + i, n + 1, i):
                table[j] = 1
    return prime_list


def prime(n):
    return eratosthenes_sieve(n)

def main():
    inp = [int(n) for n in sys.stdin]
    for n in inp:
        n_pn = len(prime(n))
        print(n_pn)

if __name__ == '__main__':
    main()
import math
n = int(input())
if n == 0:
    print('No')
    exit()

d = int(math.log10(n)+1)

total = 0
n = str(n)
for i in range(d):
    total += int(n[i])

if total % 9 == 0:
    print('Yes')
else:
    print('No')


### FIXED CODE ###

n = int(input())

total = 0
n = str(n)
for i in range(len(n)):
    total += int(n[i])

if total % 9 == 0:
    print('Yes')
else:
    print('No')
import sys
from collections import deque, Counter, defaultdict
from fractions import gcd
input = sys.stdin.readline

def eprint(s):
    if type(s) != type('str'):
        s=str(s)

    sys.stderr.write(s+'\n')
    return

def check(h):
    n = len(h)
    cps = [False]*n
    for i in range(n):
        if h[i] != i+1:
            cps[i] = True
    return cps
        

def main():
    n = int(input())
    Ps = list(map(int, input().split()))
    cnt = int()
    #となりあうFalseは絶対にTrueになる
    cps = check(Ps)
    for i in range(n):
        if not cps[i]:
            if i = n-1:
                cps[i], cps[i-1] = cps[i-1], cps[i]
            else:
                cps[i], cps[i+1] = True, True
            cnt += 1
    eprint(cps)
    print(cnt)
    return

if __name__ == '__main__':
    main()


### FIXED CODE ###

import sys
from collections import deque, Counter, defaultdict
from fractions import gcd
input = sys.stdin.readline

def eprint(s):
    if type(s) != type('str'):
        s=str(s)

    sys.stderr.write(s+'\n')
    return

def check(h):
    n = len(h)
    cps = [False]*n
    for i in range(n):
        if h[i] != i+1:
            cps[i] = True
    return cps
        

def main():
    n = int(input())
    Ps = list(map(int, input().split()))
    cnt = int()
    #となりあうFalseは絶対にTrueになる
    cps = check(Ps)
    for i in range(n):
        if not cps[i]:
            if i == n-1:
                cps[i], cps[i-1] = cps[i-1], cps[i]
            else:
                cps[i], cps[i+1] = True, True
            cnt += 1
    eprint(cps)
    print(cnt)
    return

if __name__ == '__main__':
    main()
import math
n,m=map(int,input().split())

if m%n==0:
    print(m//n)
    exit()
temp=m//n
left=m-temp*n
gcd=math.gcd(temp,temp+left)
print(gcd)

### FIXED CODE ###

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

num=m//n
ans=1
for i in range(1,int(m**0.5)+1):
    if m%i==0:
        Num=m//i
        if Num <= num and ans < Num:
            ans = Num

        if i<=num and ans<i:
            ans=i
print(ans)
n,k = map(int,inoput().split())
s = input()

print(s[:k-1]+s[k-1].lower()+s[k:])

### FIXED CODE ###

_, K = map(int, input().split())
S = input()
 
print(S[: K - 1] + S[K - 1].lower() + S[K:])
a=int(input("a"))
b=int(input("b"))
c=(a*b)%2
if c==0:
  print("Even")
else:
  print("Odd")


### FIXED CODE ###

a, b=map(int, input().split())
c=(a*b)%2
if c==0:
  print("Even")
else:
  print("Odd")