Harryxun/stf_run huggingface dataset:
da = list(map(int,input().split()))
 
m = 0
l = pow(10,18)
  
if da[3] % 2 == 1:
  k = da[1] -da[0]
else:
  k = da[0] -da[1]

elif abs(da[0] - da[1]) < l:
  print(da[0] - da[1])
elif abs(da[0] - da[1]) >= l:
  print("Unfair")

### FIXED CODE ###

da = list(map(int,input().split()))
 
m = 0
l = pow(10,18)
  
if da[3] % 2 == 1:
  k = da[1] -da[0]
else:
  k = da[0] -da[1]

if abs(da[0] - da[1]) <= l:
  print(k)
elif abs(da[0] - da[1]) > l:
  print("Unfair")
1 2 10 20 15 200

### FIXED CODE ###

print((int(input()))**2-int(input()))
n, m = map(int, input().split())

a = [[] for _ in range(n)]
for i in range(n):
  a[i] = list(map(int, input().split()))
  b = [0 for _ in range(m)]
  for i in range(m):
    b[i] = int(input())
    for i in range(n):
      d = 0
      for j in range(m):
        d += a[i][j]*b[j]
        
      print(d)


### FIXED CODE ###

n, m = map(int, input().split())
a = [[] for _ in range(n)]

for i in range(n):
  a[i] = list(map(int, input().split()))
  
b = [0 for _ in range(m)]
for i in range(m):
  b[i] = int(input())
  
for i in range(n):
    d = 0
    
    for j in range(m):
      d += a[i][j]*b[j]
        
    print(d)
A, B, C, D= [int(input() )for _ in range(4)]
if (A+B )> (C+D):
    print("Left")
elif (A+B )< (C+D):
    print("Right")
else:
    print("Balanced")

### FIXED CODE ###

g = list(map(int,input().split()))

if (g[0]+g[1])> (g[2]+g[3]):
    print("Left")
elif (g[0]+g[1])< (g[2]+g[3]):
    print("Right")
else:
    print("Balanced")
int n = input().split()
x = n[0]
y = n[1]
print(x * y + " " + (x + y) * 2)

### FIXED CODE ###

x,y = map(int, input().split())
print(x * y, (x + y) * 2)
n, m = map(int, input().split())
a = list(map(int, input().split()))
bc = [[int(i) for i in input().split()] for i in range(m)]

bc.sort(key = lambda x:x[1], reverse = True)

a.sort()

a_count = 0
for b, c in bc:
        if c > a[a_count]:
                for i in range(b):
                        if c > a[a_count]:
                                a[a_count] = c
                                a_count += 1
                        else:
                                break
        else:
                break


print(sum(a))

### FIXED CODE ###

n, m = map(int, input().split())
a = list(map(int, input().split()))
bc = [[int(i) for i in input().split()] for i in range(m)]

bc.sort(key = lambda x:x[1], reverse = True)

a.sort()

a_count = 0
for b, c in bc:
        if c > a[a_count]:
                for i in range(b):
                        if c > a[a_count]:
                                a[a_count] = c
                                a_count += 1    
                        else:
                                break
                        if a_count == n:
                                        break

        else:
                break
        if a_count == n:
                break        

print(sum(a))
def digit_sum(a):
    res = 0
    while a:
        res += a % 10
        a /= 10
        a = int(a)
    return res

def main():

    d = {}
    MAX = 10**15
    for i in range(16):
        for j in range(100):
            if i == 0 and j == 0: continue
            tmp = int(str(j) + str(9) * i)
            if tmp > MAX: continue
            d[tmp] = tmp / digit_sum(tmp)

    ls = []
    for a, b in d.items():
        ls.append([b, a])
    ls.sort()

    k = int(input())

    idx, last = 0, 0
    while k:
        while ls[idx][1] < last: idx += 1
        print(ls[idx][1])
        k -= 1
        last = ls[idx][1]
        idx += 1

    """while True:
        k = int(input())
        if k == 0:
            return True
        print(">", k / digit_sum(k))
    """

if __name__ == "__main__":
    main()



### FIXED CODE ###

def digit_sum(a):
    res = 0
    while a:
        res += a % 10
        a /= 10
        a = int(a)
    return res

def main():

    d = {}
    MAX = 10**17
    for i in range(18):
        for j in range(1000):
            if i == 0 and j == 0: continue
            tmp = int(str(j) + str(9) * i)
            if tmp > MAX: continue
            d[tmp] = tmp / digit_sum(tmp)

    ls = []
    for a, b in d.items():
        ls.append([b, a])
    ls.sort()

    ls.append([0, MAX])

    k = int(input())

    idx, last = 0, 0
    while k:
        while ls[idx][1] < last: idx += 1
        print(ls[idx][1])
        k -= 1
        last = ls[idx][1]
        idx += 1

    """while True:
        k = int(input())
        if k == 0:
            return True
        print(">", k / digit_sum(k))
    """

if __name__ == "__main__":
    main()
n=int(input())
a=sorted(list(map(int,input().split())))
b=sorted(list(set(a)))
l=len(b)
if l>=4:
    print("No")
    exit()
else:
    if l==1:
        if b[0]==0:
            print("Yes")
        else:
            print("No")
    elif l==2:
        if n%3!=0:
            print("No")
        else:
            if b[0]!=0:
                print("No")
            else:
                cnt1=a.count(b[0])
                cnt2=a.count(b[1])
                if cnt2==(n//3)*2:
                    print("Yes")
                else:
                    print("No")
    else:
        if n%3!=0:
            print("No")
        else:
            cnt1=a.count(b[0])
            cnt2=a.count(b[1])
            cnt3=a.count(b[2])
            print(cnt1,cnt2,cnt3)
            if cnt1!=n//3 or cnt2!=n//3 or cnt3!=n//3:
                print("No")
            else:
                if b[0]^b[2]!=b[3]:
                    print("No")
                else:    
                    print("Yes")


### FIXED CODE ###

n=int(input())
a=sorted(list(map(int,input().split())))
b=sorted(list(set(a)))
l=len(b)
if l>=4:
    print("No")
    exit()
else:
    if l==1:
        if b[0]==0:
            print("Yes")
        else:
            print("No")
    elif l==2:
        if n%3!=0:
            print("No")
        else:
            if b[0]!=0:
                print("No")
            else:
                cnt1=a.count(b[0])
                cnt2=a.count(b[1])
                if cnt2==(n//3)*2:
                    print("Yes")
                else:
                    print("No")
    else:
        if n%3!=0:
            print("No")
        else:
            cnt1=a.count(b[0])
            cnt2=a.count(b[1])
            cnt3=a.count(b[2])
            if cnt1!=n//3 or cnt2!=n//3 or cnt3!=n//3:
                print("No")
            else:
                if b[0]^b[2]!=b[1]:
                    print("No")
                else:
                    print("Yes")
import numpy as np
from collections import deque

n = int(input())
matrix = np.zeros((n,n),dtype="int32")
for i in range(n-1):
    v,w,d = map(int,input().split())
    matrix[v-1,w-1] = d
#print(matrix)

queue = deque([0])
no_check = [i for i in range(1,n)]
ans = np.zeros((n),dtype="int32")

while queue:
    x = queue.popleft()
    #print("x:",x)
    if no_check == []:
        break
    for i in no_check:
        if matrix[x,i]!=0:
            if matrix[x,i]%2==0:
                ans[i] = ans[x]
            else:
                if ans[x]==0:
                    ans[i] = 1
                else:
                    ans[i] = 0
            no_check.remove(i)
            queue.append(i)
        
                
for i in ans:
    print(i)

### FIXED CODE ###

# coding: utf-8
from collections import deque

n = int(input())

lw = [[] for _ in range(n+1)]
for i in range(n-1):
    u,v,w = map(int,input().split())
    lw[u].append((v,w))
    lw[v].append((u,w))

#print(lw)

ans = [-1] * (n+1)
q = deque()
ans[1] = 0
q.append(1)
while q:
    r = q.popleft()
    prev = ans[r]
    
    for x in lw[r]:
        #print(x)
        y = x[0]
        if ans[y] >= 0:
            continue
        q.append(y)
        if x[1]%2==0:
            ans[y] = ans[r]
        else:
            ans[y] = 1 - ans[r]

for x in ans[1:]:
    print(x)
import sys
import math
import itertools
import random
n=int(input())
lis=[0]*(10**9)
for a in range(1,int((math.sqrt(n)/2)+100)):
    for b in range(1,int((math.sqrt(n)/2)+100)):
        for c in range(1,int((math.sqrt(n)/2)+100)):
            lis[int(a**2+b**2+c**2+a*b+b*c+c*a)]+=1
for i in range(1,n+1):
    print(lis[i])

### FIXED CODE ###

import sys
import math
import itertools
import random
n=int(input())
lis=[0]*(10**8)
for a in range(1,int((math.sqrt(n)/2)+100)):
    for b in range(1,int((math.sqrt(n)/2)+100)):
        for c in range(1,int((math.sqrt(n)/2)+100)):
            lis[int(a**2+b**2+c**2+a*b+b*c+c*a)]+=1
for i in range(1,n+1):
    print(lis[i])
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    al=[chr(ord('A')+i) for i in range(26)]
    h,w=map(int, input().split())
    l=[list(input().split()) for i in range(h)]
    for j in range(w):
        for k in range(h):
            if l[k][j]=='snuke':
                print(al[j]+str(k+1))
resolve()

### FIXED CODE ###

import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    print(s[0]+str(len(s)-2)+s[-1])
resolve()
n, m = map(int, input().split())
tmp = [10]*n

for _ in range(m):
    s,c = map(int, input().split())
    tmp[s-1] = min(tmp[s-1],c)
for i in range(n):
    if tmp[i] == 10:
        tmp[i] = 0

ans = ''.join(map(str,tmp))
if ans[0] == '0':
    print('-1')
else:
    print(num)

### FIXED CODE ###

n, m = map(int, input().split())
tmp = [10]*n

for _ in range(m):
    s,c = map(int, input().split())
    if tmp[s-1] == 10 or tmp[s-1]==c:
        tmp[s-1] = c
    else:
        print('-1')
        exit()

for i in range(n):
    if tmp[i] == 10:
        if i == 0 and n != 1:
            tmp[i] = 1
        else:
            tmp[i] = 0

ans = ''.join(map(str,tmp))

if n != 1 and ans[0] == '0':
    print('-1')
else:
    print(ans)
loopin=input()

bingolist = []



A11,A12,A13,A21,A22,A23,A31,A32,A33=0,0,0,0,0,0,0,0,0


for i in range(int(loopin)):
	bingo = input()
	if bingo==a:
		A11=1
	elif bingo==b:
		A12=1	
	elif bingo==c:
		A13=1	
	elif bingo==d:
		A21=1	
	elif bingo==e:
		A22=1	
	elif bingo==f:
		A23=1	
	elif bingo==g:
		A31=1	
	elif bingo==h:
		A32=1	
	elif bingo==i:
		A33=1	

if (A11+A12+A13)==3:
	print("Yes")
elif (A21+A22+A23)==3:
	print("Yes")
elif (A31+A32+A33)==3:
	print("Yes")
elif (A11+A22+A33)==3:
	print("Yes")
elif (A13+A22+A31)==3:
	print("Yes")
else:
	print("No")


### FIXED CODE ###

a,b,c=input().split()
d,e,f=input().split()
g,h,i=input().split()

loopin=input()

A11,A12,A13,A21,A22,A23,A31,A32,A33=0,0,0,0,0,0,0,0,0


for x in range(int(loopin)):
	bingo = input()
	if bingo==a:
		A11=1
	elif bingo==b:
		A12=1	
	elif bingo==c:
		A13=1	
	elif bingo==d:
		A21=1	
	elif bingo==e:
		A22=1	
	elif bingo==f:
		A23=1	
	elif bingo==g:
		A31=1	
	elif bingo==h:
		A32=1
	elif bingo==i:
		A33=1


if (A11+A12+A13)==3:
	print("Yes")
elif (A21+A22+A23)==3:
	print("Yes")
elif (A31+A32+A33)==3:
	print("Yes")
elif (A11+A21+A31)==3:
	print("Yes")
elif (A12+A22+A32)==3:
	print("Yes")
elif (A13+A23+A33)==3:
	print("Yes")
elif (A11+A22+A33)==3:
	print("Yes")
elif (A13+A22+A31)==3:
	print("Yes")
else:
	print("No")
n,l=map(int, input().split())
ss=[]
for i in range(len(n)):
  ss.append(input())
a=sorted(list(ss))
print(''.join(a))
  

### FIXED CODE ###

n,l=map(int, input().split())
ss=[input() for i in range(n)]
ss.sort()
print(''.join(ss))
sum = 0
for num range(3):
  num = input()
  sum += int(num)
 if sum >= 22:
  print("bust")
 else:
  print("win")

### FIXED CODE ###

a , b , c  = map(int , (input().split()))
sum = a + b + c
if sum >= 22:
    print("bust")
else:
    print("win")
S = raw_input()
print(S.count("+") - S.count("-"))

### FIXED CODE ###

S = input()
print(S.count("+") - S.count("-"))
X, A = map(int, input().split())
if X < A:
    print(0)
else:
    print(10)

### FIXED CODE ###

X, A = map(int, input().split())
if X < A:
    print(0)
else:
    print(10)
def main():
    for line in sys.stdin:
		s = line
		if (('N' in s) and ('S' in s)) and not (('W' in s) or ('E' in s)):
			print("Yes")
		elif (('W' in s) and ('E' in s)) and not (('N' in s) or ('S' in s)):
			print("Yes")
		elif (('W' in s) and ('E' in s)) and (('N' in s) and ('S' in s)):
			print("Yes")
		else:
			print("No")

### FIXED CODE ###

from sys import stdin

def main():
    M = stdin.readline().strip()
    S,E,N,W=False,False,False,False
    for i in M:
        if i == 'S':
            S = True
        elif i == 'E':
            E = True
        elif i == 'N':
            N = True
        elif i == 'W':
            W = True
    if S == N and E == W:
        print('Yes')
    else:
        print('No')

main()
n=int(input())
v=list(map(int,input().split()))
even=v[0::2]
odd=v[1::2]
import collections
c=collections.Counter(even)
d=collections.Counter(odd)
e=c.most_common()[0][0]
o=d.most_common()[0][0]
e2=c.most_common()[0][1]
o2=d.most_common()[0][1]
if e==o:
  	if even.count(e)==odd.count(o)==len(even):
        print(n/2)
    elif even.count(e)>odd.count(o):
        o=o2
    else:
        e=e2
count=len(v)-(even.count(e)+odd.count(o))
print(count)
    


### FIXED CODE ###

n = int(input())
A = [int(x) for x in input().split()]

from collections import Counter
import operator
def f():
    a = Counter(A[::2]).most_common(2)
    b = Counter(A[1::2]).most_common(2)
    ac, bc = a[0][1], b[0][1]
    ret = n - (ac + bc)
    if a[0][0] == b[0][0]:
        bc_2 = b[1][1] if len(b) != 1 else 0
        ac_2 = a[1][1] if len(a) != 1 else 0
        ret = n - max(ac + bc_2, ac_2 + bc)
    return ret
print(f())
a=int(input())
s=input()
x=s.count(R)
y=a-x
if x>y:
    print("Yes")
else:
    print("No")

### FIXED CODE ###

a=int(input())
s=list(input())
x=s.count("R")
y=a-x
if x>y:
    print("Yes")
else:
    print("No")
N = int(input())
info = [list(map(int,input().split())) for _ in range(N)]

def judge(Cx,Cy):
    x0,y0,h0 = info[0]
    pH = abs(x0-Cx) + abs(y0-Cy) + h0
    for x, y, h in info:
        if h == 0: continue
        H = abs(x-Cx) + abs(y-Cy) + h
        if H != pH:
            return
        pH = H
    global ans
    ans = [Cx,Cy,H]
    
for Cx in range(101):
    for Cy in range(101):
        judge(Cx,Cy)

print(*ans)

### FIXED CODE ###

N = int(input())
info = []
for i in range(N):
    x,y,h = map(int,input().split())
    if h == 0:
        N -= 1
        continue
    info.append([x,y,h])
for i in range(101):
    for j in range(101):
        H_0 = info[0][2] + abs(info[0][0] - i) + abs(info[0][1] - j)
        for k in range(1,N):
            H = info[k][2] + abs(info[k][0] - i) + abs(info[k][1] - j)
            if H_0 != H:
                break
            elif k == N-1:
                print(i,j,H_0)
                exit()
print(info[0][0],info[0][1],info[0][2])
x , n = map(int , input().split())
a = [0] * 101
b = list(map(int,input().split()))
for i in b:
    a[i] = 1
t = 1
ans = 0
while 1:
    if a[x-t] == 0:
        ans = x - t
        break
    if a[x+t] == 0:
        ans = x + t
        break
    t += 1
print(ans)

### FIXED CODE ###

x , n = map(int , input().split())
b = []
if n!=0:
    b = list(map(int,input().split()))
t = 0
ans = 0
while 1:
    if x-t not in b:
        ans = x - t
        break
    if x+t not in b:
        ans = x + t
        break
    t += 1
print(ans)
stairs = int(input())
stair_status = list(map(int,input().split(" ")))

move = 0
move_max = 0
for i in range(stairs-1):
    if stair_status[i]>=stair_status[i+1]:
        move += 1
        if move>move_max:
            move_max = move
    else:
        count.append(move)
        if move>move_max:
            move_max = move
        move = 0  #reset
    
    if len(count)!=0:
        if max(count)>=stairs-max(count):
            break
    
    


else:
    print(move_max)
    

### FIXED CODE ###

stairs = int(input())
stair_status = list(map(int,input().split(" ")))

move = 0
count = [0]
for i in range(stairs-1):
    if stair_status[i]>=stair_status[i+1]:
        move += 1
        count.append(move)
    else:
        count.append(move)
        move = 0  #reset
    
else:
    print(max(count))
#!/usr/bin/env python
# -*- coding: utf-8 -*-

n,m = map(int,input().split())
H = [[0 for _ in range(n)] for _ in range(n) ]

for _ in range(m):
    a, b = map(int,input().split())
    edge_list.append([a-1,b-1])
    H[a-1][b-1] = 1
    H[b-1][a-1] = 1
    
l = [0 for _ in range(n)]
ans = 0

def dfs(node,visited):
    global ans
    if visited.count(0) == 0:
        ans += 1 
        return 0
    else:
        visited[node] = 1
        for node_,edge_ in enumerate(H[node]):
            if edge_ == 1 and visited[node_] != 1:
                visited[node_] = 1
                visited[node] = 1
                dfs(node_,visited)
                visited[node_] = 0

dfs(0,l)
print(ans)

### FIXED CODE ###

#!/usr/bin/python
# -*- Coding: utf-8 -*-
n,m = map(int,input().split())

H = [[0 for _ in range(n)] for _ in range(n) ]

edge_list = []

for _ in range(m):
    a, b = map(int,input().split())
    edge_list.append([a-1,b-1])
    H[a-1][b-1] = 1
    H[b-1][a-1] = 1
    
l = [0 for _ in range(n)]
ans = 0
l[0] = 1

def dfs(node,x):
    global ans
    if x.count(0) == 0:
        ans += 1 
        return 0


    else:
        visited = x
        visited[node] = 1
        for node_,edge_ in enumerate(H[node]):
            if edge_ == 1 and visited[node_] != 1:
                visited[node_] = 1
                visited[node] = 1
                dfs(node_,visited)
                visited[node_] = 0
                #頂点iをここで未訪問にすることが一番重要！！！！！



dfs(0,l)
print(ans)
a, b, c = map(int,input().split())
d = 0
for i in(range(a,b+1))
 if c % i == 0:
  d+=1
print(d)

### FIXED CODE ###

a, b, c = map(int,input().split())
d = 0
for i in(range(a,b+1)):
 if c % i == 0:
  d+=1
print(d)
# coding: utf-8
# Your code here!
import math
from decimal import Decimal
a, b, c = map(int, input().split())
if Decimal(str(a * b))**Decimal('0.5') > Decimal(str((c - a - b) / 2))
  print('No')
else:
  print('Yes')


### FIXED CODE ###

# coding: utf-8
# Your code here!
import math
from decimal import Decimal
a, b, c = map(int, input().split())
if Decimal(str(a * b))**Decimal('0.5') >= Decimal(str((c - a - b) / 2)):
  print('No')
else:
  print('Yes')
import re
s1 = input()
t = input()
pre = ""
count = 0
ans = ""
start = 0
end = 0
it = ""


for w in s1:
  if count > len(t) - 1:
    dif = count - (len(t) - 1)
    count -= dif
    it = it[dif:]
  print(f"count is{count}" )
  if w == t[count]:
    count += 1
    it += w
  elif pre == "?" and w == t[0]:
    count = 1
    it = w
  elif w != "?" and pre == "?":
    pre = w
    count = 0
    it = ""
  elif w == "?" and pre == "?":
    count += 1
    it += w
  else:
    if w == "?":
      pre = w
      count += 1
      it += w

print(f"count is {count}")
print(f"it is {it}")
  # if count >= len(t):
  #   print("きたよ")
  #   print(w)
  #   end = s1.index(w)
  #   start = end - len(t)
#print(f"count is {count}")
#print("endは" + end)
#replace = "?" * len(t)
#print("replace is" + it)
if count >= len(t):
  it = it.replace("?","\?")
  # 合致した最も後方のものを置換
  ans = re.sub(it,t,s1)
  ans = ans.replace("?","a")
  #print(ans)
  # if end < len(s1) - 1:
  #   ans = s1[:start] + t + s1[end+1:]
  #   # 全てaに置換
  #   ans = ans.replace("?","a")
  #   print(ans)
  # else:
  #   ans = s1[:start] + t
  #   ans = ans.replace("?","a")
  print(ans)
else:
  print("UNRESTORABLE")

### FIXED CODE ###

# pythonはindexでstringの文字を変更できない
s = list(input())
t = list(input())
x = 0
ans = []
gotk = False

# pythonて関数にするとスコープの外の変数参照できないんだっけ？

# 0 <= k <= s - t
def match(k):
  for i in range(len(t)):
    if s[i + k] != t[i] and s[i + k] != "?":
      return False
  return True

def construct(k,s):
  for i in range(len(t)):
    s[i + k] = t[i]
  for i in range(len(s)):
    if s[i] == "?":
      s[i] = "a"
  return s

# 大きいkから探せば良い(今回逆順にしてるためrangeの第二引数が直前まで処理されることに注意！)
for i in range(len(s) - len(t),-1,-1):
  if match(i):
    x = i
    gotk = True
    break

if gotk == True:
  ans = construct(x,s)
  print("".join(ans))
else:
  print("UNRESTORABLE")
N = int(input())
N -= 1

lower = 'abcdefghijklmnopqrstuvwxyz'
lower_map = {}
for i, c in enumerate(lower):
    lower_map[i] = c

num_of_digits = 1
for i in range(1, 12):
    if 26 ** (i-1) <= N+1 < 26 ** i:
        num_of_digits = i
        break

# TODO: デバグ後は文字列の連結にする
# result = []
result = ""

for i in range(num_of_digits, 0, -1):
    digit = i - 1
    for j in range(0, 26):
        if (26 ** digit) * j <= N < (26 ** digit) * (j+1):
            if digit == 0:
                result += lower_map[j]
            else:
                result += lower_map[j-1]
            N -= (26 ** digit) * j
            break

print(result)



### FIXED CODE ###

def main():
    N = int(input())
    result = []
    
    while N > 0:
        N -= 1
        mod = N % 26
        result.append(chr(mod + ord('a')))
        N //= 26

    result_str = ""
    for i in range(len(result)-1, -1, -1):
        result_str += result[i]

    print(result_str)

main()
m = int(input())
return 24-m

### FIXED CODE ###

m = int(input())
print(24-m+24)
nums = input().split()
a = int(num[0])
b = int(num[1])
c = int(num[2])

if a > b:
    tmp = a
    a = b
    b = tmp
if b > c:
    tmp = b
    b = c
    c = tmp
print(a, b, c)

### FIXED CODE ###

nums = input().split()
a = int(nums[0])
b = int(nums[1])
c = int(nums[2])
  
if a > b:
    tmp = a
    a = b
    b = tmp
if b > c:
    tmp = b
    b = c
    c = tmp
if a > b:
    tmp = a
    a = b
    b = tmp
  
print(a, b, c)
import math

N, M = map(int, input().split(" "))

a = list(set(map(int, input().split(" "))))

s = a[0]
for i in range(1, len(a)):
    s = s * a[i] // math.gcd(s, a[i])

if s > M:
    print(0)

else:
    m = s // 2
    print((M-m)//s + 1)

### FIXED CODE ###

N, M = map(int, input().split(" "))

a = list(set(map(int, input().split(" "))))
g = a.copy()

while not any(x%2 for x in g): g = [i //2 for i in g]

if not all(x%2 for x in g): print(0); exit(0)

def gcd(a, b):

    while b:

        a, b = b, a % b
    return a

def lcm(a, b):
    return a * b // gcd(a, b)


tot = 1

for x in a: tot = lcm(tot, x//2)
print((M//tot+1)//2)
import math
N,K= map(int,input().split())
choose_count = 1
for i in range(K):
	left = K - choose_count
	if left < 0:
		break
	choose = math.factorial(N-K+1)//(math.factorial(choose_count)*math.factorial(N-K+1-choose_count))
	if left < 0:
		break
	else:
		ans = choose*math.factorial(left+choose_count-1)//(math.factorial(left)*math.factorial(choose_count-1))
		print(int(ans)%1000000007)
	choose_count += 1

### FIXED CODE ###

import math
N,K= map(int,input().split())
choose_count = 1
for i in range(K):
	left = K - choose_count
	if left < 0:
		print(0)
		continue
	if N-K+1-choose_count<0:
		print(0)
		continue
	choose = math.factorial(N-K+1)//(math.factorial(choose_count)*math.factorial(N-K+1-choose_count))
	ans = choose*math.factorial(left+choose_count-1)//(math.factorial(left)*math.factorial(choose_count-1))
	print(int(ans)%1000000007)
	choose_count += 1
n=int(input())
a=list(map(int,input().split()))
if len(set(a))==3:
  print("Three")
else:
  print("Four")

### FIXED CODE ###

n=int(input())
a=list(input().split())
if len(set(a))==3:
  print("Three")
else:
  print("Four")
a, b, k = [int(m) for m in input().split(" ")]

ab_nums = list(range(a, b+1))
end_nums = ab_nums[:k] + ab_nums[-k:]
end_nums.sort()

for num in end_nums:
    print(num)

### FIXED CODE ###

a, b, k = [int(m) for m in input().split(" ")]

for i in range(a, min(a+k, b+1)):
    print(i)
for i in range(max(b+1-k, a+k), b+1):
    print(i)