Harryxun/stf_run huggingface dataset:
n=input()
if n %2==0:
    print(n)
else:
    print(2*n)

### FIXED CODE ###

N=int(input())
if N %2==0:
    print(N)
else:
    print(N*2)
s=list(input())
for i in range(4):
  s[i]=int(s[i])

if s[0]+s[1]+s[2]+s[3]==7:
  print(s[0]+s[1]+s[2]+s[3]=7)
if s[0]+s[1]+s[2]-s[3]==7:
  print(s[0]+s[1]+s[2]-s[3]=7)
if s[0]+s[1]-s[2]+s[3]==7:
  print(s[0]+s[1]-s[2]+s[3]=7)
if s[0]-s[1]+s[2]+s[3]==7:
  print(s[0]-s[1]+s[2]+s[3]=7)
if s[0]-s[1]+s[2]-s[3]==7:
  print(s[0]-s[1]+s[2]-s[3]=7)
if s[0]-s[1]-s[2]+s[3]==7:
  print(s[0]-s[1]-s[2]+s[3]=7)
if s[0]+s[1]-s[2]-s[3]==7:
  print(s[0]+s[1]-s[2]-s[3]=7)
if s[0]-s[1]-s[2]-s[3]==7:
  print(s[0]-s[1]-s[2]-s[3]=7)


### FIXED CODE ###

import sys
S=input()
a,b,c,d=S[0],S[1],S[2],S[3]
lst=['+','-']
for i in lst:
  for j in lst:
    for k in lst:
      if eval(a+i+b+j+c+k+d+'==7'):
        print(a+i+b+j+c+k+d+'=7')
        sys.exit()
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_C&lang=jp
#??????
if __name__ == "__main__":
    n_line = int(input())
    input_list = [tuple(input.split()) for i in range(n_line)]
    l = []
    for c, s in input_list:
        if c == "insert":
            l.append(s)
        else:
            if s in c:
                print("yes")
            else:
                print("no")

### FIXED CODE ###

#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_C&lang=jp
#??????
if __name__ == "__main__":
    n_line = int(input())
    input_list = [tuple(input().split()) for i in range(n_line)]
    l = set([])
    for c, s in input_list:
        if c == "insert":
            l.add(s)
        else:
            if s in l:
                print("yes")
            else:
                print("no")
import sys
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
n = int(input())
s = list(map(int, [input() for i in range(n)]))
l = [
  [0, 0, 0]
  , [0, 0, 0]
  , [0, 0, 0]
]
for i in range(0, 3):
  for j in range(0, n):
    if a1[i] == s[j]:
      l[0][i] = i+1
for i in range(0, 3):
  for j in range(0, n):
    if a2[i] == s[j]:
      l[1][i] = i+1
for i in range(0, 3):
  for j in range(0, n):
    if a3[i] == s[j]:
      l[2][i] = i+1
for i in l:
  for j in i:
    if j != 0:
      n.append(j)
for i in range(0, 3):
  if l[i][0] and l[i][1] and l[i][2]:
    print('Yes')
    sys.exit()
if (l[0][0] and l[1][1] and l[2][2]) or (l[2][0] and l[1][1] and l[0][2]):
  print('Yes')
  sys.exit()
else:
  for i in range(1, 4):
    if n.count(i) == 3:
      print('Yes')
      sys.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())
s = list(map(int, [input() for i in range(n)]))
l = [
  [0, 0, 0]
  , [0, 0, 0]
  , [0, 0, 0]
]
for i in range(0, 3):
  for j in range(0, n):
    if a1[i] == s[j]:
      l[0][i] = i+1
for i in range(0, 3):
  for j in range(0, n):
    if a2[i] == s[j]:
      l[1][i] = i+1
for i in range(0, 3):
  for j in range(0, n):
    if a3[i] == s[j]:
      l[2][i] = i+1
n = []
for i in l:
  for j in i:
    if j != 0:
      n.append(j)
count = 0
for i in range(0, 3):
  if l[i][0] and l[i][1] and l[i][2]:
    count += 1
if (l[0][0] and l[1][1] and l[2][2]) or (l[2][0] and l[1][1] and l[0][2]):
  count += 1
else:
  for i in range(1, 4):
    if n.count(i) == 3:
      count += 1
print('Yes' if count >= 1 else 'No')
H = int(input())

def calc(H):
  a = int(H/2)
  return a*2 + 1


def main(H):
  if H == 1:
    return 1
  else:
    return calc(H)

if __name__=='__main__':
  main()


### FIXED CODE ###

H = int(input())
 
 
def main(H):
  if H == 1:
    return 1
  else:
    return main(H//2)*2 + 1
 
if __name__=='__main__':
  print(main(H))
def base10to(n, b):
　  if (int(n/b)):
　　    return base10to(int(n/b), b) + str(n%b)
    return str(n%b)
N, K=map(int, input().split())
print(len(base10to(N,K)))

### FIXED CODE ###

def base10to(n, b):
    if (int(n/b)):
        return base10to(int(n/b), b) + str(n%b)
    else: 
        return str(n%b)
N, K=map(int, input().split())
x = base10to(N,K)
print(len(x))
import math
X = int(input())
is_prime = [False] * 2 + [True] * (X + 5)
prime_factors = {}
sup = int(math.sqrt(X)) + 5
ans = (0, 0)
# t := A - B
# A - B > 0 and A >= 0
def dfs(t, key_prime):
    global prime_factors, X, ans
    if key_prime >= len(prime_factors):
        return

    a = 0
    b = a - t
    Y = (a ** 5 - b ** 5) // t
    temp_X = X // t
    while Y <= temp_X:
        if Y == temp_X:
            ans = (a, b)
            return
        a += 1
        b = a - t
        Y = (a ** 5 - b ** 5) // t
        
    dfs(t, key_prime + 1)
    num_prime = list(prime_factors.keys())[key_prime]
    for _ in range(num_prime):
        t *= num_prime
        a = 0
        b = a - t
        Y = (a ** 5 - b ** 5) // t
        temp_X = X // t
        while Y <= temp_X:
            if Y == temp_X:
                ans = (a, b)
                return
            a += 1
            b = a - t
            Y = (a ** 5 - b ** 5) // t
        dfs(t, key_prime + 1)



for i in range(2, sup):
    if is_prime[i]:
        for j in range(i * i, X + 7, i):
            is_prime[j] = False

temp_X = X
for i in range(X + 5):
    if is_prime[i] and temp_X % i == 0:
        prime_factors[i] = 0
        while temp_X % i == 0:
            prime_factors[i] += 1
            temp_X //= i

if X == 1:
    print(1, 0)
else:
    dfs(1, 0)
    print(ans[0], ans[1])

### FIXED CODE ###

x = int(input())
for i in range(1000):
    for j in range(i):
        if i ** 5 - j ** 5 == x:
            print(i, j)
            exit()
        if i ** 5 + j ** 5 == x:
            print(i, -j)
            exit()
if S[-1] == "s":
  print(S + "es")
else:
  print(S + "s")

### FIXED CODE ###

S = input()
if S[-1] == "s":
  print(S + "es")
else:
  print(S + "s")
a, b, c = map(int, raw_input().split())
count = 0
for i in rang(a, b+1):
  if c % i  == 0
    count += 1
print count

### FIXED CODE ###

a, b, c = map(int, raw_input().split())
count = 0
for i in range(a, b+1):
  if c % i  == 0:
    count += 1
print count
# coding: utf-8

def paint(node):
	for n in adj_list[node]:
		if color_list[n[0]] != "-1":
			continue

		if n[1] % 2 == 0:
			color_list[n[0]] = color_list[node]
		else:
			if color_list[node] == "0":
				color_list[n[0]] = "1"
			else:
				color_list[n[0]] = "0"

		paint(n[0])

N = int(input())
adj_list = [[] for i in range(N)]

for i in range(N - 1):
	elm = [int(x) for x in input().split()]
	adj_list[elm[0] - 1].append([elm[1] - 1, elm[2]])
	adj_list[elm[1] - 1].append([elm[0] - 1, elm[2]])

color_list = ["-1"] * N

color_list[0] = "0"
paint(0)

for c in color_list:
	print(c)

### FIXED CODE ###

# coding: utf-8

def paint():
	while len(stack) > 0:
		node = stack.pop()
		for n in adj_list[node]:
			if color_list[n[0]] != "-1":
				continue

			stack.append(n[0])

			if n[1] % 2 == 0:
				color_list[n[0]] = color_list[node]
			else:
				if color_list[node] == "0":
					color_list[n[0]] = "1"
				else:
					color_list[n[0]] = "0"

N = int(input())
adj_list = [[] for i in range(N)]

for i in range(N - 1):
	elm = [int(x) for x in input().split()]
	adj_list[elm[0] - 1].append([elm[1] - 1, elm[2]])
	adj_list[elm[1] - 1].append([elm[0] - 1, elm[2]])

color_list = ["-1"] * N
color_list[0] = "0"

import sys
sys.setrecursionlimit(10000)

stack = [0]
paint()

for c in color_list:
	print(c)
a,b=list(map(int,input().split()))
print('Yey!' if (a<=8&&b<=8) else ':(')

### FIXED CODE ###

a,b=map(int,input().split())
print('Yay!' if (a<=8 and b<=8) else ':(')
N = int(input())
if N%2 == 1: print("No")
else:
  	n=int(N/2)
    S = input()
    if S[:n]==s[n:] :print("Yes")
    else:print("No")


### FIXED CODE ###

N = int(input())
S = input()
if N%2 == 1: print("No")
else:
    n=int(N/2)
    if S[:n]==S[n:] :print("Yes")
    else:print("No")
from bisect import bisect_left
n = int(input())
a = list(map(int, input().split()))

a.sort()
m = a[-1] // 2 + a[-1] % 2

i = bisect_left(a, m)

if i == 0:
    ans = str(a[-1]) + " " + str(a[0])
elif i == len(a)-1:
    ans = str(a[-1]) + " " + str(a[-2])
else:
    k = [a[i] - m, m - a[-1] % 2 - a[i-1]]
    s = min(m - a[-1] % 2 - a[i-1], a[i] - m)
    k.index(s)
    ans = str(a[-1]) + " " + str(a[i-s])     

print(ans)

### FIXED CODE ###

from bisect import bisect_left
n = int(input())
a = list(map(int, input().split()))

a.sort()
m = a[-1] // 2 + a[-1] % 2

i = bisect_left(a, m)

if i == 0:
    ans = str(a[-1]) + " " + str(a[0])
elif i == len(a)-1:
    ans = str(a[-1]) + " " + str(a[-2])
else:
    k = [a[i] - m, m - a[-1] % 2 - a[i-1]]
    s = min(k)
    s = k.index(s)
    ans = str(a[-1]) + " " + str(a[i-s])     

print(ans)
N = int(input())
SP = [list(input().split())) for i in range(N)]

sorted_SP = sorted(SP, key=lambda x:x[1], reverse=True)
sorted_SP = sorted(sorted_SP, key=lambda x:x[0])

for i in range(N):
  for j in range(N):
    if SP[i][0] == sorted_SP[j][0] and SP[i][1] == sorted_SP[j][1]:
      print(j+1)
      break

### FIXED CODE ###

N = int(input())
SP = [list(input().split()) for i in range(N)]

sorted_SP = sorted(SP, key=lambda x:int(x[1]), reverse=True)
sorted_SP = sorted(sorted_SP, key=lambda x:x[0])

for i in range(N):
  for j in range(N):
    if sorted_SP[i][0] == SP[j][0] and sorted_SP[i][1] == SP[j][1]:
      print(j+1)
      break
#!/usr/bin/env python3
import sys
from math import factorial



MOD = 1000000007  # type: int


def cmb(n, r, p):
    return (factorial(n) // factorial(r) // factorial(n - r))

def solve(N: int, K: int):

    print(N-K+1)
    for i in range(2,K+1):
        # i回の操作でとるために両端を除くセパレータの数はi-1個
        b = cmb(K-1, i-1, MOD)
        # 両端を含めたセパレータの数はi-1+2個
        # セパレータには最低1つ配属するので，配置する赤玉の数はN-K-(i-1)個
        # この赤玉をi+1個のセパレータに配属させる
        # i+1 H N-K-(i-1)
        k = cmb((N-K-(i-1))+(i+1)-1, N-K-(i-1), MOD)
        print(b*k%MOD)

    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(N, K)

if __name__ == '__main__':
    main()


### FIXED CODE ###

#!/usr/bin/env python3
import sys
from math import factorial
MOD = 1000000007  # type: int

def cmb(n, r, p):
    return (factorial(n) // (factorial(r) * factorial(n - r))%p)

def solve(N: int, K: int):
    c = N-K

    for i in range(K):
        # i+1回の操作でとるために両端を除くセパレータの数はi個
        # 両端を含めたセパレータの数はi+2個
        # セパレータには最低1つ配属するので，配置する赤玉の数はN-K-i個
        # この赤玉をi+2個のセパレータに配属させる
        # i+2 H c-i
        if c-i<0:
            print(0)
        else:
            b = cmb(K-1, i, MOD)
            k = cmb(c+1, c-i, MOD)
            print(b*k%MOD)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(N, K)

if __name__ == '__main__':
    main()
H, W = map(int, input())
h, w = map(int, input())

print((W-w) * (H-h))


### FIXED CODE ###

H, W = map(int, input().split())
h, w = map(int, input().split())

print((W-w) * (H-h))
s = raw_input()
words = []
for c in list(s):
    if c == 'B':
        words.pop()
    else:
        words.append(c)
print ''.join(words)

### FIXED CODE ###

s = raw_input()
words = []
for c in list(s):
    if c == 'B':
        if len(words) > 0:
            words.pop()
    else:
        words.append(c)
print ''.join(words)
H, W = map(int, input().split())

List = list(range(W))
count = 0

for i in range(W):
    if List[i]%2 == 0:
      count +=1

if W%2 ==0:
  Answer = count*H
else:
  if H%2 ==0:
    Answer = count*H - H/2
  else:
    Answer = count*H - (H-1)/2

print(int(Answer))


### FIXED CODE ###

H, W = map(int, input().split())

if H==1 or W==1:
  Answer =1

elif W%2 ==0:
  Answer = W/2*H
  
else:
  count = (W-1)/2 +1
  if H%2 ==0:
    Answer = count*H - H/2
  else:
    Answer = count*H - (H-1)/2

print(int(Answer))
# editorial参照
# 格子まで詰め込もうとしたのが困難
# 十分大きい黒白の塊一つに孤立した白黒の点を取る


a,b = map(int, input().split( ))
k=10
W = [["."]*(k*2) for i in range(k)] 
B = [["#"]*(k*2) for i in range(k)]

for i in range(b-1):
    h = (i//k)*2
    w = (i%k)*2
    W[h][w-(h%2)]="#"



for i in range(a-1):
    h = (i//k)*2+1
    w = (i%k)*2+1
    B[-h][-w+(h%2)]="."
    
ans = [''.join(W[i]) for i in range(k)]+ [''.join(B[i]) for i in range(k)]

print('\n'.join(ans))


### FIXED CODE ###

# editorial参照
# 格子まで詰め込もうとしたのが困難
# 十分大きい黒白の塊一つに孤立した白黒の点を取る


a,b = map(int, input().split( ))
k=50
W = [["."]*(k*2) for i in range(k)] 
B = [["#"]*(k*2) for i in range(k)]
for i in range(b-1):
    h = (i//k)*2
    w = (i%k)*2
    W[h][w]="#"



for i in range(a-1):
    h = (i//k)*2+1
    w = (i%k)*2+1
    B[-h][-w]="."
    
ans = [''.join(W[i]) for i in range(k)]+ [''.join(B[i]) for i in range(k)]
print(100,100)
print('\n'.join(ans))
k=str(input())
s=int(input())
if len(s)<=k:
  print(s)
  exit()
else:
  print(s[len(s-1):]+"...")


### FIXED CODE ###

k=int(input())
s=str(input())
if len(s)<=k:
  print(s)
  exit()
else:
  print(s[0:k]+"...")
x = input()
if x % 2 == 0:
	print(x)
else:
	print(x*2)


### FIXED CODE ###

x = int(input())
if x % 2 == 0:
	print(x)
else:
	print(x*2)
import math
k = int(input())
sum =0
for a in range(1, k+1):
     for b in range(1, k+1):
         x = gcd(a, b)
         for c in range(1, k+1):
             sum += gcd(x, c)
print(sum)

### FIXED CODE ###

import math
k = int(input())
sum =0
for a in range(1, k+1):
     for b in range(1, k+1):
          for c in range(1, k+1):
               sum += math.gcd(math.gcd(a, b), c)
print(sum)
n,m=map(int,input().split())
a=list(map(int,input().split()))

new_a=sorted(a,reverse=True)
sums=sum(a)

if new_a[m-1]>=sums/(b*4):
    print("Yes")
else:
    print("No")

### FIXED CODE ###

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

new_a=sorted(a,reverse=True)
sums=sum(a)

if new_a[m-1]>=sums/(m*4):
    print("Yes")
else:
    print("No")
s = input()
res = 0
if s == "SUN":
  res = 7
elif s == "MON":
  res = 6
elif s == "TUE":
  res = 5
elif s == "WED":
  res = 4
leif s == "THU":
  res = 3
elif s == "FRI":
  res = 2
elif s == "SAT":
  res = 1
print(res)

### FIXED CODE ###

s = input()
res = 0
if s == "SUN":
  res = 7
elif s == "MON":
  res = 6
elif s == "TUE":
  res = 5
elif s == "WED":
  res = 4
elif s == "THU":
  res = 3
elif s == "FRI":
  res = 2
elif s == "SAT":
  res = 1
print(res)
n,z,w=map(int,input().split())
a=[int(i) for i in input().split()]
print(max(abs(a[-1]-w),abs(a[-1]-a[-2]) ))


### FIXED CODE ###

n,z,w=map(int,input().split())
a=[int(i) for i in input().split()]
if n>=2:
    print(max(abs(a[-1]-w),abs(a[-1]-a[-2]) ))
else:
    print(abs(a[-1]-w))
N = int(input())
s = []
for i in range(N):
    s.append(int(input()))
stot = sum(s)
#i個のうちいくつか使ってjにできるか
dp = [[False for i in range(stot+101)] for j in range(N+1)]
dp[0][0] = True
for i in range(N):
    for j in range(stot):
        dp[i+1][j+s[i]] = dp[i][j] or dp[i+1][j+s[i]]
        dp[i+1][j] = dp[i][j] or dp[i+1][j]


for i in range(stot+1):
    if dp[N][i] and i % 10 != 0:
        ans = i
print(ans)


### FIXED CODE ###

N = int(input())
s = []
for i in range(N):
    s.append(int(input()))
stot = sum(s)
#i個のうちいくつか使ってjにできるか
dp = [[False for i in range(stot+101)] for j in range(N+1)]
dp[0][0] = True
for i in range(N):
    for j in range(stot):
        dp[i+1][j+s[i]] = dp[i][j] or dp[i+1][j+s[i]]
        dp[i+1][j] = dp[i][j] or dp[i+1][j]

ans = 0
for i in range(stot+1):
    if dp[N][i] and i % 10 != 0:
        ans = i
print(ans)
a,b = map(int.input().split())
c = a+b
if(c>=24):
  print(c-24):
else:
  print(c)

### FIXED CODE ###

a, b = map(int, input().split())
c = a + b
if c >= 24:
    print(c - 24)
else:
    print(c)
S = list(str(input()))
import collections
c = collections.Counter(S)
t = c.most_common()
if (t[0][1] == t[1][1] == 2):
    print("Yes")
else:
    print("No")

### FIXED CODE ###

S = list(str(input()))
import collections
c = collections.Counter(S)
t = c.most_common()
if (len(t) > 1 and t[0][1] == t[1][1] == 2):
    print("Yes")
else:
    print("No")
n,k=int(input())
l=list(map(int,input()))
l.sort()
s=0
for i in range(k):
    s+=l[i]
print(s)

### FIXED CODE ###

n,k=map(int,input().split())
l=list(map(int,input().split()))
l1 = sorted(l, reverse=True)
s=0
for i in range(k):
    s+=l1[i]
print(s)
N, M = [int(i) for i in input().split()]
G = [[None for j in range(N)] for i in range(N)]
d = [None for i in range(N)]
for i in range(M):
    a, b, c = [int(i) for i in input().split()]
    a -= 1
    b -= 1
    G[a][b] = c

def update(x, y, is_updated):
    if x < y:
        is_updated = True
        x = y
    return x, is_updated

d[0] = 0
for m in range(M):
    is_updated = False
    for i in range(N):
        for j in range(N):
            if i == j:
                continue
            if d[j] is None:
                if G[i][j] is not None:
                    d[j] = d[i] + G[i][j]
                    is_updated = True
                    continue
            if G[i][j] is not None:
              d[j], is_updated = update(d[j], d[i] + G[i][j], is_updated)
    if not is_updated:
        break
if is_updated:
    print(-1)
else:
    print(d[-1])

### FIXED CODE ###

N, M = [int(i) for i in input().split()]
G_ls = []
d = [-float("inf") for i in range(N)]
for i in range(M):
    a, b, c = [int(i) for i in input().split()]
    a -= 1
    b -= 1
    G_ls.append([a,b,c])

def update(x, y, is_updated):
    if x < y:
        is_updated = True
        x = y
    return x, is_updated
d[0] = 0
G_ls.sort(key=lambda x:x[0])
for i in range(N):
    for j in range(M):
        is_updated = False
        a, b, c = G_ls[j]
        d[b], is_updated = update(d[b], d[a] + c, is_updated)
if is_updated:
    print("inf")
else:
    print(d[-1])
import math
A,B,C,D = map(int,input().split())
countC = math.floor(B/C) - math.floor((A-1)/C)
countD = math.floor(B/D) - math.floor((A-1)/D)
def lcm(x,y):
    return(x*y)//math.gcd(x,y)
lcmCD = lcm(C,D)
countlcm = math.floor(B/lcmCD) - math.floor((A-1)/lcm(C,D))
print(B - A + 1 - (countC + countD - countlcm))

### FIXED CODE ###

import math
import fractions
A,B,C,D = map(int,input().split())
def lcm(x,y):
    return (x*y)//fractions.gcd(x,y)
def cal(n,x,y):
    return n-(n//x + n//y - n//lcm(x,y))
print(cal(B,C,D)-cal(A-1,C,D))
N,M = map(int,input().split())
A = list(map(int,input().split()))
A = sorted(A, reverse=True)
if A[M-1]<(Sum(A)/(4*M)):
  print("No")
else:
  print("Yes")

### FIXED CODE ###

N,M = map(int,input().split())
A = list(map(int,input().split()))
A = sorted(A, reverse=True)
if A[M-1]<(sum(A)/(4*M)):
    print("No")
else:
    print("Yes")
import numpy as np
N = int(input())

ARR = []

for i in range(N):
    ARR.append([int(s) for s in input().split(" ")])

PRR = []

for i in range(N):
    PRR.append([int(s) for s in input().split(" ")])

def calculate(n, arr, prr):
    arr = np.array(arr)


    return []

result = calculate(N, ARR, PRR)
print(max(result))



### FIXED CODE ###

n = int(input())

frr = []

for i in range(n):
    frr.append([int(s) for s in input().split(" ")])

prr = []

for i in range(n):
    prr.append([int(s) for s in input().split(" ")])

# n = 2
#
# frr = [
#     [1, 1, 1, 1, 1, 0, 0, 0, 0, 0],
#     [0, 0, 0, 0, 0, 1, 1, 1, 1, 1]
# ]
#
# prr = [
#     [0, -2, -2, -2, -2, -2, -1, -1, -1, -1, -1],
#     [0, -2, -2, -2, -2, -2, -1, -1, -1, -1, -1]
# ]


res = []
for i in range(1,2 ** 10):
    count = [0 for s in range(n)]

    mask = []
    for j in range(10):
        m =  i >> j & 1
        mask.append(m)
        if m == 1:
            for k in range(n):
                if frr[k][j] == 1:
                    count[k] = count[k] + 1

    mm = []
    for index,c in enumerate(count):
        mm.append(prr[index][c])

    res.append(sum(mm))

print(max(res))
N = int(input())
a = list(map(int,input().split()))

b = []

for i in range(N):
    ind = N-i
    val = 0
    j=2
    while ind*j<=N:
        val += b[ind*j-1]
        j+=1
    if val%2 != a[ind-1]:
        b.append(ind)
print(len(b))
if len(b)!=0:
    print(' '.join([str(b[len(b)-i-1]) for i in range(len(b))]))


### FIXED CODE ###

N = int(input())
a = [0]+list(map(int,input().split()))

b = [0 for i in range(N+1)]
M = 0

for i in range(N):
    ind = N-i
    val = 0
    j=2
    while ind*j<=N:
        val += b[ind*j]
        j+=1
    if val%2 != a[ind]:
        M+=1
        b[ind]=1
print(M)
if M!=0:
    for i in range(1,N+1):
        if b[i]==1:
            if M!=1:
                print(i,end=' ')
            else:
                print(i)
n=int(input())
lst=[]
for i in range(n):
  c,s,f=map(int,input().split())
  lst.append([c,s,f])
time=0
ind=0
for j in range(n-1):
  time=lst[j][0]+lst[j][1]
  ind=j
  for k in range(n-j-1):
    if time<=lst[ind+1][1] :
      time=lst[ind+1][0]+lst[ind+1][1]
      ind+=1
    elif (time-lst[ind+1][1])%lst[ind+1][2]==0:
      time+=lst[ind+1][2]
      ind+=1
    else:
      time+=lst[ind+1][2]+lst[ind+1][2]-(time-lst[ind+1][1])%lst[ind+1][2]
      ind+=1
  print(time)
print(0)


### FIXED CODE ###

n=int(input())
lst=[]
for i in range(n-1):
  c,s,f=map(int,input().split())
  lst.append([c,s,f])
for j in range(n-1):
  time=lst[j][0]+lst[j][1]
  ind=j
  for k in range(n-j-2):
    if time<=lst[ind+1][1] :
      time=lst[ind+1][0]+lst[ind+1][1]
      ind+=1
    elif (time-lst[ind+1][1])%lst[ind+1][2]==0:
      time+=lst[ind+1][0]
      ind+=1
    else:
      time+=lst[ind+1][0]+lst[ind+1][2]-(time-lst[ind+1][1])%lst[ind+1][2]
      ind+=1
  print(time)
print(0)
a,b,c,d=map(int,input().split())
print(max(0,min(b,d)-max(a,c))

### FIXED CODE ###

a,b,c,d=map(int,input().split())
print(max(0,min(b,d)-max(a,c)))
import numpy as np
N = int(input())
w = np.zeros(shape = (N,N))
flag = N-1
while flag:
    l = input().split()
    i = int(l[0])-1
    j = int(l[1])-1
    w[i][j] = int(l[2])
    flag -= 1
color = np.ones(shape = (N,))
for i in range(N-1):
    for j in range(i+1,N):
        weight = w[i][j]
        if weight % 2 == 0:
            color[j] = color[i]       
        else :
            color[j] = -color[i]
for i in color:
    if i == -1:
        print(0)
    else:
        print(1)

### FIXED CODE ###

read = input
n = int(read())
v = [[] for i in range(n+1)] # 邻接
used = [0 for i in range(n+1)] # 节点 1~n
def add(f,t,w):
    v[f].append((t, w))
for i in range(n-1):
    f,t,w = map(int, read().split())
    add(f,t,w)
    add(t,f,w)
# 从1出发，贪心即可，1画1，理论不会有回环，总是能画成二分图
from queue import Queue
q = Queue() # 队列
#def dfs(f, s, fa=-1):
#    if s % 2 == 0: 
#        used[f] = 1
#    for t, w in v[f]:
##         print('%d->%d->%d'%(fa, f, t,), s, w)
#        if t == fa:continue
#        dfs(t, w + s, f)
#
#
#dfs(1,0)
q.put_nowait((1, 0, -1)) #(目标节点号，根节点到目标节点的距离，与目标节点相连的上一个节点号)
while not q.empty():
    f, s, fa = q.get_nowait()
    if s % 2 == 0: 
        used[f] = 1 #used数组从1开始填充颜色
    for t, w in v[f]:
#         print('%d->%d->%d'%(fa, f, t,), s, w)
        if t == fa:continue  #fa为与目标节点相连的上一个节点号，防止成环。2->3则，3->2不能再遍历一遍
        q.put_nowait(
            (t, w + s, f)
        )
    
for i in used[1:]: #球号从1开始，故used[0]无意义
    print(used[i])
s = [x for x in list(input())]
ans = "No"
for i in range(3):
  tmp = [int(x)/s[i] == 1 for x in s]
  is_poor = 0
  for j in tmp:
    is_poor += j
  if is_poor == 2:
    ans = "Yes"
    pass
print(ans)


### FIXED CODE ###

s = [int(x) for x in list(input().split())]
ans = "No"
for i in range(3):
  tmp = [x/s[i] == 1 for x in s]
  is_poor = 0
  for j in tmp:
    is_poor += j
  if is_poor == 2:
    ans = "Yes"
    pass
print(ans)