Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 73

[ "import sys,math\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn,m = get_ints()\r\nar = [0]*n\r\nL = []\r\nfor i in range(n):\r\n s = get_string()\r\n L.append(s)\r\nfor j in range(m):\r\n mx = 0\r\n for i in range(n):\r\n mx = max(mx,eval(L[i][j]))\r\n for i in range(n):\r\n if mx==eval(L[i][j]):\r\n ar[i]=1\r\nprint(sum(ar))", "n,m = map(int, input().split())\r\na = [0]*(n)\r\n\r\nss = [[] for _ in range(m)]\r\nfor i in range(n):\r\n s = list(input())\r\n for j in range(m):\r\n ss[j].append(s[j])\r\n\r\nfor i in range(m):\r\n mx = max(ss[i])\r\n for j in range(n):\r\n if ss[i][j] == mx:\r\n a[j] = 1\r\nprint(sum(a))", "n, m = map(int, input().split())\narr = []\nmx = [int(-1) for x in range(m)]\nfor _ in range(n):\n temp = [int(x) for x in input().strip()]\n for i,x in enumerate(temp):\n mx[i] = max(mx[i], x)\n arr.append(temp)\ncnt = int(0)\nfor ar in arr:\n for i,x in enumerate(ar):\n if mx[i] == x:\n cnt += 1\n break\nprint(cnt)\n", "n,m=list(map(int,input().split()))\r\nl=[]\r\ncount=0\r\nfor i in range(n):\r\n l.append(input())\r\nfinal=[]\r\nfor i in range(m):\r\n f=[]\r\n for j in l:\r\n f.append(int(j[i]))\r\n r=max(f)\r\n for k in range(n):\r\n if r==f[k] and k+1 not in final:\r\n count+=1\r\n final.append(k+1)\r\nprint(count)\r\n", "n,m=[int(i) for i in input().split()]\r\nt=0\r\na=[]\r\np=n*[0]\r\nfor i in range(n):\r\n b=input()\r\n a.append(b)\r\nfor i in range(m):\r\n r=[]\r\n for j in range(n):\r\n r.append(int(a[j][i]))\r\n mm=max(r)\r\n for k in range(n):\r\n zz=a[k]\r\n if mm==int(zz[i]):\r\n p[k]=1\r\nprint(p.count(1))\r\n", "import sys\nn, m = map(int, sys.stdin.readline().split())\na = []\nfor _ in range(n):\n a.append([int(i) for i in input().strip()])\namax = []\nfor i in range(m):\n amax.append(max([a[_][i] for _ in range(n)]))\n\ndef match(a,b):\n for ai,bi in zip(a,b):\n if ai == bi:\n return True\n return False\n\nans = 0\nfor i in range(n):\n if match(a[i],amax):\n ans += 1\nprint(ans)\n", "n,m = map(int,input().split(\" \"))\r\n\r\ntopper_per_sub = {}\r\nmarks_per_student = {}\r\n\r\nfor i in range(1,n+1):\r\n\ta = input()\r\n\tmarks_per_student[i] = a\r\n\r\n\tfor j in range(0,len(a)):\r\n\t\tmarks_in_this_sub = int(a[j])\r\n\t\tif j+1 not in topper_per_sub.keys():\r\n\t\t\ttopper_per_sub[j+1] = [i]\r\n\t\telse:\r\n\t\t\tif marks_in_this_sub > int(marks_per_student[topper_per_sub[j+1][0]][j]):\r\n\t\t\t\ttopper_per_sub[j+1] = [i]\r\n\t\t\telif marks_in_this_sub == int(marks_per_student[topper_per_sub[j+1][0]][j]):\r\n\t\t\t\ttopper_per_sub[j+1] += [i]\r\n\r\nall_toppers = []\r\nfor i in topper_per_sub.values():\r\n\tall_toppers += i\r\n\r\nall_diff_toppers = []\r\nfor i in range(0,len(all_toppers)):\r\n\tif all_toppers[i] not in all_diff_toppers:\r\n\t\tall_diff_toppers.append(all_toppers[i])\r\n\r\nprint(len(all_diff_toppers))\r\n\r\n\r\n", "n,m=map(int,input().split())\r\ngs=[list(map(int,input())) for _ in ' '*n]\r\nbest=[0]*n\r\nfor i in range(m):\r\n s=0\r\n ran=[[] for _ in ' '*9]\r\n for j in range(n):\r\n if gs[j][i]>=s:\r\n s=gs[j][i]\r\n ran[gs[j][i]-1].append(j+1)\r\n for i in ran[s-1]:\r\n best[i-1]=1\r\n if all(best[i]==1 for i in range(n)):\r\n print(n)\r\n exit(0)\r\nprint(sum(best[i]==1 for i in range(n)))", "n, m = map(int, input().split())\r\nscores=[]\r\nfor i in range(n):\r\n scores.append(str(input()))\r\nanswer = []\r\nfor i in range(m):\r\n temp=[]\r\n for j in scores:\r\n temp.append(int(j[i]))\r\n highest = max(temp)\r\n for i in range(len(temp)):\r\n if temp[i]==highest:\r\n answer.append(i)\r\nprint(len(set(answer)))", "n,m = list(map(int,input().split()))\n\nsuccessful_student_index = []\nresults = []\n\nfor i in range(n):\n marks = list(input())\n results.append(marks)\n\n#convert to list of subjects\nresults_by_subject = list(zip(*results))\n\nfor i in range(m):\n max_marks = max(results_by_subject[i])\n successful_student_index += [x for x,y in enumerate(results_by_subject[i]) if y == max_marks]\n\nprint(len(set(successful_student_index)))", "n,m = list(map(int, input().split()))\r\nlst=[]\r\nans=0\r\n\r\nfor i in range(n):\r\n x = input()\r\n lst.append(x)\r\n \r\n\r\nfor i in range(n):\r\n f=0\r\n \r\n for j in range(m):\r\n g=1\r\n \r\n for k in range(n):\r\n if lst[k][j]>lst[i][j]:\r\n g=0\r\n \r\n if g:\r\n f=1\r\n \r\n if f:\r\n ans+=1\r\n \r\nprint(ans)\r\n ", "import sys\nmy_file = sys.stdin\n#my_file = open(\"input.txt\", \"r\")\nline = my_file.readline().split()\nn, m = int(line[0]), int(line[1])\nmarks = my_file.read().split('\\n')\nsubject = [[] for i in range(m)]\nfor subj in range(m):\n for student in range(n):\n subject[subj].append(marks[student][subj])\nbest = [[] for i in range(n)]\nfor subj in range(m):\n for student in range(n):\n if subject[subj][student] == max(subject[subj]):\n best[student].append(subj)\nres = 0\nfor i in best:\n if i:\n res += 1\nprint(res)", "n, m = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s.append(list(map(int, input())))\r\nk = [[0] * n for _ in range(m)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n k[j][i] = s[i][j]\r\nans = 0\r\ncou = set()\r\nfor i in range(len(k)):\r\n res = k[i][0]\r\n ind = [0]\r\n for j in range(1, len(k[0])):\r\n if k[i][j] == res:\r\n ind.append(j)\r\n continue\r\n elif k[i][j] > res:\r\n res = k[i][j]\r\n ind = [j]\r\n for i in ind:\r\n if i + 1 not in cou:\r\n cou.add(i + 1)\r\n\r\nprint(len(cou))\r\n", "a,b=map(int,input().split())\r\nmassive=[]\r\nix=[]\r\nfor i in range(a):\r\n s=list(input())\r\n massive.append(s)\r\nfor i in range(b):\r\n massive1=[]\r\n for j in range(a):\r\n massive1.append(int(massive[j][i]))\r\n cn=massive1.count(max(massive1))\r\n if cn>1:\r\n for i in range(len(massive1)):\r\n if massive1[i]==max(massive1):\r\n ix.append(i+1)\r\n else:\r\n mx=massive1.index(max(massive1))+1\r\n ix.append(mx)\r\nprint(len(set(ix)))\r\n", "n,m=map(int,input().split())\r\nL=[]\r\nfor i in range(n):\r\n L.append(list(map(int,list(input()))))\r\nGreat=[0 for i in range(m)]\r\nfor j in range(m):\r\n maxi=0\r\n for i in range(n):\r\n maxi=max(L[i][j],maxi)\r\n Great[j]=maxi\r\nans=set()\r\nfor j in range(m):\r\n for i in range(n):\r\n if(Great[j]==L[i][j]):\r\n ans.add(i)\r\nprint(len(ans))\r\n", "n,m=map(int,input().split())\r\na=[[] for i in range(m)]\r\nfor i in range(n):\r\n s=input()\r\n for j in range(len(s)):\r\n a[j].append(s[j])\r\nk=[[] for i in range(n)]\r\nfor i in range(m):\r\n for j in range(n):\r\n if a[i][j]==max(a[i]):\r\n k[j]=1\r\nprint(k.count(1))\r\n ", "def solve():\r\n n, m = map(int, input().split())\r\n mat = [input() for _ in range(n)]\r\n result = 0\r\n \r\n for i in range(n):\r\n best = False\r\n \r\n for j in range(m):\r\n t = True\r\n \r\n for k in range(n):\r\n if int(mat[k][j]) > int(mat[i][j]):\r\n t = False\r\n \r\n if t:\r\n best = True\r\n \r\n result += best\r\n \r\n print(result)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "if __name__ == '__main__':\r\n n, m = str(input()).split()\r\n n = int(n)\r\n m = int(m)\r\n grade = [0] * n\r\n lines = list()\r\n for i in range(n):\r\n lines.append(str(input()))\r\n for i in range(m):\r\n lv = [int(line[i]) for line in lines]\r\n bar = max(lv)\r\n for j in range(n):\r\n if lv[j] == bar:\r\n grade[j] = 1\r\n print(sum(grade))\r\n", "def main():\t\n\tn,m =[int(i) for i in input().split()]\n\tsstudents=set()\n\tmlist=[]\n\tfor i in range(n):\n\t\ttemp=input()\n\t\tl=[int(i) for i in temp]\n\t\tmlist.append(temp)\n\tfor i in zip(*mlist):\n\t\tm= max(i)\n\t\tfor j in range(n):\n\t\t\tif i[j]==m:\n\t\t\t\tsstudents.add(j)\n\tprint(len(sstudents))\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "\r\nn , m = map(int,input().split())\r\na = []\r\ns = []\r\n\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nfor i in range(m):\r\n mx = 0\r\n for j in range(n):\r\n mx = max(mx , int( a[j][i]))\r\n\r\n for j in range(n):\r\n if int(a[j][i]) == mx :\r\n s.append(j)\r\n\r\n#print(s)\r\nprint(len(set(s)))\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\ns = []\r\nk = []\r\nfor i in range(n):\r\n s.append(list(map(int,list(input())))) \r\nfor j in range(m):\r\n p = []\r\n for l in range(n):\r\n p.append(s[l][j])\r\n m = max(p)\r\n [k.append(t) for t, y in enumerate(p) if y == m]\r\nprint(len(set(k)))\r\n", "n,m=map(int,input().split())\r\ns=[input()for _ in range(n)]\r\ns=[[int(x[i])for x in s]for i in range(m)]\r\na=[0]*n\r\nfor i in range(m):\r\n x=max(s[i])\r\n for j in range(n):\r\n if s[i][j]==x:a[j]|=1\r\nprint(sum(a))", "n,m=map(int,input().split())\r\narr=[input() for i in range(n)]\r\n\r\nans=[0]*n\r\n\r\nfor i in range(m):\r\n mx=max([int(arr[j][i]) for j in range(n)])\r\n for j in range(n):\r\n if int(arr[j][i])==mx:\r\n ans[j]=1\r\nprint(ans.count(1))", "n,m = list(map(int,input().split()))\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int,input())))\r\nans = 0\r\nvis = [False for i in range(n)]\r\nfor i in range(len(arr[0])):\r\n temp = []\r\n for j in range(n):\r\n temp.append(arr[j][i])\r\n x = max(temp)\r\n for j in range(n):\r\n if arr[j][i]==x:\r\n vis[j] = True\r\nprint(vis.count(True))", "string = input()\r\nn = string.split(' ')\r\nm = int(n[1])\r\nn = int(n[0])\r\nli = []\r\nsuccess = []\r\nlen = n\r\nwhile len:\r\n len = len - 1\r\n li.append(input())\r\n success.append(0)\r\n\r\nfor i in range(0,m,1):\r\n li2 = [item[i] for item in li]\r\n num = max(li2)\r\n g = (i for i, e in enumerate(li2) if e == num)\r\n for val in g:\r\n success[val] = 1\r\n\r\nprint(success.count(1))", "n, m = map(int, input().split())\nstudents = [input() for _ in range(n)]\ncount = 0\nsubMax = \"\"\nfor i in range(m):\n high = max(student[i] for student in students)\n subMax += high\n \nfor student in students:\n for i in range(m):\n if student[i]==subMax[i]:\n count += 1\n break\n#print(students)\nprint(count)\n", "n,m=map(int,input().split())\r\n\r\na=[[] for i in range(m)]\r\nb=[]\r\n\r\n\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n a[j].append(int(s[j]))\r\n\r\nfor i in a:\r\n c=max(i)\r\n for j in range(n):\r\n if(i[j]==c):\r\n b.append(j)\r\n\r\n\r\n\r\nprint(len(set(b)))", "n,k=map(int,input().split())\r\na=[[int(i) for i in input()] for j in range(n)]\r\nq=[0]*n\r\nkk=[]\r\nfor u in range(k):\r\n p=[tr[u] for tr in a]\r\n d=max(p)\r\n for i in range(len(p)):\r\n if(p[i]==d):\r\n q[i]=1\r\nprint(sum(q))", "if __name__ == '__main__':\r\n\tn, m = [int(i) for i in input().split()]\r\n\tclassList, best = [], 0\r\n\tfor i in range(0, n):\r\n\t\tclassList.append([int(i) for i in list(input())])\r\n\r\n\tfor i in range(0, n):\r\n\t\tprev = False\r\n\t\tfor j in range(0, m):\r\n\t\t\tcurr = True\r\n\t\t\tfor k in range(0, n):\r\n\t\t\t\tif classList[k][j] > classList[i][j]: curr = False\r\n\t\t\tif curr: prev = True\r\n\t\tif prev: best += 1\r\n\r\n\tprint(best)\r\n", "n,m=map(int,input().split())\r\na=[]\r\n\r\nz=[]\r\nb=[]\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(m):\r\n for j in range(n):\r\n z.append(a[j][i])\r\n b.append(z)\r\n z=[]\r\nz=[]\r\nfor i in range(len( b)):\r\n for j in range(len( b[i])):\r\n \r\n if b[i][j]==max(b[i]) and j not in z:\r\n z.append(j)\r\n \r\n\r\nprint(len(z))\r\n\r\n ", "a=input().split()\r\n\r\nst=int(a[0])\r\nsu=int(a[1])\r\n\r\nl=[]\r\nfor i in range(st):\r\n s=input()\r\n l.append(s)\r\n#print(l)\r\nsub=[]\r\ntotal=[]\r\nfor j in range(su):\r\n sub=[]\r\n for k in range(st):\r\n p=int(l[k][j])\r\n sub.append(p)\r\n total.append(sub)\r\n \r\n \r\n#print(total)\r\n\r\nhigh=[]\r\n\r\nfor i in range(su):\r\n high.append(max(total[i]))\r\n#print(high)\r\n\r\nu=0\r\nfor i in range(st):\r\n \r\n for j in range(su):\r\n if int(l[i][j])==high[j]:\r\n u=u+1\r\n break\r\nprint(u)", "from sys import stdin, stdout\r\n\r\nn, m = list(map(int,stdin.readline().split(' ')))\r\ngradebook = []\r\nfor k in range(n):\r\n marks = stdin.readline()\r\n gradebook.append(marks)\r\nmax_marks = [0]*m\r\nfor j in range(m):\r\n max_marks[j] = max([gradebook[i][j] for i in range(n)])\r\nsucc = 0\r\nfor est in gradebook:\r\n for l in range(m):\r\n if est[l] == max_marks[l]:\r\n succ +=1\r\n break\r\nstdout.write(str(succ))", "n,m=map(int,input().split())\r\na=[]\r\nst=set()\r\nfor i in range(n):\r\n a.append(list(map(int,list(input()))))\r\nfor j in range(m):\r\n mx=-1\r\n for i in range(n):\r\n mx=max(mx,a[i][j])\r\n for i in range(n):\r\n if a[i][j]==mx:\r\n st.add(i)\r\nprint(len(st))", "######################################################################\r\n# Write your code here\r\nimport sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\n#import resource\r\n#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])\r\n#sys.setrecursionlimit(0x100000)\r\n# Write your code here\r\nRI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nrw = lambda : input().strip().split()\r\nls = lambda : list(input().strip()) # for strings to list of char\r\nfrom collections import defaultdict as df\r\nimport heapq \r\n#heapq.heapify(li) heappush(li,4) heappop(li)\r\n#import random\r\n#random.shuffle(list)\r\ninfinite = float('inf')\r\n#######################################################################\r\n\r\nn,m=RI()\r\nl=[[] for i in range(n)]\r\n\r\nfor i in range(n):\r\n l[i]=ls()\r\n\r\nans=[0]*n\r\nfor i in range(n):\r\n for j in range(m):\r\n f=0\r\n for k in range(n):\r\n if(l[k][j]>l[i][j]):\r\n f=1\r\n break\r\n if(f==0):\r\n ans[i]=1\r\n\r\nprint(sum(ans))\r\n", "n,m = [int(i) for i in input().split(\" \")]\r\nsub = []\r\nfor i in range(n):\r\n sub.append(list([int(i) for i in input()]))\r\n \r\narr = [0 for i in range(n)]\r\nfor j in range(m):\r\n maxx = []\r\n for i in range(n):\r\n maxx.append([sub[i][j],i])\r\n mval = max(i[0] for i in maxx)\r\n for i in maxx:\r\n if i[0] == mval:\r\n arr[i[1]]=1\r\nprint(sum(arr))\r\n\r\n # arr.append(maxx)\r\n# print(arr)\r\n # print(\"----\")\r\n \r\n \r\n\r\n", "n,subj=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\ns=set()\r\nfor i in range(subj):\r\n m=0\r\n for j in range(n):\r\n x=l[j]\r\n m=max(m,int(x[i]))\r\n \r\n for j in range(n):\r\n x=l[j]\r\n if m==int(x[i]):\r\n s.add(j+1)\r\n \r\nprint(len(s))\r\n \r\n", "# python 3\n\n\ndef marks(n_val: int, m_val: int, grades: list) -> int:\n successful_students = 0\n subject_highest_scores = []\n for each_subject in range(m_val):\n student_scores = [grades[each_student][each_subject] for each_student in range(n_val)]\n subject_highest_scores.append(max(student_scores))\n for each_student in range(n_val):\n for each_subject in range(m_val):\n if grades[each_student][each_subject] == subject_highest_scores[each_subject]:\n successful_students += 1\n break\n return successful_students\n\n\nif __name__ == \"__main__\":\n \"\"\"\n Inside of this is the test. \n Outside is the API\n \"\"\"\n grade_book = []\n n, m = list(map(int, input().split()))\n for student in range(n):\n subjects = input()\n grade = []\n for each in subjects:\n grade.append(int(each))\n grade_book.append(grade)\n # print(grade_book)\n print(marks(n, m, grade_book))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Marks():\r\n n,m = invr()\r\n\r\n matrix_nm = []\r\n\r\n for student_index in range(n):\r\n string_list = insr()\r\n marks = list(map(int,string_list))\r\n matrix_nm.append(marks)\r\n \r\n successfull_students = []\r\n\r\n for subject_index in range(m):\r\n\r\n subject_wise_marks = [row[subject_index] for row in matrix_nm]\r\n subject_max_score = max(subject_wise_marks)\r\n\r\n for index,student_score in enumerate(subject_wise_marks):\r\n if student_score == subject_max_score:\r\n successfull_students.append(index)\r\n \r\n unique_succesfull_students = len(set(successfull_students))\r\n print(unique_succesfull_students)\r\n return \r\n\r\nMarks()", "n,m = map(int, input().split())\r\nL = []\r\nfor i in range(n):\r\n L.append([int(j) for j in input()])\r\ns = [0]*n\r\nfor i in range(m):\r\n ma = 0\r\n for j in range(n):\r\n ma = max(ma,L[j][i])\r\n for j in range(n):\r\n if L[j][i] == ma:s[j] = 1\r\nprint(sum(s))", "n, m = map(int, input().split())\r\ns = [input() for i in range(n)]\r\n \r\narr = []\r\nfor i in range(m):\r\n lst = []\r\n for j in range(n):\r\n lst.append(int(s[j][i]))\r\n arr.append(lst)\r\n \r\nst = set()\r\nfor i in range(m):\r\n mx = max(arr[i])\r\n for j in range(n):\r\n if(arr[i][j] == mx):\r\n st.add(j)\r\n \r\nprint(len(st))", "n, m = [int(i) for i in input().split()]\r\ns = [input() for _ in range(n)]\r\nmaximum = [max([s[i][j] for i in range(n)]) for j in range(m)]\r\nprint(sum([sum([x == y for x, y in zip(maximum, t)]) > 0 for t in s]))\r\n", "nm = list(map(int, input().strip().split()))\r\nn = nm[0]\r\nm = nm[1]\r\npoint_lst = [0] * n\r\nmarks_tb = []\r\nfor i in range(n):\r\n student = list(map(int, list(input().strip())))\r\n marks_tb.append(student)\r\nfor i in range(m):\r\n col = []\r\n for j in range(n):\r\n col.append(marks_tb[j][i])\r\n col_max = max(col)\r\n for i in range(n):\r\n if col[i] == col_max:\r\n point_lst[i] += 1\r\nprint(n - point_lst.count(0))", "n, m = map(int, input().split())\r\ngradebook = [input() for _ in range(n)]\r\n\r\nsuccessful_students = 0\r\n\r\nfor student_marks in gradebook:\r\n is_successful = False\r\n for subject in range(m):\r\n is_best = True\r\n for other_student_marks in gradebook:\r\n if other_student_marks[subject] > student_marks[subject]:\r\n is_best = False\r\n break\r\n if is_best:\r\n is_successful = True\r\n break\r\n if is_successful:\r\n successful_students += 1\r\n\r\nprint(successful_students)\r\n", "import sys\n\nn, m = map(int, sys.stdin.readline().split())\nis_succ = [False] * n\nscores = [\"\"] * n\n\nfor i in range(n):\n scores[i] = input()\n\nfor i in range(m):\n max_score = 0\n for j in range(n):\n if max_score < int(scores[j][i]):\n max_score = int(scores[j][i])\n for j in range(n):\n if max_score == int(scores[j][i]):\n is_succ[j] = True\n\nans = 0\nfor i in range(n):\n if is_succ[i]:\n ans += 1\n\nprint(ans)\n", "\r\nn_m = input().split()\r\n\r\ngradebook = []\r\nfor i in range (0, int(n_m[0])):\r\n a = input()\r\n gradebook.append(a)\r\n\r\ngradebook_success ={}\r\nfor i in range(0, int(n_m[1])):\r\n max = int(gradebook[0][i])\r\n max_inds = []\r\n for j in range(0, int(n_m[0])):\r\n if(max < int(gradebook[j][i])):\r\n max = int(gradebook[j][i])\r\n max_inds = []\r\n max_inds.append(j)\r\n if (max == int(gradebook[j][i])):\r\n max_inds.append(j)\r\n\r\n gradebook_success[i] = max_inds\r\n\r\npeople_success = []\r\nfor x, y in gradebook_success.items():\r\n for i in y:\r\n people_success.append(i +1)\r\n\r\nprint(len(list(dict.fromkeys(people_success))))", "n, m = input().split()\r\nmarks = [None] * int(n)\r\nfor i in range(int(n)):\r\n marks[i] = input()\r\n\r\nanswer = 0\r\nsubj = []\r\nif n == 1:\r\n print(int(n))\r\nelse:\r\n for i in range(int(n)):\r\n temp_answer = 0\r\n for col in range(int(m)):\r\n flag = 1\r\n for j in range(int(n)):\r\n if int(marks[j][col]) > int(marks[i][col]):\r\n flag = 0\r\n if flag == 1:\r\n temp_answer = 1\r\n if temp_answer == 1:\r\n answer += 1\r\n print(answer)", "n,m=map(int,input().split())\r\na=[input() for i in range(n)]\r\nlst=[0]*n\r\nfor i in range(m):\r\n mx=max([int(a[j][i])for j in range(n)])\r\n for j in range(n):\r\n if int(a[j][i])==mx:\r\n lst[j]=1\r\nprint(lst.count(1))", "n, m = map(int, input().split())\r\ncount = 0\r\nb = [0]*101\r\nc = list()\r\nfor i in range(n):\r\n\ts = input()\r\n\tc.append(s)\r\n\tfor i in range(m):\r\n\t\tif int(s[i])>=b[i]:\r\n\t\t\tb[i]=int(s[i])\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif int(c[i][j])==b[j]:\r\n\t\t\tcount+=1\r\n\t\t\tbreak\r\nprint(count)", "n,m=map(int,input().split())\r\nb=[input()[:m] for _ in range(n)]\r\ny=0\r\nfor t in b:\r\n for p in range(m):\r\n op=[int(b[i][p]) for i in range(n)]\r\n if int(t[p])==max(op):\r\n y+=1\r\n break\r\nprint(y)\r\n", "n,m = map(int,input().split())\ndata = []\nrowData = []\nfor i in range(m):\n data.append([])\nfor i in range(n):\n str = input()\n line = [int(ch) for ch in str]\n rowData.append(line)\n for j in range(m):\n data[j].append(line[j])\nmaxList = []\nfor i in range(m):\n maxList.append(max(data[i]))\nres = 0\nfor i in range(n):\n for j in range(len(rowData[i])):\n if rowData[i][j] == maxList[j]:\n res+=1\n break\nprint(res)\n \n\n", "x = input().split(\" \")\r\nstore = []\r\nfor i in range(int(x[0])):\r\n a = input()\r\n store.append(list(map(int, a)))\r\ncounter = 0\r\nstoreEverything = []\r\njust = dict()\r\nfor i in range(int(x[0])):\r\n just[i] = 0\r\nfor i in range(len(store[0])):\r\n initial = -1\r\n storeNow = set()\r\n for j in range(len(store)):\r\n storeNow.add(int(store[j][i]))\r\n storeEverything.append(max(storeNow))\r\nfor i in range(len(store[0])):\r\n for j in range(len(store)):\r\n if int(store[j][i])==storeEverything[i]:\r\n just[j]+=1 \r\nfor x in just:\r\n if just[x]!=0:\r\n counter+=1\r\nprint(counter)", "n, m = map(int, input().split())\r\nmat = list()\r\nfor i in range(n):\r\n mat.append(list())\r\n s = input()\r\n for j in range(m):\r\n mat[i].append(int(s[j]))\r\nans = set()\r\nfor i in range(m):\r\n temp = -1\r\n for j in range(n):\r\n temp = max(temp, mat[j][i])\r\n for j in range(n):\r\n if mat[j][i] == temp:\r\n ans.add(j)\r\nprint(len(ans))", "a, q = map(int, input().split(' '))\r\ns = []\r\nfor i in range(a):\r\n s.append(list(input()))\r\nw = []\r\nfor i in range(q):\r\n d = []\r\n for j in s:\r\n d.append(int(j[i]))\r\n e = max(d)\r\n for j in range(a):\r\n if d[j] == e:\r\n w.append(j)\r\nprint(len(set(w)))\r\n", "n,m=map(int,input().split(' '))\r\nl=[]\r\nq=[0]*m\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nfor i in l:\r\n cnt=0\r\n for k in i:\r\n t=int(k)\r\n q[cnt]=max(q[cnt],t)\r\n cnt+=1\r\ns=[set()]*(m+1)\r\nqaq=0\r\nfor i in l:\r\n cnt=0\r\n for k in i:\r\n t=int(k)\r\n if q[cnt]==t:\r\n s[cnt].add(qaq)\r\n cnt+=1\r\n qaq+=1\r\nq=set()\r\nfor i in s:\r\n q=q|i\r\n# print(q)\r\nprint(len(q))", "from collections import defaultdict, deque\r\nfrom functools import lru_cache\r\nfrom heapq import heappush, heappop\r\nfrom typing import Counter\r\nimport math\r\nhpop = heappop\r\nhpush = heappush\r\n\"\"\"\r\n num = int(input())\r\n arr = list(map(int, input().split()))\r\n a,b = map(int, input().split())\r\n graph = defaultdict(list)\r\n for i in range(#)\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n MOD = 10**9 + 7\r\n\"\"\"\r\ndef solution():\r\n n,m = map(int, input().split())\r\n grid = []\r\n for _ in range(n):\r\n grid.append(input())\r\n \r\n s = set()\r\n for j in range(m):\r\n m = max([grid[i][j] for i in range(n)])\r\n for i in range(n):\r\n if grid[i][j] == m:\r\n s.add(i)\r\n print(len(s))\r\n\r\n\r\ndef main():\r\n t = 1\r\n #t = int(input())\r\n for _ in range(t):\r\n solution()\r\n \r\nimport sys\r\nimport threading\r\nsys.setrecursionlimit(1 << 30)\r\nthreading.stack_size(1 << 27)\r\nthread = threading.Thread(target=main)\r\nthread.start(); thread.join()\r\n#main()\r\n", "n,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\nl=[]\r\nfor i in range(m):\r\n m=max([x[i] for x in arr])\r\n for j in range(n):\r\n if m==arr[j][i]:\r\n l.append(j)\r\n\r\nprint(len(set(l))) \r\n \r\n ", "n,m=map(int,input().split())\r\na=list()\r\nb=list()\r\nc=list()\r\nfor i in range(n):\r\n a.append([int(i) for i in list(input())])\r\nfor i in range(m):\r\n x=0\r\n for j in range(n):\r\n if(a[j][i]>x):\r\n x=a[j][i]\r\n b=list()\r\n b.append(j)\r\n elif(a[j][i]==x):\r\n b.append(j)\r\n c+=b\r\nprint(len(set(c)))", "n,m=map(int,input().split())\r\na=[]\r\ncount=0\r\nfor i in range(n):\r\n a.append(input())\r\nb=[]\r\nfor i in range(m):\r\n c=[]\r\n for j in a:\r\n c.append(int(j[i]))\r\n r=max(c)\r\n for k in range(n):\r\n if r==c[k] and k+1 not in b:\r\n count+=1\r\n b.append(k+1)\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n b = list(input())\r\n a.append(b)\r\nb = [[a[j][i] for j in range(n)] for i in range(m)]\r\nr = []\r\nfor i in b:\r\n m = max(i)\r\n for j in range(n):\r\n if i[j] == m:\r\n r.append(j)\r\nprint(len(set(r)))\r\n", "n, m = map(int, input().split())\r\nstudents = []\r\nflags = [0]*n\r\nfor _ in range(n):\r\n t = input()\r\n l = [c for c in t]\r\n students.append(l)\r\nfor i in range(m):\r\n best = 0\r\n for j in range(n):\r\n best = max(best, int(students[j][i]))\r\n for j in range(n):\r\n if int(students[j][i]) == best:\r\n flags[j] = 1\r\nprint(sum(flags))", "n, m = [int(i) for i in input().split()]\n\nrows = []\nfor _ in range(n):\n rows.append(input())\n\nstuds = [False for i in range(n)]\n\nfor i in range(m):\n marks = []\n for j in range(n):\n marks.append(int(rows[j][i]))\n m = str(max(marks))\n for j in range(n):\n if m == rows[j][i]:\n studs[j] = True\n\nprint(sum(studs))\n", "n,m=map(int,input().split())\r\nfinal=set()\r\nl={}\r\ncheck=[0]*m\r\nfor i in range(n):\r\n\tl[i]=list(map(int,list(input())))\r\n\tfor j in range(m):\r\n\t\tcheck[j]=max(l[i][j],check[j])\r\nfor i in l:\r\n\tfor j in range(m):\r\n\t\tif check[j]==l[i][j]:\r\n\t\t\tfinal.add(i)\r\n\t\t\tbreak\r\nprint(len(final))", "n, m = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, list(input()))))\r\nz = []\r\nfor x in range(m):\r\n b = []\r\n for y in range(n):\r\n b.append(a[y][x])\r\n z.append(b)\r\nans = []\r\nfor j in range(len(z)):\r\n for k in range(len(z[0])):\r\n if max(z[j]) == z[j][k]:\r\n ans.append(k)\r\nprint(len(dict.fromkeys(ans).keys()))\r\n\r\n", "n, m = map(int, input().split())\r\nmarks = []\r\nfor i in range(n):\r\n temp = list(input())\r\n temp = list(map(int,temp))\r\n marks.append(temp)\r\nsucces = [0] * n\r\nfor j in range(m):\r\n mx = 1\r\n for i in range(n):\r\n if marks[i][j] > mx:\r\n mx = marks[i][j]\r\n for i in range(n):\r\n if marks[i][j] == mx:\r\n succes[i] = 1\r\nprint(sum(succes))", "n, m = map(lambda x: int(x), input().split())\r\nstudents = [input() for s in range(n)]\r\n\r\n\r\nmax_grades = [0 for i in range(m)]\r\ncount = 0\r\nfor i in range(m):\r\n \r\n max_grades[i] = max([int(student[i]) for student in students])\r\nfor student in students:\r\n for grade in range(m):\r\n if int(student[grade]) >= max_grades[grade]:\r\n count += 1\r\n break\r\n\r\nprint(count)\r\n\r\n", "n, m = map(int, input().split())\r\nl = []\r\ntemp = []\r\nma = 0\r\nk = 0\r\nchamp = []\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(m):\r\n d = []\r\n for j in range(n):\r\n d.append(int(l[j][i]))\r\n\r\n ma = max(d)\r\n for j in range(len(d)):\r\n if d[j] == ma:\r\n champ.append(j)\r\n\r\n for j in champ:\r\n if not (j in temp):\r\n k += 1\r\n temp.append(j)\r\nprint(k)", "n, m = map(int, input().split())\nb = m * ['']\ncur_max, cnt = 0, 0\nans = n * [0]\nfor i in range(n):\n x = input()\n for g in range(m):\n b[g] += x[g]\nfor j in range(m):\n for l in range(n):\n if int(b[j][l]) == int(max(b[j])):\n ans[l] = 1\nprint(sum(ans))\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\ns = []\r\nma = [0] * m\r\nfor _ in range(n):\r\n s0 = list(input().rstrip())\r\n for i in range(m):\r\n ma[i] = max(ma[i], s0[i])\r\n s.append(s0)\r\nans = 0\r\nfor i in range(n):\r\n ok = 0\r\n for j, k in zip(ma, s[i]):\r\n if j == k:\r\n ok = 1\r\n break\r\n if ok:\r\n ans += 1\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\r\narr = [input() for i in range(n)]\r\nres = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n for k in range(n):\r\n if i == k:\r\n continue\r\n if arr[i][j] < arr[k][j]:\r\n break\r\n else:\r\n res += 1\r\n break\r\nprint(res)\r\n", "n, m = map(int, input().split())\r\na = []\r\nb = [0] * m\r\nfor i in range(n):\r\n s = input()\r\n a.append(s)\r\n for j in range(m):\r\n if ord(s[j]) > b[j]:\r\n b[j] = ord(s[j])\r\nk = 0\r\nfor i in a:\r\n for j in range(len(i)):\r\n if ord(i[j]) == b[j]:\r\n k += 1\r\n break\r\nprint(k)\r\n", "n,m=map(int,input().split())\r\nS=[]\r\nmod=10**9 + 7\r\nfor _ in range(n):\r\n s=input()\r\n S.append(s)\r\n\r\nans=[0 for _ in range(101)]\r\nfor i in range(m):\r\n maxval=-1 \r\n for j in range(n):\r\n v=int(S[j][i])\r\n if v>maxval:\r\n maxval=v \r\n\r\n for j in range(n):\r\n if int(S[j][i])==maxval:\r\n ans[j]=1\r\n\r\nprint(sum(ans))\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nstudents = []\r\ngrades = [[] for i in range(m)]\r\nstate = [0 for i in range(n)]\r\nfor i in range(n):\r\n\tstudent = input()\r\n\tstudents.append(student)\r\n\tfor j in range(m):\r\n\t\tgrades[j].append((int(student[j])))\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif int(students[i][j]) == max(grades[j]):\r\n\t\t\tstate[i] = 1\r\n\r\nprint(sum(state))\r\n", "def int_arr(n,lista):\r\n if len(str(n))==1:\r\n lista.append(n)\r\n lista.reverse()\r\n return lista\r\n else:\r\n aux1=n%10\r\n aux2=n//10\r\n lista.append(aux1)\r\n return int_arr(aux2,lista)\r\n\r\ndef main():\r\n n,m=input().split()\r\n matriz=[]\r\n arr_ans=[]\r\n for i in range(int(n)):\r\n arr_ans.append(0)\r\n\r\n for i in range(int(n)):\r\n arr=[]\r\n aux=int(input())\r\n arr=int_arr(aux,arr)\r\n matriz.append(arr)\r\n\r\n for i in range(int(m)):\r\n arr=[]\r\n for j in range(int(n)):\r\n arr.append(matriz[j][i])\r\n maxi=max(arr)\r\n for k in range(int(n)):\r\n if arr[k]==maxi:\r\n arr_ans[k]+=1\r\n ans=0\r\n for i in range(int(n)):\r\n if arr_ans[i]!=0:\r\n ans+=1\r\n print(ans)\r\nmain()", "r,c=map(int,input().split())\r\nm=[list(input().strip()) for i in range(r)]\r\nans=0\r\nfor i in range(r):\r\n\tw=0\r\n\tfor j in range(c):\r\n\t\tb=1\r\n\t\tfor k in range(r):\r\n\t\t\tif m[k][j]>m[i][j]:\r\n\t\t\t\tb=0\r\n\t\tif b:\r\n\t\t\tw=1\r\n\tif w:\r\n\t\tans+=1\r\nprint(ans)\r\n\r\n", "N, M = map(int, input().split())\ntable = []\nfor i in range(N):\n table.append(list(map(int, list(input()))))\n\nans = [False for i in range(N)]\nfor m in range(M):\n maxv = -1\n for n in range(N):\n maxv = max(maxv, table[n][m])\n for n in range(N):\n if table[n][m] == maxv:\n ans[n] = True\nansv = sum([1 for a in ans if a])\nprint(ansv)\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n p=list(map(int,list(input())))\r\n l.append(p)\r\n\r\nq=[]\r\nfor i in range(m):\r\n x=[l[k][i] for k in range(n)]\r\n r=max(x)\r\n q.append(r)\r\n\r\nk=0\r\nfor i in range(n):\r\n if any(l[i][j]==q[j] for j in range(m)):\r\n k+=1\r\n\r\nprint(k)", "n, m = map(int, input().split())\r\nexec('a = ' + n * 'input(),')\r\ncounter = []\r\nfor i in zip(*a):\r\n counter.append([j for j, l in enumerate(i) if l == max(i)])\r\nprint(len(set(sum(counter, []))))", "\r\n\r\nn, m = map(int, input().split())\r\nstudents = []\r\nfor i in range(n):\r\n student = [g for g in input()]\r\n students.append(student)\r\n\r\nsuccessful = [False] * n\r\nfor subject in range(m):\r\n best = max([s[subject] for s in students])\r\n for student in range(n):\r\n if students[student][subject] == best:\r\n successful[student] = True\r\n\r\nprint (sum([1 if i else 0 for i in successful]))", "n = [int(j) for j in input().split()]\r\nw = []\r\nl = []\r\nfor k in range(n[0]):\r\n w.append(input())\r\nfor k in range(n[1]):\r\n s = []\r\n for j in range(n[0]):\r\n s.append(int(w[j][k]))\r\n a = max(s)\r\n for j in range(n[0]):\r\n if int(w[j][k]) == a:\r\n l.append(j)\r\nt = set(l)\r\nprint(len(t))", "def main():\r\n n, m = list(map(int, input().split()))\r\n table = [[] for i in range(m)]\r\n for i in range(n):\r\n s = input()\r\n for j in range(m):\r\n table[j].append(int(s[j]))\r\n cnt = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if table[j][i] == max(table[j]):\r\n cnt += 1\r\n break\r\n print(cnt)\r\nif __name__ == \"__main__\":\r\n main()", "n, m = map(int,input().split())\nm_max = [0]*m\nmarksheets = []\nfor i in range(n):\n marks = list(input())\n marksheets.append(marks)\n for j in range(m):\n m_max[j] = max(m_max[j],int(marks[j]))\nans = 0\nfor i in range(n):\n for j in range(m):\n if int(marksheets[i][j])==m_max[j]:\n ans += 1\n break\nprint(ans)\n\n\n", "inp = input().split()\r\nn = int(inp[0])\r\nm = int(inp[1])\r\na = [0]*n\r\ncount = 0\r\nmax = 0\r\nfor i in range(n):\r\n a[i] = input()\r\n\r\ns = [0]*n\r\nch = [0]*n\r\nfor i in range(m):\r\n for j in range(n):\r\n ch[j] = a[j][i]\r\n ch = sorted(ch)\r\n max = ch[n-1]\r\n\r\n for j in range(n):\r\n if a[j][i] == max:\r\n s[j] += 1\r\n\r\nfor i in range(n):\r\n if s[i] > 0:\r\n count += 1\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\ngradebook = []\r\nfor _ in range(n):\r\n gradebook.append(list(map(int, input())))\r\n\r\nbest_subj = set()\r\nfor i in range(m):\r\n max_grade = max(gradebook[j][i] for j in range(n))\r\n for j in range(n):\r\n if gradebook[j][i] == max_grade:\r\n best_subj.add(j)\r\n\r\nprint(len(best_subj))\r\n", "n,ma=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input())))\r\n#print(a)\r\nm=[]\r\n\r\nfor i in zip(*a):\r\n m.append(max(i))\r\n#print(m)\r\nj=0\r\ns=[0]*n\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j]==m[j]:\r\n s[i]=1\r\n break\r\nprint(sum(s))\r\n ", "n,m = map(int,input().split())\r\nd={}\r\nt=[]\r\ncnt=0\r\nfor i in range(n):\r\n s = input()\r\n t.append(s)\r\n d[i]=0\r\nfor i in range(m):\r\n ch=[]\r\n for j in range(n):\r\n ch.append(int(t[j][i]))\r\n ch = sorted(ch)\r\n max=ch[n-1]\r\n for j in range(n):\r\n if int(t[j][i])==max:\r\n d[j]+=1\r\nfor i in range(n):\r\n if d[i]>0:\r\n cnt+=1\r\nprint(cnt)\r\n", "n, m = tuple([int(x) for x in input().split()])\nstudents = []\nfor i in range(n):\n\tstudent = [int(x) for x in input()]\n\tstudents.append(student)\nby_subject = list(zip(*students))\ntop = [max(answer) for answer in by_subject]\ncounter = 0\nfor i in range(n):\n\tfor j in range(m):\n\t\tif(students[i][j] == top[j]):\n\t\t\tcounter += 1\n\t\t\tbreak\nprint(counter)", "n,m=list(map(int,input().split()))\r\nr=[input() for i in range(n)]\r\ntable=[max(i) for i in zip(*r)]\r\n#print(table)\r\nans=sum(any(i[idx] == table[idx] for idx in range(m)) for i in r)\r\nprint(ans)\r\n", "n, m = list(map(int, input().rstrip().split()))\nmarks = []\nmaxm = []\nfor i in range(n):\n marks += [input()]\n\nans = [0] * n\nfor i in range(m):\n maxmi = int(marks[0][i])\n for j in range(n):\n maxmi = max(maxmi, int(marks[j][i]))\n for k in range(n):\n if int(marks[k][i]) == maxmi:\n ans[k] += 1\nsay = 0\nfor x in ans:\n if x > 0:\n say += 1\nprint(say)\n", "students , subject = map(int , input().split()) \r\nmatrix= [[0] * students for i in range(subject) ] \r\nfor i in range(students) : \r\n row = input() \r\n for j in range(subject) : \r\n matrix[j][i] = row[j]\r\nstudentt = [0] * students \r\nfor i in matrix : \r\n mx = max(i) \r\n for j in range(len(i)) : \r\n if i[j] == mx : \r\n studentt[j] += 1\r\nprint(students - studentt.count(0))", "# Get the first line n and m\r\ntemp = input()\r\ntemp = temp.split(\" \")\r\nn = int(temp[0])\r\nm = int(temp[1])\r\n\r\n# Get marks\r\nmarks = []\r\nfor i in range(n):\r\n temp = input()\r\n temp = list(temp)\r\n for j in range(len(temp)):\r\n temp[j] = int(temp[j])\r\n marks.append(temp)\r\n\r\n# print(n,m)\r\n# print(marks)\r\n\r\nsuccessful_students = []\r\nnum_of_successful_students = 0\r\n\r\n# For each subject\r\nfor subject in range(m):\r\n\r\n # Get the max mark obtained for the subject\r\n max_mark = 0\r\n for student in range(n):\r\n if marks[student][subject] >= max_mark:\r\n max_mark = marks[student][subject]\r\n \r\n # Get students who got the max mark in the subject excluding already successful students\r\n for student in range(n):\r\n if student in successful_students:\r\n continue\r\n if marks[student][subject] == max_mark:\r\n num_of_successful_students += 1\r\n successful_students.append(student)\r\n\r\nprint(num_of_successful_students)\r\n", "n, m = map(int, input().split())\r\nsuccess = []\r\ninp = []\r\nlst = [[0 for i in range(n)] for j in range(m)]\r\n\r\nfor _ in range(n):\r\n inp.append(input())\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n lst[i][j] = inp[j][i]\r\n\r\nfor j in lst:\r\n mx = max(j)\r\n for i in range(n):\r\n if j[i] == mx:\r\n success.append(i)\r\n\r\nprint(len(set(success)))\r\n", "n,m = map(int,input().split())\r\nmat = []\r\nfor i in range(n):\r\n row = list(str(input()))\r\n row = [int(i) for i in row]\r\n mat.append(row)\r\ntopper = set()\r\nmat = list(zip(*mat))\r\nr,c = len(mat),len(mat[0])\r\nfor i in range(r):\r\n for j in range(c):\r\n if mat[i][j] == max(mat[i]):\r\n topper.add(j+1)\r\nprint(len(topper))", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n t=list(map(int,input()))\r\n l.append(t)\r\nd={}\r\nfor i in range(m):\r\n n1=[0,0]\r\n for j in range(n):\r\n if l[j][i]>n1[0]:\r\n n1[0]=l[j][i]\r\n n1[1]=[j]\r\n elif l[j][i]==n1[0]:\r\n n1[0]=l[j][i]\r\n n1[1].append(j)\r\n for i in n1[1]:\r\n d[i]=1\r\nprint(len(d))\r\n ", "n, m = map(int, input().split())\r\nlist_students = []\r\nisBest = 0\r\nsubject = []\r\nlist_successful = [0]*n\r\ncount = 0\r\nfor x in range(n):\r\n student = input()\r\n list_students.append(student)\r\n\r\nfor i in range(m):\r\n max = list_students[0][i]\r\n for j in range(n):\r\n if list_students[j][i] > max:\r\n max = list_students[j][i]\r\n for k in range(n):\r\n if list_students[k][i]==max:\r\n list_successful[k]=1\r\n\r\nfor w in list_successful:\r\n if w == 1:\r\n count +=1\r\nprint(count)\r\n\r\n\r\n\r\n", "n,m = map(int, input().split())\ngrades = []\nfor i in range(n):\n grades.append(list(map(int, list(input()))))\n\nbest = []\nfor i in range(m): #3\n max_grade = 0\n cur_best = []\n for j in range(n):\n grade = grades[j][i]\n if grade > max_grade:\n max_grade = grade\n cur_best = []\n cur_best.append(j)\n elif grade == max_grade:\n cur_best.append(j)\n best.extend(cur_best)\n\nprint(len(set(best)))", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n\r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\n x x x\r\n x x x\r\n'''\r\n\r\ndef isPalindrome(a):\r\n l = 0\r\n r = len(a) - 1\r\n while l <= r:\r\n if a[l] != a[r]:\r\n return False\r\n l += 1\r\n r -= 1\r\n return True\r\n\r\ndef solve():\r\n n, m = MII()\r\n ans = [[-1,set()] for _ in range(m)]\r\n for student in range(n):\r\n s = I().strip()\r\n for i,c in enumerate(s):\r\n d = int(c)\r\n if ans[i][0] < d:\r\n ans[i][0] = d\r\n ans[i][1] = set([student])\r\n elif ans[i][0] == d:\r\n ans[i][1].add(student)\r\n \r\n # print(ans)\r\n cnt = set()\r\n for mx,students in ans:\r\n if students:\r\n cnt = cnt.union(students)\r\n print(len(cnt))\r\n\r\nsolve()", "def prog():\r\n n,m = map(int,input().split())\r\n mat = [input() for i in range(n)]\r\n mas = []\r\n for i in range(m):\r\n rez,t = 0,[]\r\n for j in range(n):\r\n if rez<int(mat[j][i]):\r\n rez=int(mat[j][i])\r\n t = [j]\r\n if rez==int(mat[j][i]):\r\n t.append(j)\r\n for i,x in enumerate(t):\r\n if x not in mas:\r\n mas.append(x)\r\n print(len(mas))\r\nprog()\r\n", "def main():\r\n n,m=[int(x) for x in input().split()]\r\n a=[]\r\n for _ in range(n):\r\n a.append(list(input()))\r\n a=list(zip(*a))\r\n ma=max\r\n d={}\r\n for i in range(m):\r\n highest=ma(a[i])\r\n for j in range(n):\r\n if a[i][j]==highest:\r\n d[j]=1\r\n print(len(d.values()))\r\n \r\n \r\nmain()", "n,m=map(int,input().split())\r\nnomarat=[]\r\nfor i in range(n):\r\n nomarat.append(input())\r\nperfect=set()\r\nfor i in range(m):\r\n max=0\r\n momtaz=set()\r\n for j in range(n):\r\n if int(nomarat[j][i])>max:\r\n max=int(nomarat[j][i])\r\n momtaz=set()\r\n if int(nomarat[j][i])==max:\r\n momtaz.add(j)\r\n perfect.update(momtaz)\r\nprint(len(perfect))\r\n", "n, m = [int(j) for j in input().split()]\r\nscores = []\r\nfor j in range(n):\r\n s = str(input())\r\n ref = []\r\n for k in range(m):\r\n ref.append(ord(s[k]) - 48)\r\n scores.append(ref)\r\nbest = n * [0]\r\nfor col in range(m):\r\n max, index = scores[0][col], [0]\r\n for row in range(n):\r\n if max < scores[row][col]:\r\n max, index = scores[row][col], [row]\r\n elif max == scores[row][col]:\r\n index.append(row)\r\n for j in range(len(index)):\r\n best[index[j]] = 1\r\nprint(sum(best))\r\n", "def find_successful_students():\r\n\tstudents, subjects = map(int, input().split())\r\n\r\n\tsubject_marks_input = []\r\n\tfor _ in range(students):\r\n\t\tsubject_marks_input.append([int(mark) for mark in input()])\r\n\r\n\tper_subject_marks = []\r\n\tfor column_values in zip(*subject_marks_input):\r\n\t\tper_subject_marks.append(column_values)\r\n\r\n\tsuccessful_students = set()\r\n\tfor subject_marks in per_subject_marks:\r\n\t\tmax_marks = 0\r\n\t\tsuccessful_student = []\r\n\t\tfor i in range(len(subject_marks)):\r\n\t\t\tif max_marks < subject_marks[i]:\r\n\t\t\t\tmax_marks = subject_marks[i]\r\n\t\t\t\tsuccessful_student = [i]\r\n\t\t\telif max_marks == subject_marks[i]:\r\n\t\t\t\tsuccessful_student.append(i)\r\n\t\t\r\n\t\tsuccessful_students.update(successful_student)\r\n\r\n\tprint(len(successful_students))\r\n\r\n\r\nfind_successful_students()\r\n", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input())))\r\nans=0\r\nfor i in range(n):\r\n good=False\r\n for j in range(m):\r\n z,best=a[i][j],True\r\n for k in range(n):\r\n if a[k][j]>z:\r\n best=False\r\n break\r\n if best:\r\n good=True\r\n break\r\n if good:\r\n ans+=1\r\nprint(ans)\r\n \r\n \r\n \r\n", "n, m = [int(i) for i in input().split()]\r\nstudent = [input() for _ in range(n)]\r\nmaximum = [max([student[i][j] for i in range(n)]) for j in range(m)]\r\nprint(sum([sum([x == y for x, y in zip(maximum, t)]) > 0 for t in student]))", "import sys, os\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\nread = lambda: list(map(int, input().strip().split()))\r\n\r\n\r\n\r\ndef main():\r\n n, m = read(); d = set()\r\n mat = [list(map(int, list(input().strip()))) for i in range(n)]\r\n # print(mat)\r\n for i in range(m):\r\n mx = max([mat[k][i] for k in range(n)])\r\n for j in range(n):\r\n if mat[j][i] == mx:\r\n d.add(j)\r\n print(len(d))\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m=list(map(int,input().split()))\r\nl=[[int(j) for j in input()]for i in range(n)]\r\nMax=[max([l[i][j] for i in range(n)])for j in range(m)]\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n #print(l[i][j],c)\r\n if l[i][j]==Max[j]:\r\n c+=1\r\n break\r\nprint(c)", "n, m = tuple(map(int, input().split()))\n\nrows = []\n\nfor i in range(n):\n rows.append(list(map(int, input()))) \n\nmaximums = []\ncols = []\nfor i in range(len(rows[0])):\n col = [row[i] for row in rows]\n maximums.append(max(col)) \n cols.append(col)\n\nlucky = set() \n\nfor i in range(len(maximums)):\n maximum = maximums[i]\n col = cols[i]\n for i, j in enumerate(col): \n if j == maximum:\n lucky.add(i)\n\nprint(len(lucky))\n", "n, k = map(int, input().split())\n## 2D Trans\nli = [[int(i) for i in input()] for j in range(n)]\nmxs = [0] * n\nfor u in range(k):\n rw = [tr[u] for tr in li]\n d = max(rw)\n for i in range(len(rw)):\n if rw[i] == d:\n mxs[i] = 1\nprint(sum(mxs))\n\n \t\t \t\t \t \t\t \t \t\t \t \t", "def solve(n,k,mat):\n\t\n\tmaxes =[]\n\tfor i in range(k):\n\t\tx=0\n\t\tfor j in range(n):\n\t\t\tx=max(x,mat[j][i])\n\t\tmaxes.append(x)\n\t\n\tc=0\n\tfor i in mat:\n\t\tfor j in range(k):\n\t\t\tif i[j]==maxes[j] :\n\t\t\t\tc+=1\n\t\t\t\tbreak\n\treturn c\n\n\n\n\n\t\t\n\t\n\n\n\nl2=input()\n\nn= int(l2.split()[0])\nk= int(l2.split()[1])\nmat=[]\nfor i in range(n):\n\tx=input()\n\tl=[]\n\tfor j in x :\n\t\tl.append(int(j))\n\tmat.append(l)\n\nprint(solve(n,k,mat) )", "\r\n\r\n\r\nR = lambda:map(int,input().split())\r\n\r\nn, m = R()\r\narr = [input() for i in range(n)]\r\n\r\nans = [0]* n\r\n\r\nfor i in range(m):\r\n mx=max([int(arr[j][i])for j in range(n)])\r\n for j in range(n):\r\n if int(arr[j][i]) == mx:\r\n ans[j] = 1\r\nprint(ans.count(1))\r\n \r\n", "n,m=map(int,input().split())\r\na=[];c=[0]*m;k=0\r\nfor i in range(n):\r\n b=list(map(int,list(input())))\r\n for j in range(m):\r\n if c[j]<b[j]:\r\n c[j]=b[j]\r\n a.append(b)\r\nfor i in range(n):\r\n l=0\r\n for j in range(m):\r\n if a[i][j]==c[j]:\r\n l+=1\r\n if l>0:\r\n k+=1\r\nprint(k)", "'''input\n3 5\n91728\n11828\n11111\n'''\n\nn, m = map(int, input().split())\nmaxMarks = [-1 for i in range(m)]\nstudents = []\nfor _ in range(n):\n\tmarks = [int(i) for i in input()]\n\tfor index, i in enumerate(marks):\n\t\tif maxMarks[index] < i:\n\t\t\tmaxMarks[index] = i\n\n\tstudents.append(marks)\n\nsuccStud = 0\nfor i in students:\n\tfor index, j in enumerate(i):\n\t\tif maxMarks[index] == j:\n\t\t\tsuccStud += 1\n\t\t\tbreak\n\nprint(succStud)\n\n\n\n\n\t\n", "n,m=map(int,input().split())\r\nM=[input() for i in range(n)]\r\nk=0\r\nl=[]\r\nfor i in range(m) :\r\n ma=0\r\n for j in range(n) :\r\n if int(M[j][i])>=ma :\r\n ma=int(M[j][i])\r\n \r\n for j in range(n) :\r\n if int(M[j][i])==ma :\r\n l.append(j)\r\nprint(len(set(l)))\r\n", "n, m = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n a.append(input())\r\nstudents = set()\r\nfor i in range(m):\r\n col = [row[i] for row in a]\r\n target = max(col)\r\n for j in range(n):\r\n if col[j] == target:\r\n students.add(j + 1)\r\nprint(len(students))", "# -*- coding: utf-8 -*-\n\"\"\"Untitled60.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1_5zBpQX0AmGklJanmyzNjYDfVnhJxgIK\n\"\"\"\n\nn,m=map(int,input().split())\nl2=[]\nfor i in range(0,n):\n a=input()\n l1=list(a)\n l1=list(map(int,l1))\n l2.append(l1)\nl6=[]\nl5=[]\nfor j in range(0,m):\n l4=[]\n for k in range(0,n):\n c=l2[k][j]\n l4.append(c)\n l5.append(l4)\nfor x in l5:\n c=max(x)\n for j in range(0,len(x)):\n if x[j]==c:\n l6.append(j)\nl7=[]\nfor x in l6:\n if x not in l7:\n l7.append(x)\nprint(len(l7))", "n,x=map(int,input().split())\r\nse=set()\r\nl=[]\r\nfor i in range(x):\r\n l.append([])\r\nfor i in range(n):\r\n s=input()\r\n for a in range(len(s)):\r\n l[a].append(int(s[a]))\r\nfor i in range(len(l)):\r\n m=max(l[i])\r\n for j in range(len(l[i])):\r\n if l[i][j]==m:\r\n se.add(j)\r\nprint(len(se))", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\nn, m = map(int, input().split())\r\nstudents = [input() for _ in range(n)]\r\ncount = 0\r\ntemp = \"\"\r\nfor i in range(m):\r\n maxx = max(student[i] for student in students)\r\n temp += maxx\r\nfor student in students:\r\n for i in range(m):\r\n if student[i]==temp[i]:\r\n count += 1\r\n break\r\nprint(count)", "z=list(map(int,input().split()))\r\nlst=[[int(j) for j in input()] for i in range(z[0])] \r\n#print(lst)\r\nb=-1\r\nq=[]\r\nfor i in range(z[1]):\r\n b+=1\r\n # print('bbbbbbbbb=',b) \r\n a=max(lst)\r\n # print('a=',a) \r\n for j in lst: \r\n # print('j[i]=%d a[i]=%d'%(j[i],a[i]))\r\n if j[i]==a[i]:\r\n # print('b=',b)\r\n # print('q=',q)\r\n if b not in q:\r\n q.append(b)\r\n #print('q after append',q) \r\n b+=1 \r\n for e in lst:\r\n e[i]=0\r\n # print('lst=',lst)\r\n b=-1\r\n # print('******************',i)\r\nprint(len(q)) \r\n", "n, m = map(int, input().split())\r\n\r\nl = []\r\n\r\nmxl = ['0']*m\r\nind = [-1]*m\r\nfor _ in range(n):\r\n l.append(list(input()))\r\n\r\nfor j in range(m):\r\n for i in range(n):\r\n if ord(mxl[j]) < ord(l[i][j]):\r\n mxl[j] = l[i][j]\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == mxl[j]:\r\n count += 1\r\n break\r\n\r\nprint(count)", "n,m=map(int,input().split())\r\nv=[list(input()) for _ in range(n)]\r\nres=0\r\nb=[False for i in range(n)]\r\nfor j in range(m):\r\n m='0'\r\n for i in range(n):\r\n m=max(m,v[i][j])\r\n for i in range(n):\r\n if v[i][j]==m:\r\n if b[i]==False:\r\n b[i], res=True, res+1\r\nprint(res)", "n,m=map(int,input().split())\r\na=[0]*n\r\nobj=['']*m\r\nfor x in range(n):\r\n k=input()\r\n for x1 in range(m):\r\n obj[x1]+=k[x1]\r\nfor x in range(m):\r\n obj[x]=list(map(int,obj[x]))\r\nfor x in range(m):\r\n for y in range(n):\r\n if obj[x][y]==max(obj[x]) and a[y]==0:\r\n a[y]=1\r\nprint(sum(a))\r\n", "import sys\ninput = sys.stdin.readline\n\nn, m = map(int, input().split())\narr = []\nfor _ in range(n):\n arr.append(input().rstrip())\n\nans = [0]*n\n\nfor i, j in enumerate(zip(*arr)):\n max_ = max(j)\n for k, s in enumerate(arr):\n if s[i] >= max_:\n ans[k] = 1\n\nprint(sum(ans))\n", "'''\r\ncars = 100\r\nspace_in_a_car = 4.0\r\ndrivers = 30\r\npassengers = 90\r\ncars_not_driven = cars - drivers\r\ncars_driven = drivers\r\ncarpool_capacity = cars_driven * space_in_a_car\r\naverage_passengers_per_car = passengers / cars_driven\r\n\r\nprint(\"there are\" + \" \" ,cars , \"cars available\")\r\nprint(\"there are only\" + \" \" ,drivers, \"drivers only\")\r\nprint(\"there will be \" + \" \",cars_not_driven,\"empty cars today\")\r\nprint(\"We can transport\",carpool_capacity,\"people today\")\r\nprint(\"We have\" + \" \" ,passengers, \"to carpool today\")\r\nprint(\"We habe to put about\",average_passengers_per_car, \"in each other\")\r\n'''\r\n\r\nn, m = map(int, input().split())\r\nv = [[0 for j in range(m)] for i in range(n)]\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n v[i][j] = int(s[j])\r\nans = 0\r\nmaxboss = [None] * 1000\r\nfor j in range(m):\r\n maxim = 0\r\n for i in range(n):\r\n maxim = max(maxim, v[i][j])\r\n maxboss[j] = maxim\r\nfor i in range(n):\r\n for j in range(m):\r\n if v[i][j] == maxboss[j]:\r\n ans += 1\r\n break\r\nprint(ans)\r\n", "n, m = map(int, input().split(\" \"))\r\n\r\nls = []\r\nfor x in range(n):\r\n ls.append(input())\r\nhm = []\r\nfor x in range(m):\r\n hm2 = []\r\n for y in range(n):\r\n hm2.append(ls[y][x])\r\n hm.append(max(hm2))\r\nctr = 0\r\nfor x in range(n):\r\n fl = 0\r\n for y in range(m):\r\n if ls[x][y] == hm[y]:\r\n ctr += 1\r\n fl = 1\r\n break\r\nprint(ctr)\r\n", "n, m = [int(x) for x in input().split(' ')]\r\nscores = []\r\nfor i in range(n):\r\n scores.append([int(char) for char in input()])\r\nmaxes = []\r\nfor i in range(m):\r\n maxes.append(max([scores[k][i] for k in range(n)]))\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if scores[i][j] == maxes[j]:\r\n cnt += 1\r\n break\r\n\r\nprint(cnt)\r\n", "n, m = [int(x) for x in input().split()]\r\ninp = list()\r\nbest_student = [0]*n\r\nfor i in range(n):\r\n marks = input()\r\n inp.append(marks)\r\nfor k in range(m):\r\n new = list()\r\n for i in range(n):\r\n new.append(inp[i][k])\r\n maximum = max(new)\r\n for i in range(n):\r\n if new[i] == maximum:\r\n best_student[i] = 1\r\nprint(best_student.count(1))\r\n", "n, m = list(map(int, input().split()))\r\narr = []\r\nfor i in range(n):\r\n k = input()\r\n arr.append(k)\r\n\r\ncount = 0\r\nfor i in range(n):\r\n a = m\r\n for j in range(m):\r\n ch = arr[i][j]\r\n for k in range(n):\r\n ch2 = arr[k][j]\r\n if ch2> ch:\r\n a -= 1\r\n break\r\n if a>0 :\r\n count += 1\r\n\r\nprint(count)\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter, deque\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QIA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return list(input())\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n n, m = IA()\r\n d = defaultdict(list)\r\n succ = set()\r\n for i in range(n):\r\n s = S()\r\n for j in range(m):\r\n d[j].append(int(s[j]))\r\n for k, v in d.items():\r\n ma = max(v)\r\n for i in range(n):\r\n if v[i] == ma and i not in succ:\r\n succ.add(i)\r\n return len(succ)\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n,m=[int(i) for i in input().split()]\r\nlis = []\r\nfin = []\r\nfor i in range(n):\r\n lis.append(input())\r\nnew = []\r\nc=0\r\nfor j in range(m):\r\n new = []\r\n for i in range(n):\r\n new.append(lis[i][j])\r\n max = 0\r\n \r\n for i in range(n):\r\n if int(new[i])>max:\r\n max = int(new[i]) \r\n fin.append(max)\r\nstu = []\r\nfor j in range(m):\r\n for i in range(n):\r\n if int(lis[i][j])==fin[j]:\r\n stu.append(i)\r\nprint(len(set(stu)))\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\r\nhighests = []\r\nstudents_scores = []\r\nfor _ in range(n):\r\n scores = list(input())\r\n scores = list(map(int, scores))\r\n students_scores.append(scores)\r\n for i in range(m):\r\n try:\r\n if highests[i] < scores[i]:\r\n highests[i] = scores[i]\r\n except IndexError:\r\n highests.insert(i, scores[i])\r\n\r\ncounter = 0\r\nfor k in range(n):\r\n for i in range(m):\r\n if students_scores[k][i] == highests[i]:\r\n counter += 1\r\n break\r\n\r\nprint(counter)\r\n\r\n", "n, m = map(int, input().split())\r\ns = [input() for i in range(n)]\r\n\r\nar = []\r\nfor i in range(m):\r\n l = []\r\n for j in range(n):\r\n l.append(int(s[j][i]))\r\n ar.append(l)\r\n\r\nst = set()\r\nfor i in range(m):\r\n x = max(ar[i])\r\n for j in range(n):\r\n if(ar[i][j] == x):\r\n st.add(j)\r\n\r\nprint(len(st))", "\r\ncount = 0\r\nn, m = map(int, input().split())\r\ns = []\r\nfor _ in range(n):\r\n row = []\r\n for c in input():\r\n row.append(int(c))\r\n s.append(row)\r\nfor i in range(n):\r\n wasBest = False\r\n for j in range(m):\r\n isBest = True\r\n for k in range(n):\r\n if s[k][j] > s[i][j]:\r\n isBest = False\r\n if isBest:\r\n wasBest = True\r\n if wasBest:\r\n count += 1\r\nprint(count)\r\n", "n,m = map(int,input().split())\r\nsub = [list() for i in range(m)]\r\nfor i in range(n):\r\n s = list(input())\r\n for j in range(m):\r\n sub[j].append(s[j])\r\nans=0\r\nma = []\r\nfor j in range(m):\r\n ma.append(max(sub[j]))\r\nfor i in range(n):\r\n for j in range(m):\r\n if(sub[j][i]==ma[j]):\r\n ans+=1\r\n break\r\nprint(ans)\r\n", "n,m = list(map(int,input().split(' ')))\r\ns = []\r\nse = set([])\r\na = []\r\nfor i in range(n):\r\n s.append(list(map(int,list(input()))))\r\nfor i in range(m):\r\n se1 = list([])\r\n a = []\r\n for k in range(n):\r\n a.append(s[k][i])\r\n r = max(a)\r\n se1 = [i for i,j in enumerate(a) if j == r]\r\n for j in se1:\r\n se.add(j) \r\nprint(len(se)) ", "n, m = map(int, input().split())\r\ngrades = [list(map(int, input().strip())) for _ in range(n)]\r\nbest_grades = [max([grades[i][j] for i in range(n)]) for j in range(m)]\r\nnum_successful_students = sum([1 for i in range(n) if any([grades[i][j] == best_grades[j] for j in range(m)])])\r\nprint(num_successful_students)\r\n", "n,m = input().split()\r\nn,m = int(n), int(m)\r\nst = set()\r\nlt=[[] for _ in range(m)]\r\n\r\nfor _ in range(n):\r\n s = input()\r\n s = list(s)\r\n for j in range(m):\r\n lt[j].append(s[j])\r\n#print(lt) \r\nfor i in range(len(lt)):\r\n ltt = lt[i]\r\n maxi = max(ltt)\r\n ind =[j for j in range(len(ltt)) if ltt[j]==maxi]\r\n for a in ind:\r\n st.add(a)\r\nprint(len(st))", "n, m = [int(x) for x in input().split()]\r\ncheck = []\r\nmarks = []\r\nfor i in range (n):\r\n check.append(0)\r\n marks.append([int(x) for x in list(input())])\r\nfor j in range (m):\r\n current = []\r\n tmpMax = 0\r\n for i in range (n):\r\n if marks[i][j] > tmpMax:\r\n tmpMax = marks[i][j]\r\n for i in range (n):\r\n if marks[i][j] == tmpMax:\r\n current.append(i)\r\n for k in range (len(current)):\r\n check[current[k]] = 1\r\nres = 0\r\nfor i in range (len(check)):\r\n if check[i] == 1:\r\n res += 1\r\nprint(res)", "info = input().split()\r\nmarks = []\r\nsuccessnum = 0\r\nsuccessful = []\r\nfor i in range(int(info[0])):\r\n marks.append([char for char in input()])\r\n successful.append(False)\r\n\r\ndef maxnum(arr):\r\n maxnum = arr[0]\r\n for i in range(0, len(arr)):\r\n if arr[i] > maxnum:\r\n maxnum = arr[i]\r\n return maxnum\r\n\r\n#print(successful)\r\n\r\nfor j in range(int(info[1])):\r\n lists = []\r\n for k in range(int(info[0])):\r\n lists.append(marks[k][j])\r\n num = maxnum(lists)\r\n #print(lists)\r\n for k in range(int(info[0])):\r\n# print(lists[k])\r\n# print(successful[k])\r\n# print(num)\r\n if lists[k] == num and not successful[k]:\r\n successnum += 1\r\n successful[k] = True\r\n\r\n#print(successful)\r\nprint(successnum)\r\n", "a,b=[int(x) for x in input().split()]\r\nl=[]\r\nl2=[]\r\nl2+=[0]*b\r\nc=0\r\nfor i in range(a):\r\n a=input()\r\n l.append(list(a))\r\n for i in range(b):\r\n if l2[i]<int(a[i]):\r\n l2[i]=int(a[i])\r\nfor k in l:\r\n for j in range(len(k)):\r\n if int(k[j])==l2[j]:\r\n c+=1\r\n break\r\nprint(c)\r\n", "n, m = list(map(int, input().split()))\nsubjects = [0] * m\ngrades = []\n\nfor _ in range(n):\n _grades = []\n for pos, g in enumerate(input()):\n g = int(g)\n subjects[pos] = max(subjects[pos], g)\n _grades.append(g)\n grades.append(_grades)\n\ntotal = 0\nfor i in range(n):\n succ = False\n for pos, grade in enumerate(grades[i]):\n if grade == subjects[pos]:\n succ = True\n break\n if succ:\n total += 1\n\nprint(total)\n", "def maxcoloumn(list,n,y):\r\n list2=[]\r\n for i in range(n):\r\n k=list[i][y]\r\n list2.append(k)\r\n j=max(list2)\r\n return j\r\n\r\nn,m=map(int ,input().split())\r\nlist3=[]\r\nlist4=[]\r\ncount=0\r\nfor g in range(n):\r\n marks=list(map(int ,input())) \r\n list3.append(marks)\r\n \r\nfor x in range(n):\r\n for p in range(m):\r\n if(list3[x][p]==maxcoloumn(list3,n,p)):\r\n list4.append(x)\r\n \r\nmph=set(list4)\r\nprint(len(mph))", "n,m = map(int, input().split())\r\ngrades = []\r\nfor _ in range(n):\r\n grades.append(input())\r\n\r\nranks = []\r\n\r\nfor i in range(m):\r\n highest = 0\r\n position = []\r\n for j in range(n):\r\n if int(grades[j][i]) > highest:\r\n highest = int(grades[j][i])\r\n position.clear()\r\n position.append(j)\r\n elif int(grades[j][i]) == highest:\r\n position.append(j)\r\n else:\r\n pass\r\n for k in position:\r\n ranks.append(k)\r\nprint(len(set(ranks)))", "n, m = map(int, input().split())\r\nar = []\r\nfor i in range(n):\r\n ar.append(list(input()))\r\ns = set()\r\nfor i in range(m):\r\n ma = -1\r\n st = set()\r\n for j in range(n):\r\n if(ma < int(ar[j][i])):\r\n st = set()\r\n st.add(j)\r\n ma = int(ar[j][i])\r\n elif (ma == int(ar[j][i])):\r\n st.add(j)\r\n for i in st:\r\n s.add(i)\r\nprint(len(s))", "n,m = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nans = 0\r\nfor i in range(n):\r\n wasBest = False\r\n for j in range(m):\r\n isBest = True\r\n for k in range(n):\r\n if a[k][j]>a[i][j]:\r\n isBest = False\r\n if isBest:\r\n wasBest = True\r\n if wasBest:\r\n ans+=1\r\nprint(ans)\r\n", "A = input().split()\r\nn,m = int(A[0]), int(A[1])\r\nX = []\r\nresult = []\r\nfor i in range(n):\r\n k = int(input())\r\n l = list(map(int,list(str(k))))\r\n X.append(l)\r\n\r\nfor i in range(m):\r\n k = []\r\n for j in range(n):\r\n k.append(X[j][i])\r\n l = max(k)\r\n for j in range(n):\r\n if X[j][i]==l:\r\n result.append(j)\r\n else:\r\n continue\r\nprint(len(set(result)))\r\n\r\n", "n,m=map(int,input().split(' ',1))\r\narray=[]\r\nfor i in range(n):\r\n x=int(input())\r\n arr=[]\r\n for j in str(x):\r\n arr.append(int(j))\r\n array.append(arr)\r\n\r\nstudent=[0]*n\r\nsubjects=[]\r\n\r\n\r\nfor y in range(m):\r\n subject=[]\r\n for x in range(n):\r\n subject.append(array[x][y])\r\n subjects.append(subject)\r\n\r\n\r\nfor r in subjects:\r\n maxx=max(r)\r\n for z in range(n):\r\n if r[z]==maxx:\r\n student[z]=1\r\nsuccess=0\r\nfor hi in student:\r\n if hi==1:\r\n success+=1\r\nprint(success)\r\n\r\n \r\n\r\n \r\n\r\n ", "n,m=map(int,input().split())\nbest=[[0,set()] for _ in range(m)]\nfor i in range(n):\n for j,grade in enumerate(map(int,list(input()))):\n if grade>best[j][0]:\n best[j][0]=grade\n best[j][1].clear()\n best[j][1].add(i)\n if grade==best[j][0]:best[j][1].add(i)\nd=set()\nfor i in best:d=d.union(i[1])\nprint(len(d))", "n, m = map(int, input().split())\nbest_marks = m * [0]\na = n * [0]\ncnt = 0\nfor i in range(n):\n x = list(map(int, input()))\n a[i] = x\n for j in range(m):\n if x[j] > best_marks[j]:\n best_marks[j] = x[j]\nfor p in range(n):\n for u in range(m):\n if a[p][u] == best_marks[u]:\n cnt += 1\n break\nprint(cnt)\n", "n,m=map(int,input().split())\r\nx=[]\r\nd={}\r\nfor i in range(n):\r\n a=list(input())\r\n x.append(a)\r\nfor i in x:\r\n for j,k in enumerate(i):\r\n d[j]=0\r\nfor i in x:\r\n for j,k in enumerate(i):\r\n d[j]=max(d[j],int(k))\r\nc=0\r\nfor i in x:\r\n for j,k in enumerate(i):\r\n if int(k)==d[j]:\r\n c+=1\r\n break\r\nprint(c)", "from collections import *\r\nimport itertools\r\nimport collections\r\n\r\nN, M = map(int, input().strip().split())\r\nA = [list(map(int, list(input()))) for _ in range(N)]\r\nN = len(A)\r\nM = len(A[0])\r\nans = [0 for _ in range(N)]\r\nfor i in range(M):\r\n mx = 0\r\n for j in range(N):\r\n mx = max(mx, A[j][i])\r\n # print(mx)\r\n for j in range(N):\r\n if A[j][i] == mx:\r\n ans[j] = 1\r\n\r\nprint(sum(i for i in ans))", "nm = list(map(int, input().split()))\r\nstudents = []\r\nmaxes = [0] * nm[1]\r\nfor i in range(nm[0]):\r\n\tstudents.append(list(map(int, input())))\r\n\tfor j in range(nm[1]):\r\n\t\tmaxes[j] = max(maxes[j], students[i][j])\r\nbest = 0\r\nfor i in range(nm[0]):\r\n\tfor j in range(nm[1]):\r\n\t\tif students[i][j] == maxes[j]:\r\n\t\t\tbest += 1\r\n\t\t\tbreak\r\nprint(best)", "vals = [int(b) for b in input().split()]\r\nn = vals[0]\r\nm = vals[1]\r\nmaxScore = [0] * m\r\nstudentsSubjects = []\r\nfor _ in range(n):\r\n subjects = [int(n) for n in input()]\r\n for i in range(m):\r\n if subjects[i] > maxScore[i]:\r\n maxScore[i] = subjects[i]\r\n studentsSubjects.append(subjects)\r\n\r\nresult = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if studentsSubjects[i][j] == maxScore[j]:\r\n result += 1\r\n break\r\nprint(result)", "n,m=map(int,input().split())\nN=[]\nfor i in range(n):\n L=list(input())\n for j in range(m):\n L[j]=int(L[j])\n N.append(L)\nL=[]\nfor k in range(m):\n maxx=0\n J=[]\n for i in range(n):\n if(N[i][k]>maxx):\n maxx=N[i][k]\n J=[i]\n elif(N[i][k]==maxx):\n J+=[i]\n L+=J\nprint(len(set(L)))\n", "n, m = map(int, input().split())\ns = [0] * n\nv = []\nfor i in range(0, n):\n v.append(input())\nfor x in zip(*v):\n m = max(x)\n for i in range(0, n):\n s[i] |= x[i] == m\nprint(sum(s))\n", "n, m = [int(x) for x in input().split()]\r\ncount = 0\r\ngrade_book = []\r\nsorted_book = []\r\nfor i in range(0, n):\r\n temp = input()\r\n grade_book.append(temp)\r\n\r\n\r\ndef get_sorted(book):\r\n for j in range(0, m):\r\n tem = ''\r\n for k in range(0, n):\r\n tem += book[k][j]\r\n sorted_book.append(tem)\r\n\r\n\r\nget_sorted(grade_book)\r\nfor i in range(0, n):\r\n for j in range(0, m):\r\n t = sorted_book[j]\r\n best = max(t)\r\n if grade_book[i][j] >= best:\r\n count += 1\r\n break\r\n\r\n\r\nprint(count)\r\n", "n,m=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nsubject=[]\r\nfor i in range(m):\r\n temp=0\r\n for j in range(n):\r\n if(int(a[j][i])>=int(a[temp][i])):\r\n temp=j\r\n for j in range(n):\r\n if(int(a[temp][i])==int(a[j][i])):\r\n subject.append(j)\r\n\r\nans=set(subject)\r\nprint(len(ans))", "### Codeforces handle - \"@titanalpha\"\r\n#Email id - [email protected]\r\n\r\nfrom collections import Counter, deque\r\nimport math\r\nfrom random import randint\r\nfrom bisect import bisect\r\nimport sys\r\nimport re\r\nimport copy\r\nfrom decimal import Decimal,getcontext\r\ngetcontext().prec = 32\r\n\r\nMOD = 1000000007\r\nMAX = sys.maxsize\r\nMIN = -sys.maxsize\r\nprime = []\r\n\r\nclass get:\r\n def int():\r\n return list(map(int,input().split()))\r\n def str():\r\n return input().split()\r\n def float():\r\n return list(map(float,input().split()))\r\n def map():\r\n return map(int,input().split())\r\n\r\ndef sqrt(x):\r\n return int(math.sqrt(x))+1\r\n\r\ndef gcd(*args):\r\n result = args[0]\r\n for item in args:\r\n result = math.gcd(result,item)\r\n return result\r\n\r\ndef LCM(a,b):\r\n return (a*b)//(math.gcd(a,b))\r\n\r\ndef isPrime(n):\r\n if n == 1:\r\n return False\r\n for i in range(2,sqrt(n)):\r\n if n%i == 0:\r\n return False\r\n return True\r\n\r\ndef solve():\r\n n,m = get.map()\r\n grades = []\r\n for _ in range(n):\r\n grades.append(input())\r\n\r\n ranks = []\r\n\r\n for i in range(m):\r\n highest = 0\r\n position = []\r\n for j in range(n):\r\n if int(grades[j][i]) > highest:\r\n highest = int(grades[j][i])\r\n position.clear()\r\n position.append(j)\r\n elif int(grades[j][i]) == highest:\r\n position.append(j)\r\n else:\r\n pass\r\n for k in position:\r\n ranks.append(k)\r\n print(len(set(ranks)))\r\n \r\n \r\n#for _ in range(int(input())):\r\nsolve()", "n, m = map(int, input().strip().split())\nstudents = []\nsuccessfulStudents = 0\nbestMarks = [0] * m\n\nfor student in range(n):\n newStudent = [int(x) for x in input().strip()]\n students.append(newStudent)\n for i, mark in enumerate(newStudent):\n if mark > bestMarks[i]:\n bestMarks[i] = mark\n\nfor student in students:\n for i, mark in enumerate(student):\n if mark == bestMarks[i]:\n successfulStudents += 1\n break\n\nprint(successfulStudents)\n", "n, m = map(int, input().split())\r\ngrades = []\r\nfor i in range(n):\r\n grades.append(input())\r\nsuccess = set()\r\nfor i in range(m):\r\n maxiMark, maxStu = 0, set()\r\n for j in range(n):\r\n if int(grades[j][i]) > maxiMark:\r\n maxiMark = int(grades[j][i])\r\n maxStu = set()\r\n maxStu.add(j)\r\n elif int(grades[j][i]) == maxiMark:\r\n maxiMark = int(grades[j][i])\r\n maxStu.add(j)\r\n success |= maxStu\r\nprint(len(success))\r\n ", "n, m = [int(x) for x in input().split()]\nmarks = []\nfor _ in range(n):\n new_marks = list(input())\n marks.append(new_marks)\nans = 0\nfor i in range(n):\n successful = 0\n for j in range(m):\n cur_mark = marks[i][j]\n other_marks = [marks[ii][j] > cur_mark for ii in range(n)]\n if sum(other_marks) == 0:\n successful = 1\n ans += successful\nprint(ans)\n\n", "n,m=map(int,input().split())\r\n\r\n\r\ndef col(matrix, i):\r\n return [row[i] for row in matrix]\r\n\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(int,list(input()))))\r\n\r\n\r\ns=set()\r\n\r\n\r\nfor j in range(m):\r\n c=col(l,j)\r\n\r\n m=max(c)\r\n\r\n \r\n\r\n for i in range(n):\r\n if (c[i]==m):\r\n s.add(i)\r\n\r\nprint(len(s))\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n", "# parse = lambda st: map(int, st.split())\n\n# def solve(n, m, grades):\n# res = set()\n# for i in range(m):\n# highest = None\n# best = 0\n# for j in range(n):\n# if grades[j][i] > best:\n# best = grades[j][i]\n# highest = []\n# highest.append(j)\n# elif grades[j][i] == best:\n# highest.append(j)\n# res.update(set(highest))\n# return len(res)\n\n# def solve2(n, m, grades):\n# res = set()\n# subjects = [[grades[j][i] for j in range(n)] for i in range(m)]\n# for grades in subjects:\n# _max = max(grades)\n# for student, grade in enumerate(grades):\n# if grade == _max:\n# res.add(student)\n# return len(res)\n\n\n# main\n# n, m = map(int, input().split())\n# grades = [[int(x) for x in input()] for _ in range(n)]\n# res = set()\n# subjects = [[grades[j][i] for j in range(n)] for i in range(m)]\n# for j in range(m):\n# _max = max([grades[i][j] for i in range(n)])\n# for i in range(n):\n# if grades[i][j] == _max:\n# res.add(i)\n# print(len(res))\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, m = readln()\ndis = list(zip(*tuple([list(input()) for _ in range(n)])))\nbest = [0]*n\nfor j in range(m):\n t = max(dis[j])\n for i in range(n):\n if dis[j][i] == t:\n best[i] = 1\nprint(sum(best))\n", "n,m=map(int,input().split())\r\nmarks=[]\r\nfor i in range(n):\r\n\tmarks.append(input())\r\nmm=[0 for x in range(m)]\r\nfor i in range(m):\r\n\tcurr=0\r\n\tfor j in range(n):\r\n\t\tcurr=int(marks[j][i])\r\n\t\tif(curr>mm[i]):\r\n\t\t\tmm[i]=curr\r\nsuccess=[0 for x in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif(int(marks[i][j])==mm[j]):\r\n\t\t\tsuccess[i]=1\r\n\t\t\tbreak\r\nprint(len(list(filter(lambda x:x==1,success))))", "parse = lambda st: map(int, st.split())\n\ndef solve(n, m, grades):\n res = set()\n for i in range(m):\n highest = None\n best = 0\n for j in range(n):\n if grades[j][i] > best:\n best = grades[j][i]\n highest = []\n highest.append(j)\n elif grades[j][i] == best:\n highest.append(j)\n res.update(set(highest))\n return len(res)\n\ndef solve2(n, m, grades):\n res = set()\n subjects = [[grades[i][j] for j in range[n]] for i in range(m)]\n for grades in subjects:\n _max = max(grades)\n for student, grade in enumerate(grades):\n if grade == _max:\n res.add(student)\n return len(res)\n\nif __name__ == '__main__':\n n, m = parse(input())\n grades = [[int(x) for x in input()] for _ in range(n)]\n res = solve(n, m, grades)\n print(res)\n", "\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nblist=[]\r\n\r\nind=1\r\nclist=[]\r\nfor i in range(n):\r\n a=list(map(int,input()))\r\n blist.append(a)\r\nfor k in range(m):\r\n maxi=-1\r\n for j in range(n):\r\n maxi=max(maxi,blist[j][k])\r\n for j in range(n):\r\n if(blist[j][k]==maxi):\r\n clist.append(j)\r\n \r\n#print(clist)\r\nseti=set(clist)\r\n#print(seti)\r\nprint(len(seti))\r\n", "n, m = [int(x) for x in input().split()]\r\nmatrix = []\r\nsucc = set()\r\n\r\nfor i in range(n):\r\n row = [int(x) for x in input()]\r\n matrix.append(row)\r\n\r\nfor j in range(m):\r\n lst = []\r\n for k in range(n):\r\n lst.append(matrix[k][j])\r\n indices = [i for i, x in enumerate(lst) if x == max(lst)]\r\n succ.update(set(indices))\r\n\r\nprint(len(succ))\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nL={}\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n if(j not in L):\r\n L[j]=[[i],s[j]]\r\n else:\r\n if(L[j][1]<s[j]):\r\n L[j]=[[i],s[j]]\r\n elif(L[j][1]==s[j]):\r\n L[j][0]+=[i]\r\n\r\n\r\nL=[L[x][0] for x in L] \r\nx=[]\r\nfor i in L:\r\n x+=i\r\nprint(len(set(x)))", "n,m = map(int,input().split())\r\nar = [tuple(map(int,list(input()))) for i in range(n)]\r\nx = list(zip(*ar))\r\ncnt = 0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif ar[i][j] == max(x[j]):\r\n\t\t\tcnt+=1\r\n\t\t\tbreak\r\nprint(cnt)", "n,m = map(int,input().split())\r\nll = []\r\nl = [0] * m\r\nfor i in range(n):\r\n ll.append(input().strip())\r\n for j in range(m):\r\n l[j] = max(l[j],int(ll[-1][j]))\r\nans = 0\r\nfor i in ll:\r\n for j in range(m):\r\n if int(i[j]) == l[j]:\r\n ans += 1\r\n break\r\nprint(ans)", "n,m=map(int,input().split())\r\nmarks=[]\r\nfor i in range(m):\r\n marks.append([])\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n marks[j].append(int(s[j]))\r\nb=[]\r\nfor i in range(m):\r\n m1=max(marks[i])\r\n for j in range(n):\r\n if(marks[i][j]==m1):\r\n b.append(j)\r\nprint(len(set(b)))", "if __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n grades = [[int(x) for x in input()] for _ in range(n)]\r\n res = set()\r\n for j in range(m):\r\n _max = max([grades[i][j] for i in range(n)])\r\n for i in range(n):\r\n if grades[i][j] == _max:\r\n res.add(i)\r\n print(len(res))", "a,b=map(int,input().split())\r\nl=[]\r\nfor i in range(a):\r\n\tm=[j for j in input()]\r\n\tl.append(m)\r\np=[]\r\nfor i in range(b):\r\n\tm=l[0][i]\r\n\tfor j in range(1,a):\r\n\t\tif m<l[j][i]:\r\n\t\t\tm=l[j][i]\r\n\tp.append(m)\r\nn=[]\r\nfor i in range(a):\r\n\tn.append(0)\r\nfor i in range(b):\r\n\tfor j in range(a):\r\n\t\tif l[j][i]==p[i]:\r\n\t\t\tn[j]=1\r\nprint(n.count(1))", "parse = lambda st: map(int, st.split())\n\n# main\nn, m = parse(input())\ngrades = [[int(x) for x in input()] for _ in range(n)]\nres = set()\nsubjects = [[grades[j][i] for j in range(n)] for i in range(m)]\nfor grades in subjects:\n _max = max(grades)\n for student, grade in enumerate(grades):\n if grade == _max:\n res.add(student)\nprint(len(res))\n", "n, m = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(input()))\r\nres = set()\r\nfor i in range(m):\r\n temp = []\r\n for j in arr:\r\n temp.append(j[i])\r\n m = max(temp)\r\n for ind, j in enumerate(temp):\r\n if j == m:\r\n res.add(ind+1)\r\n\r\nprint(len(res))\r\n", "n, m = map(int, input().split())\r\ns, t, p = 0, [], ['0'] * m\r\n\r\nfor i in range(n):\r\n t.append(input())\r\n for j in range(m):\r\n p[j] = max(t[i][j], p[j])\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if t[i][j] == p[j]:\r\n s += 1\r\n break\r\nprint(s)\r\n ", "n,m=map(int,input().split())\r\nx=[]\r\nmarks=[0]*m\r\na=[]\r\nfor i in range(n):\r\n s=str(input())\r\n a=list(s)\r\n x.append(a)\r\n \r\nfor i in range(m):\r\n for j in range(n):\r\n # print(x[i][j],end=\" \")\r\n marks[i]=max(marks[i],int(x[j][i]))\r\n# print(marks)\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(int(x[i][j])==marks[j]):\r\n c+=1\r\n break\r\nprint(c)\r\n\r\n", "n,m = map(int, input().split())\r\n\r\nsub = [-1]*(m)\r\nwinner = [[-1]*1]*(m)\r\ncount = 0\r\n# print(winner)\r\nfor i in range(n):\r\n\ttemp = list(input().split())\r\n\t# print(temp)\r\n\tfor j in range(len(temp[0])):\r\n\t\t# print(temp)\r\n\t\t# print('val {}'.format(temp[0][j]))\r\n\t\tif int(temp[0][j]) == sub[j]:\r\n\t\t\twinner[j].append(i)\r\n\r\n\t\telif int(temp[0][j]) > sub[j]:\r\n\t\t\tsub[j] = int(temp[0][j])\r\n\t\t\t# var = winner[j]\r\n\t\t\twinner[j] = [i]\r\n\t\t\t\r\n\t\t\r\n\t# print(sub, winner)\r\ns = set()\r\nfor i in range(len(winner)):\r\n\tfor j in range(len(winner[i])):\r\n\t\ts.add(winner[i][j])\r\nprint(len(s))\r\n\r\n\t\t", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\n\r\ndef main() -> int:\r\n (n, m) = map(int, input().split())\r\n students = [''] * n\r\n max_marks = ['0'] * m\r\n\r\n for i in range(n):\r\n marks = input()\r\n students[i] = marks\r\n\r\n for j in range(m):\r\n if marks[j] > max_marks[j]:\r\n max_marks[j] = marks[j]\r\n\r\n count_successful = 0\r\n\r\n for i in range(n):\r\n is_successful = False\r\n\r\n for j in range(m):\r\n if students[i][j] == max_marks[j]:\r\n is_successful = True\r\n\r\n if is_successful:\r\n count_successful += 1\r\n\r\n print(count_successful)\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "x = list(map(int, input().split()))\r\nsuccessful = 0\r\nsuccess_list = []\r\ngradebook = []\r\nadjusted_gradebook = []\r\n\r\nfor student in range(x[0]):\r\n gradebook.append(input())\r\n\r\nfor i in range(len(gradebook[0])):\r\n for e in range(x[0]):\r\n adjusted_gradebook.append(gradebook[e][i])\r\n adjusted_gradebook.append(\"\".join(adjusted_gradebook[-(x[0]):]))\r\n adjusted_gradebook[i:i + x[0]] = []\r\n\r\nfor i in range(x[0]):\r\n success_list.append(\"Unsuccessful\")\r\n\r\nfor i in range(len(adjusted_gradebook)):\r\n max_ = max(adjusted_gradebook[i])\r\n max_list = []\r\n for index, value in enumerate(adjusted_gradebook[i]):\r\n if value == max_:\r\n max_list.append(index)\r\n\r\n for i in range(len(max_list)):\r\n success_list[int(max_list[i])] = \"Successful\"\r\n\r\nfor i in success_list:\r\n if i == \"Successful\":\r\n successful += 1\r\n\r\nprint(successful)", "#import math\nn, m = input().split()\nn = int (n)\nm = int (m)\n#k = int (k)\n#x = int(input())\n\n#h = list(map(int, input().split()))\n#b = list(map(int, input().split()))\n#c = list(map(int, input().split()))\n\n#x1, y1, x2, y2 =map(int,input().split())\n#n = int(input())\n#f = []\nf = [0]*n\n#t = [0]*n\n#f = [(int(s1[0]),s1[1]), (int(s2[0]),s2[1]), (int(s3[0]), s3[1])]\n#f = sorted (f, key = lambda tup: tup[0] )\n\n#h = [\"\"] * n\n#f1 = sorted(f, key = lambda tup: tup[0])\n\n#f1 = sorted(t, key = lambda tup: tup[0])\nbest = [0]*n\ncu = [0]*n\nfor i in range(n):\n f[i] = int(input())\nfor i in range (m):\n ma = 0\n for j in range (n):\n cu[j] = f[j] % 10\n f[j] = f[j] // 10\n if (ma < cu[j]):\n ma = cu[j]\n for j in range(n):\n if (ma == cu[j]):\n best[j] = 1\nc = 0\n\nfor i in range(n):\n if (best[i] == 1):\n \n c+=1\nprint(c)\n", "n,m=list(map(int,input().split()))\nans=set()\nmarkTable={}\nmaxMarks=[0 for i in range(m)]\nfor i in range(n):\n\tmarkTable[i]=list(map(int,list(input())))\n\tfor j in range(m):\n\t\tmaxMarks[j]=max(markTable[i][j],maxMarks[j])\nfor i in markTable:\n\tfor j in range(m):\n\t\tif maxMarks[j]==markTable[i][j]:\n\t\t\tans.add(i)\n\t\t\tbreak\nprint(len(ans))\n\n\n", "n,m = list(map(int,input().split()))\r\nmk = []\r\nmarks = []\r\nfor _ in range(n):\r\n l = list(map(int,input().split()))\r\n mk.append(str(*l))\r\n\r\n \r\n\r\n\r\ne = []\r\ne1 = []\r\nfor i in range(m):\r\n for j in range(n):\r\n e.append(eval(mk[j][i]))\r\n e1.append(e)\r\n e = []\r\nbest = []\r\nfor i in e1:\r\n m = max(i)\r\n for j in range(len(i)):\r\n if m == i[j]:\r\n \r\n best.append(j)\r\nprint(len(set(best)))\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n", "line = list(map(int,input().split()))\r\nn = line[0]\r\nm = line[1]\r\ns = []\r\nlol = [0] * n\r\ntot = 0\r\nfor i in range(0,n):\r\n line = list(map(int,list(input())))\r\n s.append(line)\r\nif n == 1:\r\n print(1)\r\nelse:\r\n for i in range(0,m):\r\n step = [0]\r\n ma = s[0][i]\r\n for j in range(1,n):\r\n if(s[j][i] == ma):\r\n step.append(j)\r\n elif(s[j][i] > ma):\r\n step = []\r\n step.append(j)\r\n ma = s[j][i]\r\n else:\r\n continue\r\n for j in step:\r\n lol[j] = 1\r\n for j in lol:\r\n if j == 1:\r\n tot = tot + 1\r\n print(tot)\r\n \r\n \r\n ", "inputLine = input().split()\r\nn = int(inputLine[0])\r\nm = int(inputLine[1])\r\nmaxArray = [0]*m\r\nmaxStudentList = [[]]*m\r\nfor student in range(n):\r\n grades = list(input())\r\n for subject in range(len(grades)):\r\n grades[subject] = int(grades[subject])\r\n if grades[subject] > maxArray[subject]:\r\n maxArray[subject] = grades[subject]\r\n maxStudentList[subject] = [student]\r\n elif grades[subject] == maxArray[subject]:\r\n maxStudentList[subject].append(student)\r\nsuccesfulStudents = set()\r\nfor someList in maxStudentList:\r\n for student in someList:\r\n succesfulStudents.add(student)\r\nprint(len(succesfulStudents))", "\r\n\r\ndef main():\r\n n,m = [int(v) for v in input().split()]\r\n marks = []\r\n for i in range(n):\r\n data = [int(v) for v in input()]\r\n marks.append(data)\r\n sucs = set()\r\n for i in range(m):\r\n vals = [marks[j][i] for j in range(n)]\r\n mxs = max(vals)\r\n l = [(i,v) for i,v in enumerate(vals) if v==mxs]\r\n for k,v in l:\r\n sucs.add(k)\r\n print(len(sucs))\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\n\r\nwas_best = [ False ] * n\r\n\r\ndata = [input() for _ in range(n)]\r\n\r\nfor j in range(m):\r\n bv = -1\r\n bi = set()\r\n for i in range(n):\r\n v = int(data[i][j])\r\n if v > bv:\r\n bv = v\r\n bi = set([i])\r\n elif v == bv:\r\n bi.add(i)\r\n for i in bi:\r\n was_best[i] = True\r\n\r\nprint(sum(was_best))\r\n", "n, m = map(int, input().split())\r\nmarks = [[int(x) for x in input()] for _ in range(n)]\r\nsuccessful_students = 0\r\nfor i in range(n):\r\n is_successful = False\r\n for j in range(m):\r\n highest_mark = True\r\n for k in range(n):\r\n if k != i and marks[k][j] > marks[i][j]:\r\n highest_mark = False\r\n break\r\n if highest_mark:\r\n is_successful = True\r\n break\r\n if is_successful:\r\n successful_students += 1\r\nprint(successful_students)\r\n", "from sys import stdin,stdout\r\n\r\nst=lambda:list(stdin.readline().strip())\r\nli=lambda:list(map(int,stdin.readline().split()))\r\nmp=lambda:map(int,stdin.readline().split())\r\ninp=lambda:int(stdin.readline())\r\npr=lambda n: stdout.write(str(n)+\"\\n\")\r\n\r\nmod=1000000007\r\nINF= float('inf')\r\ndef solve():\r\n n,m=mp()\r\n mat = []\r\n for i in range(n):\r\n mat.append(list(input()))\r\n \r\n maximum = []\r\n for i in range(m):\r\n maxi = -INF \r\n for j in range(n):\r\n maxi = max(maxi, int(mat[j][i]))\r\n maximum.append(maxi)\r\n \r\n suc = 0\r\n for i in range(n):\r\n flag = 0\r\n for j in range(m):\r\n if int(mat[i][j])==maximum[j]:\r\n flag = 1\r\n break\r\n if flag==1:\r\n suc+=1\r\n print(suc)\r\nfor _ in range(1):\r\n solve()\r\n", "l = []\r\nn, m = map(int, input().split())\r\ng = [0]*n\r\nfor _ in range(n):\r\n l.append([int(x) for x in input()])\r\n\r\nfor i in range(m):\r\n c = []\r\n for j in range(n):\r\n c.append(l[j][i])\r\n\r\n mx = max(c)\r\n for k in range(n):\r\n if l[k][i] == mx:\r\n g[k] += 1\r\n\r\nprint(n-g.count(0))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Jan 17 18:36:43 2018\n\n@author: brandtsmith\n\"\"\"\nimport re\n\nfirst = input()\nnum_students, num_subjects = first.split(' ')\n\nmarks = []\nsub_marks = [[] for x in range(int(num_subjects))]\n\nfor i in range(int(num_students)):\n string = input()\n marks.append([int(k) for k in string])\n\nsucc_set = set()\n\nfor m in range(int(num_subjects)):\n for n in range(int(num_students)):\n sub_marks[m].append(marks[n][m])\n \nfor item in sub_marks:\n max_value = max(item)\n indices = [i for i, x in enumerate(item) if x == max_value]\n\n for i in indices:\n succ_set.add(i)\n\nprint(len(succ_set))\n \n \n\n \n \n \n", "n, m = (int(x) for x in input().split())\r\ni = 0\r\nstudents = []\r\nwhile i < n:\r\n\tstudents.append([int(x) for x in input()])\r\n\ti += 1\r\nj = 0\r\nbest_student = set()\r\nwhile j < m:\r\n\ti = 0\r\n\tcurr_best_list = []\r\n\tcurr_best_score = 0\r\n\twhile i < n:\r\n\t\tif students[i][j] > curr_best_score:\r\n\t\t\tcurr_best_score = students[i][j]\r\n\t\t\tcurr_best_list = []\r\n\t\t\tcurr_best_list.append(i)\r\n\t\telif students[i][j] == curr_best_score:\r\n\t\t\tcurr_best_list.append(i)\r\n\t\ti += 1\r\n\t\r\n\tfor el in curr_best_list:\r\n\t\tbest_student.add(el)\r\n\t\r\n\tif len(best_student) == n:\r\n\t\tbreak\r\n\tj += 1\r\n\r\nprint(len(best_student))", "n,m = [int(e) for e in input().split()]\r\n\r\ngrade = [[] for e in range(m)]\r\n\r\nstudents = []\r\n\r\nfor i in range(n):\r\n score = input().strip()\r\n students.append(score)\r\n for j in range(m):\r\n grade[j].append(int(score[j]))\r\n\r\nout = 0\r\nfor j in range(n):#stud\r\n b = False\r\n for i in range(m):#subj\r\n if (int(students[j][i]) == max(grade[i])):\r\n b = True\r\n if b: out+=1\r\n\r\nprint(out)\r\n", "# coding: utf-8\nn, m = [int(i) for i in input().split()]\nstu = []\nfor i in range(n):\n stu.append([int(ch) for ch in input()])\nbest = []\nfor i in range(m):\n best.append(max([stu[j][i] for j in range(n)]))\nans = 0\nfor i in range(n):\n for j in range(m):\n if stu[i][j] == best[j]:\n ans += 1\n break\nprint(ans)\n", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nsel = [0] * n\r\nfor j in range(m):\r\n mx = '1'\r\n for i in range(n):\r\n if a[i][j] > mx:\r\n mx = a[i][j]\r\n for i in range(n):\r\n if a[i][j] == mx:\r\n sel[i] = 1\r\nprint(sum(sel))", "n,m=list(map(int, input(\"\").split()))\r\nl=[]\r\nr=[]\r\nmax1=[]\r\ncount=0\r\nfor i in range(n):\r\n ar1=list(str(input(\"\")))\r\n l.append(ar1)\r\n\r\nr=zip(*l)\r\nfor i in r:\r\n max1.append(max(i))\r\n \r\nfor i in l:\r\n ct=0\r\n for j in range(m):\r\n if(i[j]==max1[j]):\r\n ct=1\r\n if(ct==1):\r\n count=count+1\r\n \r\nprint(count)", "from itertools import count\r\nn, m = map(int, input().split())\r\nss = []\r\nmat = []\r\nfor _ in range(n):\r\n mat.append(input())\r\nfor i in range(m):\r\n maxl = max([int(x[i]) for x in mat])\r\n for j in range(n):\r\n if (int(mat[j][i]) == maxl) and not (j in ss):\r\n ss.append(j)\r\nprint(len(ss))\r\n", "n, m = map(int, input().split())\r\n\r\nmax_ = [0] * m\r\nnums = []\r\nfor _ in range(n):\r\n nums.append(list(map(int, list(input()))))\r\n for i, j in enumerate(nums[-1]):\r\n max_[i] = max(max_[i], j)\r\n\r\ncount = 0\r\nfor i in nums:\r\n if any(k == max_[j] for j, k in enumerate(i)):\r\n count += 1\r\n\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\nx=[]\r\nfor i in range(n):\r\n\ta=list(map(int,list(input())))\r\n\tx.append(a)\r\nb=[]\r\nfor i in range(m):\r\n\tz=[]\r\n\tfor j in range(n):\r\n\t\ty=x[j][i]\r\n\t\tz.append(y)\r\n\tfor p in range(len(z)):\r\n\t\tif z[p]==max(z):\r\n\t\t\tb.append(p)\r\nprint(len(set(b)))", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n p=list(s)\r\n l.append(p)\r\nr=set()\r\nfor i in range(m):\r\n u=[]\r\n for j in range(n):\r\n u.append(int(l[j][i]))\r\n k=max(u)\r\n for j in range(n):\r\n if(u[j]==k):\r\n r.add(j)\r\nprint(len(r))", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tl+=[list(map(int,input()))]\r\nans=0\r\nmx=[]\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tans=max(ans,l[j][i])\r\n\tmx.append(ans)\r\n\tans=0\r\nc=0\r\nf=[0]*n\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tif mx[c]==l[j][i]:\r\n\t\t\tf[j]=1\r\n\tc+=1\r\nprint(sum(f))", "n, m = map(int, input().split())\r\nM = []\r\nfor _ in range(n):\r\n M.append(list(input()))\r\nC = [0 for _ in range(n)]\r\nfor i in range(m):\r\n a = []\r\n for j in range(n):\r\n a.append(M[j][i])\r\n for k in range(n):\r\n if M[k][i] == max(a):\r\n C[k] = 1\r\nprint(C.count(1))\r\n", "n, m = map(int, input().split())\r\nli = [[] for i in range(m)]\r\nfor i in range(n):\r\n t = list(map(int, list(input())))\r\n for idx, j in enumerate(t):\r\n li[idx].append(j)\r\n# print(li)\r\ns = set()\r\nfor i in range(m):\r\n mm = max(li[i])\r\n for j in range(n):\r\n if li[i][j] == mm:\r\n s.add(j)\r\n \r\n \r\nprint(len(s))", "N, M = map(int, input().split())\r\n\r\nA= []\r\n\r\nfor n in range(N):\r\n A+= [list(map(int, list(input())))]\r\ngr = [0] * M\r\nfor m in range(M):\r\n for n in range(N):\r\n gr[m] = max(gr[m], A[n][m])\r\n \r\nans = 0\r\n\r\nfor r in A:\r\n for i, g in enumerate(r):\r\n if g == gr[i]:\r\n ans += 1\r\n break\r\nprint(ans) ", "n,m = map(int,input().split())\r\nscs = [[] for _ in range(m)]\r\nfor _ in range(n):\r\n s = input()\r\n for i,c in enumerate(s):\r\n scs[i].append(c)\r\n\r\nsts = set()\r\nfor ss in scs:\r\n ms = max(ss)\r\n for i,c in enumerate(ss):\r\n if c==ms:\r\n sts.add(i)\r\nprint(len(sts))", "n,m=map(int,input().split())\r\na=[[]]*n\r\nc=[]\r\nfor i in range(n):\r\n a[i]=list(map(int,str(input())))\r\nfor i in range(m):\r\n ma=a[0][i]\r\n k=0\r\n for j in range(n):\r\n if ma<a[j][i]:\r\n ma=a[j][i]\r\n for j in range(n):\r\n if ma==a[j][i]:\r\n c.append(j)\r\nprint(len(set(c)))\r\n", "n, m = map(int, input().split())\r\nl = []\r\n\r\nfor i in range(n):\r\n s = list(map(int, input()))\r\n l.append(s)\r\nres = set() \r\n\r\nfor a in zip(*l):\r\n aux = max(a)\r\n for i in range(len(a)):\r\n if a[i] == aux: \r\n res.add(i)\r\nprint(len(res))\r\n ", "n,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n\tarr.append([])\r\nfor i in range(n):\r\n\ts=input().strip()\r\n\tfor j in s:\r\n\t\tarr[i].append([int(j),i])\r\n# print(arr)\r\nss=set()\r\nfor i in range(m):\r\n\tl=[]\r\n\tfor j in range(n):\r\n\t\tl.append(arr[j][i])\r\n\tl=sorted(l,key=lambda item:item[0],reverse=True)\r\n\txx=l[0][0]\r\n\tss.add(l[0][1])\r\n\tfor j in range(1,len(l)):\r\n\t\tif xx==l[j][0]:\r\n\t\t\tss.add(l[j][1])\r\n\t\telse:\r\n\t\t\tbreak\r\nprint(len(ss))", "n,m=map(int,input().split())\r\ntot=0\r\narr=[input() for _ in range(n)]\r\nmx=[]\r\nfor i in zip(*arr):\r\n mx.append(max([int(j) for j in i]))\r\nfor i in range(n):\r\n for j in range(m):\r\n if int(arr[i][j])==mx[j]:\r\n tot+=1\r\n break\r\nprint(tot)", "\r\ncount = 0\r\nn, m = map(int, input().split())\r\ns = [input() for i in range(n)]\r\nt = [max(i) for i in zip(*s)]\r\nfor row in s:\r\n isBest = False\r\n for i in range(m):\r\n if t[i] == row[i]:\r\n if not isBest:\r\n isBest = True\r\n count += 1\r\nprint(count)\r\n \r\n \r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor x in range(n):\r\n\tl.append(input())\r\nz=[]\r\nfor x in range(m):\r\n\tw=[]\r\n\tfor y in range(n):\r\n\t\tw.append(l[y][x])\r\n\tz.append(w)\r\nd=[]\r\nfor i in range(m):\r\n\ta=max(z[i])\r\n\tfor j in range(n):\r\n\t\tif z[i][j]>=a:\r\n\t\t\td.append(j)\r\nprint(len(set(d)))", "n,m = input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nk=[]\r\ns=[]\r\nfor i in range(n):\r\n l.append(0)\r\nfor i in range(n):\r\n l[i]=list(input())\r\n for j in range(m):\r\n s.append(int(l[i][j]))\r\n k.append(s)\r\n s=[]\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nfor i in range(m):\r\n for j in range(n):\r\n l1.append(k[j][i])\r\n l2.append(l1)\r\n l1=[]\r\nfor i in range(m):\r\n l3.append(max(l2[i]))\r\nr=0\r\np=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if l3[j]==k[i][j]:\r\n r+=1\r\n if r>0:\r\n p+=1\r\n r=0\r\n\r\nprint(p)\r\n", "\r\nn,m=map(int,input().split())\r\nx=[]\r\nfor i in range(n):\r\n x.append(input())\r\nmx=[]\r\nfor i in range(m):\r\n mx.append(max([ x[j][i] for j in range(n) ]))\r\n \r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if mx[j]==x[i][j]:\r\n ans+=1\r\n break\r\nprint(ans) ", "def question1():\r\n student,grades = map(int,input().split())\r\n success = [0 for i in range(student)]\r\n max1 = [0 for i in range(grades)]\r\n G = []\r\n for i in range(student):\r\n g1 = input()\r\n G.append(g1)\r\n for j in range(grades):\r\n max1[j] = max(max1[j],int(g1[j]))\r\n # print(max1) \r\n count = 0 \r\n for i in range(student):\r\n for j in range(grades):\r\n if int(G[i][j]) == max1[j]:\r\n success[i] = 1 \r\n return sum(success) \r\n \r\n \r\n \r\n \r\n \r\n# remained_test_case = int(input())\r\nremained_test_case = 1\r\nwhile remained_test_case > 0:\r\n print(question1())\r\n remained_test_case -= 1 ", "(n, m) = map(int, input().split(' '))\n\ngrid = []\n\nfor i in range(n):\n grid.append(list(int(x) for x in input()))\n\nbest = set()\n\nma = [0 for j in range(m)]\n\nfor j in range(m):\n for i in range(n):\n ma[j] = max(grid[i][j], ma[j])\n\nfor j in range(m):\n for i in range(n):\n if grid[i][j] == ma[j]:\n best.add(i)\n\nprint(len(best))\n", "students, lessons = list(map(int, input().split()))\r\ngood_students = []\r\nmarks_all = []\r\nhighest_mark = -1\r\nfor i in range(students):\r\n marks = list(map(int, list(input())))\r\n marks_all.append(marks)\r\nfor i in range(lessons):\r\n for k in range(students):\r\n highest_mark = max(highest_mark, marks_all[k][i])\r\n for z in range(students):\r\n if marks_all[z][i] == highest_mark:\r\n good_students.append(z + 1)\r\n highest_mark = -1\r\nprint(len(set(good_students)))\r\n", "# https://codeforces.com/contest/152/problem/A\r\n\r\nn, m = [int(i) for i in input().split()]\r\nrecords = []\r\n\r\nfor i in range(0, n):\r\n c = input()\r\n records.append(c)\r\n\r\nsuccess = 0\r\n\r\nfor i in range(0, n):\r\n for j in range(0, m):\r\n l = [records[a][j] for a in range(0, n)]\r\n if records[i][j] == max(l): \r\n success += 1\r\n break\r\n\r\nprint(success)", "from sys import stdin\r\nn,m=map(int,stdin.readline().split())\r\nl=[]\r\nfor i in range(n):\r\n s=stdin.readline().rstrip()\r\n l.append(s)\r\np=[]\r\nfor i in range(m):\r\n k=[]\r\n for j in range(n):\r\n k.append(l[j][i])\r\n ma=max(k)\r\n for j in range(n):\r\n if l[j][i]==ma:\r\n if j+1 not in p:\r\n p.append(j+1)\r\nprint(len(p))", "a=[]\r\na=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\na=[]\r\nfor i in range(0,n):\r\n a.append(input())\r\n\r\nx=[]\r\nfor i in range(0,m): # for subjects\r\n c=a[0][i]\r\n flag=0\r\n for j in range(0,n): #for students\r\n if c<a[j][i]:\r\n c=a[j][i]\r\n for k in range(0,n): #for students\r\n if c==a[k][i]:\r\n x.append(k)\r\ns=[]\r\nfor i in x:\r\n if i not in s:\r\n s.append(i)\r\n\r\nprint(len(s))\r\n", "import itertools\r\nimport math\r\nimport random\r\n\r\nimport time\r\ndef timer(f):\r\n def tmp(*args, **kwargs):\r\n t = time.time()\r\n res = f(*args, **kwargs)\r\n print(\"Время выполнения функции: %f\" % (time.time()-t))\r\n return res\r\n\r\n return tmp\r\n\r\ndef genArray(length, lower, upper):\r\n return [random.randint(lower, upper) for i in range(length)]\r\n\r\n#print(genArray(5, 4, 9))\r\n\r\n\r\nn, m = map(int, input().split(' '))\r\narray = [input() for i in range(n)]\r\n\r\n\r\n\r\ntotal = 0\r\nfor i in range(n):\r\n isNorm = False\r\n for j in range(m):\r\n isBest = True\r\n for k in range(n):\r\n if int(array[k][j]) > int(array[i][j]):\r\n isBest = False\r\n if isBest:\r\n isNorm = True\r\n if isNorm:\r\n total+=1\r\nprint(total)", "n,m=map(int,input().split())\r\na=[]\r\ns=[]\r\nfor i in range(n):\r\n\ta.append(input())\r\nfor i in range(m):\r\n\tma=0\r\n\tfor j in range(n):\r\n\t\tma=max(ma,int(a[j][i]))\r\n\tfor j in range(n):\r\n\t\tif int(a[j][i])==ma:\r\n\t\t\ts.append(j)\r\nprint(len(set(s)))", "def main():\r\n\r\n def solve(n, m, a):\r\n s = [False for _ in range(n)]\r\n for col in range(m):\r\n t = []\r\n mx = '0'\r\n for row in range(n):\r\n c = a[row][col]\r\n if c > mx:\r\n t = [row]\r\n mx = c\r\n elif c == mx:\r\n t.append(row)\r\n for st in t:\r\n s[st] = True\r\n ret = sum(s)\r\n return ret\r\n\r\n n, m = [int(x) for x in input().split()]\r\n a = []\r\n\r\n for _ in range(n):\r\n a.append(input())\r\n\r\n print(solve(n, m, a))\r\n\r\nif __name__ == \"__main__\":\r\n import sys, threading\r\n input = sys.stdin.readline\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n thread.join()", "n, m = tuple(map(int, input().split()))\r\nmark_lst_stud = []\r\nfor i in range(n):\r\n s = input()\r\n mark_lst_stud.append(s)\r\n\r\nmark_lst_sub = []\r\nfor i in range(m):\r\n lst = []\r\n for j in mark_lst_stud:\r\n lst.append(j[i])\r\n mark_lst_sub.append(lst)\r\n\r\nbest_lst = []\r\nfor i in mark_lst_sub:\r\n x=max(i)\r\n for j in range(len(i)):\r\n if i[j] == x:\r\n best_lst.append(j)\r\nprint(len(set(best_lst)))", "n, m = list(map(int, input().split()))\nmarks = [list(map(int, list(input()))) for _ in range(n)]\nsucc = [0] * n\nfor i in range(m):\n M = max([marks[row][i] for row in range(n)])\n for j in range(n):\n if marks[j][i] == M:\n succ[j] = 1\nprint(sum(succ))\n", "n,m=map(int,input().split())\r\nM=[]\r\nfor i in range(n):\r\n M.append(input())\r\n\r\nS=[0]*n\r\n\r\nfor i in range(m):\r\n Max=[]\r\n maxx='0'\r\n for j in range(n):\r\n if(M[j][i]>maxx):\r\n maxx=M[j][i]\r\n Max=[j]\r\n elif(M[j][i]==maxx):\r\n Max.append(j)\r\n for item in Max:\r\n S[item]=1\r\nprint(sum(S))\r\n", "def marks(n,m,array):\r\n temp=[]\r\n for col in range(m):\r\n max_marks=0\r\n for row in range(n):\r\n if array[row][col]>=max_marks:\r\n max_marks=array[row][col]\r\n for row in range(n):\r\n if array[row][col]==max_marks and row not in temp:\r\n temp.append(row)\r\n print(len(temp))\r\nn,m=input().split()\r\narray=[]\r\nfor i in range(int(n)):\r\n a=[]\r\n for j in input():\r\n a.append(int(j))\r\n array.append(a) \r\nmarks(int(n),int(m),array)\r\n", "x = input()\r\nstud = int(x.split()[0])\r\npredmet = int(x.split()[1])\r\nlol = list()\r\nfor i in range(stud):\r\n lol.append(input())\r\nspisok = list()\r\nfor i in range(predmet):\r\n luchshyi = []\r\n luchshyi_string = []\r\n for j in range(stud):\r\n luchshyi.append(int(lol[j][i]))\r\n luchshyi_string.append(lol[j][i])\r\n if luchshyi_string.count(str(max(luchshyi))) == 1:\r\n spisok.append(luchshyi.index(max(luchshyi)))\r\n else:\r\n for k in range(luchshyi_string.count(str(max(luchshyi)))):\r\n spisok.append(luchshyi.index(max(luchshyi)))\r\n luchshyi[spisok[-1]] = 0\r\n\r\npr = set()\r\nfor i in spisok:\r\n pr.add(i)\r\n\r\nprint(len(pr))", "n, m = [int(x) for x in input().split()]\r\nl = []\r\nl1 = []\r\nl2 = []\r\ny = 1\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(m):\r\n l1.append([l[j][i] for j in range(n)])\r\nl.clear()\r\nfor i in l1:\r\n for j in i:\r\n if j == max(i):\r\n l.append(y) \r\n y += 1\r\n y = 1\r\nfor i in l:\r\n if i not in l2:\r\n l2.append(i)\r\nprint(len(l2))\r\n", "n, m = map(int, input().split())\r\nl = [input() for i in range(n)]\r\nt = [max(i) for i in zip(*l)]\r\nprint(sum(any(t[i] == a[i] for i in range(m)) for a in l))", "temp = [int(x) for x in input().split()]\r\nn = temp[0]\r\nm = temp[1]\r\ng = []\r\nfor i in range(n):\r\n g.append([int(x) for x in list(input().strip())])\r\nmax = []\r\nfor j in range(m):\r\n largest = 0\r\n for i in range(n):\r\n if g[i][j] > largest:\r\n largest = g[i][j]\r\n max.append(largest)\r\nresult = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == max[j]:\r\n result += 1\r\n break\r\nprint(result)\r\n", "import sys\r\nfrom os import path\r\nfrom math import gcd,floor,sqrt,log,ceil\r\nfrom bisect import bisect_left, bisect_right\r\nimport heapq\r\n\r\n############ ---- Input Functions ---- ####################\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\ndef inmatrix(n,m):\r\n arr=[]\r\n for i in range(n):\r\n temp=inlt()\r\n arr.append(temp)\r\n return arr\r\n############################################################\r\ndef cuberoot(x):\r\n if 0<=x: return x**(1./2.)\r\n return -(-x)**(1./2.)\r\ndef is_anagram(str1, str2):\r\n return sorted(str1) == sorted(str2)\r\n############################################################\r\nmod=1000000007\r\n############################################################\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n sys.stderr = open(\"error.txt\", \"w\")\r\nelse:\r\n input = sys.stdin.readline\r\n############################################################\r\ndef solve():\r\n n,m=invr()\r\n score=[]\r\n c=0\r\n max_score=[0 for i in range(m)]\r\n for i in range(n):\r\n temp=list(input().strip())\r\n score.append(temp)\r\n for i in range(m):\r\n for j in range(n):\r\n max_score[i]=max(max_score[i],int(score[j][i]))\r\n for i in range(n):\r\n for j in range(m):\r\n if max_score[j]==int(score[i][j]):\r\n c+=1\r\n break\r\n print(c)\r\n\r\ndef main():\r\n # T=inp()\r\n T=1\r\n for i in range(1,T+1):\r\n #print(\"Case #{}:\".format(i),end=\" \")\r\n solve()\r\n\r\nmain() ", "import sys\nimport math\ntake = input\ninput = sys.stdin.readline\nshow = sys.stdout.write\n\nn,m = map(int, input().split())\narr = list()\nfor i in range(n):\n arr.append(list(input()))\n# print(*arr, sep='\\n')\nans = 0\nfor i in range(n):\n for j in range(m):\n f = True\n for k in range(n):\n if k!=i:\n if arr[i][j] < arr[k][j]:\n f = False\n break\n if f:\n ans += 1\n ff = True\n break\nprint(ans)\n \n\n \t \t \t\t \t \t \t \t\t \t\t\t\t\t \t \t\t", "n, k = input().split(\" \")\r\nn = int(n)\r\nk = int(k)\r\nresult = []\r\nall_scores = [list(input()) for z in range(n)]\r\nfor z in range(k):\r\n a = []\r\n for y in range(n):\r\n a.append(all_scores[y][z])\r\n m = max(a)\r\n p = [i for i, j in enumerate(a) if j == m]\r\n for i in p:\r\n if i not in result:\r\n result.append(i)\r\n\r\nprint(len(result))", "a = input().split(' ')\r\nn = int(a[0])\r\nm = int(a[1])\r\nM = []\r\ni = 0\r\nwhile i < n:\r\n M.append([])\r\n j = 0\r\n a = input()\r\n while j < m:\r\n M[i].append(int(a[j]))\r\n j+=1\r\n i+=1\r\nbest = {}\r\nj = 0\r\nwhile j < m:\r\n mx = -1\r\n ind = []\r\n i = 0\r\n while i < n:\r\n if M[i][j] > mx:\r\n ind.clear()\r\n mx = M[i][j]\r\n ind.append(i)\r\n else :\r\n if M[i][j] == mx:\r\n ind.append(i)\r\n i+=1\r\n for x in ind:\r\n best[x] = 1\r\n j+=1\r\nans = 0\r\nfor x in best:\r\n ans+=1\r\nprint(ans)", "a = input().split(' ')\nn = int(a[0])\nm = int(a[1])\nstudents = []\nfor i in range(n):\n a = list(input())\n students.append(a)\nbest = []\nmax = 0\nindex = []\nfor i in range(m):\n max = 0\n for j in range(n):\n if int(students[j][i]) > max:\n max = int(students[j][i])\n index = [j]\n elif int(students[j][i]) == max:\n index.append(j)\n for k in index:\n best.append(k)\nprint(len(set(best)))\n", "n,m = map(int, input().split())\r\nTF = [[False]*m for _ in range(n)]\r\nl = [list(input()) for _ in range(n)]\r\n\r\nans=0\r\nfor i in range(m):\r\n list =[]\r\n for j in range(n):\r\n list.append(int(l[j][i]))\r\n a = max(list)\r\n\r\n for j in range(n):\r\n if int(l[j][i]) == a:\r\n TF[j][i] = True\r\n\r\nfor i in range(n):\r\n if any(TF[i]):\r\n ans+=1\r\n\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\r\nl=[]\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\ny=1\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(m):\r\n l1.append([l[j][i] for j in range(n)])\r\nprint\r\nl.clear()\r\nfor i in l1:\r\n for j in i:\r\n if j==max(i):\r\n l2.append(y)\r\n y+=1\r\n y=1\r\n l.append(l2)\r\n l2=l3.copy() \r\nfor i in l:\r\n for j in i:\r\n if j not in l3:\r\n l3.append(j)\r\nprint(len(l3))\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\n\ngradebook = []\nfor i in range(m):\n gradebook.append([])\n\nfor _ in range(n):\n _grade = input()\n for i in range(m):\n gradebook[i].append(int(_grade[i]))\n\nsuccessful_students = set()\nfor subject in gradebook:\n max_i = []\n max_grade = 0\n for student_i in range(n):\n if subject[student_i] > max_grade:\n max_i = [student_i+1]\n max_grade = subject[student_i]\n elif subject[student_i] == max_grade:\n max_i.append(student_i+1)\n successful_students |= set(max_i)\n\nprint(len(successful_students))\n", "students,subjects = map(int,input().split())\r\ngrades = []\r\nbest = [0] * subjects\r\nsuccessful = 0\r\nfor i in range(students):\r\n grades.append(input().strip())\r\n for j in range(subjects):\r\n best[j] = max(best[j],int(grades[-1][j]))\r\n \r\nfor i in grades:\r\n for j in range(subjects):\r\n if int(i[j]) == best[j]:\r\n successful += 1\r\n \r\n break\r\nprint(successful)", "lst = [w.rstrip() for w in open(0).readlines()]\r\nn, m = map(int, lst[0].split())\r\ndc = dict()\r\nfor j in range(m):\r\n dc[j] = list()\r\n\r\nfor line in lst[1:]:\r\n for j, c in enumerate(line):\r\n dc[j].append(int(c))\r\n\r\nsuccessful = set()\r\nfor j in range(m):\r\n maj = max(dc[j])\r\n s = [k for k, z in enumerate(dc[j]) if z == maj]\r\n successful = successful.union(s)\r\n\r\nprint(len(successful))", "n,m=map(int, input().split())\r\nl=[]\r\na=[]\r\nfor i in range(n):\r\n p=input()\r\n l.append(p)\r\n a.append(0)\r\nfor i in range(n):\r\n for j in range(m):\r\n x=[]\r\n for k in range(n):\r\n x.append(int(l[k][j]))\r\n f=max(x)\r\n if int(l[i][j])>=f:\r\n a[i]=1\r\n if a[i]==1:\r\n break\r\nprint(a.count(1))", "# cook your dish here\r\nn, m = map(int, input().split())\r\nmat = []\r\nfor i in range(n):\r\n a = list(input())\r\n mat.append(a)\r\n#print(mat)\r\n\r\na =[]\r\nfor i in range(m):\r\n b =[]\r\n for j in range(n):\r\n b.append(mat[j][i])\r\n a.append(b)\r\n#print(a)\r\n\r\nse = []\r\nfor i in a:\r\n m = max(i)\r\n for j in range(n):\r\n if(i[j]==m):\r\n se.append(j)\r\n#print(se)\r\nse = set(se)\r\nprint(len(se))\r\n", "n, m = (int(x) for x in input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(input())\r\nms = [max(s[x] for s in l) for x in range(m)]\r\nprint(sum(1 for s in l if sum(1 for x, y in zip(s, ms) if x == y) > 0))", "n, m = map(int, input().split())\ns = {}\nbs = [0]*n\n\nfor i in range(n):\n s[i] = list(map(int, [int(x) for x in input()]))\nfor j in range(m):\n best = 1\n for i in range(n):\n if s[i][j] > best:\n best = s[i][j]\n for i in range(n):\n if s[i][j] == best:\n bs[i] += 1\n\nprint(len(list(filter((0).__ne__, bs))))\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n f = [] * 0\r\n s = input()\r\n f += s\r\n a.append(f)\r\nc = []\r\nfor i in range(m):\r\n d = list()\r\n for j in range(n):\r\n d.append(a[j][i])\r\n d.sort(reverse=True)\r\n c.append(d[0])\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] != c[j]:\r\n a[i][j] = 0\r\n else:\r\n a[i][j] = 1\r\n if sum(a[i]) > 0:\r\n ans += 1\r\nprint(ans)", "n,m=map(int,input().split(\" \"))\r\nans=[[] for _ in range(m)]\r\nfor _ in range(n):\r\n a=list(map(int,list(input())))\r\n for x in range(m):\r\n ans[x].append(a[x])\r\naaa=0\r\nt=[0 for x in range(n)]\r\nfor x in ans:\r\n ss=max(x)\r\n for xx in range(n):\r\n if ss==x[xx]:\r\n t[xx]=1\r\nc=0\r\nfor x in t:\r\n if x==1:\r\n c=c+1\r\nprint(c)\r\n \r\n ", "n,m = map(int,input().split(\" \"))\r\nmas=[]\r\nfor i in range(n):\r\n mas.append([int(x) for x in input()])\r\nres=[0]*n\r\nfor i in range(m):\r\n ma = max([x[i] for x in mas])\r\n for j in range(n):\r\n if mas[j][i]==ma:\r\n res[j]=1\r\nprint(sum(res))", "n, m = map(int, input().split())\ndis = list(zip(*tuple([list(input()) for _ in range(n)])))\nbest = [0]*n\nfor j in range(m):\n t = max(dis[j])\n for i in range(n):\n if dis[j][i] == t:\n best[i] = 1\nprint(sum(best))\n", "def readln(): return tuple(map(int, input().split()))\n\nn, m = readln()\ndis = list(zip(*tuple([list(input()) for _ in range(n)])))\nbest = [0]*n\nfor j in range(m):\n t = max(dis[j])\n for i in range(n):\n if dis[j][i] == t:\n best[i] = 1\nprint(sum(best))\n", "n,m = [int(x) for x in input().split()]\r\nsub = []\r\nmaximum = []\r\nfor i in range(n):\r\n sub.append(input())\r\nfor i in range(m):\r\n max = 0\r\n for j in range(n):\r\n if(int(sub[j][i]) > max):\r\n max = int(sub[j][i])\r\n maximum.append(max)\r\n\r\n#print(maximum)\r\ntotal = 0\r\nfor i in range(n):\r\n count = 0\r\n for j in range(len(maximum)):\r\n if(int(sub[i][j]) == maximum[j]):\r\n count+=1\r\n break\r\n if(count > 0):\r\n total+=1\r\nprint(total)\r\n \r\n\r\n \r\n \r\n\r\n", "n,m=map(int,input().split()); l=[]\nfor i in range(n):\n t=[int(x) for x in list(input())]\n l.append(t)\ns = [0 for i in range(100)]\nmi = 0; mv = 0\n\nfor i in range(m):\n l2 = []\n for j in range(n):\n l2.append(l[j][i])\n \n mx = max(l2)\n for k in range(n):\n if l2[k] == mx:\n s[k] = 1\n \nprint(sum(s))\n", "\r\n \r\nn,m = map(int, str(input()).split())\r\n\r\nfinal = [0]*n\r\n\r\nmarks = [list(input().strip()) for i in range(n)]\r\n\r\nfor j in range(m):\r\n\r\n x = [marks[i][j] for i in range(n)]\r\n\r\n for i in range(n):\r\n\r\n if marks[i][j] == max(x):\r\n\r\n final[i] = 1\r\n\r\nprint (sum(final))\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nml=[0]*m\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\n for j in range(m):\r\n ml[j]=max(ml[j],int(s[j]))\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if int(l[i][j])==ml[j]:\r\n c+=1\r\n break\r\nprint(c)", "n, m = list(map(int, input().strip().split()))\nres = [[] for i in range(m)]\nresult = []\nfor i in range(n):\n data = list(input().strip())\n for j in range(len(data)):\n res[j].append(int(data[j]))\nfor i in res:\n for j in range(len(i)):\n if i[j] == max(i):\n result.append(j)\nprint(len(set(result)))", "N, M = map(int, input().split())\n\nA = []\n\nfor n in range(N):\n A.append([int(x) for x in input()])\n\nbest_set = set()\n\nfor m in range(M):\n curr_best_val = -1\n curr_best_set = set()\n for n in range(N):\n if A[n][m] > curr_best_val:\n curr_best_val = A[n][m]\n curr_best_set = set()\n curr_best_set.add(n)\n if A[n][m] == curr_best_val:\n curr_best_set.add(n)\n \n best_set = best_set.union(curr_best_set)\n\nprint(len(best_set))", "n,m=map(int,input().split())\r\n\r\n# a=input()\r\n\r\n\r\narr=[]\r\nfor i in range(n):\r\n\t# print(i)\r\n\tlst=[int(x) for x in input()]\r\n\tarr.append(lst)\r\n\r\nset1=set()\r\n# for j in range(n):\r\n# \tmax=-1\r\n# \tfor i in range(m):\r\n\t\t\r\n# \t\tif arr[j][i]>max:\r\n# \t\t\tmax=arr[j][i]\r\n# \t\t\tset1.add(j)\r\n# \t\telif arr[j][i]==max:\r\n# \t\t\tset1.add(j)\t\r\n\r\n\r\n\r\n# print(set1\r\nrez = [[arr[j][i] for j in range(n)] for i in range(m)]\r\nfor i in range(m):\r\n\trez[i]=max(rez[i])\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif arr[i][j]==rez[j]:\r\n\t\t\tset1.add(i)\r\n\r\nprint(len(set1))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n , m = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nb = []\r\nfor j in range(m):\r\n b.append(max(a[i][j] for i in range(n)))\r\n\r\nc = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == b[j]:\r\n c +=1\r\n break\r\n\r\nprint(c)\r\n", "n,m=(int(i) for i in input().split())\r\nl=[0]*n\r\ns=set()\r\nfor i in range(n):\r\n l[i]=list(input())\r\nfor i in range(m):\r\n l1=[]\r\n for j in range(n):\r\n l1.append(l[j][i])\r\n k=max(l1)\r\n for j in range(n):\r\n if(l1[j]==k):\r\n s.add(j)\r\nprint(len(s))", "n,m=map(int,input().split())\r\nmat=[]\r\nfor i in range(n):\r\n arr=input()\r\n arr=[int(i) for i in arr]\r\n mat.append(arr)\r\nmat=list(zip(*mat))\r\ntopper=set()\r\nr,c=len(mat),len(mat[0])\r\nfor i in range(r):\r\n for j in range(c):\r\n if mat[i][j]==max(mat[i]):\r\n topper.add(j+1)\r\nprint(len(topper))", "#!/usr/bin/env python3\nimport os\nfrom sys import stdin, stdout\n\n\ndef solve(tc):\n n, m = map(int, stdin.readline().split())\n grade = []\n for i in range(n):\n grade.append(stdin.readline().strip())\n\n idx = list(range(n))\n successful = [False for i in range(n)]\n for i in range(m):\n out = sorted(idx, key=lambda x: grade[x][i], reverse=True)\n\n cur = grade[out[0]][i]\n successful[out[0]] = True\n for j in range(1, n):\n if grade[out[j]][i] < cur:\n break\n successful[out[j]] = True\n\n cnt = 0\n for i in range(n):\n if successful[i]:\n cnt += 1\n print(cnt)\n\n\ntcs = 1\ntc = 1\nwhile tc <= tcs:\n solve(tc)\n tc += 1\n", "from collections import deque\r\nn, m = map(int, input().split())\r\nbase = deque([])\r\nbest = [0] * n\r\nfor t in range(n):\r\n s = input()\r\n base.append(s)\r\nfor i in range(len(base[0])):\r\n marks = deque([])\r\n for e in range(len(base)):\r\n marks.append(int(base[e][i]))\r\n a = max(marks)\r\n for q in range(len(marks)):\r\n if marks[q] == a and best[q] == 0:\r\n best[q] += 1\r\nprint(sum(best))\r\n\r\n\r\n", "# import sys\r\n# import math\r\n# import collections\r\n\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n# sys.stderr = (open('error.txt','w'))\r\n\r\nn, m = map(int, input().split())\r\ns = [0] * n\r\nv = []\r\nfor i in range(0, n):\r\n v.append(input())\r\nfor x in zip(*v):\r\n m = max(x)\r\n for i in range(0, n):\r\n s[i] |= x[i] == m\r\nprint(sum(s))", "n,m = map(int,input().split())\r\na=[]\r\nans = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n lst = []\r\n for ch in s:\r\n lst.append(int(ch))\r\n a.append(lst)\r\n \r\nfor i in range(n):\r\n wasBest = False \r\n for j in range(m):\r\n isBest = True\r\n for k in range(n):\r\n if a[k][j] > a[i][j] :\r\n isBest = False \r\n if isBest :\r\n wasBest = True \r\n if wasBest:\r\n ans = ans + 1\r\n\r\n\r\nprint(ans)", "\r\n\r\nn,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tarr.append(s)\r\n\r\npos=[]\r\n#print(arr)\r\nfor i in range(m):\r\n\tnarr=[]\r\n\tfor j in range(n):\r\n\t\tnarr.append(arr[j][i])\r\n#\tprint(narr)\r\n\td=max(narr)\r\n\tval=[]\r\n\tfor j in range(n):\r\n\t\tif narr[j]==d:\r\n\t\t\tpos.append(j+1)\r\n#\tprint(pos)\r\nprint(len(set(pos)))\r\n\r\n", "n,m=map(int,input().split())\r\ndef transpose(l1):\r\n\tl2=[]\r\n\tfor i in range(len(l1[0])):\r\n\t\trow =[]\r\n\t\tfor item in l1:\r\n\t\t\trow.append(item[i])\r\n\t\tl2.append(row)\r\n\treturn l2\r\nl=[]\r\nfor i in range(n):\r\n\ts=list(map(int,list(input())))\r\n\tl.append(s)\r\nl=transpose(l)\r\n# print(l)\r\ns=set()\r\nfor i in l:\r\n\ta=max(i)\r\n\tfor j in range(len(i)):\r\n\t\tif a==i[j]:\r\n\t\t\ts.add(j)\r\nprint(len(s))", "#code\r\n#code\r\nn,m = map(int,input().split())\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(input())\r\n \r\na = 0\r\np=0\r\nfor i in range(n):\r\n for j in range(m):\r\n for k in range(n):\r\n if l[i][j]<l[k][j]:\r\n p=1\r\n break\r\n if not p:\r\n a+=1\r\n break\r\n p=0\r\n\r\nprint(a) ", "n,m = map(int,input().split())\r\na=list()\r\nfor i in range(n):\r\n a.append(input())\r\nb=list()\r\nc=[0]*n\r\nfor i in range(m):\r\n s=''\r\n for j in range(n):\r\n s=s+a[j][i]\r\n b.append(s)\r\nfor item in b:\r\n k = max(item)\r\n for i in range(n):\r\n if k == item[i]:\r\n c[i]=c[i]+1\r\nans=0\r\nfor item in c:\r\n if item>0:\r\n ans+=1\r\nprint(ans)", "n,s=input().split()\r\nn=int(n)\r\ns=int(s)\r\nz=[]\r\na=[]\r\nfor i in range(0,n):\r\n x=[]\r\n k=int(input())\r\n while(k>0):\r\n r=k%10\r\n k=k//10\r\n x.append(r)\r\n z.append(x)\r\ncnt=0\r\nfor j in range(0,s):\r\n m=z[0][j]\r\n f=0\r\n for i in range(1,n):\r\n if(z[i][j]>m):\r\n m=z[i][j]\r\n for i in range(0,n):\r\n if(z[i][j]==m):\r\n if(i not in a):\r\n a.append(i)\r\nprint(len(a))\r\n \r\n \r\n", "n,m=map(int,input().split())\r\na=[[0 for _ in range(n)]for _ in range(m)]\r\nfor i in range(n):\r\n b=list(map(int,input()))\r\n for j in range(m):\r\n a[j][i]=b[j]\r\ns=[]\r\nfor i in range(m):\r\n m=max(a[i])\r\n for j in range(n):\r\n if j in s:\r\n continue\r\n if a[i][j]==m :\r\n s.append(j)\r\nprint(len(s))", "n,m=map(int,input().split())\nma= ['0']*m\nst = []\nfor i in range(n):\n s= input()\n for j in range(m):\n ma[j] = max(ma[j],s[j])\n\n st.append(s)\nans =0\nfor i in range(n):\n s = st[i]\n for j in range(m):\n if(s[j]==ma[j]):\n ans+=1\n break\n\nprint(ans)\n\n \n", "n,m=map(int,input().split(' '))\nl=[]\nq=[0]*m\nfor i in range(n):\n s=input()\n l.append(s)\nfor i in l:\n cnt=0\n for k in i:\n t=int(k)\n q[cnt]=max(q[cnt],t)\n cnt+=1\ns=[set()]*(m+1)\nqaq=0\nfor i in l:\n cnt=0\n for k in i:\n t=int(k)\n if q[cnt]==t:\n s[cnt].add(qaq)\n cnt+=1\n qaq+=1\nq=set()\nfor i in s:\n q=q|i\n# print(q)\nprint(len(q))\n \t\t\t \t\t \t \t \t\t \t\t \t \t", "def main():\r\n [n, m] = list(map(int, input().split()))\r\n\r\n ms = []\r\n for _ in range(n):\r\n ms.append(list(map(int, list(input()))))\r\n\r\n sol = [False for _ in range(n)]\r\n\r\n for j in range(m):\r\n mx = -1\r\n for i in range(n):\r\n if ms[i][j] > mx:\r\n mx = ms[i][j]\r\n\r\n for i in range(n):\r\n if ms[i][j] == mx:\r\n sol[i] = True\r\n\r\n\r\n c = 0\r\n for s in sol:\r\n if s:\r\n c += 1\r\n print(c)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nmarks=[]\r\nfor i in range(n):\r\n marks.append(input())\r\n\r\nS=[0]*n\r\n\r\nfor i in range(m):\r\n Max=[]\r\n high='0'\r\n for j in range(n):\r\n if(marks[j][i]>high):\r\n high=marks[j][i]\r\n Max=[j]\r\n elif(marks[j][i]==high):\r\n Max.append(j)\r\n for item in Max:\r\n S[item]=1\r\nprint(sum(S))\r\n ", "import math\r\nimport sys\r\nimport collections\r\n\r\n# imgur.com/Pkt7iIf.png\r\n\r\ndef getdict(n):\r\n d = {}\r\n if type(n) is list:\r\n for i in n:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n else:\r\n for i in range(n):\r\n t = ii()\r\n if t in d:\r\n d[t] += 1\r\n else:\r\n d[t] = 1\r\n return d\r\ndef cdiv(n, k): return n // k + (n % k != 0)\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(map(int, input().split()))\r\ndef lcm(a, b): return abs(a*b) // math.gcd(a, b)\r\n\r\nn, m = mi()\r\nr = []\r\nt = ['0']*m\r\nfor i in range(n):\r\n s = input()\r\n r.append(s)\r\n for j in range(m):\r\n t[j] = max(s[j], t[j])\r\n\r\nres = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if r[i][j] == t[j]:\r\n res += 1\r\n break\r\nprint(res)\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\ng = [map(int, list(input()[:m])) for _ in range(n)]\r\n\r\nd = []\r\nw = list(zip(*g))\r\nfor i in w:\r\n d += [_ for _, j in enumerate(i) if j == max(i)]\r\nprint(len(set(d)))", "p,k=map(int,input().split())\r\nx=[]\r\nfor i in range(p):\r\n x.append(input())\r\nmx=[]\r\nfor i in range(k):\r\n mx.append(max([ x[j][i] for j in range(p) ]))\r\n \r\nans=0\r\nfor i in range(p):\r\n for j in range(k):\r\n if mx[j]==x[i][j]:\r\n ans+=1\r\n break\r\nprint(ans) ", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n x=list(input())\r\n x=[int(x) for x in x]\r\n a.append(x)\r\nans=[0]*n\r\nfor i in range(0,m):\r\n z=max(element[i] for element in a)\r\n for j in range(0,n):\r\n if(z==a[j][i]):\r\n ans[j]=1\r\nprint(ans.count(1))", "from math import *\r\nfrom collections import *\r\nfrom sys import *\r\nt=stdin.readline\r\np=stdout.write\r\ndef gI(): return map(int, t().strip().split())\r\ndef gS(): return map(str, t().strip().split())\r\ndef gL(): return list(map(int, t().strip().split()))\r\ndef SL(): return list(map(str, t().strip().split()))\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=gI()\r\n a=gL()\r\n'''\r\nn,m=gI()\r\na=[[i for i in t()] for _ in range(n)]\r\nans=0\r\nfor i in range(n):\r\n f1=0\r\n for j in range(m):\r\n f2=1\r\n for k in range(n):\r\n if a[k][j]>a[i][j]: f2=0\r\n if f2: f1=1\r\n if f1: ans+=1\r\nprint(ans)", "a,b=map(int,input().split())\r\nc=[input()for i in range(a)]\r\nd=''.join(map(str,(max(map(int,(c[i][j]for i in range(a))))for j in range(b))))\r\ne=0\r\nfor i in c:\r\n for j in range(b):\r\n if i[j]==d[j]:\r\n e+=1\r\n break\r\nprint(e)\r\n", "n, m = list(map(int, input().split()))\n\nsuccess = set()\nallmarks = []\n\nfor i in range(n):\n mar = input()\n allmarks.append(mar)\n\nfor j in range(m):\n marks = \"\"\n for i in range(n):\n marks += allmarks[i][j]\n mx = max(marks)\n for i in range(n):\n if marks[i] == mx:\n success.add(i)\n\nprint(len(success))\n\n \t\t\t\t \t\t\t \t \t\t \t \t", "L=input().split()\r\nstudent=int(L[0])\r\nsubject=int(L[1])\r\nscore=[]\r\nn=[]\r\nfor i in range(student):\r\n score.append(list(input()))\r\n n.append(0)\r\nfor j in range(subject):\r\n max1=int(score[0][j])\r\n for i in range(1,student):\r\n if int(score[i][j])>max1:\r\n max1=int(score[i][j])\r\n for i in range(student):\r\n if int(score[i][j])==max1:\r\n n[i]=1\r\ncount=0\r\nfor i in range(student):\r\n if n[i]==1:\r\n count+=1\r\nprint(count)", "twos = [int(i) for i in input().split()]\r\n\r\nnews = [[] for i in range(twos[1])]\r\ns = []\r\n\r\nfor i in range(twos[0]):\r\n t = input()\r\n s.append(t)\r\n for j in range(twos[1]):\r\n news[j].append(t[j: j+1])\r\n\r\nanswer = 0\r\nfor i in range(len(s)):\r\n check = 0\r\n while check < twos[1]:\r\n if s[i][check:check+1] == max(news[check]):\r\n answer+=1\r\n break\r\n else:\r\n check+=1\r\nprint(answer)", "n, m = (input().split())\r\nn, m = int(n), int(m)\r\nt = []\r\nfor i in range(n):\r\n #n = int(input())\r\n a = input()\r\n a.split()\r\n a = [int(x) for x in a] \r\n t.append(a)\r\n \r\nv = []\r\nfor i in range(m):\r\n s = 0\r\n for j in range(n):\r\n if s < t[j][i]:\r\n s = t[j][i] \r\n v.append(s); \r\n#print(v) \r\ns = 0 \r\nfor i in range(n):\r\n for j in range(m):\r\n if t[i][j] == v[j]:\r\n s += 1\r\n break\r\n \r\nprint(s)", "from collections import Counter\n\nn, m = map(int, input().split())\n\nc = Counter()\n\narr = []\n\nfor i in range(n):\n string = input()\n\n for i in range(len(string)):\n c[i] = max(c[i], int(string[i]))\n\n arr.append(string)\n\nans = 0\n\nfor i in arr:\n for j in range(len(i)):\n if c[j] == int(i[j]):\n ans += 1\n break\n\nprint(ans)\n", "n,m=map(int,input().split())\r\n\r\ns=[input() for _ in range(n)]\r\n\r\na=[max([s[i][j] for i in range(n)]) for j in range(m)]\r\n\r\nprint(sum([sum([x==y for x,y in zip(a,t)])>0 for t in s]))", "n,m = map(int,input().split())\nl1 = []\nfor x in range(n):\n intt = input()\n l1.append(intt)\n\nstudent = []\n\nfor y in range(m):\n topp = []\n res = []\n for x in range(n):\n res.append(int(l1[x][y]))\n maxx = max(res)\n for p in range(n):\n if res[p]==maxx:\n topp.append(int(p+1))\n student.append(topp)\n\nl5 = []\nfor x in student:\n for y in x:\n if y not in l5:\n l5.append(y)\n else:\n pass\n\nprint(len(l5))\n\n\n\n\n\n\n \n \n\n\n\n\n\n\n\n\n\n \n\n\n\n ", "n,m=map(int,input().split())\r\nk=[]\r\nfor i in range(n):\r\n k.append(input())\r\nk=tuple(zip(*k))\r\na=set()\r\nfor i in range(m):\r\n g=max(k[i])\r\n for j in range(n):\r\n if k[i][j]==g:\r\n a.add(j+1)\r\nprint(len(a))\r\n \r\n \r\n", "try:\r\n a,b=map(int,input().split())\r\n l=[]\r\n for i in range(a):\r\n k=input()\r\n \r\n l.append(k)\r\n \r\n f=[] \r\n for i in range(b):\r\n g=[]\r\n for j in range(a):\r\n g.append(l[j][i])\r\n f.append(g) \r\n \r\n final=[]\r\n for i in range(b):\r\n m=max(f[i])\r\n for j in range(a):\r\n if(f[i][j]==m):\r\n final.append(j)\r\n \r\n \r\n p=list(set(final)) \r\n print(len(p))\r\n \r\n \r\nexcept:\r\n pass\r\n", "read = lambda: map(int, input().split())\nn, m = read()\na = []\nfor _ in range(n):\n a.append([int(__) for __ in input()])\nb = [max([a[_][__] for _ in range(n)]) for __ in range(m)]\nr = 0\nfor _ in range(n):\n for __ in range(m):\n if a[_][__] == b[__]:\n r += 1\n break\nprint(r)\n", "n,m = map(int,input().split())\r\n# n = students, m = course\r\n\r\nres = [[0,[]] for _ in range(m)]\r\nfor _ in range(n):\r\n\tscores = input()\r\n\tfor i,c in enumerate(scores):\r\n\t\ts = int(c)\r\n\t\tif res[i][0] > s:continue\r\n\t\telif res[i][0] == s:\r\n\t\t\tres[i][1] = res[i][1] +[_]\r\n\t\telse:\r\n\t\t\tres[i][1] = [_]\r\n\t\t\tres[i][0] = s\r\nbest = set()\r\nfor x in res:\r\n\tbest.update(set(x[1]))\t\r\nprint (len(best))\r\n", "n,m=map(int, input().split())\r\na=[False for i in range(n)]\r\narr=[]\r\nfor i in range(n):\r\n arr2=list(input())\r\n arr.append(arr2)\r\narr=list(zip(*arr))\r\nfor i in range(m):\r\n m=(max(arr[i]))\r\n for j in range(n):\r\n if(arr[i][j]==m):\r\n a[j]=True\r\n if(a.count(True)==len(a)):\r\n break\r\nprint(a.count(True))", "n, m = map(int, input().split())\r\nd_s = {}\r\n\r\nl_s = list(set() for _ in range(m))\r\n\r\nfor i in range(n):\r\n s = input()\r\n \r\n for j in range(m):\r\n if j not in d_s:\r\n d_s[j] = int(s[j])\r\n l_s[j].add(i)\r\n elif d_s[j] < int(s[j]):\r\n d_s[j] = int(s[j])\r\n l_s[j].clear()\r\n l_s[j].add(i)\r\n elif d_s[j] == int(s[j]):\r\n l_s[j].add(i)\r\n\r\nfor i in range(1, m):\r\n l_s[0] = l_s[0].union(l_s[i])\r\n\r\nprint(len(l_s[0]))", "l1 = [int(x) for x in input().split()]\r\nn,m = l1[0],l1[1]\r\nl3=[[] for x in range(m)]\r\nfor x in range(n):\r\n l2 = [int(x) for x in list(input())]\r\n i=0\r\n while i<len(l2):\r\n l3[i].append(l2[i])\r\n i+=1\r\ntable=[]\r\nfor x in l3:\r\n t = max(x)\r\n while t in x:\r\n s=x.index(t)\r\n x[s]=0\r\n if s not in table:\r\n table.append(s)\r\n \r\n \r\n\r\nprint(len(table))\r\n", "n,m = (int(x) for x in input().split())\nl=[]\nfor i in range(n):\n\tl.append(input())\nms=[max(s[x] for s in l) for x in range(m)]\nprint (sum(1 for s in l if (sum (1 for x,y in zip(s,ms) if x==y) > 0)))", "n, m = map(int, input().split())\r\n# taking lists input\r\nmarks = [input() for i in range(n)]\r\n# zip function to take in columns\r\nsuc = [max(i) for i in zip(*marks)]\r\n# compare max of suc with each row to sum trues\r\nprint(sum(any(suc[i] == a[i] for i in range(m)) for a in marks))\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n\ts=list(input())\r\n\tl.append(s)\r\np=[]\r\nfor i in range(m):\r\n\tq=[]\r\n\tfor j in range(n):\r\n\t\tq.append(int(l[j][i]))\r\n\ta=max(q)\r\n\tfor k in range(n):\r\n\t\tif q[k]==a:\r\n\t\t\tp.append(k)\r\nd=len(set(p))\r\nprint(d)\r\n\r\n\r\n\r\n", "import sys\r\n\r\nn,m,*l = sys.stdin.read().split()\r\n\r\nn = int(n)\r\nm = int(m)\r\n\r\ng = []\r\n\r\nst = 0\r\nfor s in l:\r\n sb = 0\r\n for c in s:\r\n if st == 0:\r\n g.append([])\r\n g[sb].append(int(c))\r\n sb +=1\r\n st += 1\r\n\r\nbest = [0] * n\r\nfor sb in range(m):\r\n mx = max(g[sb])\r\n for st in range(n):\r\n if g[sb][st] == mx:\r\n best[st] = 1\r\n\r\nprint(sum(best))", "n, m = list(map(int, input().strip().split()))\r\n\r\narr = []\r\ncompare = lambda x, y : max(int(x),int(y))\r\ncompare1 = lambda x, y: True if int(x)>=int(y) else False\r\n\r\nfor _ in range(n):\r\n temp = list(input())\r\n arr.append(temp)\r\n\r\nmarks = [-1]*m\r\n\r\nfor ele in arr:\r\n marks = list(map(compare, ele, marks))\r\n\r\ncount = 0\r\nfor ele in arr:\r\n if True in (list(map(compare1, ele, marks))):\r\n count += 1\r\n \r\nprint(count)\r\n", "n,m=map(int,input().split())\nl=[]\nfor i in range(n):\n\tl.append(list(map(int,list(input()))))\nsuccess=[-1]*n\ncount=0\nfor i in range(m):\n\tm=-1\n\tbest=[]\n\tfor j in range(n):\n\t\tif l[j][i]>m:\n\t\t\tm=l[j][i]\n\t\t\tbest=[]\n\t\t\tbest.append(j)\n\t\telif l[j][i]==m:\n\t\t\tbest.append(j)\n\tfor j in best:\n\t\tsuccess[j]=1\nprint (success.count(1))\n\n", "x = input().split()\nn, m = map(int, x)\n\nlst = []\nfor i in range(n):\n x = list(input())\n x = list(map(int, x))\n lst.append(x)\n\nlst = list(map(list, zip(*lst)))\n\nans = []\nfor a in lst:\n m = max(a)\n ans += [i for i, j in enumerate(a) if j == m]\n\nans = set(ans)\nprint (len(ans))\n", "n, m = map(int, input().split())\r\nlst, mx, dem = [], [0] * m, 0\r\nfor x in range(n):\r\n lst.append(input())\r\n for i in range(m): mx[i] = max(int(lst[x][i]), mx[i])\r\nfor x in range(m):\r\n for i in range(n):\r\n if ord(lst[i][x]) - 48 == mx[x]: dem, lst[i] = dem + 1, \"0\" * m\r\nprint(dem)", "ar = []\r\nfor i in input().split(' '):\r\n ar.append(int(i))\r\nmarks = []\r\nfor i in range(ar[0]):\r\n temp = []\r\n el = input()\r\n for j in range(len(el)):\r\n temp.append(int(el[j]))\r\n marks.append(temp)\r\ncol_totals = [ max(x) for x in zip(*marks) ]\r\ncount = 0\r\nfor i in range(len(marks)):\r\n for j in range(len(marks[i])):\r\n if marks[i][j] == col_totals[j]:\r\n count = count + 1\r\n break\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\n\r\nl1=[0 for i in range(0,n)]\r\n\r\narr=[[] for i in range(0,m)]\r\n\r\nfor i in range(0,n):\r\n s=input()\r\n for i in range(0,m):\r\n arr[i].append(int(s[i]))\r\n\r\nfor i in range(0,m):\r\n ch=max(arr[i])\r\n\r\n for j in range(0,n):\r\n if arr[i][j]==ch:\r\n l1[j]=1\r\n\r\nprint(sum(l1))", "n,m=map(int,input().split())\r\nl1=[]\r\nfor i in range(0,n):\r\n s=input()\r\n l2=list(int(str(x)) for x in s)\r\n l1.append(l2)\r\nsuccessfulls=[0]*n\r\nfor j in range(0,m):\r\n x=0\r\n for i in range(0,n):\r\n x=max(x,l1[i][j])\r\n for i in range(0,n):\r\n if l1[i][j]==x:\r\n successfulls[i]=1\r\nprint(successfulls.count(1))", "l = list(map(int,input().split()))\r\ns = l[0]\r\nsub = l[1]\r\nc = 0\r\na = []\r\nfor i in range(l[0]):\r\n a.append(list(input())) \r\nf = []\r\nfor i in range(sub):\r\n fake = []\r\n for j in range(s):\r\n fake.append(a[j][i])\r\n f.append(max(fake))\r\n\r\nfor i in range(s):\r\n for j in range(sub):\r\n if a[i][j] == f[j] :\r\n c+=1 \r\n break\r\nprint(c)", "r,c=map(int,(input().split()))\r\nl=[]\r\ns=[]\r\np=[]\r\nfor i in range(r):\r\n o=input()\r\n l.append([])\r\n for j in o:\r\n l[i].append(int(j))\r\n\r\nfor i in range(c):\r\n s.append([])\r\n for j in range(r):\r\n s[i].append(l[j][i])\r\n \r\nfor i in range(c):\r\n d=max(s[i])\r\n for j in range(r):\r\n if(s[i][j]==d):\r\n p.append(j)\r\nprint(len(set(p))) ", "n,m=map(eval,input().split())\na=[]\nnum=0\nflag=0\nfor i in range(n):\n a.append(list(map(eval,input())))\nfor i in range(n):\n for j in range(m):\n max=a[i][j]\n for k in range(n):\n if max<a[k][j]:\n flag=1\n break\n if flag==1:\n flag=0\n else:\n num+=1\n break\nprint(num)\n\n\t \t\t \t \t\t \t \t \t \t\t \t", "n, m = map(int, input().split())\r\n\r\nmat = [input() for _ in range(n)]\r\n\r\na = [max([mat[i][j] for i in range(n)]) for j in range(m)]\r\n\r\nprint(sum([sum([x == y for x,y in zip(a,t)]) > 0 for t in mat]))", "num_students, num_subjects = map(int, input().split())\r\nstudent_marks = [input() for _ in range(num_students)]\r\nis_successful = [False] * num_students\r\n\r\nfor subject in range(num_subjects):\r\n best_mark = '0'\r\n for student in range(num_students):\r\n if student_marks[student][subject] > best_mark:\r\n best_mark = student_marks[student][subject]\r\n \r\n for student in range(num_students):\r\n if student_marks[student][subject] == best_mark:\r\n is_successful[student] = True\r\n\r\nprint(is_successful.count(True))\r\n", "def input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n, m = input_ints()\r\n s = []\r\n for i in range(n):\r\n s.append(input())\r\n ans = 0\r\n for i in range(n):\r\n f = False\r\n for j in range(m):\r\n g = True\r\n for k in range(n):\r\n if s[k][j] > s[i][j]:\r\n g = False\r\n if g:\r\n f = True\r\n ans += f\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n, m = map(int,input().split())\r\nstudents = [list(map(int,input())) for i in range(n)]\r\ngrades = [[students[j][i] for j in range(n)] for i in range(m)]\r\nmax_grades = [max(grades[i]) for i in range(m)]\r\nbest = [[students[i][j] == max_grades[j] for j in range(m)] for i in range(n)]\r\nans = [max(best[i]) for i in range(n)]\r\nprint(sum(ans))\r\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nb = []\r\nfor j in range(m):\r\n b.append(max(a[i][j] for i in range(n)))\r\n#print(b)\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == b[j]:\r\n cnt += 1\r\n break\r\nprint(cnt)\r\n", "ns , ng = map(int, input().split()); data = []\r\nfor i in range(ns):d = input();data.append(d)\r\nbest = {\"dd\"}; meme = \"\"\r\nfor i in range(ng):\r\n for j in range(ns):\r\n meme += data[j][i]\r\n gay = sorted(meme)\r\n mx = gay[ns-1]\r\n for j in range(ns-1,-1,-1):\r\n if meme[j] == mx:\r\n best.add(j)\r\n meme = \"\"\r\nprint(len(best)-1)", "ans = []\r\nbest = []\r\ncnt = 0\r\nn, m = map(int, input().split())\r\nfor i in range(n):\r\n if i == 0:\r\n y = input()\r\n x = [int(f) for f in y]\r\n best = x[:]\r\n ans.append(x)\r\n else:\r\n y = input()\r\n x = [int(f) for f in y]\r\n for j in range(m):\r\n if x[j] >= best[j]:\r\n best[j] = x[j]\r\n ans.append(x)\r\nfor i in ans:\r\n for j in range(m):\r\n if i[j] >= best[j]:\r\n cnt += 1\r\n break\r\nprint(cnt)", "def helper(mat, i):\r\n return [row[i] for row in mat]\r\n\r\ndef solve(n, m, arr):\r\n s = set()\r\n for i in range(m):\r\n c = helper(arr, i)\r\n mx = max(c)\r\n\r\n for j in range(n):\r\n if c[j] == mx:\r\n s.add(j)\r\n\r\n return len(s)\r\n\r\n\r\nn, m = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n x = list(map(int, input()))\r\n arr.append(x)\r\nprint(solve(n, m, arr))\r\n", "val=input().split()\r\nval=[int(x) for x in val]\r\n\r\nn=val[0]\r\nm=val[1]\r\nliss=[]\r\n\r\nfor i in range(n):\r\n t=input()\r\n liss.append(t)\r\n\r\nst=set()\r\n\r\nfor j in range(m):\r\n val=liss[0][j]\r\n for i in range(1,n):\r\n if val<liss[i][j]:\r\n val=liss[i][j]\r\n \r\n for k in range(n):\r\n if liss[k][j]==val:\r\n st.add(k)\r\n\r\nprint(len(st))\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n", "n,m=map(int,input().split())\r\nA=[]\r\nmax_subject_marks=[0]*m\r\nfor i in range(n):\r\n s=input()\r\n A.append(s)\r\n for j in range(m):\r\n max_subject_marks[j]=max(max_subject_marks[j],int(s[j]))\r\ncnt=0\r\nfor i in A:\r\n flag=0\r\n for j in range(m):\r\n marks=int(i[j])\r\n if(marks==max_subject_marks[j]):\r\n flag=1\r\n break\r\n if flag:\r\n cnt+=1\r\nprint(cnt)", "\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n students = []\r\n for i in range(n):\r\n students.append(input())\r\n hash_table = {}\r\n max_scores = []\r\n for i in range(m):\r\n maxis = 0\r\n for j in range(n):\r\n if int(students[j][i]) > maxis:\r\n maxis = int(students[j][i])\r\n max_scores.append(maxis)\r\n hash_table = [0 for i in range(n)]\r\n for i in range(m):\r\n maxu = max_scores[i]\r\n for j in range(n):\r\n if int(students[j][i]) == maxu:\r\n hash_table[j] += 1\r\n counter = 0\r\n for i in hash_table:\r\n if i != 0:\r\n counter += 1\r\n return counter\r\n\r\n return max_scores\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "L1= [int(x) for x in input().split(\" \")]\r\n\r\nnum=L1[0]\r\nnum2=L1[1]\r\n\r\nL2=[]\r\n\r\nctr=0\r\nflag=0\r\nflag2=0\r\nfor i in range(0,num):\r\n user=input()\r\n L2.append(list(user))\r\n#print(L2)\r\n\r\nL3=[]\r\n\r\n\r\nctr=0\r\nfor i in range(0,num):\r\n\r\n L4=L2[i]\r\n\r\n for j in range(0,num2):\r\n\r\n flag=0\r\n\r\n suru=L4[j]\r\n\r\n #print(suru)\r\n\r\n for k in range(0,num):\r\n\r\n if k!=i:\r\n \r\n\r\n if suru<L2[k][j]:\r\n \r\n flag=1\r\n break\r\n \r\n if flag==0:\r\n ctr=ctr+1\r\n break\r\n \r\n\r\n #print(\"\\n\")\r\n\r\n\r\n \r\nprint(ctr)\r\n ", "# Author: SaykaT\r\n# Problem: 152A\r\n# Time Created: September 07(Monday) 2020 || 11:12:27\r\n\r\n#>-------------------------<#\r\n\r\n#>-------------------------<#\r\n\r\n\r\n# Helper Functions. -> Don't cluster your code.\r\n\r\n\r\n# Main functions. -> Write the main solution here\r\ndef solve():\r\n n, m = map(int, input().split())\r\n numbers = []\r\n\r\n for _ in range(n):\r\n number = list(input())\r\n number = list(map(int, number))\r\n numbers.append(number)\r\n\r\n subject = dict() \r\n\r\n for i in range(m):\r\n tmp = []\r\n for j in range(n):\r\n tmp.append(numbers[j][i])\r\n subject[i] = tmp\r\n\r\n successful = 0\r\n\r\n for student in numbers:\r\n is_successful = False\r\n for idx, number in enumerate(student):\r\n if number == max(subject[idx]):\r\n is_successful = True\r\n break\r\n if is_successful:\r\n successful += 1\r\n\r\n print(successful)\r\n\r\n\r\n# Single test cases\r\nsolve()\r\n\r\n", "numS, numC = map(int, input().split())\r\nmaxG = 0\r\nsucc = [0] * numS\r\ngr = []\r\nfor _ in range(numS):\r\n row = input()\r\n gr.extend([int(x) for x in row])\r\nfor m in range(numC):\r\n maxG = 0\r\n for n in range(numS):\r\n maxG = max(maxG, gr[n * numC + m])\r\n for n in range(numS):\r\n if gr[n * numC + m] == maxG:\r\n succ[n] = 1\r\ntotal = sum(succ)\r\nprint(total)# 1691109833.5611374", "import sys\r\nn,m=map(int,sys.stdin.readline().split())\r\nx=[]\r\nt=[]\r\nfor i in range(n):\r\n x.append(input())\r\n t.append(0)\r\n\r\nfor j in range(m):\r\n o=[]\r\n for i in range(n):\r\n o.append(int(x[i][j]))\r\n b=max(o)\r\n for k in range(n):\r\n if o[k]==b:\r\n t[k]+=1\r\n\r\n\r\nnum=0\r\nfor i in range(n):\r\n if t[i]>0:\r\n num+=1\r\n\r\nprint(num)", "n, m = [int(x) for x in input().split()]\r\ns = 0\r\no = []\r\nfor i in range(0,n):\r\n o.append(input())\r\n\r\nl = []\r\n\r\nfor j in range(0,m):\r\n a = []\r\n for i in range(0,n):\r\n a.append(o[i][j])\r\n l.append(max(a))\r\n\r\n\r\n\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if o[i][j] == l[j]:\r\n s+=1 \r\n break\r\nprint(s)", "n,m = map(int, input().split())\r\ndata = [list(map(int,list(input()))) for _ in range(n)]\r\n\r\nbest = []\r\nfor i in range(m):\r\n tmp = -1\r\n for j in range(n):\r\n if data[j][i]>tmp:\r\n tmp = data[j][i]\r\n best.append(tmp)\r\n\r\nresult = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if data[i][j]==best[j]:\r\n result += 1\r\n break\r\nprint(result)", "n,m=map(int,input().split())\r\nl=[[] for _ in range(m+5)]\r\nfor i in range(n):\r\n\ta=list(map(int,list(input())))\r\n\tfor j in range(m):\r\n\t\tl[j].append(a[j])\r\ns=0\r\nfor i in range(n):\r\n\tf=False\r\n\tfor j in range(m):\r\n\t\tif l[j][i]==max(l[j]):\r\n\t\t\tf=True\r\n\ts+=f\r\nprint(s)", "# a = input().split()\n# t = []\n# for i in a:\n# t.append(int(i))\n# ans = 0\n# # s = input()\n# for i in range(len(s)):\n# ans += t[int(s[i]) - 1]\n# print(ans)\n\n# for i in s:\n# ans += t[int(i) - 1]\n# print(ans)\n\n# t = int(input())\n# for i in range(t):\n# n = int(input())\n# print(n // 2)\n\n#n - чётное\n#1 2 3 4 5 6\n#1 + 6 = 2 + 5 = 3 + 4 # n // 2\n\n#n - нечётное\n#1 2 3 4 5 6 7\n#1 + 6 = 2 + 5 = 3 + 4 = 7\n\n# t = int(input())\n# for i in range(t):\n# n = int(input())\n# if n % 2 == 0:\n# print(n // 2)\n# else:\n# print((n + 1) // 2)\n\n# def gcd(a,b):\n# g = 1\n# for i in range(1, min(a,b) + 1):\n# if a % i == 0 and b % i == 0:\n# g = i\n# return g\n\n# def scm(a,b):\n# m = min(a,b)\n# while m % a != 0 or m % b != 0:\n# m = m + 1\n# return m\n\n# print(scm(5, 2))\n\n# n = int(input())\n# x = input().split()\n# y = input().split()\n# a = set(x[1:])\n# b = set(y[1:])\n# a = a.union(b)\n# if len(a) == n:\n# print(\"yes\")\n# else:\n# print(\"no\")\n\n# a = set(list(map(int, input().split())))\n\n# n = int(input())\n# t = input().split()\n# flag = 0\n# for i in t:\n# if i == '1':\n# flag = 1\n# if flag == 0:\n# print('Easy')\n# else:\n# print('Hard')\n \n\n# n = int(input())\n# t = input()\n# flag = 0\n# for i in t:\n# if i != \"4\" and i != '7':\n# flag = 1\n# break\n# if flag == 1:\n# print(\"no\")\n# else:\n# a = 0\n# b = 0\n# for i in t[:n // 2]:\n# a += int(i)\n# for i in t[n // 2:]:\n# b += int(i)\n# if a == b:\n# print('yes')\n# else:\n# print(\"no\")\n\n# n = int(input())\n# k = int(input())\n# a = []\n# for i in range(1, n + 1, 2):\n# a.append(i)\n# for i in range(2, n + 1, 2):\n# a.append(i)\n# print(a[k - 1])\n\n# a = int(input())\n\n\n# b = input().split()\n# a = []\n# t = []\n# for i in b:\n# a.append(int(i))\n# for i in range(a[0]):\n# t.append([])\n# for j in range(a[1]):\n# t[i].append('0')\n# for i in range(a[0]):\n# for j in range(a[1]):\n# print(t[i][j], end = \" \")\n# print()\n# i = t[2]\n# j = t[3]\n# while i != t[4] and j != t[5]\n\n####ПОМУЧАТЬ\n# b = input().split()\n# a = []\n# t = []\n# for i in b:\n# a.append(int(i))\n# for i in range(a[0]):\n# t.append([])\n# for j in range(a[1]):\n# t[i].append('0')\n# t[a[4] - 1][a[5] - 1] = \"1\"\n# x = a[2] - 1\n# y = a[3] - 1\n# #move = 0 - вправо вниз\n# #move = 1 - вправо вверх\n# #move = 2 - влево вверх\n# #move = 3 -влево вниз\n# move = 0\n# sec = 0\n# count = 0\n# print(x, y)\n# while count < 20:\n# if move == 0:\n# if x + 1 < a[0]:\n# x += 1\n# else:\n# move = 1\n# if y + 1 < a[1]:\n# y += 1\n# else:\n# move = 2\n \n# if move == 1:\n# if x - 1 > -1:\n# x -= 1\n# else:\n# move = 3\n# if y + 1 < a[3]:\n# y += 1\n# else:\n# move = 2\n \n# if move == 2:\n# if x - 1 > -1:\n# x -= 1\n# else:\n# move = 0\n# if y - 1 > -1:\n# y -= 1\n# else:\n# move = 3\n \n# if move == 3:\n# if x + 1 < a[0]:\n# x += 1\n# else:\n# move = 1\n# if y - 1 > -1:\n# y -= 1\n# else:\n# move = 0\n# count += 1\n# print(x, y)\n \n \n\n# for i in range(a[0]):\n# for j in range(a[1]):\n# print(t[i][j], end = \" \")\n# print()\n\n# class Rectangle:\n# def __init__(self, width, height): # обязательная строка\n# self.__width = width\n# self.__height = height\n\n# def get_width(self):\n# return self.__width\n\n# def get_height(self):\n# return self.__height\n\n# def set_width(self, w):\n# self.__width = w\n\n# def set_height(self, h):\n# self.__height = h\n\n# def area(self):\n# return self.__width * self.__height\n\n# def print(self):\n# print(f'''Rect:\\nHeight: {self.__height}\\nWidth: {self.__width}''')\n\n# rect = Rectangle(5, 7)\n# print(rect.get_height())\n# rect.print()\n# rect.set_width(7)\n# rect.print()\n\n# t = int(input())\n# for i in range(t):\n# temp1 = input().split()\n# temp2 = input().split()\n# a1 = int(temp1[0])\n# a2 = int(temp2[0])\n# b1 = int(temp1[1])\n# b2 = int(temp2[1])\n# if (a1 + a2 == b1 and b1 == b2) or (b1 + b2 == a1 and a1 == a2) or (a1 + b2 == b1 and b1 == a2) or (a2 + b1 == a1 and a1 == b2):\n# print(\"Yes\")\n# else:\n# print(\"No\")\n\ntemp = input().split()\nn = int(temp[0])\nm = int(temp[1])\na = []\ncount = 0\nfor i in range(n):\n a.append([])\n s = input()\n for j in s:\n a[i].append(int(j))\nmx = [0 for i in range(m)]\nfor i in range(m):\n for j in range(n):\n if mx[i] < a[j][i]:\n mx[i] = a[j][i]\nfor i in range(n):\n for j in range(m):\n if a[i][j] == mx[j]:\n count += 1\n break\nprint(count) ", "n, m = map(int, input().split())\r\nlst = [list(map(lambda x: int(x), input())) for _ in range(n)]\r\nans = 0\r\nfor _ in range(len(lst)):\r\n for __ in range(len(lst[_])):\r\n u = [x[__] for x in lst]\r\n if lst[_][__] == max(u):\r\n ans += 1\r\n break\r\nprint(ans)", "row = input().split()\r\nn = int(row[0])\r\nm = int(row[1])\r\n\r\nmark =[]\r\nfor i in range(n):\r\n mark.append(input())\r\n\r\ncount = 0\r\n\r\nlistm = []\r\nlistmax = []\r\nfor i in range(m):\r\n listm.clear()\r\n for j in mark:\r\n listm.append(int(j[i]))\r\n listmax.append(max(listm))\r\n\r\nfor i in range(n):\r\n k = mark[i]\r\n for r in range(m):\r\n if int(k[r]) == int(listmax[r]):\r\n count+=1\r\n break\r\n\r\n\r\nprint(count)\r\n\r\n", "n,m=map(int,input().split())\r\ngs=[list(map(int,input())) for _ in ' '*n]\r\nmx=[max(i) for i in zip(*gs)]\r\nprint(sum(any(mx[i]==a[i] for i in range(m)) for a in gs))", "n,m=map(int,input().split())\r\nt2=[]\r\nfor i in range(n):\r\n s=input()\r\n t1=list(s)\r\n if i==0:max_mark=list(s)\r\n else:\r\n for j in range(m):\r\n if s[j]>max_mark[j]:max_mark[j]=s[j]\r\n t2.append(t1)\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if t2[i][j]==max_mark[j]:\r\n c+=1\r\n break\r\nprint(c)\r\n", "def solve(arr,n,m):\n res = [False]*n\n for col in range(m):\n max_val = arr[0][col]\n for row in range(n):\n if arr[row][col] > max_val:\n max_val = arr[row][col]\n for row in range(n):\n if arr[row][col] == max_val:\n res[row] = True\n\n return res.count(True) \n \n \ndef main():\n n,m = list(map(int, input().split(' ')))\n arr = []\n for i in range(n):\n arr.append(list(map(int, list(input()))))\n print(solve(arr,n,m))\n\n\nmain()", "n, m = map(int, input().split())\r\nmark = [input() for i in range(n)]\r\ns = [max(x) for x in zip(*mark)]\r\nprint (sum([any([p[i] == s[i] for i in range(m)]) for p in mark]))", "n,m=map(int,input().split())\r\ndef transpose(l1):\r\n\tl2=[]\r\n\tfor i in range(len(l1[0])):\r\n\t\trow =[]\r\n\t\tfor item in l1:\r\n\t\t\trow.append(item[i])\r\n\t\tl2.append(row)\r\n\treturn l2\r\nl=[]\r\nfor i in range(n):\r\n\ts=list(map(int,list(input())))\r\n\tl.append(s)\r\nl=transpose(l)\r\ns=set()\r\nfor i in l:\r\n\ta=max(i)\r\n\tfor x in range(len(i)):\r\n\t\tif a==i[x]:\r\n\t\t\ts.add(x)\r\nprint(len(s))", "n,m=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\tb.append(list(map(int,input())))\r\n\r\nl=[]\r\nfor i in range(m):\r\n\ta=[]\r\n\tfor j in range(n):\r\n\t\ta.append(b[j][i])\r\n\r\n\tfor k in range(len(a)):\r\n\t\tif a[k]==max(a):\r\n\t\t\tif k not in l:\r\n\t\t\t\tl.append(k)\r\n\t\r\n\tif len(l)==n:\r\n\t\tbreak\r\nprint(len(l))", "n, m = map(int, input().split())\r\nmarks = [input() for _ in range(n)]\r\nsuccess = []\r\nfor i in range(m):\r\n amax = \"-1\"\r\n for j in range(n):\r\n if marks[j][i] >= amax:\r\n amax = marks[j][i]\r\n \r\n for j in range(n):\r\n if marks[j][i] == amax and j not in success:\r\n success.append(j)\r\n \r\nprint(len(success))", "def check(List,h,j):\r\n x = List[0][j]\r\n for i in range(len(List)):\r\n if List[i][j]>=x:\r\n x = List[i][j]\r\n return x<=List[h][j]\r\n\r\ndef true(List,h,m):\r\n for j in range(m):\r\n if check(List,h,j)==True:\r\n return True\r\n return False\r\n \r\nn,m = map(int,input().split())\r\ncount = 0\r\nList = []\r\nfor i in range(n):\r\n String = int(input())\r\n List.append([int(d) for d in str(String)])\r\nfor h in range(n):\r\n if true(List,h,m)==True:\r\n count+=1\r\nprint(count)", "\r\ns = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\ng = []\r\nmaxm = [0 for i in range(m)]\r\nfor i in range(n):\r\n s = input()\r\n g.append(s)\r\n for j in range(m):\r\n maxm[j] = max(maxm[j],int(s[j]))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if int(g[i][j])==maxm[j]:\r\n count+=1\r\n break\r\n\r\nprint(count)", "n, m = map(int, input().split())\r\n\r\n# read the gradebook\r\ngrades = [input() for i in range(n)]\r\n\r\n# find the maximum grade for each subject\r\nmax_grades = [max([int(grades[i][j]) for i in range(n)]) for j in range(m)]\r\n\r\n# count the number of successful students\r\nsuccessful = sum([1 for i in range(n) if any([grades[i][j] == str(max_grades[j]) for j in range(m)])])\r\n\r\nprint(successful)\r\n", "\r\ndata = input().split()\r\n\r\nN, M = int(data[0]), int(data[1])\r\n\r\nmarks = [None] * N\r\nfor i in range(N):\r\n marks[i] = input()\r\n\r\nanswer = 0\r\nsubj = []\r\nif N == 1:\r\n print(N)\r\nelse:\r\n for i in range(N):\r\n tmp_answer = 0\r\n for col in range(M):\r\n flag = 1\r\n for j in range(N):\r\n if int(marks[j][col]) > int(marks[i][col]):\r\n flag = 0\r\n if flag == 1:\r\n tmp_answer = 1\r\n if tmp_answer == 1:\r\n answer += 1\r\n\r\n print(answer)", "n,m=map(int,input().split())\r\nlist1=[]\r\nfor i in range(n):\r\n \r\n ll=list(map(int,input()))\r\n list1.append(ll)\r\nlist2=[]\r\nfor i in range(m):\r\n mm=0\r\n for j in range(n):\r\n if(list1[j][i] >mm):\r\n mm=list1[j][i]\r\n list2.append(mm)\r\nset1=set() \r\nfor i in range(n):\r\n for j in range(m):\r\n if(list1[i][j]==list2[j]):\r\n set1.add(i)\r\nprint(len(set1))", "\r\nn,m=map(int,input().split())\r\nl=[]\r\nk=[]\r\nfor i in range(n):\r\n\tl.append(list(input()))\r\nfor i in range(m):\r\n\ta=[]\r\n\r\n\tfor j in range(n):\r\n\t\ta.append(int(l[j][i]))\r\n\tfor p in range(len(a)):\r\n\t\tif(max(a)==a[p]):\r\n\t\t\tif(p not in k):\r\n\t\t\t\tk.append(p)\r\n\tif(len(k)==n):\r\n\t\tbreak\r\nprint(len(k))\r\n\r\n", "n,m=[int(x) for x in input().split()]\r\nd={}\r\nfor i in range(n):\r\n t=[int(j) for j in list(input())]\r\n d[i+1]=t\r\nsuccessful=[]\r\nfor j in range(m):\r\n max=0\r\n for stu in range(1,n+1):\r\n if d[stu][j]>max:\r\n max=d[stu][j]\r\n for stu in range(1,n+1):\r\n if d[stu][j]==max and stu not in successful:\r\n successful.append(stu)\r\nprint(len(successful))\r\n\r\n \r\n\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nl1=[[]]*m\r\ns=set()\r\nfor i in range(n):\r\n a=input()\r\n l.append(a)\r\nfor i in range(m):\r\n mx=-1\r\n for j in range(n):\r\n if int(l[j][i])>mx:\r\n mx=int(l[j][i])\r\n for j in range(n):\r\n if int(l[j][i])==mx:\r\n l1[i].append(j)\r\nfor i in range(m):\r\n for j in range(len(l1[i])):\r\n s.add(l1[i][j])\r\nprint(len(s))\r\n\r\n ", "n, m = map(int, input().split())\ndata = []\nbest = m*[0]\nfor i in range(n):\n grades = list(map(int, input().strip()))\n for j, grade in enumerate(grades):\n best[j] = max(best[j], grade)\n data.append(grades)\ncount = 0\nfor i in range(n):\n grades = data[i]\n for j, grade in enumerate(grades):\n if grade == best[j]:\n count += 1\n break\nprint(count)\n", "n, m = map(int, input().split())\r\nr = [input() for _ in range(n)]\r\ntable = [max(i) for i in zip(*r)]\r\nprint(sum(any(i[idx] == table[idx] for idx in range(m)) for i in r))", "n, m = map(int, input().split())\ns = [input() for i in range(n)]\n\na = [0] * n\n\nans = 0\nfor i in range(m):\n mx = 0\n tmp = []\n for j in range(n):\n if ord(s[j][i]) > mx:\n mx = ord(s[j][i])\n tmp = []\n if ord(s[j][i]) == mx:\n tmp.append(j)\n for j in tmp:\n a[j] = 1\n\nprint(sum(a))\n", "z = []\r\nw = []\r\nq = []\r\nz[0:] = map(int,input().split())\r\nfor i in range(z[0]):\r\n w[0:] = map(int,input())\r\n q.append(w[:])\r\nnewlst = []\r\nlst = []\r\nfor i in range(z[1]):\r\n for j in range(z[0]):\r\n lst.append(q[j][i])\r\n newlst.append(lst[::])\r\n lst = []\r\nnew = []\r\nfor i in range(z[1]):\r\n for j in range(z[0]):\r\n if max(newlst[i]) == newlst[i][j] and j not in new and max(newlst[i]) != min(newlst[i]):\r\n new.append(j)\r\n elif len(newlst[i]) == 1 and j not in new:\r\n new.append(j)\r\n elif max(newlst[i]) == min(newlst[i]) and j not in new:\r\n new.append(j)\r\n\r\nprint(len(new))", "n,m=map(int,input().split())\r\nl=[]\r\no=[]\r\nfor i in range(n):\r\n k=list(input())\r\n l.append(k)\r\n\r\nfor i in range(m):\r\n e=0\r\n pp=[]\r\n for j in range(n):\r\n if(int(l[j][i])==e):\r\n pp.append(j)\r\n \r\n if(int(l[j][i])>e):\r\n pp.clear()\r\n e=int(l[j][i])\r\n pp.append(j)\r\n \r\n for j in range(len(pp)):\r\n o.append(pp[j])\r\no=list(set(o))\r\nprint(len(o))\r\n \r\n\r\n ", "n, m = [int(x) for x in input().split()]\r\nl = []\r\nfor i in range(n):\r\n\tl.append(input())\r\nans = 0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tfor k in range(n):\r\n\t\t\tif i == k:\r\n\t\t\t\tcontinue\r\n\t\t\tif l[i][j] < l[k][j]:\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tans += 1\r\n\t\t\tbreak\r\nprint(ans)", "n, m = (int(i) for i in input().split())\ngrades = [input() for _ in range(n)]\nres = set()\nfor subj in zip(*grades):\n ma = max(subj)\n for i, g in enumerate(subj):\n if g == ma:\n res.add(i)\nres = len(res)\nprint(res)\n", "n, m = map(int, input().split())\ns = []\nfor i in range(n):\n s += [input()]\nr = [\"\"]*m\nfor i in range(m):\n for j in range(n):\n r[i] += s[j][i]\n\nstud = set()\nfor sub in r:\n rates = [int(i) for i in sub]\n m = max(rates)\n for i,c in enumerate(rates):\n if c == m:\n stud.add(i)\n\nprint(len(stud))\n", "n,m = map(int,input().split())\r\narr = []\r\nfor i in range(n):\r\n lst = list(map(int,input()))\r\n arr.append(lst)\r\narr2 = []\r\nfor i in range(m):\r\n lst = []\r\n for j in range(n):\r\n lst += [arr[j][i]]\r\n arr2.append(lst)\r\nlstn = [0]*n\r\nfor i in range(m):\r\n maxi = max(arr2[i])\r\n for j in range(n):\r\n if arr2[i][j]==maxi:\r\n lstn[j]=1\r\nprint(lstn.count(1))\r\n\r\n\r\n", "n, m = map(int, input().split())\ngradebook = []\nfor _ in range(n):\n gradebook.append(input())\n\n\n# def solve1():\n# count = 0\n# for student in range(n):\n# successfull = False\n# for subject in range(m):\n# score = gradebook[student][subject]\n# maxi = True\n# for i in range(n):\n# if gradebook[i][subject] > score:\n# maxi = False\n# break\n# if maxi:\n# successfull = True\n# break\n# if successfull:\n# count += 1\n# return count\n\n\ndef solve2():\n # get max for every subject\n subjects_max = []\n for subject in range(m):\n maxi = \"-1\"\n for student in range(n):\n maxi = max(maxi, gradebook[student][subject])\n subjects_max.append(maxi)\n # print(subjects_max)\n\n # check for every student if it has one max\n count = 0\n for student in range(n):\n for subject in range(m):\n if gradebook[student][subject] == subjects_max[subject]:\n count += 1\n break\n return count\n\n\nprint(solve2())\n# print(solve1())\n", "n, m = map(int, input().split())\r\nbest = [False for _ in range(n)]\r\n\r\nfor sub in zip(*[input() for _ in range(n)]):\r\n maxs = max(sub)\r\n for i in range(n):\r\n if sub[i] == maxs:\r\n best[i] = True\r\n\r\nprint(best.count(True))\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################", "n,m = list(map(int,input().split(\" \")))\r\nsuccessful=[False]*n\r\nmarks=[]\r\nfor _ in range(n):\r\n marks.append(list(map(int,list(input()))))\r\nfor sub in range(m):\r\n best=0\r\n for i in range(n):\r\n if marks[i][sub]>best:\r\n best=marks[i][sub]\r\n for i in range(n):\r\n if marks[i][sub]==best:\r\n successful[i]=True\r\nprint(successful.count(True))", "import sys\r\nimport math\r\n\r\nn, m = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nmaxarr = [1] * m\r\n\r\nk = []\r\nfor i in range(n):\r\n st = sys.stdin.readline()\r\n kk = []\r\n for j in range(m):\r\n kk.append(int(st[j]))\r\n if(int(st[j]) > maxarr[j]):\r\n maxarr[j] = int(st[j])\r\n \r\n k.append(kk)\r\n \r\nr = [0] * n\r\nfor j in range(m):\r\n for i in range(n):\r\n if(k[i][j] == maxarr[j]):\r\n r[i] = 1\r\n\r\nres = 0\r\nfor i in r:\r\n if(i == 1):\r\n res += 1 \r\nprint(res)\r\n \r\n\r\n ", "def solution():\r\n n,m = [int(i) for i in input().split(\" \")]\r\n cases = [input() for _ in range(n)]\r\n #go through every single subject and every single person\r\n count = set()\r\n for i in range(m):\r\n best_score = 0\r\n person_count = set()\r\n for index,x in enumerate(cases):\r\n if int(x[i]) > best_score:\r\n person_count = set()\r\n person_count.add(index)\r\n best_score = int(x[i])\r\n elif int(x[i]) == best_score:\r\n person_count.add(index)\r\n for i in person_count:\r\n count.add(i)\r\n \r\n\r\n print(len(count))\r\n\r\nsolution()\r\n " ]

[ "import math\r\nnumbers = input('')\r\n\r\nnumbers = numbers.split(' ')\r\nnumbers = [int(i) for i in numbers]\r\n\r\nn = numbers[0]\r\nm = numbers[1]\r\na = numbers[2]\r\nb = numbers[3]\r\n\r\nwithout_special = n * a\r\nwith_special = ((math.ceil(n / m) * m) / m) * b\r\nhybrid = (math.floor(n / m) * b) + ((n % m) * a)\r\n\r\nprint(int(min(without_special, with_special, hybrid)))", "# Ann has recently started commuting by subway. We know that a one ride subway ticket costs a rubles. Besides,\r\n# Ann found out that she can buy a special ticket for m rides (she can buy it several times). It costs b rubles. Ann\r\n# did the math; she will need to use subway n times. Help Ann, tell her what is the minimum sum of money she will\r\n# have to spend to make n rides?\r\n\r\n# Input The single line contains four space-separated integers n, m, a, b — the number of rides Ann has planned,\r\n# the number of rides covered by the m ride ticket, the price of a one ride ticket and the price of an m ride ticket.\r\n\r\n# Output\r\n# Print a single integer — the minimum sum in rubles that Ann will need to spend.\r\n\r\nvl = input().split()\r\n\r\n# the number of rides Ann has planned\r\nn = int(vl[0])\r\n# the number of rides covered by the m ride ticket\r\nm = int(vl[1])\r\n# the price of a one ride ticket\r\na = int(vl[2])\r\n# the price of an m ride ticket\r\nb = int(vl[3])\r\n\r\nonerideminimal = n\r\n\r\nif (n / m) >= (n//m):\r\n mminimaltickets = n//m + 1\r\nelse:\r\n mminimaltickets = n/m\r\n\r\nminimal_spend = n*a\r\nfor i in range(mminimaltickets+1):\r\n for j in range(onerideminimal+1):\r\n t_rides = i * m + j\r\n cost = i * b + j * a\r\n if t_rides >= n:\r\n if cost <= minimal_spend:\r\n minimal_spend = cost\r\n\r\n\r\nprint(minimal_spend)\r\n", "def calculate_min_cost(n, m, a, b):\r\n result1 = ((n % m) * a) + (int(n // m) * b)\r\n result2 = n * a\r\n result3 = b + (int(n // m) * b)\r\n \r\n if result1 > result2 and result3 > result2:\r\n return result2\r\n elif result2 > result3 and result1 > result3:\r\n return result3\r\n else:\r\n return result1\r\n\r\nn, m, a, b = map(int, input().split())\r\nresult = calculate_min_cost(n, m, a, b)\r\nprint(result)\r\n", "n,m,a,b = map(int,input().split())\r\nif (m*a >b):\r\n rem = n%m * a\r\n if rem>b:\r\n print(n // m * b + b)\r\n else:\r\n print(n // m * b + rem)\r\nelse:\r\n print(n*a)\r\n", "n, m, a, b = map(int, input().split())\r\nanswer = a * n\r\nfor i in range(1, 1001):\r\n answer = min(answer, b * i + a * max(0, n - m * i))\r\nprint(answer)", "n, m, a, b = map(int, input().split())\r\np = 1\r\n\r\nx = 0\r\ny = 0\r\n\r\nlowest = (n * a)\r\n\r\nwhile y >= 0:\r\n\r\n y = n - (m * x)\r\n\r\n if y >= 0:\r\n cost = (x * b) + (y * a)\r\n if cost < lowest:\r\n lowest = cost\r\n\r\n x += 1\r\n\r\nx = 0\r\ny = 0\r\n\r\nwhile x >= 0:\r\n\r\n q = (n - (p * y))\r\n x = q // m\r\n\r\n if q % m != 0:\r\n x += 1\r\n\r\n if x >= 0:\r\n cost = (x * b) + (y * a)\r\n if cost < lowest:\r\n lowest = cost\r\n\r\n y += 1\r\n\r\nprint(lowest)\r\n", "#yousef\r\nn,m,a,b=map(int, input().split())\r\nc=(n//m)*b\r\nd=n*a\r\nw=n%m\r\nprint(min(d,c)+min((w*a,b)))", "n, m, a, b = map(int, input().split())\r\ncount = 0\r\nif b/m < a:\r\n count += ((n-(n%m))//m)*b + min((n%m)*a, b)\r\nelse:\r\n count += n*a\r\nprint(count)", "n , a , b , c = map(int , input().split())\r\nif (c / a) < b:\r\n if b * (n % a) < c:\r\n print(c * (n // a) + b * (n % a))\r\n else:\r\n print(c * (n // a + 1))\r\nelse:\r\n print(n * b)", "# a - 1 билет, m проездов за b рублей, n раз нужно воспользоваться метрополитеном.\r\nn, m, a, b = map(int, input().split())\r\nq1 = a * n\r\n\r\nq2 = ((n // m) * b) + ((n % m) * a)\r\n\r\nq3 = (n // m + 1) * b\r\nprint(min(q1, q2, q3))\r\n\r\n# 10 3 5 1 -> 4", "\r\nn , m , a , b = map(int , input().split())\r\n\r\ndef func():\r\n \r\n if b/m > a :\r\n return n*a\r\n \r\n pr = ( n//m)*b\r\n rem = n%m\r\n if rem * a < b :\r\n pr += (rem * a)\r\n else :\r\n pr += b\r\n \r\n return pr\r\n\r\n# print( b/m ) \r\n\r\nprint(func())", "from math import *\r\nn,m,a,b = map(int,input().split())\r\nres = n*a\r\nfor i in range(0,n+1):\r\n # i为个人票数\r\n j = ceil((n-i)/m)\r\n res = min(res,i*a+j*b)\r\nprint(res)\r\n \r\n \r\n\r\n\r\n", "(n,m,a,b)=map(int,input().split())\r\np=0\r\nk=n\r\nwhile(n>=m):\r\n p=p+b\r\n n=n-m\r\nif(n*a>b):\r\n p=p+b\r\nelse:\r\n p=p+n*a\r\nif(p>k*a):\r\n print(k*a)\r\nelse:\r\n print(p)", "n, m, a, b = [int(x) for x in input().split()]\r\nif m >= n and b <= n*a: print(b)\r\nelif m >= n and b > n*a: print(n*a)\r\nelif m < n and m*a <= b: print(n*a)\r\nelif m < n and m*a > b and b < n%m * a: print(b*(int(n-0.1)//m + 1))\r\nelif m < n and m*a > b and b >= n%m * a: print(n//m *b + n%m * a)", "#Coder_1_neel\r\nn, m, a, b = map(int, input().split())\r\n\r\nindividual_ticket_cost = n * a\r\n\r\n\r\nm_ride_tickets_cost = (n // m) * b + min((n % m) * a, b)\r\n\r\nmin_cost = min(individual_ticket_cost, m_ride_tickets_cost)\r\n\r\nprint(min_cost)\r\n\r\n", "n,m,a,b=map(int,input().split())\r\nif m*a>b:\r\n r=(n%m)*a\r\n if r>b:\r\n print(n//m*b+b)\r\n else:\r\n print(n//m*b+r)\r\nelse:\r\n print(n*a)", "n, m, a, b = map(int, input().split(\" \"))\r\n\r\nprint(min(n * a, (n // m) * b + min(n % m * a, b)))", "n,m,a,b=map(int, input().split())\r\nprint(min((n // m)*b + (min((n%m)*a,b)), (a*n)))", "n,m,a,b = map(int, input().split())\r\nsum = 0\r\nwhile(n>=m):\r\n if a*m>b:\r\n sum = sum + b\r\n n = n-m\r\n else:\r\n sum = sum + (n-m+1)*a\r\n n = m-1\r\nif n*a>b:\r\n sum = sum + b\r\nelse:\r\n sum = sum + n*a\r\nprint(sum)", "n, m, a, b = map(int, input().split())\r\n\r\nif b / m < a:\r\n res = (n // m) * b\r\n n = n - m * (n // m)\r\n res += min(a * n, b)\r\nelse:\r\n res = a * n\r\n\r\nprint(res)\r\n", "n, m, a, b = map(int, input().split())\r\n\r\npass_cost = (n // m) * b + min((n % m) * a, b)\r\nindividual_cost = n * a\r\nmin_cost = min(pass_cost, individual_cost)\r\n\r\nprint(min_cost)\r\n", "import sys\nfrom math import ceil\ninput = sys.stdin.readline\n\nn,m,a,b = map(int, input().split())\nprint(min(n*a, (n//m)*b + (n%m)*a, ceil(n/m)*b))", "#initializes scenario\r\nnumbers = input().split(' ')\r\nrides = int(numbers[0])\r\nmTicket = int(numbers[1])\r\nrideCost = int(numbers[2])\r\nmCost = int(numbers[3])\r\n\r\n#if cost per mRide is the same/more expensive than just buyin individual rides\r\nif mCost / mTicket >= rideCost:\r\n print(rides * rideCost)\r\n\r\n#cost of buying a mix of individual rides and m tickets/ all m tickets\r\nelse:\r\n print(((rides // mTicket) * mCost) + min((rides % mTicket) * rideCost, mCost))", "import math\ninput_line = input()\n\n[n, m, a, b] = [int(x) for x in input_line.split()]\n\nif n <= m:\n if a <= (b / m):\n print(a * n)\n else:\n print(min(a * n, b))\nelse:\n if a <= (b / m):\n print(a * n)\n else:\n m_tks = math.floor(n / m)\n print(min((m_tks * b + (n - (m * m_tks)) * a, b * (math.ceil(n / m)))))", "n, m, a, b = map(int, input().split())\r\nif b / m < a:\r\n if n % m * a < b:\r\n print(n // m * b + n % m * a)\r\n else:\r\n print(-n//m * -b)\r\nelse:\r\n print(n * a)\r\n", "n, m, a, b = map(int, input().split())\r\n\r\ncost1 = n * a\r\n\r\nnum_special_tickets = n // m\r\nremaining_rides = n % m\r\n\r\nif b < (remaining_rides * a):\r\n cost2 = (num_special_tickets * b) + b\r\nelse:\r\n cost2 = (num_special_tickets * b) + (remaining_rides * a)\r\n\r\nprint(min(cost1, cost2))\r\n", "n, m, a, b = map(int, input().strip().split(' '))\r\n\r\nif b < a*m:\r\n print(b*(n//m) + min(b, a*(n % m)))\r\nelse:\r\n print(a*n)", "n, m, a, b= map(int, input().split())\r\nprint(min(n*a, (n//m)*b+(n%m)*a, (n//m+1)*b))", "n, m, a, b = map(int, input().split())\r\ncost_one_ride = n * a\r\ncost_special_tickets = (n // m) * b + min((n % m) * a, b)\r\nmin_cost = min(cost_one_ride, cost_special_tickets)\r\nprint(min_cost)\r\n", "n,m,a,b=map(int,list(input().split()))\r\nprint(min(a*n, n//m*b+n%m*a, n//m*b+b))", "n,m,a,b=map(int,input().split())\r\nif a*m<b:\r\n print(n*a)\r\nelse:\r\n print(n//m*b+min(b,n%m*a))", "n,m,a,b=map(int,input().split())\r\nif m*a <= b:\r\n print(n*a)\r\nelse:\r\n ans=(n//m)*b\r\n rem=n%m\r\n if rem>0: \r\n one1= (n%m)*a\r\n one2= b \r\n ans+=min(one1,one2)\r\n print(ans)\r\n #print(ans)\r\n \r\n ", "def solve(n,m,a,b):\n if a * m < b:\n print(n*a)\n return\n \n numberOfM = n // m\n if (n - (numberOfM * m))*a > b:\n print((numberOfM + 1)*b)\n return\n\n print((n - (numberOfM * m))*a + numberOfM * b)\n\n\nif __name__==\"__main__\":\n numbers = input().split()\n n = int(numbers[0])\n m = int(numbers[1])\n a = int(numbers[2])\n b = int(numbers[3])\n solve(n,m,a,b)\n\n\n", "n, m, a, b = map(int, input().split())\r\n\r\ncost_individual = n * a\r\n\r\ncost_special = (n // m) * b + min((n % m) * a, b)\r\n\r\nmin_cost = min(cost_individual, cost_special)\r\n\r\nprint(min_cost)\r\n", "n, m, a, b = list(map(int, input().split()))\r\nif b >= m*a:\r\n print(n*a)\r\nelse:\r\n print(min((n//m)*b + n % m*a, ((n+m-1)//m)*b))", "n,m,a,b = map(int,input().split())\r\noc = n*a\r\nrc = (n // m) * b +min((n % m) * a,b)\r\nmc = min(oc,rc)\r\nprint(mc)\r\n", "n, m, a, b = map(int, input().split())\r\nindividual_cost = n * a\r\nticket_cost = (n // m) * b + min((n % m) * a, b)\r\nprint(min(individual_cost, ticket_cost))\r\n", "x = str(input())\r\nc= x.split(\" \")\r\no=list(c)\r\nn=c[0]\r\nm=c[1]\r\na=c[2]\r\nb=c[3]\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nb = int(b)\r\nv,z,l=0,0,0\r\nt=n%m\r\nk=n/m*b\r\nd=n*a\r\ns=(n%m)*a\r\nif m*a<=b:\r\n l=n*a\r\nelse:\r\n l=int((n/m))*b+min(int((n%m))*a,b)\r\nprint(l)", "# https://codeforces.com/problemset/problem/466/A\r\n\r\nx = list(map(int, input().split()))\r\nn = x[0]\r\nm = x[1]\r\na = x[2]\r\nb = x[3]\r\n\r\nif m * a <= b:\r\n print(n * a)\r\nelse:\r\n print((n // m) * b + min((n % m) * a, b))", "n,m,a,b=map(int,input().split())\r\nprint(n//m*min(b,m*a)+min((n%m)*a,b))", "from math import ceil\r\nn, m, a, b = map(int, input().split())\r\nzxc1 = (n // m) * b + (n % m) * a\r\nzxc2 = n * a\r\nzxc3 = ceil(n / m) * b\r\nzxc = [zxc1, zxc2, zxc3]\r\nprint(min(zxc))\r\n\r\n", "n,m,a,b=list(map(int,input().strip().split()))\r\nv1=(n+m-1)//m*b\r\nv2=n//m*b+(n%m)*a\r\nv3=n*a\r\nprint(min(v1,v2,v3))", "l=[int(i) for i in input().split()]\r\nif (l[3]/l[1])>=l[2]:\r\n print(l[0]*l[2])\r\nelse:\r\n print(min(l[3]*(int(l[0]/l[1])+1),l[3]*int(l[0]/l[1])+l[2]*(l[0]-int(l[0]/l[1])*l[1])))\r\n ", "n,m,a,b=map(int,input().split())\r\nif(m*a<=b):\r\n\tprint(n*a)\r\nelse:\r\n\tprint(int(n/m)*b + min(int(n%m)*a,b))", "N, M, A, B = map(int, input().split())# N: Final number of times Ann has to use the subway\n\nif M * A <= B: # Where A are the number of Roubles, M are the number of special rides that she can buy several times\n print(N * A)\nelse:\n print((N // M) * B + min((N % M) * A, B))\n\t\t\t\t \t\t\t \t \t \t\t \t\t \t \t\t \t \t", "n, m, a, b = map(int, input().split())\r\ncost = n * a\r\nif n >= m:\r\n cost = min(cost, (n//m)*b + min((n%m)*a, b))\r\nelse:\r\n cost = min(cost, b)\r\nprint(cost)\r\n", "n,m,a,b=map(int,input().split())\r\nprint(min((n//m+1)*b,min(a*n,a*(n%m)+b*(n//m))))", "def min_cost(n, m, a, b):\r\n # Calculate the cost of using individual rides\r\n cost_individual = n * a\r\n # Calculate the cost of using the special ticket\r\n cost_special_ticket = (n // m) * b + min((n % m) * a, b)\r\n # Choose the minimum cost between individual rides and special ticket\r\n return min(cost_individual, cost_special_ticket)\r\n\r\n# Read input\r\nn, m, a, b = map(int, input().split())\r\n\r\n# Calculate and output the minimum sum in rubles that Ann will need to spend\r\nprint(min_cost(n, m, a, b))\r\n", "n,m,a,b=map(int,input().split())\r\nprint(min(min(n*a,(n//m)*b+(n%m)*a),(n//m)*b+b))", "n, m, a, b = map(int,input().split())\r\nif m > n:\r\n mb = b # n-1 проездов n // m * b за рублей\r\n na = n * a # n проездов за n*a рублей\r\n if na > mb:\r\n print(mb)\r\n else:\r\n print(na)\r\nelse:\r\n mb = n // m * b # n-1 проездов n // m * b за рублей\r\n na = n * a # n проездов за n*a рублей\r\n if na > mb:\r\n if n % m != 0:\r\n if (n - m) * a < b:\r\n print(mb + (n-m)*a)\r\n else:\r\n if b < a:\r\n print(mb + b)\r\n else:\r\n print(mb + a)\r\n else:\r\n print(mb)\r\n else:\r\n print(na)", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the cost of buying m-ride tickets and individual tickets\r\ncost_m_tickets = (n // m) * b + min((n % m) * a, b)\r\ncost_individual_tickets = n * a\r\n\r\n# Choose the minimum cost between the two options\r\nmin_cost = min(cost_m_tickets, cost_individual_tickets)\r\n\r\nprint(min_cost)\r\n", "n, m, a, b = map(int, input().split())\r\nif b/m>=a:\r\n print(a*n)\r\nelse:\r\n d=b//a+1\r\n c=(n//m)*b\r\n if n%m>=d:\r\n print(c+b)\r\n else:\r\n print(c+(n%m)*a)", "\r\n\r\nn,m,a,b=map(int,input().split())\r\nans2=n*a;\r\nt1=b/m;\r\nt2=a;\r\nif (t1<=t2):\r\n if(n<m):\r\n ans=b;\r\n n=0;\r\n else:\r\n ans=int(n/m)*b;\r\n n=n%m;\r\n \r\n if(n!=0):\r\n if(a>b):\r\n ans=ans+b;\r\n else:\r\n ans=ans+(n*a);\r\n \r\n if(ans<ans2):\r\n print(ans)\r\n\r\n else:\r\n print(ans2)\r\nelse:\r\n print(ans2)\r\n\r\n", "def minimum_spending(n, m, a, b):\r\n # 只使用单次票的费用\r\n single_ticket_cost = n * a\r\n \r\n # 使用m次票和（如果需要的话）一些单次票的费用\r\n m_tickets = n // m\r\n remainder_rides = n % m\r\n combo_cost = m_tickets * b + remainder_rides * a\r\n \r\n # 如果剩余的次数用单次票比再买一张m次票贵，那么我们只用m次票\r\n m_only_cost = (m_tickets + 1) * b\r\n \r\n return min(single_ticket_cost, combo_cost, m_only_cost)\r\n\r\n# 输入\r\nn, m, a, b = map(int, input().split())\r\n\r\n# 输出\r\nprint(minimum_spending(n, m, a, b))\r\n", "n,m,a,b=map(int,input().split())\r\ns=0\r\nif m*a>b:\r\n d=n//m\r\n n-=(m*d)\r\n s+=(b*d)\r\n if b<n*a:\r\n n=0\r\n s+=b\r\ns+=n*a\r\nprint(s)\r\n", "import sys\r\n\r\n\r\ndef get_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int_list():\r\n return list(get_ints())\r\n\r\n\r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\nRIDES_COUNT, SPECIAL_RIDES_COUNT, RIDE_PRICE, SPECIAL_RIDES_PRICE = get_ints()\r\n\r\nif SPECIAL_RIDES_COUNT * RIDE_PRICE <= SPECIAL_RIDES_PRICE:\r\n print(RIDES_COUNT * RIDE_PRICE)\r\n exit(0)\r\n\r\nsp_rides = RIDES_COUNT // SPECIAL_RIDES_COUNT\r\nmoney = sp_rides * SPECIAL_RIDES_PRICE\r\n\r\nrides_left = RIDES_COUNT - sp_rides * SPECIAL_RIDES_COUNT\r\n\r\nmoney += min(rides_left * RIDE_PRICE, SPECIAL_RIDES_PRICE)\r\n\r\nprint(money)\r\n", "n, m, a, b = [int(x) for x in input().split()]\r\n\r\nsum_tickets = n * a\r\nsum_subscriptions = (n // m) * b if n % m == 0 else (n // m + 1) * b \r\nsum_t_and_subs = n // m * b + n % m * a\r\n\r\nprint(min(sum_tickets, sum_subscriptions, sum_t_and_subs))", "(n, m, a, b) = map(int, input().split())\r\n\r\ncost = 0\r\n\r\nif a*m > b:\r\n while n > m:\r\n cost += b\r\n n-=m\r\n\r\n # Remaining cost\r\n if n*a > b:\r\n cost += b\r\n else:\r\n cost += n*a\r\nelse:\r\n cost += a*n\r\n\r\nprint(cost)", "n,m,a,b=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nb=int(b)\r\nif (b/m)>=a:\r\n print(n*a)\r\nelse:\r\n sum=int(0)\r\n sum+=b*(n//m)\r\n n=n%m\r\n if n*a<=b:\r\n sum+=(n*a)\r\n else:\r\n sum+=b\r\n print(sum)", "def min_money_spent(n, m, a, b):\n \n ride_tickets_cost = (n // m) * b + min((n % m) * a, b)\n \n \n single_ride_cost = n * a\n \n \n return min(ride_tickets_cost, single_ride_cost)\n\nn, m, a, b = map(int, input().split())\n\nresult = min_money_spent(n, m, a, b)\nprint(result)\n\n\t\t \t \t \t\t\t\t \t \t \t\t \t\t\t \t\t\t\t", "def minimum_cost(n, m, a, b):\r\n return min(n * a, (n // m) * b + min((n % m) * a, b))\r\nn, m, a, b = map(int, input().split())\r\nresult = minimum_cost(n, m, a, b)\r\nprint(result)", "def minimum_cost(n, m, a, b):\n # Calculate the cost of buying individual tickets vs. m ride tickets\n cost_individual = n * a\n cost_m_tickets = (n // m) * b + min((n % m) * a, b)\n\n # Return the minimum cost\n return min(cost_individual, cost_m_tickets)\n\n# Read input values\nn, m, a, b = map(int, input().split())\n\n# Calculate and print the minimum cost\nprint(minimum_cost(n, m, a, b))\n\n \t \t \t \t \t \t\t\t \t", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the cost of buying individual tickets\r\nindividual_cost = n * a\r\n\r\n# Calculate the cost of buying the m-ride tickets\r\nticket_cost = (n // m) * b\r\n\r\n# Calculate the cost of buying the remaining individual tickets\r\nremaining_rides = n % m\r\nif remaining_rides > 0:\r\n remaining_cost = min(remaining_rides * a, b)\r\nelse:\r\n remaining_cost = 0\r\n\r\n# Calculate the total cost\r\ntotal_cost = min(individual_cost, ticket_cost + remaining_cost)\r\n\r\nprint(total_cost)\r\n", "a, b, c, d = map(int, input().split())\nq = a*c\nw = ((a//b)*d) + ((a%b)*c)\ne = (a//b+1)*d\nprint(min(q,w,e))\n \t\t\t\t\t\t\t\t\t\t \t \t\t\t \t \t\t \t\t", "n, m, a, b = map(int, input().split())\r\n\r\nif a > (b/m):\r\n d = int(n/m)\r\n if n % m == 0:\r\n print(d*b)\r\n else:\r\n c = (n-(d*m))*a\r\n f = (d*b)+c\r\n e = (d+1)*b\r\n if f<e:\r\n print(f)\r\n else:\r\n print(e)\r\nelse:\r\n print(n*a)\r\n", "n, m, a, b = map(int, input().split())\r\n\r\ntotal_cost = n * a\r\ncost_ticket = (n // m) * b + min((n % m) * a, b)\r\n\r\nmin_cost = min(total_cost, cost_ticket)\r\nprint(min_cost)", "n,m,a,b=map(int,input().split())\r\nif m*a<=b:\r\n print(n*a)\r\nelse:\r\n print(n//m*b+min((n%m)*a,b))\r\n ", "n, m, a, b = map(int, input().split())\r\n\r\nans = 0\r\n\r\n\r\nif b / m < a:\r\n while n >= m:\r\n n -= m\r\n ans += b\r\n ans += min(n * a, b)\r\n print(ans)\r\nelse:\r\n print(n * a)\r\n", "import math\r\nimport sys\r\n\r\nn,m,a,b = map(int,input().split())\r\n\r\nq = n*a\r\nr=n\r\ns = 0\r\n\r\n\r\nwhile True:\r\n if r==0:\r\n break\r\n if r-m>=0:\r\n r -= m\r\n s+=min(a*m,b)\r\n else:\r\n s+=min(r*a,b)\r\n r = 0\r\n\r\nprint(s)", "n, m, a, b = [int(x) for x in input().split(\" \")]\n\ncost_per_ride_sp = b/m;\n\nif (cost_per_ride_sp < a):\n if(n%m==0):\n cost = int(n/m)*b \n else:\n cost = min(int(n/m)*b+b, int(n/m)*b+(n%m)*a)\n\nelse:\n cost = a*n\n\nprint(cost)\n \n \t\t\t \t \t \t \t \t \t\t \t", "def II():\r\n return(int(input()))\r\ndef LMI():\r\n return(list(map(int,input().split())))\r\ndef I():\r\n return(input())\r\ndef MII():\r\n return(map(int,input().split()))\r\nimport sys\r\ninput=sys.stdin.readline\r\n# import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# from collections import Counter\r\n# int(math.log(len(L)))\r\n# import math\r\n# from collections import defaultdict\r\nmod=10**9+7\r\n# from collections import deque\r\nimport math\r\n\r\n\r\n\r\ndef t():\r\n n,m,a,b=MII()\r\n if a*m<=b:\r\n print(a*n)\r\n else:\r\n print(min((n//m)*b+(n-(n//m)*m)*a,int(math.ceil(n/m))*b))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n\r\n # for _ in range(II()):\r\n # t()\r\n t()", "n , m , a , b = map(int,input().split())\r\ncount = 0\r\nif b / m < a : \r\n while n >= m : \r\n n -= m\r\n count += b\r\n if n * a > b : \r\n count += b\r\n n = 0\r\ncount += n * a\r\nprint(count)", "def min_cost(n, m, a, b):\n return min((n + m - 1) // m * b, n * a, n // m * b + min((n % m) * a, b))\n\n# Take input from the user\nn, m, a, b = map(int, input().split())\n\n# Calculate and print the minimum cost\nprint(min_cost(n, m, a, b))\n\n \t \t \t\t \t\t \t \t\t \t \t\t \t\t", "n1,n2,n3,n4= map(int,input().split())\r\nprint(min(n1*n3,(-n1//n2)*-n4,n1//n2*n4+n1%n2*n3))", "n, m, a, b = map(int, input().split())\r\nif m*a<= b:print(n*a)\r\nelse: print((n//m)*b+min((n%m)*a,b))", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the minimum cost\r\nif m * a <= b:\r\n # It's cheaper to buy individual tickets for each ride\r\n cost = n * a\r\nelse:\r\n # It's cheaper to buy an abonement and use it for m rides, and pay the rest individually\r\n cost = (n // m) * b + min((n % m) * a, b)\r\n\r\nprint(cost)\r\n", "from math import ceil\r\nn, m, a, b = map(int, input().split())\r\nprint(min(b * i + max(0, n - m * i) * a for i in range(ceil(n / m) + 1)))\r\n\r\n ", "n,m,a,b=map(int,input().split())\r\noneride=b/m\r\nif oneride>=a:\r\n print(n*a)\r\nelse:\r\n print(min((((n//m)*b+(n%m)*a),((n//m)+1)*b)))\r\n \r\n", "inp = [int(i) for i in input().split()]\r\ntrips = inp[0]\r\nsrides = inp[1]\r\ncost = inp[2]\r\nscost = inp[3]\r\n\r\ntotal = 0\r\navg_scost = scost/srides\r\n\r\nif avg_scost >= cost:\r\n total = cost * trips\r\nelse:\r\n while trips >= srides:\r\n total += scost\r\n trips -= srides\r\n \r\n if trips * cost > scost:\r\n total += scost\r\n else:\r\n total += trips * cost\r\n\r\nprint(total)", "\r\ns = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\na = int(s[2])\r\nb = int(s[3])\r\ns = 0\r\nif b< m * a:\r\n s += (n // m) * b\r\n if (n % m) * a < b:\r\n s += (n % m) * a\r\n else:\r\n s += b\r\nelse:\r\n s += n * a\r\nprint(s)", "n, m, a, b = map(int, input().split())\r\nanss = float('inf')\r\n\r\nfor i in range(1001):\r\n w = n - i * m\r\n if w > 0:\r\n ans = w * a\r\n else:\r\n ans = 0\r\n ans = ans + i * b\r\n if ans < anss:\r\n anss = ans\r\nprint(anss)# 1698059147.4799483", "x, y, a, b = map(int, input().split())\n\ncost1 = x * a\ncost2 = (x // y) * b + min((x % y) * a, b)\nminsum = min(cost1, cost2)\n\nprint(minsum)\n\n \t\t\t\t \t\t \t \t\t \t \t \t \t\t\n \t\t\t \t \t \t \t \t \t\t\t", "quantity, season_ticket, cost_1, cost_ticket = map(int, input().split())\r\nq = quantity // season_ticket + 1\r\nmin_sum = []\r\nfor i in range(q):\r\n min_sum.append((i * cost_ticket) + (quantity - i * season_ticket) * cost_1)\r\nmin_sum.append(q * cost_ticket)\r\nprint(min(min_sum))", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the minimum cost\r\nif m * a <= b:\r\n min_cost = n * a\r\nelse:\r\n min_cost = (n // m) * b + min((n % m) * a, b)\r\n\r\n# Print the result\r\nprint(min_cost)\r\n", "n, m, a, b = map(int, input().split())\r\nk = n // m\r\nans = n * a\r\n\r\nfor i in range((2 * n) // m + 1):\r\n r = n - m * i\r\n if r < 0:\r\n r = 0\r\n ans = min(ans, r * a + i * b)\r\n\r\nif n % m == 0:\r\n ans = min(ans, k * b)\r\nelse:\r\n ans = min(ans, (k + 1) * b)\r\n\r\nprint(ans)", "n, m, a, b = map(int, input().split())\r\nm_ride_tickets = n // m\r\nm_ride_cost = m_ride_tickets * b\r\none_ride_cost_for_remaining = min((n % m) * a, b)\r\none_ride_cost = n * a\r\nminimum_cost = min(m_ride_cost + one_ride_cost_for_remaining, one_ride_cost)\r\nprint(minimum_cost)", "from math import ceil\r\n\r\n\r\ndef solve():\r\n\tn, m, a, b = map(int, input().split())\r\n\r\n\treturn int(min(n*a, ((n%m)*a)+((n-(n%m))/m)*b, ceil(n/m)*b))\r\n\r\nprint(solve())", "from math import ceil\r\nn, m, a, b = [int(x) for x in input().split()]\r\nvalue = (n // m) * b\r\nost = n % m\r\nvalue += min(a * ost, b)\r\nprint(min(value, a * n))\r\n", "n,m,a,b = map(int,input().split())\r\nn1= int(n)\r\nm1= int(m)\r\na1=int(a)\r\nb1=int(b)\r\nc = (n1//m1)*b1+(n1%m1)*a1\r\nl = ((n1//m1)+1)*b1\r\nq = n1*a1\r\nif q <= c and q <= l:\r\n print(q)\r\nelif c < l and c < q:\r\n print(c)\r\nelif l <= c and l < q:\r\n print(l)\r\n\r\n\r\n\r\n\r\n", "n, m, a, b=map(int, input().split())\r\nif m*a<b:\r\n print(a * n)\r\nelif m>n and b<a*n:\r\n print(b)\r\nelse:\r\n print(b*(n//m)+min(a*(n%m), b))", "n, m, a, b = input().split()\r\nn, m, a, b = int(n), int(m), int(a), int(b)\r\n\r\nprice_1 = n * a\r\nprice_2 = n // m * b + n % m * a\r\nprice_3 = (n // m + 1) * b\r\n\r\nprint(min(price_1, price_2, price_3))\r\n", "\r\n\r\nn, m, a, b = map(int, input().split())\r\n\r\n\r\ncost = 0\r\nif n > m:\r\n single_ride = m * a\r\n\r\n rides = n // m\r\n\r\n n = n - (rides * m)\r\n if single_ride < b:\r\n cost = single_ride * rides\r\n else:\r\n cost = b * rides\r\n\r\n\r\nreq = n * a\r\nif req < b:\r\n cost += req\r\nelse:\r\n cost += b\r\n\r\n\r\nprint(cost)\r\n", "\r\nfrom math import ceil\r\nfrom sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn,m,a,b=map(int,input().split())\r\nif m*a<=b:\r\n\tprint(n*a)\r\nelse:\r\n\tprint(min(ceil(n/m)*b,(n//m)*b+(n%m)*a))", "n,m,a,b = map(int,input().split())\r\nprint(min(n*a,-n//m*-b,n//m*b+n%m*a))", "n,m,a,b=map(int,input().split())\r\nprint(min(n*a,n//m*b+min(b,n%m*a)))", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn,m,a,b = getints()\r\nprint(min(n*a , (n//m)*b+min(b,(n%m)*a)))", "n,m,a,b=map(int,input().split())\r\nif b/m>a:\r\n print(n*a)\r\nelse:\r\n if n%m*a>b:\r\n print((1+n//m)*b)\r\n else:\r\n \r\n print((n//m)*b+n%m*a)\r\n", "n,m,a,b = list(map(int,input().split()))\r\nif a*m <= b:\r\n print(n*a)\r\nelse:\r\n print(min(n//m*b + n%m*a, (n + m - 1)//m*b))", "\nn, m, a, b = map(int, input().split())\n\nif b // m < a:\n r = n // m\n if n < m:\n if b < n * a:\n print(b)\n else:\n print(n * a)\n else:\n s = r * b\n h = n - r * m\n if h * a < b:\n s += h * a\n print(s)\n else:\n s += b\n print(s)\nelse:\n s = a * n\n print(s)\n\n\t \t\t \t\t\t \t \t\t\t\t \t\t \t\t \t\t", "n,m,a,b=map(int,input().split())\nans2=n*a;\nif (b/m<=a):\n ans=int(n/m)*b;\n n=n%m;\n ans=ans+min(n*a,b)\nelse:\n ans=ans2\nprint(min(ans,ans2))\n\n\n \t\t\t \t\t \t\t\t \t \t\t \t\t \t \t \t \t", "n,m,a,b=list(map(int,input().split()))\r\nret=0\r\nif m*a<b:\r\n ret=n*a\r\nelse:\r\n ret=n//m*b\r\n ret+=min(b,n%m*a)\r\nprint(ret)", "n,m,a,b=list(map(int, input().split()))\r\n\r\nx=max(1, n//m)\r\ny=max(n-x*m, 0)\r\nprint(min(x*b+min(min(1, y)*b, y*a), n*a))", "n, m, a, b = map(int, input().split())\r\n\r\none_ride_cost = n * a\r\n\r\nm_ride_tickets = (n // m) * b\r\nremainder = n % m\r\nif remainder > 0:\r\n m_ride_tickets += min(remainder * a, b)\r\n\r\nresult = min(one_ride_cost, m_ride_tickets)\r\nprint(result)", "n, m, a, b = map(int, input().split())\r\ncost_scenario1 = n * a\r\ncost_scenario2 = (n // m) * b + min((n % m) * a, b)\r\nprint(min(cost_scenario1, cost_scenario2))\r\n", "import math\r\n\r\nn,m,a,b=map(int,input().split())\r\nresult=0\r\nif m*a<=b:\r\n print(a*n)\r\nelse:\r\n result=(n//m)*b+min((n%m)*a,b)\r\n print(int(result))\r\n", "n, m, a, b = map(int, input().split())\r\nprint(min((a*n), (n//m * b + min(n%m * a, b))))", "num_rides, num_rides_ticket, price_one_ticket, price_mult_ticket = map(int, input().split())\n\nnum_mult_tickets = num_rides // num_rides_ticket\n\nprint(min(num_rides * price_one_ticket,\n num_mult_tickets * price_mult_ticket + (num_rides - num_mult_tickets * num_rides_ticket) * price_one_ticket,\n (num_mult_tickets + 1) * price_mult_ticket))\n\n", "n,m,a,b=map(int,input().split())\r\nans2=n*a;\r\nif (b/m<=a):\r\n ans=int(n/m)*b;\r\n n=n%m;\r\n ans=ans+min(n*a,b)\r\nelse:\r\n ans=ans2\r\nprint(min(ans,ans2))\r\n\r\n", "# Wadea #\r\n\r\nfrom math import ceil\r\nfrom math import floor\r\nn,m,a,b = map(int,input().split())\r\nr = n-1\r\nif n % 2 == 0:\r\n if m > n and b < a*n:\r\n print(b) \r\n elif m > n and b > a*n:\r\n print(a)\r\n else:\r\n if b > a*m:\r\n print(a*n)\r\n else:\r\n print(min(ceil(n/m) * b,floor(n/m)*b+a*(n-(floor(n/m))*m))) \r\nelse:\r\n if m > n and b < a*n:\r\n print(b) \r\n elif m > n and b > a*n:\r\n print(a)\r\n else:\r\n if b > a*m:\r\n print(a*n)\r\n else:\r\n print(min(ceil(n/m) * b,floor(n/m)*b+a*(n-(floor(n/m))*m)))\r\n ", "n,m,a,b = map(int,input().split())\r\nz=b/m\r\nif n>m:\r\n if z>a:\r\n print(n*a)\r\n else:\r\n if (n%m)*a > b:\r\n print(int((n//m)*b + b))\r\n else:\r\n print(int((n//m)*b + (n%m)*a))\r\nelse:\r\n if n*a > b:\r\n print(b)\r\n else:\r\n print(n*a)", "n,m,a,b = map(int,input().split())\r\nif m*a >= b:\r\n money = int(n / m) * b + (n % m) * a\r\n if (int((n-0.1)/m)+1) * b < money:\r\n money = (int((n-0.1)/m)+1) * b\r\nelse:\r\n money = n*a\r\nprint(money)", "n, m, a, b = [int(_) for _ in input().split()]\r\nresult = []\r\nfor i in range((n//m)+2):\r\n if (n-i*m)<0:\r\n prix = i*b\r\n result.append(prix)\r\n else:\r\n prix = i*b + (n-i*m)*a\r\n result.append(prix)\r\nprint(min(result))", "n,m,a,b=map(int,input().split(' '))\r\nif(b>=a*m):\r\n print(a*n)\r\nelse:\r\n t = n//m\r\n print((t*b)+min((n-(t*m))*a, b))", "n, m, a, b = map(int,input().split(\" \"))\r\nif a < (b/m):\r\n print(n*a)\r\nelse:\r\n output = (n//m)*b\r\n du = n%m\r\n if (du * a) < b:\r\n output += (du*a)\r\n else:\r\n output += b\r\n print(output)", "from math import ceil\r\nfrom sys import stdin\r\n\r\nn, m, a, b = map(int, stdin.readline().split())\r\n\r\nif b > a * m:\r\n print(a * n)\r\nelse:\r\n print(min(n // m * b + n % m * a, ceil(n / m) * b))\r\n", "n,m,a,b = map(int,input().split())\ncost = 0\ncost2 = 0\n\n\nans1 = n//m\ncost += (ans1 * b)\nleft = n %m\ncost += (a)* left\n\ncost2 += a*n\n\ncost3= 0\n#cost 3 when better to take all m rides\n\ncost3 += (ans1 + 1)*b\n\ncost = min(cost,cost2,cost3)\nprint(cost)", "n,m,a,b=list(map(int, input().split()))\r\n\r\nprint(min((n//m)*b+min(b, (n%m)*a), n*a))", "n,m,a,b=map(float,input().split())\r\nprice=0\r\n\r\nif b/m<a:\r\n price=(n//m)*b\r\n if (n%m)*a>b:\r\n price+=b\r\n else:\r\n \r\n price=price+(n%m)*a \r\n \r\nelse:\r\n price=n*a\r\nprint(int(price)) \r\n", "n, m, a, b = map(int, input().split())\n\ncost1 = n * a\ncost2 = (n // m) * b + min((n % m) * a, b)\nminsum = min(cost1, cost2)\n\nprint(minsum)\n\n \t\t\t\t \t\t \t \t\t \t \t \t \t\t", "n, m, a, b = map(int, input().split())\r\nstoim = 0\r\nif b/m<a:\r\n stoim = (n // m) * b\r\n n = n % m \r\n stoim = stoim + min(b, a*n)\r\nelse:\r\n stoim = a * n\r\nprint(stoim) ", "n,m,a,b=map(int,input().split());print(min(n//m*b+min((n%m)*a,b),a*n))", "from sys import stdin\r\ninput = lambda: stdin.readline().rstrip('\\r\\n')\r\nn,m,a,b = map(int,input().split())\r\nprint(n//m*min(b,m*a)+min((n%m)*a,b))\r\n", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the cost of using one-ride tickets\r\ncost_one_ride = n * a\r\n\r\n# Calculate the cost of using m-ride tickets\r\ncost_m_ride = (n // m) * b + min((n % m) * a, b)\r\n\r\n# Find the minimum cost\r\nmin_cost = min(cost_one_ride, cost_m_ride)\r\n\r\nprint(min_cost)\r\n", "n, m, a, b = map(int, input().split())\r\nprint(min(n*a, (n//m)*b + (n%m)*a, (n+m-1)//m *b))", "import math\r\nn,m,a,b=map(int,input().split())\r\nq=(n/m)//1\r\nfp=(q*b)+((n-(q*m))*a)\r\nsp=n*a\r\ntp=(math.ceil(n/m))*b\r\nl=[fp,sp,tp]\r\nprint(int(min(l)))", "n, m, a, b = list(map(int, input().split()))\r\n\r\ntotal_individual_cost = n * a\r\n\r\nspecial_tickets_needed = n // m\r\ncost_using_special_tickets = special_tickets_needed * b\r\n\r\nremaining_journeys = n % m\r\n\r\nremaining_cost_individual = remaining_journeys * a\r\n\r\nremaining_cost = min(remaining_cost_individual, b)\r\n\r\ntotal_cost = cost_using_special_tickets + remaining_cost\r\n\r\nprint(min(total_individual_cost, total_cost))", "n, m, a, b = map(int, input().split())\r\ne = (n // m) * b + min((n % m) * a, b)\r\nq = n * a\r\nprint(min(e, q))", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the cost of using one-ride tickets for all rides\r\none_ride_cost = n * a\r\n\r\n# Calculate the cost of using m-ride tickets, with an option to buy a one-ride ticket for the remainder\r\nm_ride_tickets_cost = (n // m) * b + min((n % m) * a, b)\r\n\r\n# Choose the minimum cost between using one-ride tickets and using m-ride tickets\r\nprint(min(one_ride_cost, m_ride_tickets_cost))\r\n", "a,b,c,d=map(int,input().split())\r\n\r\nif d/b<c:\r\n if a%b==0:\r\n print((a//b)*d)\r\n else: \r\n if (a%b)*c<d:\r\n print((a//b)*d+(a%b)*c)\r\n else:\r\n print((a//b)*d+d)\r\nelse:\r\n print(a*c)", "n,m,a,b= map(int, input().split(' '))\r\nif m*a>b:\r\n ans= (n//m)*b+ min(b,(n%m)*a) \r\nelse:\r\n ans= n*a\r\nprint(ans)", "n,m,a,b=map(int,input().split())\r\ndp=[0]*(1001)\r\nfor i in range(1,1001):\r\n dp[i]=float('inf')\r\n if i>=m:dp[i]=min(dp[i],dp[i-m]+b)\r\n dp[i]=min(dp[i],dp[i-1]+a)\r\nprint(min(dp[n:1001]))\r\n", "n,m,a,b = map(int, input().split())\r\n\r\ntickets = n // m\r\n\r\nprint(min(n * a,tickets * b + (n - tickets * m) * a,(tickets + 1) * b))", "n,m,a,b=map(int, input().split())\r\nprint(min(((n+m-1)//m)*b, (n//m)*b+(n%m)*a, n*a))", "n, m, a, b = map(int, input().split())\r\n\r\noption_1_cost = n * a\r\n\r\noption_2_cost = (n // m) * b + min((n % m) * a, b)\r\n\r\nmin_cost = min(option_1_cost, option_2_cost)\r\n\r\nprint(min_cost)\r\n", "n, m, a, b = map(int, input().split())\n\n\ncount_special = n/m if m<n else 1\nremain = n%m if count_special > 1 else 0\ncost = remain*a if remain*a < b else b\nspecial_cost = int(count_special)*b if int(count_special)*b < n*a else n*a\nprint(special_cost + cost)\n", "n, m, a, b = map(int, input().split())\r\nprint (min (n * a, n // m * b + min (b, n % m * a)))", "n, m, a, b = map(int, input().split())\nif m*a<=b:\n sum1=n*a;\n print(sum1)\nelse:\n x=(n//m)*b;\n y=min((n%m)*a,b)\n print(x+y)\n\n\t \t \t\t\t\t\t\t \t\t \t\t \t \t \t\t\t", "n, m, a, b = map(int, input().split())\r\n\r\n# n - количество проездов, запланированное Аней\r\n# m - количество проездов, которое покрывает абонемент\r\n# a - цена одного проезда\r\n# b - цена одного абонемента\r\n\r\noh = 0\r\n\r\n\r\nwhile n > 0:\r\n if a * m < b or a * n < b:\r\n n -= 1\r\n oh += a\r\n else:\r\n n -= m\r\n oh += b\r\n\r\nprint(oh)", "n, m, a, b = list(int(num) for num in input().split())\r\n\r\nif b >= m * a:\r\n print(n * a)\r\nelse:\r\n sum_1 = n // m * b + n % m * a\r\n sum_2 = (n // m + 1) * b\r\n if sum_1 <= sum_2:\r\n print(sum_1)\r\n else:\r\n print(sum_2)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 28 15:31:05 2023\r\n\r\n@author: CCLAB\r\n\"\"\"\r\n\r\nn,m,a,b=input().split()\r\nn,m,a,b=int(n),int(m),int(a),int(b)\r\nans=0\r\nif m*a <= b:\r\n ans=n*a\r\nelse:\r\n time=n//m\r\n ans+=time*b\r\n rest=n % m\r\n if rest*a <= b:\r\n ans+=rest*a\r\n else:\r\n ans+=b\r\nprint(ans)", "def main():\r\n n, m, a, b = [int(x) for x in input().split()]\r\n\r\n if a*m < b:\r\n print(a*n)\r\n return\r\n\r\n x = int(n/m)\r\n\r\n y = a*(n-m*x) if a*(n-m*x) <= b else b\r\n print((x*b)+y)\r\n\r\n # if a*(n-x) > b:\r\n # print(b*(x+1))\r\n # return\r\n\r\n # print(a*(n-x) + b*x) \r\n\r\nmain()", "n,m,a,b=map(int,input().split())\r\n#n for plan, m for m-ticket, a for one-ride, b for m-ride\r\nif b/m <= a:\r\n if n%m and n%m*a >= b:\r\n ans = (n//m+1)*b\r\n else:\r\n ans = (n//m)*b + n%m*a\r\n print(ans)\r\nelse:\r\n print(n*a)", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the minimum cost using m ride tickets\r\nmin_cost = min(n % m * a, b)\r\n\r\n# Calculate the minimum cost using one ride tickets\r\nmin_cost += min((n // m) * b, a * n)\r\n\r\nprint(min_cost)", "n, m, a, b=map(int,input().split())\r\np=0\r\nif n%m>0:\r\n p=1\r\nc=min(n*a,int(n/m)*b+n%m*a,int(n/m)*b+p*b)\r\nprint(c)\r\n", "n, m, a, b = map(int, input().split())\r\n\r\nm_tickets = n // m\r\nm_cost = m_tickets * b\r\na_cost = n * a\r\n\r\nif m_tickets == 0:\r\n total_cost = b if b < a_cost else a_cost\r\nelif m_cost > a_cost:\r\n total_cost = a_cost\r\nelse:\r\n total_cost = m_cost\r\n rest_rides = n - (m * m_tickets)\r\n ar_cost = rest_rides * a\r\n\r\n total_cost += ar_cost if ar_cost < b else b\r\n\r\nprint(total_cost)", "n, m, a, b = map(int, input().split())\r\nprint(min(n*a, n//m*b+n%m*a, (n//m + int(n%m > 0)) * b))", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the minimum cost using one-ride tickets only\r\none_ride_cost = n * a\r\n\r\n# Calculate the cost using m-ride tickets\r\n# Buy as many m-ride tickets as needed, then pay the remaining rides individually\r\nm_ride_cost = (n // m) * b + min((n % m) * a, b)\r\n\r\n# Print the minimum cost\r\nprint(min(one_ride_cost, m_ride_cost))\r\n", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the cost of single rides and the cost of using the special ticket\r\ncost_single_rides = n * a\r\ncost_special_ticket = (n // m) * b + min((n % m) * a, b)\r\n\r\n# Determine the minimum cost\r\nmin_cost = min(cost_single_rides, cost_special_ticket)\r\n\r\nprint(min_cost)\r\n", "n,m,a,b = list(map(int,input().split()))\r\nk = n\r\nres = 0\r\nwhile (n > 0):\r\n if (b > m*a):\r\n res = n*a\r\n break\r\n elif (n%m == 0):\r\n res = n//m*b\r\n break\r\n else:\r\n res += (n-n%m)//m*b\r\n res += min(n%m*a,b)\r\n break\r\nprint(res)", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the minimum cost using one-ride tickets\r\nmin_cost_one_ride = n * a\r\n\r\n# Calculate the minimum cost using m-ride tickets\r\nmin_cost_m_ride = (n // m) * b + min((n % m) * a, b)\r\n\r\n# Find the minimum of the two costs\r\nmin_cost = min(min_cost_one_ride, min_cost_m_ride)\r\n\r\nprint(min_cost)\r\n", "import math\r\nn,m,a,b=map(int,input().split())\r\np=n*a\r\nq=math.ceil(n/m)*b\r\nr=(n//m)*b+(n%m)*a\r\nprint(min(p,q,r))", "n,m,a,b=map(int,input().split())\r\nif m*a<=b:\r\n print(n*a)\r\nelse:\r\n print((n//m)*b+min((n%m)*a,b))\r\n", "n, m, b, v = map(int, input().split())\r\ns = min(n * b, (n // m) * v + (n % m) * b)\r\nprint(min(s, (n // m + 1) * v))\r\n", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn,m,a,b=map(int,input().split())\r\n\r\nif a*m<=b:\r\n print(a*n)\r\nelse:\r\n tmp=n//m*b\r\n print(tmp+min(b,(n%m)*a))", "n, m, a, b = list(map(int,input().split()))\r\n\r\nab = b/m\r\n\r\ncnt=0\r\n\r\nif ab<a:\r\n cnt+=(n//m)*b\r\n n%=m\r\n if n*a>b:\r\n cnt+=b\r\n else: \r\n cnt+=n*a\r\n \r\nelse:\r\n cnt+=(n*a)\r\n\r\nprint(cnt)", "import math\nn,m,a,b = map(int,input().split())\n\nif (m*a)>b:\n x = (n%m)*a\n if x>b:\n print((math.floor(n/m)*b)+b)\n else:\n print((math.floor(n/m)*b)+x)\nelse:\n print(n*a)", "import math\r\nimport sys\r\n\r\n# Read input from stdin\r\nn, m, a, b = map(int, sys.stdin.readline().split())\r\n\r\n# Calculate the number of multi-ride tickets\r\nnum_tickets = n // m\r\n\r\n# Calculate the remaining rides\r\nremaining_rides = n % m\r\n\r\n# Calculate the cost of multi-ride tickets and single-ride tickets\r\ncost_multi = num_tickets * b\r\ncost_single = n * a\r\n\r\n# Calculate the cost in the case when it's cheaper to buy another multi-ride ticket\r\ncost_extra_multi = cost_multi + min(remaining_rides * a, b)\r\n\r\n# Print the minimum cost to stdout\r\nprint(min(cost_single, cost_extra_multi))\r\n", "n, m, a, b = map(int, input().split())\r\nindividual_cost = n * a\r\nspecial_ticket_cost = (n // m) * b + min((n % m) * a, b)\r\nmin_cost = min(individual_cost, special_ticket_cost)\r\nprint(min_cost)\r\n", "n, m, a, b = map(int, input().split())\r\nif m*a <= b:\r\n print((n*a))\r\nelse:\r\n print(int((n/m))*b + min((n%m)*a, b))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 15 09:30:32 2023\r\n\r\n@author: pc\r\n\"\"\"\r\n\r\ndef min_spending(n, m, a, b):\r\n # Calculate the cost of buying m-ride tickets only\r\n m_tickets_cost = (n // m) * b + min((n % m) * a, b)\r\n \r\n # Calculate the cost of buying individual single ride tickets\r\n single_tickets_cost = n * a\r\n \r\n # Return the minimum of the two costs\r\n return min(m_tickets_cost, single_tickets_cost)\r\n\r\n# Read input\r\nn, m, a, b = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nresult = min_spending(n, m, a, b)\r\nprint(result)\r\n", "r=input()\r\ns=r.split(\" \")\r\nn=int(s[0])\r\nm=int(s[1])\r\na=int(s[2])\r\nb=int(s[3])\r\nticket=0;cishu=0;price=0\r\nif n%m==0:\r\n ticketmax=n//m\r\nelse:\r\n ticketmax=n//m+1\r\nmini=ticketmax*b\r\nwhile ticket<=ticketmax:\r\n other=n-ticket*m\r\n if other<0:\r\n other=0\r\n price=ticket*b+other*a\r\n if price<mini:\r\n mini=price\r\n ticket+=1\r\nprint(mini)", "\r\n\r\nn,m,a,b=map(int,input().split())\r\nans2=n*a;\r\nt1=b/m;\r\nt2=a;\r\nif (t1<=t2):\r\n di,mod=divmod(n,m)\r\n ans=di*b+min(mod*a,b)\r\nelse:\r\n ans=ans2\r\nprint(min(ans2,ans))\r\n\r\n", "n,m,a,b = map(int, input().split())\r\nnum=n\r\ncoun=0\r\nif m*a>b:\r\n while(n>=b or n>=m):\r\n coun+=b\r\n n-=m\r\n while(n>0):\r\n coun+=min(a,b)\r\n n-=1\r\nelse:\r\n while(n>0):\r\n n-=1\r\n coun+=a\r\nprint(coun)", "n,m,a,b = list(map(int, input().split(\" \")))\r\nration = b/m # cost of one ride\r\n# print(n//m , n%m)\r\nx,y,z = n*a, ((n//m)*b+max((n%m)//m*b, b)) if n//m!=0 else b, ((n//m)*b+(n%m)*a) if n//m!=0 else b\r\n# print(x,y,z, n//m, n%m)\r\nprint(min({x,y,z}))", "import math\nn,m,a,b=map(int,input().split())\nt=int(1e10)\nfor i in range(0,n,m):\n sin=(n-i)*a\n dou=(i//m)*b\n t=min(t,sin+dou)\nprint(min(t,math.ceil(n/m)*b))", "n, m, a, b = map(int, input().split())\r\n\r\nans = 0\r\n\r\nif m * a <= b:\r\n ans = n * a\r\nelse:\r\n ans = (n // m) * b + min((n % m) * a, b)\r\n\r\nprint(ans)\r\n", "def min_cost(n, m, a, b):\r\n # Option 1: Buy m-ride tickets as long as it's cost-effective\r\n cost_option1 = (n // m) * b + min((n % m) * a, b)\r\n\r\n # Option 2: Buy one-ride tickets for each ride\r\n cost_option2 = n * a\r\n\r\n return min(cost_option1, cost_option2)\r\n\r\n# Input\r\nn, m, a, b = map(int, input().split())\r\n\r\n# Output\r\nresult = min_cost(n, m, a, b)\r\nprint(result)\r\n", "n,m,a,b=map(int,input().split())\r\nans=0\r\nif m*a>=b:\r\n rem= int(n%m) * a\r\n if rem>b:\r\n print(int(n/m)*b +b)\r\n else:\r\n print(int(n/m)*b +rem)\r\nelse:\r\n print(n*a)", "from math import *\r\nn,m,a,b = [int(i) for i in input().split()]\r\n\r\npriceSpecial = b / m\r\n\r\nif a <= priceSpecial:\r\n print (a * n)\r\nelse:\r\n SpecialAvailable = n // m\r\n answer1 = (n - SpecialAvailable * m) * a + SpecialAvailable * b\r\n answer2 = ceil (n / m) * b\r\n print (min(answer1,answer2))", "n,m,a,b=map(int,input().split())\nif b>=a*m:\n print(n*a)\nelse:\n sum=0\n quo=n//m\n sum += quo * b\n n=n-quo*m\n \n if b>n*a:\n sum += n*a\n else:\n sum += b\n print(sum)\n", "# 输入数据\r\nn, m, a, b = map(int, input().split())\r\n\r\n# 直接计算使用全单次票的总成本\r\ntotal_cost_single = n * a\r\n\r\n# 计算使用特殊票的最大次数，考虑剩余乘坐次数使用单次票的情况\r\ntotal_cost_m_ticket = (n // m) * b + min((n % m) * a, b)\r\n\r\n# 输出两种方式中较便宜的一种\r\nprint(min(total_cost_single, total_cost_m_ticket))\r\n", "n, m, a, b = map(int, input().split())\r\ncost_m_tickets = (n // m) * b + min((n % m) * a, b)\r\ncost_individual_tickets = n * a\r\nprint(min(cost_m_tickets, cost_individual_tickets))", "n, m,a,b = map(int,input().split())\r\nif n%m == 0:\r\n print(min((n//m)*b, n*a))\r\nelse:\r\n k = n//m\r\n if (k+1)*b < k*b + (n-k*m)*a:\r\n print((k+1)*b)\r\n else:\r\n print(min(n*a,k*b + (n-k*m)*a))\r\n\r\n", "def min_cost(k, m, a, b):\n return min((k + m - 1) // m * b, k * a, k // m * b + min((k % m) * a, b))\n\n\nk, m, a, b = map(int, input().split())\n\n\nprint(min_cost(k, m, a, b))\n \t \t\t\t \t \t\t\t\t \t \t", "n, m, a, b = map(int, input().split())\r\nif a*m<=b:\r\n price=n*a\r\nelse:\r\n price=n//m*b+min((n%m)*a,b)\r\nprint(price)", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the cost of buying individual one-ride tickets for all rides\r\ncost1 = n * a\r\n\r\n# Calculate the cost of buying special tickets and remaining one-ride tickets\r\n# based on the number of special tickets needed\r\nnum_special_tickets = n // m # Number of full sets of m rides\r\nremaining_rides = n % m # Remaining rides not covered by special tickets\r\n\r\n# Calculate the cost of Scenario 2:\r\n# 1. Cost of full sets of special tickets\r\ncost_special_tickets = num_special_tickets * b\r\n# 2. Cost of remaining rides using one-ride tickets if there are any\r\ncost_remaining_rides = remaining_rides * a\r\n\r\n# Calculate the minimum cost by considering two scenarios:\r\n# 1. Buy individual one-ride tickets for all rides\r\n# 2. Buy special tickets for full sets and one-ride tickets for remaining rides\r\nmin_cost = min(cost1, cost_special_tickets + cost_remaining_rides)\r\n\r\n# Calculate the minimum cost by also considering the cost of only buying special tickets\r\nmin_cost = min(min_cost, (num_special_tickets + 1) * b)\r\n\r\nprint(min_cost)\r\n", "n, m, a, b = map(int, input().split())\r\nflag = True\r\nif m * a <= b:\r\n flag = False\r\nif flag:\r\n print(n // m * b + min(n % m * a, b))\r\nelse:\r\n print(n * a)\r\n", "n,m,a,b=map(int,input().split())\r\nif b/m>=a:\r\n print(n*a)\r\nelse:\r\n if n%m==0:\r\n print(int(n/m*b))\r\n else:\r\n x=int(n//m)\r\n y=n%m\r\n if y*a>b:\r\n print((x+1)*b)\r\n else:\r\n print(x*b+y*a)", "a, b, c, d = map(int, input().split())\r\nq = a*c\r\nw=((a//b)*d) + ((a%b)*c)\r\ne=(a//b+1)*d\r\nprint(min(q,w,e))", "l=list(map(int,input().strip().split()))\r\nn=l[0]\r\narr=[]\r\nrides=l[1]\r\none=l[2]\r\nmulti=l[3]\r\na=n//rides\r\nb=n%rides\r\nprice=a*multi+b*one\r\nif b!=0:\r\n rate=multi*(a+1)\r\n arr.append(rate)\r\ncount=n*one\r\narr.append(count)\r\narr.append(price)\r\nprint(min(arr))", "n, m, a, b =map(int, input().split())\r\nx = n * a\r\ny = (n // m)*b+b if n%m else (n//m)*b\r\nz = (n//m)*b + (n%m)*a\r\nprint(min(x,y,z))", "from math import ceil\r\nn1,n2,n3,n4= map(int,input().split())\r\nprint(min(n1*n3,ceil(n1/n2)*n4,n1//n2*n4+n1%n2*n3))", "n,m,a,b=map(int,input().split())\r\nc1=n*a\r\nc2=(n//m)*b+min((n%m)*a,b)\r\nprint(min(c1,c2))\r\n", "n, m, a, b = map(int, input().split())\r\nif m * a >= b:\r\n cost = 0\r\n m_tickets = n // m\r\n cost += m_tickets * b\r\n remaining_tickets = n - (m_tickets * m)\r\n cost += min(remaining_tickets * a, b)\r\n print(cost)\r\nelse:\r\n print(n * a)", "n,m,a,b=map(int,input().split())\r\nx=n//m if(n%m==0) else n//m+1\r\nprint(min(a*n,x*b,n//m*b+(n%m*a)))", "from math import floor\na=input()\nb=a.split(\" \")\nc=[int(x) for x in b]\nif(c[3]/c[1]<c[2]):\n shared=floor(c[0]/c[1])*c[3]+min(((c[0]%c[1])*c[2]),c[3])\n print(shared)\nelse:\n print(c[0]*c[2])", "l=list(map(int,input().split()))\nn=l[0]\nm=l[1]\na=l[2]\nb=l[3]\ntotal_cost=0\nwhile(n>0):\n if(n-m>=0):\n current_cost=min(m*a,b)\n total_cost+=current_cost\n n=n-m\n elif(n-1>=0):\n current_cost=min(a,b)\n total_cost+=current_cost\n if(current_cost==a):\n n=n-1\n elif(current_cost==b):\n n=n-m\nif(m>=l[0]):\n total_cost=min(total_cost,b)\nprint(total_cost)\n \t \t \t \t \t\t\t\t\t\t \t \t \t \t", "n, m, a, b = map(int, input().split())\r\n\r\n# If it's cheaper to buy multiple m-ride tickets than single ride tickets\r\nif b/m <= a:\r\n # Calculate the cost of buying the m-ride tickets\r\n cost = (n // m) * b\r\n # Check if there are any remaining rides to be bought with a single ride ticket\r\n cost += min((n % m) * a, b)\r\nelse:\r\n # If it's cheaper to buy single ride tickets\r\n cost = n * a\r\n\r\nprint(cost)\r\n", "rides_planned, tickets_covered_special, normal_price, special_price = map(int, input().split())\r\n\r\ndp = [0] * 10005\r\ndp[0] = 0\r\nfor i in range(1, rides_planned + 1):\r\n try1 = normal_price + (dp[i - 1] if i - 1 >= 0 else 0)\r\n try2 = special_price + (dp[i - tickets_covered_special] if i - tickets_covered_special >= 0 else 0)\r\n dp[i] = min(try1, try2)\r\n\r\nans = dp[rides_planned]\r\nprint(ans)", "import math\r\n\r\ninner = input().split()\r\nn = int(inner[0])\r\nm = int(inner[1])\r\na = int(inner[2])\r\nb = int(inner[3])\r\n\r\ninitial = math.floor(n/m)\r\nif a*n > initial*b:\r\n nCost = (n%m)*a\r\n if nCost > b:\r\n print(initial*b + b)\r\n else:\r\n print(initial*b + nCost)\r\nelse:\r\n print(a*n)\r\n", "n,m,a,b=map(int,input().split())\nif b/m >= a:\n print(n*a)\nelse:\n k=n%m\n l=n//m\n mmax=(l+1)*b\n maxi=l*b+k*a\n if mmax>=maxi:\n print(maxi)\n else:\n print(mmax)", "n, m, a, b = map(int, input().split())\r\nif a * m <= b:\r\n print(a * n)\r\n exit()\r\nx = n // m\r\nn = n - m * x\r\nv = min(n*a, (n // m + [1, 0][n % m == 0]) * b)\r\nprint(x * b + v)\r\n", "n, m, a, b = map(int, input().split())\r\nl = 0\r\ng = 0\r\ns = 0\r\nif n % m > 0 :\r\n g = n % m\r\nl = l + n // m\r\nif (l * b) < (a * n):\r\n s = l * b\r\nelse:\r\n s =a * n\r\nif b < (a * g):\r\n print(s + b)\r\nelse:\r\n print(s + g * a)", "import math\r\nn,m,a,b=map(int,input().split())\r\nwithoutCard=n*a\r\nwithCard=math.ceil(n/m)*b\r\nwithCard2=1000000000000\r\nif n%m!=0:\r\n withCard2=(n//m)*b+(n%m)*a\r\nprint(min(withCard,withCard2,withoutCard))", "n, m, a, b = map(int, input().split())\r\ns = []\r\ns.append(n * a)\r\nif n % m != 0:\r\n s.append((n // m + 1) * b )\r\n s.append((n // m) * b + (n % m) * a)\r\nelif n % m == 0:\r\n s.append((n // m) * b )\r\nprint(min(s))\r\n", "n, m, a, b = map(int, input().split())\r\nif a * m < b:\r\n print(a * n)\r\nelse:\r\n print((n // m) * b + min((n % m) * a, b))", "n, m, a, b=map(int,input().split())\r\nif b/m>=a: \r\n print(n*a)\r\nelse:\r\n s=(n//m)*b\r\n \r\n x= n%m\r\n \r\n s+=min(x*a,b)\r\n \r\n print(s)\r\n ", "s=input().split()\r\nn=int(s[0]); m=int(s[1]); a=int(s[2]); b=int(s[3])\r\nif (b/m) <a :\r\n d=(n//m)*b\r\n c=(n-((n//m)*m))*a\r\n if c<b :\r\n total=d+c\r\n else:\r\n total=d+b\r\nelse:\r\n total=n*a\r\nprint(total)", "total_rides_required, rides_per_special, cost_per_oneway, cost_per_special = map(int, input().split())\r\n\r\ncost_for_both_type_of_ticket = (total_rides_required // rides_per_special) * cost_per_special \\\r\n + min((total_rides_required%rides_per_special)*cost_per_oneway, cost_per_special)\r\ncost_for_oneway_ticket = total_rides_required * cost_per_oneway\r\nmin_cost = min(cost_for_both_type_of_ticket, cost_for_oneway_ticket)\r\n\r\nprint(min_cost)\r\n", "import math\r\n\r\ntemp = (input())\r\nlist = temp.split()\r\nn = int(list[0])\r\nm = int(list[1])\r\na = int(list[2])\r\nb = int(list[3])\r\nr = b/m\r\n\r\nC1 = n*a\r\nC2 = math.floor(n/m)*b + (n%m)*a\r\nC3 = math.floor(n/m)*b + b\r\n\r\nprint(min(C1,C2,C3))\r\n", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the cost of using individual tickets\r\nindividual_cost = n * a\r\n\r\n# Calculate the cost of using the special m-ride ticket multiple times\r\nspecial_cost = (n // m) * b + min((n % m) * a, b)\r\n\r\n# Choose the minimum between individual and special ticket costs\r\nmin_cost = min(individual_cost, special_cost)\r\n\r\nprint(min_cost)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 8 16:04:56 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn, m, a, b = map(int,input().split())\r\nk = 0\r\nsum = []\r\nwhile (k - 1) * m <= n:\r\n sum.append(b * k + a * max(0, n - k * m))\r\n k += 1\r\nprint(min(sum))", "n = [int(x) for x in input().split()]\r\n\r\nif n[0] % n[1] == 0:\r\n x = (n[0] / n[1]) * n[3]\r\n y = n[0] * n[2]\r\n print(int(min(x,y)))\r\n\r\n\r\n\r\nelse:\r\n a = n[0] % n[1]\r\n rounded_up = -(-(n[0]/n[1]) // 1)\r\n\r\n\r\n x = ((n[0] - a) / n[1] * n[3]) + (a * n[2])\r\n y = n[0] * n[2]\r\n z = rounded_up * n[3]\r\n\r\n print(int(min(x , y , z)))\r\n\r\n\r\n", "n, m, a, b = map(int, input().split())\r\n\r\n# Calculate the cost of buying individual one-ride tickets\r\ncost_one_ride = n * a\r\n\r\n# Calculate the cost of buying m-ride tickets and one-ride tickets as needed\r\ncost_m_ride = (n // m) * b + min((n % m) * a, b)\r\n\r\n# Choose the minimum cost between the two calculated costs\r\nmin_cost = min(cost_one_ride, cost_m_ride)\r\n\r\nprint(min_cost)\r\n", "n,m,a,b=map(int,input().split())\nanswer = min(n*a,n//m*b+min(b,n%m*a))\nprint(answer)\n\t \t\t \t \t \t\t\t\t \t \t\t\t\t \t", "n, m, a, b = map(int, input().split()); _= min(n*a, (n//m)*b + min(b, (n%m)*a)); print(_)\r\n", "numbers = input('')\r\nlisstt = numbers.split(' ')\r\nlistt = [int(lisstt) for lisstt in lisstt]\r\n\r\nn, m, a, b = listt\r\nif a <+ b/m:\r\n print(n*a)\r\n\r\nelse:\r\n if (int(n/m) + 1)* b < b* int(n/m)+ (n - int(n/m)*m)*a:\r\n print(int(n/m + 1)* b)\r\n else:\r\n print(b* int(n/m)+ (n - int(n/m)*m)*a )\r\n", "from math import ceil\r\ns=list(map(int,input().split()))\r\nn=s[0]\r\nm=s[1]\r\na=s[2]\r\nb=s[3]\r\nminim=min(a*n,b*(ceil(n/m)),b*(n//m)+a*(n%m))\r\nprint(minim)\r\n", "rides, ticket_rides, ride_cost, ticket_cost = map(int, input().split())\ndefault = rides * ride_cost\nmax_tickets = rides // ticket_rides\nticket = max_tickets * ticket_cost + (rides - max_tickets * ticket_rides) * ride_cost\nticket_next = (max_tickets + 1) * ticket_cost\nprint(min(default, ticket, ticket_next))\n\t\t\t \t \t\t \t\t\t\t \t \t\t \t \t\t \t", "n, m, a, b = map(int, input().split())\n\nwith_multi = ((n // m) * b) + min(b, ((n % m)*a))\nprint(min(n*a, with_multi))\n", "# https://codeforces.com/problemset/problem/466/A\r\n\r\nn, m, a, b = list(map(int, input().split()))\r\n\r\nif b / m < a:\r\n ac = n % m\r\n ap = ac * a\r\n bc = (n - ac) // m\r\n bp = bc * b\r\n if ap < b:\r\n print(bp + ap)\r\n else:\r\n print(bp + b)\r\nelse:\r\n print(n * a)" ]

[ "MOD = 1000000007\r\ndp = [[[0] * 2 for _ in range(11)] for _ in range(11)]\r\nN = 0\r\ndig = [0] * 11\r\ndigits = 0\r\ndef rec(n, lucky, pre):\r\n global dp\r\n if n == 0:\r\n if lucky == 0:\r\n return 1\r\n else:\r\n return 0\r\n r = dp[n][lucky][pre]\r\n if r != -1:\r\n return r\r\n r = 0\r\n s, e = 0, 9\r\n if pre:\r\n e = dig[n - 1]\r\n for i in range(s, e + 1):\r\n if i == 4 or i == 7:\r\n r += rec(n - 1, lucky - 1, pre and i == e)\r\n else:\r\n r += rec(n - 1, lucky, pre and i == e)\r\n r %= MOD\r\n dp[n][lucky][pre] = r\r\n return r\r\ncnt = [0] * 12\r\ndef find(n, lim):\r\n if n == 0:\r\n return 1\r\n ans = 0\r\n for i in range(lim + 1):\r\n if cnt[i] == 0:\r\n cnt[i] += 1\r\n ans += (find(n - 1, lim - i) * rec(digits, i, 1)) % MOD\r\n cnt[i] -= 1\r\n else:\r\n y = rec(digits, i, 1) - cnt[i]\r\n if y < 0:\r\n y += MOD\r\n cnt[i] += 1\r\n ans += (find(n - 1, lim - i) * y) % MOD\r\n cnt[i] -= 1\r\n ans %= MOD\r\n return ans\r\ndef main():\r\n global digits\r\n M = int(input())\r\n ans = 0\r\n while M > 0:\r\n dig[digits] = M % 10\r\n digits += 1\r\n M //= 10\r\n for i in range(11):\r\n for j in range(11):\r\n dp[i][j][0] = dp[i][j][1] = -1\r\n rec(digits, 0, 1)\r\n dp[digits][0][1] -= 1\r\n for i in range(1, digits + 1):\r\n tmp = rec(digits, i, 1)\r\n for j in range(11):\r\n cnt[j] = 0\r\n f = find(6, i - 1)\r\n ans += (f * tmp) % MOD\r\n ans %= MOD \r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1691150085.2200148" ]

[ "s = input()\r\nd4 = 0\r\nd7 = 0\r\nfor c in s:\r\n if c == '4':\r\n d4 += 1\r\n if c == '7':\r\n d7 += 1\r\nif not d4 and not d7:\r\n print('-1')\r\nelif d4 == d7:\r\n print('4')\r\nelif d4 > d7:\r\n print('4')\r\nelse:\r\n print('7')", "n = input()\r\nprint((7, 4, -1)[-1 if n.count('7') == n.count('4') == 0 else n.count('4') >= n.count('7')])", "### 122 - B. Lucky Substring\r\n\r\ndef solve():\r\n s = input()\r\n \r\n cnt_4 = s.count(\"4\")\r\n cnt_7 = s.count(\"7\")\r\n# print(cnt_4)\r\n# print(cnt_7)\r\n \r\n if cnt_4 == 0 and cnt_7 == 0:\r\n print(\"-1\")\r\n \r\n else:\r\n if cnt_7 > cnt_4:\r\n print(\"7\")\r\n \r\n else:\r\n print(\"4\")\r\n \r\n \r\nfor _ in range(1):\r\n solve()", "a=input()\r\na4=0\r\na7=0\r\nfor i in range(len(a)):\r\n if a[i]=='4':\r\n a4+=1\r\n elif a[i]=='7':\r\n a7+=1\r\nif a4>=a7:\r\n if a4!=0:\r\n print(4)\r\n else:\r\n print(-1)\r\nelse:\r\n print(7)", "a=input()\r\nx,y=[a.count(x)for x in'47']\r\nprint([[4,7][y>x],-1][x<1>y])", "s = input()\ncount4 = count7 = 0\nfor c in s:\n if c == '4':\n count4 += 1\n elif c == '7':\n count7 += 1\nif count4 == 0 and count7 == 0:\n print(-1)\nelif count4 >= count7:\n print(4)\nelse:\n print(7)\n \t\t \t \t \t\t \t \t\t\t \t \t\t\t\t", "s = input()\r\nslist = list(s)\r\nt = int(s)\r\narr = []\r\nfor i in range(len(slist)):\r\n arr.append(slist[i])\r\nif ('4' in arr or '7' in arr):\r\n if(arr.count('4') >= arr.count('7')):\r\n print('4')\r\n elif(arr.count('7') > arr.count('4')):\r\n print('7')\r\nelse:\r\n print('-1')", "s=input()\r\ndict=[0]*11\r\nfor i in s:\r\n dict[int(i)]+=1\r\nif dict[4]<dict[7]:\r\n print(7)\r\nelif dict[4]>=dict[7] and dict[4]!=0:\r\n print(4)\r\nelse:\r\n print(-1)", "s = input()\r\ncount4 = count7 = 0\r\nfor c in s:\r\n if c == '4':\r\n count4 += 1\r\n elif c == '7':\r\n count7 += 1\r\nif count4 == 0 and count7 == 0:\r\n print(-1)\r\nelif count4 >= count7:\r\n print(4)\r\nelse:\r\n print(7)", "s=input()\r\ni=0\r\n\r\nif set(s)=={\"0\"}:\r\n print(-1)\r\nelse:\r\n while s[i]=='0':\r\n i=i+1\r\n z=s[i:]\r\n\r\n hsh=[0]*10\r\n\r\n for i in z:\r\n hsh[int(i)]+=1\r\n\r\n\r\n if hsh[7]<hsh[4]:\r\n print(4)\r\n elif hsh[4]<hsh[7]:\r\n print(7)\r\n elif (hsh[4]==hsh[7]) and hsh[7]!=0:\r\n print(4)\r\n else:\r\n print(-1)\r\n", "import math, array, re\n \ndef read_int():\n return int(input().strip())\n \ndef read_ints():\n return list(map(int, input().strip().split()))\n \ndef read_str():\n return input().strip()\n \ndef read_strs():\n return input().strip().split()\n\nif __name__ == '__main__':\n s = read_str()\n freq = {}\n substrings = re.findall('[47]+', s)\n\n if not substrings:\n print(-1)\n exit()\n \n for string in substrings:\n length = len(string)\n for i in range(length):\n for l in range(i, length):\n candidate = string[i:l+1]\n if freq.get(candidate) == None:\n freq[candidate] = 0\n freq[candidate] += 1\n\n max_freq_value = freq[max(freq, key=lambda k: freq[k])]\n print(min(k for k, f in freq.items() if f == max_freq_value))\n", "string = input()\r\ncount4 = 0\r\ncount7 = 0\r\nfor elem in string:\r\n if elem == '4':\r\n count4 += 1\r\n elif elem == '7':\r\n count7 += 1\r\nif count4 + count7 == 0:\r\n print(-1)\r\nelif count4 >= count7:\r\n print(4)\r\nelse:\r\n print(7)", "n = input()\r\nhashmap = {}\r\nfor i in n:\r\n if i == '4' or i == '7':\r\n if i not in hashmap:\r\n hashmap[i] = 1\r\n else:\r\n hashmap[i] += 1\r\nif len(hashmap) == 0:\r\n print(-1)\r\nelif len(hashmap) == 1:\r\n for i in hashmap.keys():\r\n print(i)\r\nelse:\r\n if hashmap['4'] > hashmap['7'] or hashmap['7'] == hashmap['4']:\r\n print('4')\r\n else:\r\n print('7')", "ed=input()\r\n\r\nrv=0\r\nzx=0\r\nfor i in range(len(ed)):\r\n if ed[i]=='4':\r\n rv+=1\r\n elif ed[i]=='7':\r\n zx+=1\r\n\r\nif rv==0 and zx==0:\r\n print(-1)\r\nelse:\r\n if zx>rv:\r\n print(7)\r\n else:\r\n print(4)", "text = input()\nempat = 0\ntujuh = 0\nfor dt in text:\n if dt == \"4\":\n empat = empat + 1\n elif dt == \"7\":\n tujuh = tujuh + 1\n\nif empat == 0 and tujuh == 0:\n print(-1)\nelif empat >= tujuh:\n print(4)\nelse:\n print(7)\n\nquit()\n\n \t \t \t \t\t\t \t \t \t\t\t", "s = input()\r\nss = s.count('7')\r\nfs = s.count('4')\r\n\r\nif ss == 0 and fs == 0:\r\n print(-1)\r\nelif fs >= ss:\r\n print(4)\r\nelse:\r\n print(7)", "d = {4:0,7:0,-1:1}\r\nstring = input()\r\nfor i in string:\r\n if i==\"4\":\r\n d[4] += 1\r\n elif i==\"7\":\r\n d[7] += 1\r\nprint(max(4,7,-1,key=lambda x:d[x]))", "\r\ns = input()\r\n\r\nfour = s.count(\"4\")\r\nseven = s.count(\"7\")\r\n\r\nif four == 0 and seven == 0:\r\n print(-1)\r\nelif seven > four:\r\n print(7)\r\nelse:\r\n print(4)\r\n", "v = input()\r\nt=t7 = 0\r\nfor c in v:\r\n if c=='4':\r\n t+=1\r\n elif c=='7':\r\n t7+=1\r\nif t==0 and t7==0:\r\n print(-1)\r\nelif t>=t7:\r\n print(4)\r\nelse:\r\n print(7)" ]

[ "ak=int(10**13)\r\nf=int(input())\r\nn,m,List=10000,15000,[]\r\n\r\ndef Fun1(input):\r\n\tif input==0:\r\n\t\treturn (0,1)\r\n\ta,b=Fun1(input>>1)\r\n\ta,b=((2*a*b-a*a)%n,(b*b+a*a)%n)\r\n\tif input&1:\r\n\t\ta,b=(b%n,(a+b)%n)\r\n\treturn (a,b)\r\n\r\nfor j in range(m):\r\n\tif Fun1(j)[0]==f%n:\r\n\t\tList.append(j)\r\n\r\nwhile n<ak:\r\n\tn*=10;\r\n\tTest=[]\r\n\tfor i in List:\r\n\t\tfor j in range(10):\r\n\t\t\tif Fun1(i+j*m)[0]==f%n:\r\n\t\t\t\tTest.append(i+j*m)\r\n\tList=Test;m*=10\r\n\tif List==[]:\r\n\t\tbreak\r\n\r\nif List==[]:\r\n\tprint(-1)\r\nelse:\r\n\tList.sort()\r\n\tprint(List[0])\r\n", "n, m, limn, f, L = 10000, 15000, int(10 ** 13), int(input()), []\r\n\r\ndef F(i):\r\n if i == 0:\r\n return (0, 1)\r\n p, q = F(i >> 1)\r\n p, q = ((2 * p * q - p * p) % n, (q * q + p * p) % n)\r\n if i & 1:\r\n p, q = (q % n, (p + q) % n)\r\n return (p, q)\r\n\r\n\r\nfor i in range(m):\r\n if F(i)[0] == f % n:\r\n L.append(i)\r\n\r\nwhile n < limn:\r\n n *= 10;\r\n Z = []\r\n for i in L:\r\n for j in range(10):\r\n if F(i + j * m)[0] == f % n:\r\n Z.append(i + j * m)\r\n L = Z;\r\n m *= 10\r\n if L == []:\r\n break\r\n\r\nif L == []:\r\n print(-1)\r\nelse:\r\n L.sort()\r\n print(L[0])", "n,m,limn,f,L=10000,15000,int(10**13),int(input()),[]\n\ndef F(i):\n\tif i==0:\n\t\treturn (0,1)\n\ta,b=F(i>>1)\n\ta,b=((2*a*b-a*a)%n,(b*b+a*a)%n)\n\tif i&1:\n\t\ta,b=(b%n,(a+b)%n)\n\treturn (a,b)\n\nfor i in range(m):\n\tif F(i)[0]==f%n:\n\t\tL.append(i)\n\nwhile n<limn:\n\tn*=10;\n\tT=[]\n\tfor i in L:\n\t\tfor j in range(10):\n\t\t\tif F(i+j*m)[0]==f%n:\n\t\t\t\tT.append(i+j*m)\n\tL=T;m*=10\n\tif L==[]:\n\t\tbreak\n\nif L==[]:\n\tprint(-1)\nelse:\n\tL.sort()\n\tprint(L[0])\n", "n, m, limn, f, L = 10000, 15000, int(10 ** 13), int(input()), []\r\n\r\n\r\ndef F(i):\r\n if i == 0:\r\n return (0, 1)\r\n a, b = F(i >> 1)\r\n a, b = ((2 * a * b - a * a) % n, (b * b + a * a) % n)\r\n if i & 1:\r\n a, b = (b % n, (a + b) % n)\r\n return (a, b)\r\n\r\n\r\nfor i in range(m):\r\n if F(i)[0] == f % n:\r\n L.append(i)\r\n\r\nwhile n < limn:\r\n n *= 10;\r\n T = []\r\n for i in L:\r\n for j in range(10):\r\n if F(i + j * m)[0] == f % n:\r\n T.append(i + j * m)\r\n L = T;\r\n m *= 10\r\n if L == []:\r\n break\r\n\r\nif L == []:\r\n print(-1)\r\nelse:\r\n L.sort()\r\n print(L[0])", "mo = 10 ** 13\np = [\n\t1, 60, 300, 1500, 15000, 150000, 1500000, 15000000,\n\t150000000, 1500000000, 15000000000, 150000000000,\n\t1500000000000, 15000000000000\n]\n\nclass mat(object):\n\tdef __init__(self, a, b, c, d):\n\t\tself.a, self.b, self.c, self.d = a, b, c, d\n\tdef times(self, k):\n\t\treturn mat(\n\t\t\t(self.a * k.a + self.b * k.c) % mo,\n\t\t (self.a * k.b + self.b * k.d) % mo,\n\t\t (self.c * k.a + self.d * k.c) % mo,\n\t\t (self.c * k.b + self.d * k.d) % mo\n\t\t)\n\tdef copy(self):\n\t\treturn mat(self.a, self.b, self.c, self.d)\n\nme, mt = mat(1, 0, 0, 1), mat(0, 1, 1, 1)\n\ndef fib(k):\n\tans, t = me.copy(), mt.copy()\n\twhile k > 0:\n\t\tif k & 1:\n\t\t\tans = ans.times(t)\n\t\tt = t.times(t)\n\t\tk >>= 1\n\treturn ans.b\n\ndef gene(a, ta, b, tb, tab):\n\tab = []\n\tfor i in a:\n\t\tfor j in b:\n\t\t\ty = -j // tb - 1\n\t\t\twhile j + y * tb < 0:\n\t\t\t\ty += 1\n\t\t\twhile j + y * tb < tab:\n\t\t\t\tif (j - i + y * tb) % ta == 0:\n\t\t\t\t\tab.append(j + y * tb)\n\t\t\t\ty += 1\n\treturn ab\n\ndef filt(a, f, m):\n\tr = f % m\n\treturn [i for i in a if (fib(i) % m == r)]\n\nif __name__ == '__main__':\n\tf = int(input())\n\ta = filt(list(range(p[1])), f, 10)\n\tb = a[:]\n\n\tfor i in range(2, 14):\n\t\tm = 10 ** i\n\t\tb = gene(a, p[1], b, p[i - 1], p[i])\n\t\tb = filt(b, f, m)\n\n\tprint(min(b) if b else -1)\n", "mod = 10**13\r\n\r\ndef f(n):\r\n if n == 0:\r\n return 0, 1\r\n if n % 2:\r\n a, b = f(n - 1)\r\n return b, (a + b) % mod\r\n a, b = f(n / 2)\r\n return a * (2 * b - a) % mod, (a * a + b * b) % mod\r\n\r\ndef fib(n):\r\n a, _ = f(n)\r\n return a\r\n\r\nv = int(input())\r\n\r\nm, per = 10, 60\r\ncand = []\r\nfor i in range(per):\r\n if fib(i) % m == v % m:\r\n cand.append(i)\r\n\r\nfor i in range(12):\r\n m *= 10\r\n cand = [x + j * per for x in cand for j in range(10) if fib(x + j * per) % m == v % m]\r\n per *= 10\r\n\r\nprint(min(cand) if cand else -1)", "n,m,limn,f,L=10000,15000,int(10**13),int(input()),[]\r\n \r\ndef F(i):\r\n\tif i==0:\r\n\t\treturn (0,1)\r\n\ta,b=F(i>>1)\r\n\ta,b=((2*a*b-a*a)%n,(b*b+a*a)%n)\r\n\tif i&1:\r\n\t\ta,b=(b%n,(a+b)%n)\r\n\treturn (a,b)\r\n \r\nfor i in range(m):\r\n\tif F(i)[0]==f%n:\r\n\t\tL.append(i)\r\n \r\nwhile n<limn:\r\n\tn*=10;\r\n\tT=[]\r\n\tfor i in L:\r\n\t\tfor j in range(10):\r\n\t\t\tif F(i+j*m)[0]==f%n:\r\n\t\t\t\tT.append(i+j*m)\r\n\tL=T;m*=10\r\n\tif L==[]:\r\n\t\tbreak\r\n \r\nif L==[]:\r\n\tprint(-1)\r\nelse:\r\n\tL.sort()\r\n\tprint(L[0])", "\r\nn,m,l,f,L=10000,15000,int(10**13),int(input()),[]\r\n \r\ndef F(i):\r\n\tif i==0:\r\n\t\treturn (0,1)\r\n\tx,y=F(i>>1)\r\n\tx,y=((2*x*y-x*x)%n,(y*y+x*x)%n)\r\n\tif i&1:\r\n\t\tx,y=(y%n,(x+y)%n)\r\n\treturn (x,y)\r\n \r\nfor i in range(m):\r\n\tif F(i)[0]==f%n:\r\n\t\tL.append(i)\r\n \r\nwhile n<l:\r\n\tn*=10;\r\n\tT=[]\r\n\tfor i in L:\r\n\t\tfor j in range(10):\r\n\t\t\tif F(i+j*m)[0]==f%n:\r\n\t\t\t\tT.append(i+j*m)\r\n\tL=T;m*=10\r\n\tif L==[]:\r\n\t\tbreak\r\n \r\nif L==[]:\r\n\tprint(-1)\r\nelse:\r\n\tL.sort()\r\n\tprint(L[0])", "x = int(10 ** 13)\r\nf = int(input())\r\nn, m, List = 10000, 15000, []\r\n\r\n\r\ndef Fun1(input):\r\n if input == 0:\r\n return (0, 1)\r\n a, b = Fun1(input >> 1)\r\n a, b = ((2 * a * b - a * a) % n, (b * b + a * a) % n)\r\n if input & 1:\r\n a, b = (b % n, (a + b) % n)\r\n return (a, b)\r\n\r\n\r\nfor j in range(m):\r\n if Fun1(j)[0] == f % n:\r\n List.append(j)\r\n\r\nwhile n < x:\r\n n *= 10\r\n Test = []\r\n for i in List:\r\n for j in range(10):\r\n if Fun1(i + j * m)[0] == f % n:\r\n Test.append(i + j * m)\r\n List = Test\r\n m *= 10\r\n if List == []:\r\n break\r\n\r\nif List == []:\r\n print(-1)\r\nelse:\r\n List.sort()\r\n print(List[0])\r\n" ]

[ "from sys import stdin\nfrom sys import stdout\nfrom sys import exit\nnm = [int(x) for x in stdin.readline()[:-1].split(' ')]\nn = nm[0]\nm = nm[1]\nmatrice = [[] for z in range(n)]\nfor i in range(n):\n matrice[i] = [int(x) for x in stdin.readline()[:-1].split(' ')]\ncancomplete = False\na = [[0 for i in range(n)] for j in range(m)]\nfor colonna in range(m):\n for riga in range(n):\n a[colonna][riga] = matrice[riga][colonna]\nfor i in range(m):\n for j in range(i, m):\n o = a[:]\n tieni = o[i][:]\n o[i] = o[j][:]\n o[j] = tieni[:]\n #print(o)\n trycomplete = True\n for riga in range(n):\n conto = 0\n for colonna in range(m):\n # print(colonna, o[colonna][riga], conto)\n if o[colonna][riga] != colonna + 1:\n conto += 1\n #o1[riga][colonna] = 1\n if conto > 2:\n trycomplete = False\n cancomplete = cancomplete or trycomplete\n'''for colonna in range(m):\n conto = 0\n for riga in range(n):\n if o1[riga][colonna] == 1:\n conto += 1\n if conto > 1:\n stdout.write('NO')\n exit()'''\nif cancomplete:\n stdout.write('YES')\nelse:\n stdout.write('NO')\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n a0 = [0] + list(map(int, input().split()))\r\n a.append(a0)\r\nans = \"NO\"\r\nfor i in range(1, m + 1):\r\n for j in range(i + 1, m + 1):\r\n ok = 1\r\n for k in range(n):\r\n a0 = a[k]\r\n a0[i], a0[j] = a0[j], a0[i]\r\n c = 0\r\n for l in range(1, m + 1):\r\n if a0[l] ^ l:\r\n c += 1\r\n a0[i], a0[j] = a0[j], a0[i]\r\n if c > 2:\r\n ok = 0\r\n break\r\n if ok:\r\n ans = \"YES\"\r\n break\r\n if ans == \"YES\":\r\n break\r\nok = 1\r\nfor i in range(n):\r\n a0 = a[i]\r\n c = 0\r\n for j in range(1, m + 1):\r\n if a0[j] ^ j:\r\n c += 1\r\n if c > 2:\r\n ok = 0\r\n break\r\nif ok:\r\n ans = \"YES\"\r\nprint(ans)", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\nfrom copy import deepcopy\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\nr, c = rint()\n\nmat = [[] for i in range(r)]\nfor i in range(r):\n mat[i] = list(rint())\n\norimat = deepcopy(mat)\nnotok = 0\nfor i in range(c):\n for j in range(i+1, c):\n mat = deepcopy(orimat)\n for k in range(r):\n mat[k][j], mat[k][i] = mat[k][i], mat[k][j]\n cnt = 0\n for l in range(c):\n if mat[k][l] != l+1:\n cnt += 1\n if cnt > 2:\n break\n else:\n print(\"YES\")\n exit()\n\nmat = deepcopy(orimat)\nfor k in range(r):\n cnt = 0\n for l in range(c):\n if mat[k][l] != l+1:\n cnt += 1\n if cnt > 2:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n", "n, m = [int(i) for i in input().split()]\r\na = [[] for i in range(n)]\r\ndef sw(row, j1, j2):\r\n tmp = a[row][j1]\r\n a[row][j1] = a[row][j2]\r\n a[row][j2] = tmp\r\n\r\nfor i in range(n):\r\n a[i] = list(map(int, input().split()))\r\nCan = False\r\nfor j in range(m):\r\n for j2 in range(j, m):\r\n\r\n fl = True\r\n\r\n for ptr in range(n):\r\n sw(ptr, j, j2)\r\n cnt = 0\r\n for _ in range(m):\r\n cnt += a[ptr][_] != (_ + 1)\r\n if cnt > 2:\r\n fl = False\r\n if fl is True:\r\n Can = True\r\n for ptr in range(n):\r\n sw(ptr, j, j2)\r\n\r\nif Can:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\niden = list(range(1, m + 1))\r\nb = [[int(x) for x in input().split()] for _ in range(n)]\r\ndef run(board):\r\n okay = True\r\n for row in board:\r\n s = 0\r\n for x, y in zip(row, iden):\r\n s += x != y\r\n okay = okay and s in {0, 2}\r\n return okay\r\nokay = run(b)\r\nfor i in range(m):\r\n for j in range(m):\r\n if i == j: continue\r\n B = [row[:] for row in b]\r\n for k in range(n):\r\n B[k][i], B[k][j] = B[k][j], B[k][i]\r\n okay = okay or run(B)\r\nprint('YES' if okay else 'NO')", "def get_perms(perm):\r\n\tperms = {tuple(perm)}\r\n\tfor i in range(len(perm)):\r\n\t\tfor j in range(i+1, len(perm)):\r\n\t\t\tperm_copy = list(perm)\r\n\t\t\tperm_copy[i], perm_copy[j] = perm_copy[j], perm_copy[i]\r\n\t\t\tperms.add(tuple(perm_copy))\r\n\treturn perms\r\n\r\nn, m = map(int, input().split(' '))\r\ngood_perms = get_perms([i for i in range(1, m+1)])\r\nfor i in range(n):\r\n\tperm = list(map(int, input().split(' ')))\r\n\tgood_perms &= get_perms(perm)\r\nif good_perms:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "n, m = map(int, input().strip().split(' '))\r\ng = [list(map(int, input().strip().split(' '))) for i in range(n)]\r\n\r\ndef check(a, b):\r\n\tfor row in g:\r\n\t\trow[a], row[b] = row[b], row[a]\r\n\t\tmis_placed = 0\r\n\t\tfor i in range(1, m + 1):\r\n\t\t\tif row[i - 1] != i: mis_placed += 1\r\n\t\trow[a], row[b] = row[b], row[a]\r\n\t\tif mis_placed > 2: return False\r\n\treturn True\r\n\r\nyes = check(0, 0)\r\nfor a in range(0, m - 1):\r\n\tfor b in range(a + 1, m):\r\n\t\tif check(a, b): yes = True\r\nprint ('YES' if yes else 'NO')", "from copy import deepcopy\r\nn,m=input().split(' ')\r\narray=[]\r\nfor i in range(int(n)):\r\n row=[int(i) for i in input().split(' ')]\r\n array.append(row)\r\n \r\ndef check(ar):\r\n return [i for i in range(len(ar)) if ar[i]!=i+1]\r\n\r\ndef sorting(mass):\r\n if all(len(check(i))<=2 for i in mass):\r\n return 'YES'\r\n\r\n mass2=deepcopy(mass)\r\n k=list()\r\n for i in mass:\r\n if check(i):\r\n k=check(i)\r\n break\r\n\r\n for i in k:\r\n for j in k:\r\n if i==j:\r\n continue\r\n for s in mass2:\r\n s[i],s[j]=s[j],s[i]\r\n\r\n if all(len(check(k))<=2 for k in mass2):\r\n return 'YES'\r\n mass2=deepcopy(mass)\r\n return 'NO'\r\n\r\n\r\nprint(sorting(array)) ", "n,m=map(int,input().split())\r\ndef test(b):\r\n for r in range(n):\r\n cnt = 0\r\n for k in range(m):\r\n cnt += b[r][k] != k+1\r\n if cnt > 2:\r\n return False\r\n return True\r\n\r\na=[[*map(int,input().split())]for _ in range(n)]\r\nif test(a): exit(print('YES'))\r\n\r\nfor j in range(m):\r\n for i in range(j):\r\n b = [r[:]for r in a]\r\n for k in range(n):\r\n b[k][i], b[k][j] = b[k][j], b[k][i]\r\n if test(b):\r\n exit(print('YES'))\r\nprint('NO')", "n, m = list(map(int, input().split()))\r\ntable = [list(map(int, input().split())) for _ in range(n)]\r\neverything = True\r\n\r\ndef swap(t, a, b):\r\n t[a], t[b] = t[b], t[a]\r\n return t\r\n\r\nfor i in range(m):\r\n for j in range(m):\r\n secend_table = [swap(k[:], i, j) for k in table[:]]\r\n\r\n for row in range(n):\r\n wrong = 0\r\n everything = True\r\n for column in range(m):\r\n if secend_table[row][column] != column + 1:\r\n wrong += 1\r\n\r\n if wrong > 2:\r\n everything = False\r\n break\r\n\r\n if everything is True:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "from sys import stdin, stdout\r\n\r\n\r\ndef check():\r\n global numbers\r\n for z in range(n):\r\n cnt = 0\r\n chal = numbers[z][:]\r\n for j in range(m):\r\n if chal[j] != j + 1:\r\n cnt += 1\r\n for k in range(j + 1, m):\r\n if chal[k] == j + 1:\r\n chal[k], chal[j] = chal[j], chal[k]\r\n break\r\n \r\n if cnt > 1:\r\n return 0\r\n else:\r\n return 1\r\n\r\n\r\nn, m = map(int, stdin.readline().split())\r\n\r\nnumbers = []\r\nfor i in range(n):\r\n numbers.append(list(map(int, stdin.readline().split())))\r\n \r\nchallengers = []\r\nfor i in range(m): \r\n for j in range(i, m):\r\n challengers.append((i, j))\r\n \r\n\r\n\r\nlabel = 0\r\n\r\nfor a, b in challengers:\r\n for j in range(n):\r\n numbers[j][a], numbers[j][b] = numbers[j][b], numbers[j][a]\r\n \r\n label = max(check(), label)\r\n \r\n for j in range(n):\r\n numbers[j][a], numbers[j][b] = numbers[j][b], numbers[j][a] \r\n \r\n \r\nif not label:\r\n stdout.write('NO')\r\nelse:\r\n stdout.write('YES')", "import copy\r\nn,m = map(int,input().split())\r\nl = []\r\nfor i in range(n) :\r\n l.append(list(map(int,input().split())))\r\n\r\ndef test_matrix(l) :\r\n test = 1\r\n for i in range(n) :\r\n rem = 0\r\n k = 1\r\n for j in range(m) :\r\n if l[i][j] != j+1 and rem == 0 :\r\n rem = {j+1,l[i][j]}\r\n elif l[i][j] != j+1 and (l[i][j] not in rem) :\r\n k = 0\r\n break\r\n if k == 0 :\r\n test = 0\r\n break\r\n\r\n if test == 0 :\r\n return False\r\n else :\r\n return True\r\n\r\nola = 0\r\n\r\nif test_matrix(l) == True :\r\n ola = 1\r\n\r\n\r\n\r\nfor i in range(m) :\r\n for j in range(i+1,m) :\r\n b = copy.deepcopy(l)\r\n for p in range(n) :\r\n b[p][i],b[p][j] = b[p][j],b[p][i]\r\n\r\n\r\n\r\n if test_matrix(b) == True :\r\n ola = 1\r\n break\r\n\r\n if ola == 1 :\r\n break\r\n\r\n\r\n\r\nif ola == 1 :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n", "from copy import deepcopy\n\nn, m = list(map(int, input().split()))\narr = []\n\nfor i in range(n):\n arr.append(list(map(int, input().split())))\n\ndef solve(arr):\n # print(arr)\n for row in arr:\n count = 0\n for i, num in enumerate(row):\n if i + 1 != num:\n count += 1\n if count > 2:\n return False\n return True\n\ndef permute(arr, i, j):\n arr_ = deepcopy(arr)\n for k in range(n):\n arr_[k][i], arr_[k][j] = arr_[k][j], arr_[k][i]\n # print(arr_)\n return arr_\n\ndef main():\n if solve(arr):\n print(\"YES\")\n return\n\n for row in arr:\n wrong_cols = []\n for i, num in enumerate(row):\n if i + 1 != num:\n wrong_cols.append(i)\n if wrong_cols:\n # print(row, wrong_cols)\n if len(wrong_cols) > 4:\n print(\"NO\")\n return\n for col in wrong_cols:\n if solve(permute(arr, col, row[col] - 1)):\n print(\"YES\")\n return\n print(\"NO\")\n return\n\n print(\"NO\")\n return\n\nmain()", "from sys import stdin\r\n\r\nn, m = (int(x) for x in stdin.readline().split())\r\n\r\ntable = []\r\nfor _ in range(n):\r\n table.append([int(x) for x in stdin.readline().split()])\r\n\r\n\r\ndef tr(l):\r\n return list(map(list, zip(*l)))\r\n\r\n\r\ndef need_one_or_zero_swap(l):\r\n swap = 2\r\n for i, item in enumerate(l):\r\n if item != i + 1:\r\n if swap:\r\n if l[item-1] == i + 1:\r\n swap -= 1\r\n else:\r\n return False\r\n else:\r\n return False\r\n return True\r\n\r\n\r\ndef check_after_global_swap(t):\r\n for row in t:\r\n if not need_one_or_zero_swap(row):\r\n return False\r\n return True\r\n\r\n\r\ndef try_global_swap_first():\r\n if check_after_global_swap(table):\r\n return True\r\n transp = tr(table)\r\n for i in range(len(transp)):\r\n for j in range(i + 1, len(transp)):\r\n transp[i], transp[j] = transp[j], transp[i]\r\n t2 = tr(transp)\r\n if check_after_global_swap(t2):\r\n return True\r\n transp[i], transp[j] = transp[j], transp[i]\r\n return False\r\n\r\nif try_global_swap_first():\r\n print('YES')\r\nelse:\r\n print('NO')\r\n# print(need_one_or_zero_swap([1, 4, 3, 2]))", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n\ndef find(l,r):\n global N,M,A\n B = [x[:] for x in A]\n for i in range(N):\n B[i][l],B[i][r] = B[i][r], B[i][l]\n\n\n check = [x for x in range(1,M+1)]\n for i in range(N):\n num = 0\n for x in range(M):\n if B[i][x]!=check[x]:\n num+=1\n if num>2:\n return False\n return True\n\n\nN,M = map(int,input().split())\nA = [list(map(int,input().split())) for _ in range(N)]\nans = \"NO\"\n\nfor x in range(M):\n for y in range(x,M):\n if find(x,y):\n ans = \"YES\"\n break\nprint(ans)", "from collections import defaultdict\n\ndef getdiff(l):\n diff = []\n for i in range(m):\n if l[i] != i + 1:\n diff.append(l[i])\n return diff\n\nn, m = map(int, input().split())\nt = [list(map(int, input().split())) for i in range(n)]\n\ndiffs = [defaultdict(bool) for i in range(n)]\nfor j in range(m):\n for j2 in range(j, m):\n for i in range(n):\n t[i][j], t[i][j2] = t[i][j2], t[i][j]\n df = getdiff(t[i])\n t[i][j], t[i][j2] = t[i][j2], t[i][j]\n if len(df) == 2:\n diffs[i][tuple(sorted(df))] = True\n\nfor j in range(m):\n for j2 in range(j, m):\n for i in range(n):\n if j != j2 and not diffs[i][(j + 1, j2 + 1)]:\n break\n t[i][j], t[i][j2] = t[i][j2], t[i][j]\n df = getdiff(t[i])\n t[i][j], t[i][j2] = t[i][j2], t[i][j]\n if len(df) > 2:\n break\n else:\n print('YES')\n exit(0)\nprint('NO')\n", "import sys \n#from fractions import Fraction\n#import re\n#sys.stdin=open('.in','r')\n#sys.stdout=open('.out','w')\n#import math \n#import random\n#import time\n#sys.setrecursionlimit(int(1e5))\ninput = sys.stdin.readline\n \n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\ndef inp():\n return(int(input()))\ndef inara():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n################################################################\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\n\t\t\ndef solve():\n\tn,m=invr()\n\tara=[inara() for i in range(n)]\n\tfor i in range(n):\n\t\tfor j in range(m):\n\t\t\tara[i][j]-=1\n\tper=[i for i in range(m)]\n\tfor a in range(m):\n\t\tfor b in range(a,m):\n\t\t\tper[a],per[b]=per[b],per[a]\n\t\t\tflag=True\n\t\t\tfor i in range(n):\n\t\t\t\tmismatch=0\n\t\t\t\tfor j in range(m):\n\t\t\t\t\tif ara[i][j]!=per[j]:\n\t\t\t\t\t\tmismatch+=1\n\t\t\t\tif mismatch==1:\n\t\t\t\t\tflag=False\n\t\t\t\telif mismatch>2:\n\t\t\t\t\tflag=False\n\t\t\tif flag:\n\t\t\t\texit(print(\"YES\"))\n\t\t\tper[a],per[b]=per[b],per[a]\n\tprint(\"NO\")\n\t\ndef main():\n\ttestcase=1\n\t#testcase=int(input())\n\tfor _ in range(testcase):\n\t\tsolve()\n\t\nif __name__==\"__main__\":\n\tmain()\n\n\t \t \t \t \t \t\t \t\t\t\t\t\t \t", "import sys\n\nn, m = map(int,input().split())\ng = [list(map(int,input().split())) for _ in range(n)]\nfor c1 in range(m):\n for c2 in range(c1, m):\n ok = True\n for row in g:\n row[c1], row[c2] = row[c2], row[c1]\n cnt = 0\n for i in range(m):\n if row[i] != i + 1:\n cnt += 1\n if cnt > 2:\n break\n row[c1], row[c2] = row[c2], row[c1]\n if cnt > 2:\n ok = False\n break\n if ok:\n print('YES')\n sys.exit(0)\nprint('NO')\n", "def check(table):\r\n n = len(table)\r\n m = len(table[0])\r\n bits = [[table[i][j] == j+1 for j in range(m)] for i in range(n)]\r\n for row in bits:\r\n if row.count(False) > 2:\r\n return False\r\n return True\r\n\r\nn,m =map(int, input().split())\r\ntable = [list(map(int, input().split())) for i in range(n)]\r\nfor i in range(m-1):\r\n for j in range(i,m):\r\n _table = [table[i][:] for i in range(n)]\r\n for k in range(n):\r\n _table[k][i], _table[k][j] = _table[k][j],_table[k][i]\r\n if check(_table):\r\n print('YES')\r\n exit()\r\nif check(table):\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n\r\n", "import sys\r\n\r\ndef swapC(c1, c2):\r\n for r in range(n):\r\n swap(r, c1, c2)\r\n\r\ndef swap(r, c1, c2):\r\n nums[r][c1], nums[r][c2] = nums[r][c2], nums[r][c1]\r\n\r\ndef checkRow(r):\r\n bad = []\r\n for i in range(m):\r\n if nums[r][i] != i:\r\n bad.append(i)\r\n if len(bad) == 0:\r\n return True\r\n if len(bad) != 2:\r\n return False\r\n x0, x1 = nums[r][bad[0]], nums[r][bad[1]]\r\n return bad[0] == x1 and bad[1] == x0\r\n\r\ndef checkAll():\r\n for r in range(n):\r\n if not checkRow(r):\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\nnums = [list(map(lambda x: int(x) - 1, input().split())) for i in range(n)]\r\n\r\n\r\nflag = False\r\nfor c1 in range(m):\r\n for c2 in range(c1, m):\r\n swapC(c1, c2)\r\n if checkAll():\r\n print(\"YES\")\r\n flag = True\r\n break\r\n swapC(c1, c2)\r\n if flag:\r\n break\r\nelse:\r\n print(\"NO\")", "\r\nn, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\ndef check(x, y):\r\n for i in range(n):\r\n k = 0\r\n for j in range(m):\r\n if (j == x):\r\n if (a[i][y] != j + 1):\r\n k += 1\r\n elif (j == y):\r\n if (a[i][x] != j + 1):\r\n k += 1\r\n elif (a[i][j] != j + 1):\r\n k += 1\r\n if k > 2:\r\n return False\r\n return True\r\nfor e in range(m):\r\n for r in range(m):\r\n if check(e, r):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "def main():\n from itertools import combinations\n n, m = map(int, input().split())\n l = []\n for _ in range(n):\n row = list(map(int, input().split()))\n l.append(sorted(range(m), key=row.__getitem__))\n for i, j in [(0, 0), *combinations(range(m), 2)]:\n def inner(row):\n line = row[:]\n line[i], line[j] = line[j], line[i]\n flag = False\n for u in range(m):\n while u < line[u]:\n if flag:\n return False\n flag, v = True, line[u]\n line[u], line[v] = line[v], v\n return True\n\n if all(map(inner, l)):\n print(\"YES\")\n return\n print(\"NO\")\n\n\nif __name__ == '__main__':\n main()\n", "def difference(ln, k, l):\r\n count = 0\r\n\r\n line2 = ln[:]\r\n line2[k], line2[l] = ln[l], ln[k]\r\n for i in range(len(ln)):\r\n if line2[i] != i + 1:\r\n count += 1\r\n\r\n return count\r\n\r\ndef difference2(ln):\r\n count = 0\r\n for i in range(len(ln)):\r\n if ln[i] != i + 1:\r\n count += 1\r\n\r\n return count\r\n\r\nif __name__ == '__main__':\r\n\r\n n, m = input().split(' ')\r\n n = int(n)\r\n m = int(m)\r\n\r\n matrix = []\r\n for i in range(n):\r\n line = [int(i) for i in input().split(' ')]\r\n matrix.append(line)\r\n \r\n res = False\r\n\r\n ans = True\r\n for line in matrix:\r\n if difference2(line) > 2:\r\n ans = False\r\n if ans:\r\n res = True\r\n\r\n for i in range(m):\r\n for j in range(m):\r\n if i == j:\r\n continue\r\n\r\n answer = True\r\n for line in matrix:\r\n if difference(line, i, j) > 2:\r\n answer = False\r\n\r\n if answer == True:\r\n res = True\r\n\r\n if res:\r\n print('YES')\r\n else:\r\n print('NO')", "N, M = map(int, input().split())\nin_mat = [list(map(int, input().split())) for _ in range(N)]\norig = [list(range(1, M + 1)) for i in range(N)]\n\nif M == 1:\n print(\"YES\")\n exit()\n\n\ndef check():\n for i in range(N):\n cnt = 0\n for j in range(M):\n if orig[i][j] != in_mat[i][j]:\n cnt += 1\n if cnt != 0 and cnt != 2:\n return False\n return True\n\nif check():\n print(\"YES\")\n exit()\n\nfor j1 in range(M - 1):\n for j2 in range(j1 + 1, M):\n for i in range(N):\n orig[i][j1], orig[i][j2] = orig[i][j2], orig[i][j1]\n if check():\n print(\"YES\")\n exit()\n orig = [list(range(1, M + 1)) for i in range(N)]\nprint(\"NO\")\n", "import sys, re, itertools\r\nrai=lambda x:list(map(int, x.split()))\r\ndef pm(a):\r\n for l in a:\r\n print(l)\r\n print()\r\n_use_stdin = True\r\nif _use_stdin:\r\n inp = sys.stdin\r\nelse:\r\n inp = open(\"input.txt\", \"r\")\r\nls = inp.read().splitlines()\r\nn, m = rai(ls[0])\r\na = [rai(l) for l in ls[1:]]\r\nb = list(range(1,m+1))\r\nc = []\r\ndef f(x):\r\n t = 0\r\n for i, x in enumerate(a[x]):\r\n if x != b[i]:\r\n t += 1\r\n return t\r\nflag = False\r\nfor i in range(m):\r\n for j in range(i, m):\r\n for k in range(n):\r\n a[k][i], a[k][j] = a[k][j], a[k][i]\r\n flag2 = True\r\n for k in range(n):\r\n if f(k) > 2:\r\n flag2 = False\r\n break\r\n# for k in range(n):\r\n# print(a[k], f(k))\r\n# print()\r\n if not flag:\r\n flag = flag2\r\n for k in range(n):\r\n a[k][i], a[k][j] = a[k][j], a[k][i]\r\nprint(\"YES\" if flag else \"NO\")", "read = lambda: map(int, input().split())\r\nn, m = read()\r\na = [list(read()) for i in range(n)]\r\nb = [a[i][:] for i in range(n)]\r\nflag = True\r\nfor i in range(n):\r\n c = sorted(b[i])\r\n d = b[i][:]\r\n dif = sum(c[j] != d[j] for j in range(m))\r\n if dif > 2: flag = False\r\nif flag:\r\n print('YES')\r\n exit()\r\nfor k1 in range(m):\r\n for k2 in range(k1 + 1, m):\r\n b = [a[i][:] for i in range(n)]\r\n for i in range(n):\r\n b[i][k1], b[i][k2] = b[i][k2], b[i][k1]\r\n flag = True\r\n for i in range(n):\r\n c = sorted(b[i])\r\n d = b[i][:]\r\n dif = sum(c[j] != d[j] for j in range(m))\r\n if dif > 2: flag = False\r\n if flag:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(a, b):\r\n d = w.copy()\r\n d[a], d[b] = d[b], d[a]\r\n q = list(zip(*d))\r\n et = 0\r\n for x in q:\r\n z = sorted(x)\r\n c = 0\r\n for l in range(m):\r\n if x[l] != z[l]:\r\n c += 1\r\n if c == 0 or c == 2:\r\n et += 1\r\n return et\r\n\r\n\r\nn, m = map(int, input().split())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\nw = list(zip(*g))\r\new = 0\r\n\r\nif f(0, 0) == n:\r\n ew = 1\r\n\r\nfor i in range(m):\r\n for j in range(i+1, m):\r\n et = f(i, j)\r\n if et == n:\r\n ew = 1\r\n break\r\n if ew == 1:\r\n break\r\nprint(['NO', 'YES'][ew == 1])", "from itertools import combinations\n\n\ndef inner(row):\n row[i], row[j] = row[j], row[i]\n flag = False\n for u in range(m):\n while u < row[u]:\n if flag:\n return False\n flag, v = True, row[u]\n row[u], row[v] = row[v], v\n return True\n\n\nn, m = map(int, input().split())\nl, res = [], \"NO\"\nfor _ in range(n):\n row = list(map(int, input().split()))\n l.append(sorted(range(m), key=row.__getitem__))\nfor i, j in [(0, 0), *combinations(range(m), 2)]:\n if all(map(inner, map(list, l))):\n res = \"YES\"\n break\nprint(res)\n", "def cntmisp(a):\r\n return(sum([int(a[i]!=(i+1)) for i in range(len(a))]))\r\n\r\nn,m=[int(x) for x in input().split(' ')]\r\na=[]\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split(' ')])\r\n\r\ncnts=[cntmisp(x) for x in a]\r\n\r\nfl=0\r\nif(max(cnts)<=2):\r\n print(\"YES\")\r\nelse:\r\n for p1 in range(m-1):\r\n for p2 in range(p1+1,m):\r\n A=[]\r\n for i in range(n):\r\n subA=[]\r\n for p in range(m):\r\n if(p==p1):\r\n subA.append(a[i][p2])\r\n elif(p==p2):\r\n subA.append(a[i][p1])\r\n else:\r\n subA.append(a[i][p])\r\n A.append(list(subA))\r\n newcnts=[cntmisp(x) for x in A]\r\n if(max(newcnts)<=2):\r\n fl=1\r\n print(\"YES\" if(fl) else \"NO\")\r\n\r\n", "I=lambda:map(int,input().split())\r\nR=range\r\nn,m=I()\r\nt=[[]for _ in R(m)]\r\ne=list(R(1,m+1))\r\nr='NO'\r\nfor _ in R(n):\r\n\tfor i,v in zip(R(m),I()):t[i]+=[v]\r\nfor i in R(m):\r\n\tfor j in R(i,m):\r\n\t\tt[i],t[j]=t[j],t[i]\r\n\t\tif all(3>sum(t[i][j]!=e[i]for i in R(m))for j in R(n)):r='YES'\r\n\t\tt[i],t[j]=t[j],t[i]\r\nprint(r)", "import random\r\n\r\n\r\ndef gcd(a, b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\n\r\n\r\ndef lcm(a, b):\r\n return (a * b) / gcd(a, b)\r\n\r\n\r\nn,m=map(int, input().split())\r\na=[]\r\nans=0\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(m):\r\n for j in range(i+1, m):\r\n for k in range(n):\r\n t=a[k][i]\r\n a[k][i]=a[k][j]\r\n a[k][j]=t\r\n # for z in a:\r\n # print(z)\r\n f=0\r\n for r in range(n):\r\n che=1\r\n cnt=0\r\n for c in range(m):\r\n if a[r][c]!=che:\r\n cnt+=1\r\n che+=1\r\n if cnt>2:\r\n f=1\r\n break\r\n if f==0:\r\n ans=1\r\n break\r\n for k in range(n):\r\n t=a[k][i]\r\n a[k][i]=a[k][j]\r\n a[k][j]=t\r\n if ans==1:\r\n break\r\nf=0\r\nfor r in range(n):\r\n che=1\r\n cnt=0\r\n for c in range(m):\r\n if a[r][c]!=che:\r\n cnt+=1\r\n che+=1\r\n if cnt>2:\r\n f=1\r\n break\r\nif f==0:\r\n ans=1\r\nif ans==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l+=[list(map(int,input().split()))]\r\nfor i in range(m):\r\n for j in range(i,m):\r\n t=0\r\n k=[_+1 for _ in range(m)]\r\n k[i],k[j]=k[j],k[i]\r\n for ii in range(n):\r\n o=0\r\n for jj in range(m):\r\n if l[ii][jj]!=k[jj]:\r\n o+=1\r\n if o>2:\r\n t+=1\r\n if t==0:\r\n exit(print(\"YES\"))\r\nelse:\r\n print(\"NO\")" ]

[ "s = input()\nn = len(s)\nsett = {}\n\nfor i in range(n):\n if s[i] not in sett:\n sett[s[i]] = []\n sett[s[i]].append(s[i + 1:] + s[:i])\nans = 0\n\n# ao fazer sett.items(), é realizado unpack da chave,valor para k,l, respectivamente\nfor k, l in sett.items():\n tmp = 0\n for j in range(n - 1):\n \n seen, sett1 = set(), set()\n \n for i in range(len(l)):\n \n if l[i][j] in sett1:\n sett1.remove(l[i][j])\n elif l[i][j] not in seen: \n sett1.add(l[i][j])\n seen.add(l[i][j])\n \n tmp = max(tmp, len(sett1))\n tmp /= n\n ans += tmp\n\n# precisao 10^6\nprint('{:.7}'.format(ans))\n\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, Counter\r\n\r\ns = input()[:-1]\r\nd = defaultdict(list)\r\nfor i, j in enumerate(s):\r\n d[j].append(i)\r\nn = len(s)\r\ns += s[:-1]\r\nc = 0\r\nfor i in d:\r\n x = 0\r\n for j in range(1, n):\r\n q = Counter()\r\n for l in d[i]:\r\n q[s[l+j]] += 1\r\n x = max(x, sum(1 for i in q if q[i] == 1))\r\n c += x\r\nprint(c/n)", "s=input()\r\nn=len(s)\r\npos=[[] for i in range(26)]\r\nfor i in range(len(s)):\r\n pos[ord(s[i])-97].append(s[i:] + s[:i])\r\nans=0\r\nfor i in range(26):\r\n max1=0\r\n for j in range(n):\r\n b=[0 for i in range(26)]\r\n \r\n for k in pos[i]:\r\n b[ord(k[j])-97]+=1\r\n temp1=0\r\n for k in range(26):\r\n if(b[k]==1):\r\n temp1+=1\r\n max1=max(temp1,max1)\r\n ans+=max1\r\nprint(ans/n)\r\n \r\n", "from collections import defaultdict\r\n\r\n\r\ns=input()\r\nn=len(s)\r\n\r\nshifts=defaultdict(list)\r\nshifts[s[0]].append(s)\r\nfor i in range(1,n):\r\n\tt=s[i:]+s[:i]\r\n\tshifts[t[0]].append(t)\r\n# print(shifts)\r\n\r\nans=0\r\nfor l in shifts.values():\r\n\tbest=0\r\n\tfor i in range(1,n):\r\n\t\tcts=defaultdict(int)\r\n\t\tfor s in l:cts[s[i]]+=1\r\n\t\tgood=0\r\n\t\tfor v in cts.values():good+=(v==1)\r\n\t\tbest=max(good,best)\r\n\tans+=best\r\nprint(f'{ans/n:.8f}')\r\n\r\n", "def process(s):\r\n n = len(s)\r\n d = []\r\n for i in range(n):\r\n row = [0 for j in range(26*26)]\r\n d.append(row)\r\n counts = [0 for i in range(26)]\r\n for i in range(n):\r\n c = ord(s[i])-ord('a')\r\n counts[c]+=1\r\n for j in range(1, n):\r\n j2 = (i+j) % n\r\n c2 = ord(s[j2])-ord('a')\r\n c3 = 26*c+c2\r\n d[j][c3]+=1\r\n answer = 0\r\n for x in range(26):\r\n p1 = counts[x]/n\r\n \"\"\"\r\n the probability I see x\r\n \"\"\"\r\n my_max = 0\r\n for y in range(1, n):\r\n win = 0\r\n lose = 0\r\n for z in range(26):\r\n c3 = 26*x+z\r\n if d[y][c3]==1:\r\n win+=1\r\n else:\r\n lose+=d[y][c3]\r\n if (win+lose) > 0:\r\n my_max = max(my_max, win/(win+lose))\r\n answer+=my_max*p1\r\n return answer\r\ns = input()\r\nprint(process(s))\r\n", "str = input()\r\nl = len(str)\r\na = [0] * (2 * l)\r\npos = [[] for i in range(26)]\r\nfor i, c in enumerate(str):\r\n t = ord(c) - ord('a')\r\n a[i] = t\r\n a[i + l] = t\r\n pos[t].append(i)\r\nans = 0\r\nfor c in range(26):\r\n cur = 0\r\n for k in range(1, l):\r\n cnt = [0] * 26\r\n for i in pos[c]:\r\n cnt[a[i + k]] += 1\r\n cur = max(cur, len(list(filter(lambda x : x == 1, cnt))))\r\n ans += cur\r\nprint(ans / l)\r\n", "import sys\nfrom collections import defaultdict\n\ns = sys.stdin.readline().strip()\nn = len(s)\n\n\ns_mp = defaultdict(list)\nfor i in range(n):\n s_mp[s[i]].append(i)\n\nresult = 0\nfor let, starts in s_mp.items():\n max_p = 0.0\n for j in range(1, n):\n cnter = defaultdict(int)\n for start in starts:\n cnter[s[(start + j) % n]] += 1\n\n uniq = 0\n for i, v in cnter.items():\n if v == 1:\n uniq += 1\n max_p = max(max_p, uniq/len(starts))\n total = len(starts)\n result += max_p * len(starts)/n\n\nprint('{:.8f}'.format(result))\n", "s = str(input())\nn = len(s)\n\nt = s+s\nP = [[[0]*26 for i in range(26)] for j in range(n)]\nfor i in range(n):\n c1 = ord(t[i])-ord('a')\n for j in range(1, n):\n c2 = ord(t[i+j])-ord('a')\n P[j][c1][c2] += 1\n\ns = set(s)\nans = 0\nfor c1 in s:\n c1 = ord(c1)-ord('a')\n M = 0\n for j in range(1, n):\n temp = 0\n for c2 in range(26):\n if P[j][c1][c2] == 1:\n temp += 1\n M = max(M, temp)\n ans += M\nprint(ans/n)\n", "\r\n\r\ns = input()\r\nl = len(s)\r\n\r\ninstances = [[] for x in range(26)]\r\n\r\ns_i = [ord(c) - 97 for c in s]\r\n\r\n\r\nfor i in range(l):\r\n instances[s_i[i]].append(i)\r\n\r\n\r\n\r\n#sum_probability += len * probability\r\n#probability = sum_probabilty\r\n\r\nsum_probability = 0\r\n\r\nfor c in range(0,26):\r\n if not instances[c]:\r\n continue\r\n if len(instances[c]) == 0:\r\n sum_probability += 1\r\n continue\r\n max_probability = 0\r\n for guess in range(1, l):\r\n num_seen = [0]*26\r\n probability = 0\r\n for index in instances[c]:\r\n num_seen[s_i[(index+guess)%l]] += 1\r\n for x in num_seen:\r\n if x == 1:\r\n probability += 1\r\n max_probability = max(max_probability, probability)\r\n sum_probability += max_probability\r\n\r\n\r\n\r\n\r\n\r\nprint(sum_probability/l)", "s=input()\r\n\r\nd=dict()\r\nmod=[]\r\nmx=[]\r\n\r\nfor k in s:\r\n\td[k]=[]\r\nfor i in range(len(s)):\r\n\td[s[i]].append(i)\r\nindex=0\r\nfor k in d.keys():\r\n\tmod.append(d[k])\r\n\r\nfor k in mod:\r\n\tmxct=0\r\n\tct=0\r\n\tx=[]\r\n\tfor i in range(len(s)):\r\n\t\tct=0\r\n\t\tdic=dict()\r\n\t\tfor j in k:\r\n\t\t\telt = s[(j+i)%(len(s))]\r\n\t\t\tif elt in dic:\r\n\t\t\t\tdic[elt]+=1\r\n\t\t\telse:\r\n\t\t\t\tdic[elt]=1\r\n\t\tfor r in dic:\r\n\t\t\tif dic[r]==1:\r\n\t\t\t\tct+=1\r\n\t\tmxct=max(ct,mxct)\r\n\tmx.append(mxct)\r\nsm=0\r\nfor k in mx:\r\n\tsm+=k\r\nprint(sm/len(s))", "s = input()\r\nn = len(s)\r\nd = {}\r\nfor i in range(n):\r\n if s[i] not in d: d[s[i]] = []\r\n d[s[i]].append(s[i + 1:] + s[:i])\r\nres = 0\r\nfor k, l in d.items():\r\n ans = 0\r\n for j in range(n - 1):\r\n seen, s1 = set(), set()\r\n for i in range(len(l)):\r\n if l[i][j] in s1: s1.remove(l[i][j])\r\n elif l[i][j] not in seen: \r\n s1.add(l[i][j])\r\n seen.add(l[i][j])\r\n ans = max(ans, len(s1))\r\n ans /= n\r\n res += ans\r\nprint('{:.7f}'.format(res))" ]

[ "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nrem = set()\r\nfor i in a:\r\n new = {(i + j) % m for j in rem | {0}}\r\n rem |= new\r\n if 0 in rem:\r\n print('YES')\r\n exit()\r\nprint('NO')", "l=lambda:map(int,input().split())\r\nn,k=l();a=set()\r\nfor i in l():\r\n b=set(((i+j)%k)for j in a);a|=b;a.add(i%k)\r\n if 0in a:print(\"YES\");exit()\r\nprint(\"NO\")", "import collections\r\nimport heapq\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\nimport os\r\nfrom io import BytesIO, IOBase\r\ninput = sys.stdin.readline\r\ndef solve():\r\n n, m = list(map(int, input().split()))\r\n l = list(map(int, input().split()))\r\n if n > m : return \"YES\"\r\n elif 0 in set(l) :return \"YES\"\r\n else:\r\n dp = [-1]*(m+1)\r\n for ele in l:\r\n tmp = dp.copy()\r\n \r\n for j in range(m):\r\n if dp[j] == -1:continue\r\n tmp[(j+ele) % (m)] = 1\r\n tmp[ele%m]=1\r\n dp = tmp.copy()\r\n if dp[0] == 1:return \"YES\" \r\n \r\n return \"NO\"\r\n\r\nif __name__ == '__main__':\r\n print(solve())\r\n", "n, m = map(int, input().split())\r\nmas = [int(i) for i in input().split()]\r\nif n > m:\r\n pref = [0] * n\r\n pref[0] = mas[0]\r\n for i in range(1, n):\r\n pref[i] = pref[i - 1] + mas[i]\r\n d = dict()\r\n for i in range(n):\r\n d[pref[i] % m] = d.get(pref[i] % m, 0) + 1\r\n if d[pref[i] % m] > 1:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"N0\")\r\nelse:\r\n dp = [[0] * (m + 1) for i in range(m + 1)]\r\n for i in range(n):\r\n dp[0][mas[i] % m] = 1\r\n for i in range(n):\r\n for r in range(0, m):\r\n if dp[i][r] == 1:\r\n dp[i + 1][r] = 1\r\n dp[i + 1][(r + mas[i]) % m] = 1\r\n if dp[n - 1][0] == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "reminder = list(map(int, input().split()))[1]\r\nlst = list(map(int, input().split()))\r\nst = set()\r\nfor i in lst:\r\n st |= {(i + j) % reminder for j in st | {0}}\r\n if 0 in st:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "n, m = [int (i) for i in input().split(\" \")]\r\narr = [int (i) % m for i in input().split(\" \")]\r\n \r\nc = {}\r\nfor i in range(m):\r\n c[i] = False\r\n \r\nstack = [0]\r\nnewstack = []\r\n \r\nfor i in arr:\r\n for j in stack:\r\n arrrrgh = (i+j) % m\r\n if (arrrrgh == 0):\r\n print (\"YES\")\r\n exit()\r\n elif (c[arrrrgh] == False):\r\n newstack.append(arrrrgh)\r\n c[arrrrgh] = True\r\n stack = stack + newstack\r\n newstack = []\r\n \r\nprint(\"NO\")\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\n \r\nd=set()\r\nfor i in a:\r\n w={(i+y)%m for y in d}\r\n d|=w\r\n d.add(i%m)\r\n if 0 in d:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nd = set()\nfor i in a:\n w = {(i + y) % m for y in d}\n d |= w\n d.add(i % m)\n if 0 in d:\n print(\"YES\")\n exit()\nprint(\"NO\")\n", "import sys\r\ninput = sys.stdin.readline\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\na = [0] + a\r\n\r\nif n > m:\r\n print(\"YES\")\r\nelse:\r\n d = [[0 for _ in range(m+1)] for _ in range(n+1)]\r\n \r\n for i in range(1,n+1):\r\n for j in range(m):\r\n d[i][(a[i] + j)%m] = d[i-1][(a[i]+j)%m] or d[i-1][j]\r\n \r\n d[i][a[i]%m] = 1\r\n \r\n print(\"YES\" if d[n][0] == 1 else \"NO\")", "import sys\r\na,b=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=list(j%b for j in c)\r\n# print(d)\r\nif a>=b: \r\n print(\"YES\")\r\n sys.exit()\r\ne=[[0]*(b+1) for _ in range(a+1)]\r\n\r\nfor i in range(1,a+1):\r\n e[i][d[i-1]]=1\r\n \r\nfor i in range(2,a+1):\r\n for j in range(0,b):\r\n if e[i][j]==1:continue\r\n if e[i-1][j]==1: e[i][j]=e[i-1][j];continue\r\n e[i][j]=e[i-1][(j-d[i-1]+b)%b]\r\n\r\nif e[a][0]==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\nimport random\r\nfrom collections import Counter, deque\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport heapq\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n return sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef main():\r\n n, m = I()\r\n a = I()\r\n d = [False] * m\r\n for i in range(n):\r\n el = a[i] % m\r\n new_d = d.copy()\r\n new_d[el] = True\r\n for j in range(m):\r\n if d[j]:\r\n new_d[(j + el) % m] = True\r\n d = new_d.copy()\r\n\r\n if d[0]:\r\n print('YES')\r\n return\r\n\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "import bisect\r\nimport heapq\r\nimport sys\r\nfrom types import GeneratorType\r\nfrom functools import cmp_to_key\r\nfrom collections import defaultdict, Counter, deque\r\nimport math\r\nfrom functools import lru_cache\r\nfrom heapq import nlargest\r\nimport random\r\n\r\ninf = float(\"inf\")\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n\r\ndef bin_split(num):\r\n # 二进制优化是指 1.2.4.x这样连续的而不是二进制10101对应的1\r\n assert num > 0\r\n lst = []\r\n x = 1\r\n while x <= num:\r\n lst.append(x)\r\n num -= x\r\n x *= 2\r\n if num:\r\n lst.append(num)\r\n return lst\r\n\r\n\r\ndef main(ac=FastIO()):\r\n n, m = ac.read_ints()\r\n nums = ac.read_list_ints()\r\n cnt = [0]*m\r\n for num in nums:\r\n cnt[num%m] += 1\r\n if cnt[0] or max(cnt)>=m:\r\n ac.st(\"YES\")\r\n return\r\n pre = [0]*m\r\n for i in range(1, m):\r\n if cnt[i]:\r\n for x in bin_split(cnt[i]):\r\n cur = pre[:]\r\n y = (x*i) % m\r\n cur[y] = 1\r\n for j in range(m):\r\n if pre[j]:\r\n cur[(j+y)%m] = 1\r\n pre = cur[:]\r\n if pre[0]:\r\n ac.st(\"YES\")\r\n return\r\n ac.st(\"NO\")\r\n return\r\n\r\n\r\nmain()\r\n", "def check(n,m,a):\n if n>=m:\n return True\n\n dp = [[False] * (m + 1) for _ in range(n + 1)]\n for i in range(1,n+1):\n dp[i][a[i-1]%m] = True\n for i in range(2,n+1):\n for j in range(m):\n if dp[i][j]:\n continue\n if dp[i-1][j]:\n dp[i][j] = dp[i-1][j]\n continue\n dp[i][j] = dp[i-1][(j-(a[i-1]%m)+m)%m]\n return dp[n][0]\n\n\nn,m = map(int, input().split()) \na = list(map(int, input().split()))\nif check(n,m,a):\n print(\"YES\")\nelse:\n print(\"NO\")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndp = [0] * m\r\ndp[0] = 1\r\nans = \"NO\"\r\nfor i in a:\r\n if dp[-i % m]:\r\n ans = \"YES\"\r\n break\r\n dp = [dp[j] | dp[(j - i) % m] for j in range(m)]\r\nprint(ans)", "# m=5\r\n# 4 4 2 5\r\n# 15 11 9 5\r\nn,m=list(map(int,input().split()))\r\nif n>m:\r\n print(\"YES\")\r\n exit()\r\nnums = list(map(int,input().split()))\r\ndp=[[0 for i in range(m+1)] for i in range(n+1)]\r\n# dp[0][0]=True\r\n# print(2%5)\r\n# [0,1,2,3,4,5,6]\r\n# [0,]\r\ncheck=\"NO\"\r\nfor i in range(1,len(dp)):\r\n target = nums[i-1]%m\r\n # print(target,nums[i-1])\r\n dp[i][target] = True\r\n for j in range(len(dp[0])):\r\n if dp[i-1][j]==True:\r\n value = (j+nums[i-1])%m\r\n dp[i][value] = dp[i][value] or True\r\n # pass\r\n # else:\r\n dp[i][j]=dp[i-1][j] or dp[i][j]\r\n# for i in dp:\r\n# print(i)\r\n# print(check)\r\n# print(dp)\r\nif dp[-1][0]==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")" ]

[ "from math import floor, sqrt\r\nimport bisect\r\n\r\nimport math\r\n\r\n\r\ndef rwh_primes2(n):\r\n # https://stackoverflow.com/questions/2068372/fastest-way-to-list-all-primes-below-n-in-python/3035188#3035188\r\n \"\"\" Input n>=6, Returns a list of primes, 2 <= p < n \"\"\"\r\n correction = (n%6>1)\r\n n = {0:n,1:n-1,2:n+4,3:n+3,4:n+2,5:n+1}[n%6]\r\n sieve = [True] * (n//3)\r\n sieve[0] = False\r\n for i in range(int(n**0.5)//3+1):\r\n if sieve[i]:\r\n k=3*i+1|1\r\n sieve[ ((k*k)//3) ::2*k]=[False]*((n//6-(k*k)//6-1)//k+1)\r\n sieve[(k*k+4*k-2*k*(i&1))//3::2*k]=[False]*((n//6-(k*k+4*k-2*k*(i&1))//6-1)//k+1)\r\n return [2,3] + [3*i+1|1 for i in range(1,n//3-correction) if sieve[i]]\r\n\r\n\r\nk = int(input())\r\n\r\nprimes = rwh_primes2(k)\r\n\r\na = 1\r\np2 = 2\r\nfor i in primes[::-1]:\r\n if k%i == 0:\r\n p2 = i\r\n break\r\n\r\nxx = range(k-p2+1, k+1)\r\n#print(list(xx))\r\nif p2>240:\r\n p1 = primes[bisect.bisect_left(primes, int(math.ceil(xx[0]/2)))]\r\n print(p1+1)\r\nelse:\r\n ans = k\r\n p1 = 1\r\n for x1 in xx:\r\n for i in primes[::-1]:\r\n\r\n if i >= x1:\r\n continue\r\n\r\n if x1 % i == 0:\r\n p1 = i\r\n break\r\n ans = min(ans, x1-p1+1)\r\n\r\n print(ans)", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n| created: 10.03.2018 20:50 |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n# inp = open(\"input.txt\", \"r\"); input = inp.readline; out = open(\"output.txt\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef resheto(l, k, n):\r\n i=0\r\n while i<len(l):\r\n if l[i]%k == 0: l=l[:i]+l[i+1:]\r\n i+=1\r\n lst = []\r\n for i in l:\r\n if n % i == 0: lst.append(i)\r\n return lst\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef solution():\r\n x2 = int(input())\r\n n = 1000001\r\n max_prime = [0] * n\r\n s = list(range(n))\r\n s[1] = 0\r\n for i in s:\r\n if i > 1 and s[i]:\r\n for j in range(2 * i, n, i):\r\n s[j] = 0\r\n max_prime[j] = i\r\n min_x0 = n\r\n for x in range(x2 - max_prime[x2] + 1, x2 + 1):\r\n max_div = max_prime[x]\r\n tmp = x - max_div + 1\r\n if max_div and tmp < min_x0:\r\n min_x0 = tmp\r\n print(min_x0)\r\n\r\n\r\n\r\n# ===========================================\r\nwhile TN != 0:\r\n solution()\r\n TN -= 1\r\n# ===========================================\r\n# inp.close()\r\n# out.close()\r\n", "a = int(input())\r\nb = [0 for i in range(a+1)]\r\nfor i in range(2, a+1):\r\n if (b[i] == 0):\r\n for j in range(i+i, a+1, i):\r\n b[j] = i\r\n b[i] = i -b[i]+1\r\nprim = a\r\nfor i in range(b[a], a+1):\r\n prim = prim if (prim<b[i]) else b[i]\r\nprint(prim)", "x2 = int(input())\r\nnum = []\r\nfor val in range(1000010):\r\n num.append(0)\r\nfor i in range(2,x2):\r\n if(num[i]==0):\r\n for j in range(i+i,x2+1,i):\r\n num[j]=i\r\nprim = x2 - num[x2] + 1\r\nminn = 10000000\r\nfor i in range(prim,x2+1):\r\n minn = min(minn,i - num[i] + 1)\r\nprint(minn)", "def factorize(n):\r\n res = []\r\n if n % 2 == 0:\r\n power = 0\r\n while n % 2 == 0:\r\n power += 1\r\n n //= 2\r\n res.append((2, power))\r\n i = 3\r\n while i * i <= n:\r\n if n % i == 0:\r\n power = 0\r\n while n % i == 0:\r\n power += 1\r\n n //= i\r\n res.append((i, power))\r\n i += 2\r\n if n > 1:\r\n res.append((n, 1))\r\n return res\r\n\r\nx2 = int(input())\r\n\r\np = max(k for k, _ in factorize(x2))\r\nk = x2 // p\r\nres = float('inf')\r\nfor x1 in range(p * (k - 1) + 1, p * k + 1):\r\n p = max(k for k, _ in factorize(x1))\r\n k = x1 // p\r\n if k > 1:\r\n res = min(res, p * k - p + 1)\r\n if res < x1 // 2: break\r\nprint(res)", "number=int(input())\r\nesPrimo=[True]*number\r\nfor i in range(2,number):\r\n if esPrimo[i]:\r\n for j in range (i*i,number,i):\r\n esPrimo[j]=False\r\nprimos=[i for i in range(2,number) if esPrimo[i]]\r\nm=number -1\r\nfor p in primos:\r\n if number % p == 0:\r\n m=number-p\r\nanswer = m+1\r\nfor p in primos:\r\n if p>m:\r\n break\r\n d=m-m%p\r\n if d+p<=number:\r\n answer=min(answer,d+1)\r\nprint(answer)", "x2 = int(input())\r\n\r\ns = [-1] * (x2 + 1)\r\nfor i in range(2, x2+1):\r\n\tif s[i] == -1:\r\n\t\tfor j in range(i, x2+1, i):\r\n\t\t\ts[j] = i\r\n\t\r\nans = x2\r\nfor x1 in range(x2 - s[x2] + 1, x2 + 1):\r\n\tx0 = x1 - s[x1] + 1\r\n\tif x0 > 1:\r\n\t\tans = min(ans, x0)\r\n\r\nprint(ans)\r\n", "def sieve(MAX):\r\n sieve = [1] * MAX\r\n for i in range(2, MAX):\r\n if sieve[i] != 1:\r\n continue\r\n for j in range(2 * i, MAX, i):\r\n sieve[j] = i\r\n return sieve\r\n\r\n\r\ndef main():\r\n MAX = int(1e6)\r\n N = MAX + 1\r\n primes = sieve(N)\r\n\r\n x2 = int(input())\r\n\r\n max_p = primes[x2]\r\n\r\n result = float('inf')\r\n for x1 in range(x2 - max_p + 1, x2 + 1):\r\n if primes[x1] == x1:\r\n result = min(result, x1)\r\n continue\r\n max_p = primes[x1]\r\n t = x1 - max_p + 1\r\n result = min(result, t)\r\n\r\n print(result)\r\n\r\n\r\nmain()\r\n", "n = int(input())\n\nsiv = [0 for _ in range(n + 1)]\n\nfor i in range(2, n + 1):\n if siv[i] == 0:\n for j in range(i + i, n + 1, i):\n siv[j] = i\n siv[i] = i - siv[i] + 1;\n\nans = n\nfor i in range(siv[n], n + 1):\n ans = min(ans, siv[i])\n\nprint(ans)\n", "def max_less_prime_divisor(n): # 1 for primes\n d, max_d = 2, 1\n while d * d <= n:\n while n % d == 0:\n max_d = d\n n //= d\n d += 1\n return n if n != 1 and max_d != 1 else max_d\n\nn = int(input())\nm = n - max_less_prime_divisor(n) + 1\nanswer = m\nis_prime = [True] * m\nfor i in range(2, m):\n if is_prime[i]:\n d = (m - 1) - (m - 1) % i\n if d + i <= n:\n answer = min(answer, d + 1)\n for j in range(i * i, m, i):\n is_prime[j] = False\nprint(answer)\n \n", "nmax = 1000010\nprimes = [0 for i in range(nmax)]\n\ndef get_primes():\n global primes\n\n n = 2\n while n < nmax:\n num = 2*n\n while num < nmax:\n primes[num] = n\n num += n\n num = n + 1\n while num < nmax and primes[num] != 0 :\n num += 1\n n = num\n\ndef algo(x2):\n global primes\n\n p2 = primes[x2]\n min_x1 = x2-p2+1\n min_x0 = nmax\n\n for x1 in range(min_x1, x2+1):\n p1 = primes[x1]\n x0 = x1 - p1 + 1\n\n if x0 < min_x0:\n min_x0 = x0\n # print(\"p1 is \", p1, \" for \", x0)\n return min_x0\n\n\nx2 = int(input().strip())\nget_primes()\nprint(algo(x2))\n", "numero = int(input())\n\n\nlista = [0]*(numero+1)\n\n\nfor i in range(2, numero+1):\n if lista[i]==0:\n for j in range(2*i, numero+1, i):\n lista[j] = i\n \n lista[i] = i-lista[i]+1\n \np = numero\n\nfor i in range(lista[numero], numero+1):\n \n p = min(p, lista[i])\n \nprint(p)\n", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nN = int(input())\r\nP = [0 for _ in range(1000010)]\r\nfor i in range(2, N):\r\n if P[i] == 0:\r\n for j in range(2*i, N+1, i):\r\n P[j] = i\r\nans = 1000010\r\nfor i in range(N-P[N]+1, N+1):\r\n ans = min(ans, i-P[i]+1)\r\nprint(ans)", "lectura = int(input())\r\nlista0 = [0]*(lectura+1)\r\nfor i in range(2, lectura+1):\r\n #print(\"i= \"+str(i))\r\n if lista0[i]==0:\r\n for j in range(2*i, lectura+1, i):\r\n #print(\"j= \"+str(j))\r\n lista0[j] = i\r\n lista0[i] = i-lista0[i]+1\r\nconclusion = lectura\r\nfor i in range(lista0[lectura], lectura+1):\r\n conclusion = min(conclusion, lista0[i])\r\nprint(conclusion)", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,pi,inf\r\nfrom collections import deque,defaultdict\r\nfrom bisect import bisect,bisect_left\r\nfrom time import time\r\nfrom itertools import permutations as per\r\nfrom heapq import heapify,heappush,heappop,heappushpop\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\r\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(str(x)+'\\n')\r\nlcm=lambda x,y:(x*y)//gcd(x,y)\r\nnCr=lambda x,y:(f[x]*inv((f[y]*f[x-y])%N))%N\r\ninv=lambda x:pow(x,N-2,N)\r\nsm=lambda x:(x**2+x)//2\r\nN=10**9+7\r\n\r\nprime=[True for i in range(10**6+1)]\r\nv=[0]*(10**6+1)\r\nfor i in range(2,10**6+1):\r\n\tif prime[i]:\r\n\t\tj=i\r\n\t\twhile j<=10**6:\r\n\t\t\tv[j]=i\r\n\t\t\tprime[j]=False\r\n\t\t\tj+=i\t\r\n\t\t\t\r\ndef ret_max(n):\r\n\treturn v[n]-1 if v[n]!=n else 0\r\n\r\nn=I()\r\nmn=n\r\n#print(ret_max(n)+1)\r\nfor i in range(n-ret_max(n),n):\r\n\t#print(i)\r\n\tmn=min(mn,i-ret_max(i))\r\nprint(mn)", "p=int(input())\r\nf=[0]*(p+1)\r\nfor i in range(2,p+1):\r\n if not f[i]:\r\n for j in range(2*i,p+1,i):\r\n f[j]=i\r\nans=p\r\nfor i in range(p-f[p]+1,p+1):\r\n ans=min(i-f[i]+1,ans)\r\nprint(ans)", "x=int(input())\r\nprim=[0]*(x+1)\r\nfor n in range(2,x+1):\r\n if not prim[n]:\r\n #prim[n]=n\r\n for k in range(2*n,x+1,n):\r\n prim[k]=n\r\n\r\np=prim[x]\r\nres=1e9\r\nfor n in range(x-p+1,x+1):\r\n cur=n\r\n mxp=prim[cur]\r\n d=cur-mxp+1\r\n res=min(res,d)\r\n\r\nprint(res)\r\n\r\n", "import math\r\n\r\nx2 = int(input())\r\n\r\nprimes = [True] * (10**6 + 2)\r\n\r\nfor j in range(2, int(math.sqrt(10**6 + 2)) + 1):\r\n for c in range(2*j, 10**6 + 2, j):\r\n primes[c] = False\r\n\r\ndef f(n):\r\n\r\n mp = 0\r\n\r\n for i in range(1, int(math.sqrt(n))+1):\r\n if n % i == 0:\r\n if primes[n // i]:\r\n return n // i\r\n if primes[i]:\r\n mp = max(i, mp)\r\n\r\n return mp\r\n\r\nmult = f(x2)\r\nres = [x2]\r\n\r\nfor x1 in range(x2 - mult + 1, x2):\r\n if primes[x1]:\r\n res.append(x1)\r\n continue\r\n mult1 = f(x1)\r\n res.append(x1 - mult1 + 1)\r\n\r\nprint(min(res))\r\n", "n = int(input())\r\n\r\nsiv = [0 for _ in range(n+1)]\r\n\r\nfor i in range(2, n+1):\r\n if siv[i] == 0:\r\n for j in range(i+i, n+1, i):\r\n siv[j] = i\r\n siv[i] = i - siv[i] + 1;\r\n\r\nresult = n\r\nfor i in range(siv[n], n + 1):\r\n result = min(result, siv[i])\r\n\r\nprint(result)", "x2 = int(input())\ns = [-1] * (x2+1)\nfor i in range(2, x2+1):\n if s[i] == -1:\n for j in range(i, x2+1, i):\n s[j] = i;\nans = x2\nfor x1 in range(x2-s[x2]+1, x2+1):\n x0 = x1 - s[x1] + 1\n if x0 > 1:\n ans = min(ans, x0)\nprint(ans)\n", "x2 = int(input())\n\ndef maxPrimeDevisor(v):\n result = 0\n while v % 2 == 0:\n result = 2\n v //= 2\n i = 3\n while i * i <= v:\n if v % i == 0:\n while v % i == 0:\n v //= i\n result = max(result, i)\n else:\n i += 2\n if v > 1:\n result = max(result, v)\n return result\n\nx1 = [max(3, x2 - maxPrimeDevisor(x2) + 1), x2]\nx0 = x1[1]\nfor i in range(x1[0], x1[1] + 1):\n mpd = maxPrimeDevisor(i)\n if mpd != i:\n x0 = max(3, min(x0, i - maxPrimeDevisor(i) + 1))\nprint(x0)\n", "n = int(input())\n\nis_prime = [True] * n\nfor i in range(2, n):\n if is_prime[i]:\n for j in range(i * i, n, i):\n is_prime[j] = False\nprimes = [i for i in range(2, n) if is_prime[i]]\n\nm = n - 1\nfor p in primes:\n if n % p == 0:\n m = n - p\n\nanswer = m + 1\nfor p in primes:\n if p > m:\n break\n d = m - m % p\n if d + p <= n:\n answer = min(answer, d + 1)\nprint(answer)\n \n", "x2 = int(input())\r\n\r\nn = 1000001\r\nmax_prime_div = [0] * n\r\nsieve = list(range(n))\r\nsieve[1] = 0\r\nfor i in sieve:\r\n if i > 1 and sieve[i]:\r\n for j in range(2 * i, n, i):\r\n sieve[j] = 0\r\n max_prime_div[j] = i\r\n\r\nmin_x0 = n\r\nfor x in range(x2 - max_prime_div[x2] + 1, x2 + 1):\r\n max_div = max_prime_div[x]\r\n tmp = x - max_div + 1\r\n if max_div and tmp < min_x0:\r\n min_x0 = tmp\r\nprint(min_x0)", "x = int(input())\nlp = [0 for x in range(x+1)]\nfor i in range(2, x+1):\n if(lp[i]==0):\n for j in range(i*2, x+1, i):\n lp[j] = i\n lp[i] = i - lp[i] + 1\np = x\nfor i in range(lp[x], x+1):\n p = min(p, lp[i])\nprint(p)\n", "def X0(X):\r\n max = 1000005\r\n dp = [0] * max\r\n ans = 10**9\r\n for i in range(2, X + 1):\r\n if not dp[i]:\r\n for j in range(i, X + 1, i):\r\n dp[j] = i\r\n \r\n for i in range(X - dp[X] + 1, X + 1):\r\n if dp[i] != i:\r\n ans = min(ans, i - dp[i] + 1)\r\n\r\n return ans\r\n\r\nX = int(input())\r\nresult = X0(X)\r\nprint(result)# 1690844383.6275144", "primes = []\r\nfor p in range(2, 10**6):\r\n if p*p > 10**6:\r\n break\r\n is_prime = True\r\n for p2 in primes:\r\n if p2*p2 > p:\r\n break\r\n if p % p2==0:\r\n is_prime = False\r\n break\r\n if is_prime:\r\n primes.append(p)\r\n \r\ndef factor(n):\r\n d = set([])\r\n for p in primes:\r\n if p*p > n:\r\n break\r\n while n % p==0:\r\n d.add(p)\r\n n = n//p\r\n if n > 1:\r\n d.add(n)\r\n return d\r\n\r\ndef process(X):\r\n d = factor(X)\r\n answer = float('inf')\r\n for p in d:\r\n for x1 in range(max(p+1, X-p+1), X+1):\r\n for p2 in factor(x1):\r\n entry = max(x1-p2+1, p2+1)\r\n answer = min(answer, entry)\r\n return answer\r\n \r\nX = int(input())\r\nprint(process(X))", "x=int(input())\naa=[1]*1111111\nfor ii in range(2,x):\n if aa[ii]==1:\n for jj in range(ii*2,x+1,ii):\n aa[jj]=ii\ndef aaa(ii):\n if aa[ii]==1:\n return ii\n jj=ii-1\n jj=jj-(jj%aa[ii])\n ans=max(3,jj+1)\n return ans\nans=min(aaa(ii) for ii in range(aaa(x),x+1))\nprint(ans)\n \t \t\t\t \t \t\t\t \t \t \t\t \t\t\t\t \t", "small_prime = [0]*(10**6+1)\r\nfor i in range(2,10**6+1):\r\n if small_prime[i] != 0:\r\n continue\r\n small_prime[i] = i\r\n for j in range(1,10**6+1):\r\n temp = i*j\r\n if temp>10**6:\r\n break\r\n small_prime[temp] = i\r\n\r\ndef find(X):\r\n # find all prime \r\n org = X\r\n P = set([])\r\n while small_prime[X] != X:\r\n P.add(small_prime[X])\r\n X = X//small_prime[X]\r\n P.add(X)\r\n P = sorted(list(P))\r\n Mp = P[-1]\r\n if Mp == org:\r\n return X\r\n return org-Mp+1\r\n\r\ndef find_ans(X):\r\n X1 = find(X)\r\n ans = X\r\n for x1 in range(X1,X):\r\n ans = min(ans,find(x1))\r\n return ans\r\n\r\nprint(find_ans(int(input())))", "n = int(input())\n\nans = n\n\nf = [0]*(n+1)\n\nfor i in range(2, n+1):\n\n if f[i]==0:\n\n for j in range(i*2, n+1, i):\n\n f[j] = i\n\n f[i] = i-f[i]+1\n\nfor i in range(f[n], n+1):\n\n ans = min(ans, f[i])\n\nprint(ans)\n\n\n\n# Made By Mostafa_Khaled", "from sys import stdin\nmaxn = 1000006\nprime = [0] * maxn\ndef getPrimes():\n n = 2\n while(n < maxn):\n num = n*2\n while(num < maxn):\n prime[num] = n\n num += n\n num = n + 1\n while( num < maxn and prime[num]!= 0 ):\n num += 1\n n = num\n\n\ndef main():\n getPrimes()\n n = int(stdin.readline().strip())\n a = 0\n b = prime[n]\n x0 = 9999999\n for i in range(n-b+1,n+1):\n \n a = prime[i]\n x0 = min(i-a+1,x0)\n #print(\"i\",i,\"prime[i]\",prime[i],\"x0\",x0)\n print(x0)\n\nmain()\n", "n = int(input())\ne = [0 for i in range(n+1)]\nfor i in range(2, n+1):\n if (e[i] == 0):\n for j in range(i+i, n+1, i):\n e[j] = i\n e[i] = i -e[i]+1\nans = n\nfor i in range(e[n], n+1):\n ans = ans if (ans<e[i]) else e[i]\nprint(ans)\n \t \t\t \t \t \t\t\t\t\t \t \t\t\t\t \t\t" ]

[ "def calcEdges(n, m):\r\n if n == 1:\r\n return m // 2 if m % 2 == 0 else m // 2 + 1\r\n if m == 1:\r\n return n // 2 if n % 2 == 0 else n // 2 + 1\r\n top, bottom, left, right = 0, 0, 0, 0\r\n left = n // 2 if n % 2 == 0 else n // 2 + 1\r\n right = n // 2 if m % 2 == 0 else left\r\n n -= 2\r\n m -= 2\r\n top = m // 2\r\n if n % 2 != 0:\r\n bottom = top\r\n else:\r\n bottom = m // 2 if m % 2 == 0 else m // 2 + 1\r\n return top + bottom + left + right\r\n\r\n\r\nn, m = [int(item) for item in input().split(' ')]\r\nx, times = int(input()), 1\r\nmyDict = {}\r\nwhile n > 0 and m > 0:\r\n myDict[times] = calcEdges(n, m)\r\n times += 1\r\n n -= 2\r\n m -= 2\r\nprint(myDict[x] if x in myDict else 0)\r\n", "import itertools\nimport math\n\nn, m = [int(k) for k in input().split()]\nx = int(input())\nif n-2*(x-1) < 1 or m-2*(x-1) < 1:\n print(0)\nelif n-2*(x-1) == 1 or m-2*(x-1) == 1:\n print((n+m-4*(x-1))//2)\nelse: print(n+m-2 - 4*(x-1))\n\n\n\n\n", "n,m=list(map(int,input().split()))\r\nx=int(input())\r\nif n-2*(x-1)==m-2*(x-1)==1:\r\n print(1)\r\nelif n-2*(x-1)>0 and m-2*(x-1)>0:\r\n print(n+m-4*x+2)\r\nelse:\r\n print(0)", "'''\r\nBeezMinh\r\n21:04 UTC+7\r\n19/08/2023\r\n'''\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline().rstrip()\r\nn, m = map(int, input().split())\r\nx = int(input())\r\nw, h = n - x - x + 1, m - x - x + 1\r\nif w < 0 or h < 0:\r\n print(0)\r\nelse:\r\n print(max(w + h, 1))", "n, m = map(int, input().split())\r\nx = int(input())\r\nk = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if not (i + j) % 2:\r\n if min(min(i, j) + 1, min(n - i, m - j)) == x:\r\n k += 1\r\nprint(k)\r\n", "def calculateEdges(n: int, m: int) -> int:\r\n if m == 1:\r\n return n // 2 if n % 2 == 0 else n // 2 + 1\r\n if n == 1:\r\n return m // 2 if m % 2 == 0 else m // 2 + 1\r\n top, bot, left, right = 0, 0, 0, 0\r\n\r\n top = m // 2 if m % 2 == 0 else m // 2 + 1\r\n if n % 2 != 0:\r\n bot = top\r\n else:\r\n bot = m // 2\r\n n -= 2\r\n m -= 2\r\n\r\n left = n // 2\r\n\r\n if m % 2 != 0:\r\n right = left\r\n else:\r\n right = n // 2 if n % 2 == 0 else n // 2 + 1\r\n return top + bot + left + right\r\n\r\n\r\nn, m = [int(item) for item in input().split()]\r\nq = int(input())\r\n\r\ntimes, cont = 1, {}\r\n\r\nwhile n > 0 and m > 0:\r\n cont[times] = calculateEdges(n, m)\r\n n -= 2\r\n m -= 2\r\n times += 1\r\n\r\n# print(cont)\r\nprint(cont[q] if q in cont else 0)", "import math\n\nm, n = map(int, input().split())\nx = int(input())\nrows = n-2*(x-1)\ncols = m-2*(x-1)\nif n % 2 == 0:\n rows += 1\nif m % 2 == 0:\n cols += 1\nif rows <= 0 or cols <= 0:\n print(0)\n exit(0)\nif rows == 1:\n counts = math.ceil(cols/2)\nelif cols == 1:\n counts = math.ceil(rows/2)\nelse:\n counts = 2*(math.ceil(rows/2)+math.ceil(cols/2)) - 4\nif n % 2 == 0:\n counts -= 1\nif m % 2 == 0:\n counts -= 1\nprint(counts)\n", "def BLACKED(n, m):\r\n if min(n, m) <= 0:\r\n return 0\r\n return (n * m + 1) // 2\r\n\r\n\r\nn, m = map(int, input().split())\r\nx = int(input())\r\n\r\nif (min(n, m) + 1) // 2 < x:\r\n print(0)\r\nelse:\r\n x -= 1\r\n print(BLACKED(n - 2 * x, m - 2 * x) - BLACKED(n - 2 * x - 2, m - 2 * x - 2))\r\n", "from sys import stdin\r\nfrom math import ceil\r\ninp = stdin.readline\r\n\r\na, b = map(int, inp().split())\r\nk = int(inp()) - 1\r\na = max(a-2*k, 0)\r\nb = max(b-2*k, 0)\r\n\r\nif a > 1 and b > 1:\r\n print(a+b-2)\r\nelif a > 1 and b > 0:\r\n print(ceil(a/2))\r\nelif a > 0:\r\n print(ceil(b/2))\r\nelse:\r\n print(0)\r\n", "def calcEdges(n,m):\r\n if n == 1:\r\n return m // 2 if m % 2 == 0 else m // 2 + 1\r\n if m == 1:\r\n return n // 2 if n % 2 == 0 else n // 2 + 1\r\n left, right, top, bottom = 0, 0, 0, 0\r\n left = n // 2 if n % 2 == 0 else n // 2 + 1\r\n right = n // 2 if m % 2 == 0 else left\r\n m = m-2\r\n top = m//2\r\n if n % 2 != 0:\r\n bottom = top\r\n else:\r\n bottom = m // 2 if m % 2 == 0 else m // 2 + 1\r\n return left + right + top + bottom\r\n\r\n\r\nn, m = [int(item) for item in input().split(' ')]\r\nx = int(input())\r\nmyDict = dict()\r\ntimes = 1\r\nwhile n > 0 and m > 0:\r\n myDict[times] = calcEdges(n,m)\r\n times += 1\r\n n -= 2\r\n m -= 2\r\n\r\nprint(myDict[x] if x in myDict else 0)", "n,m=map(int,input().split())\r\nx=int(input())\r\nw,h=n-(2*x-1),m-(2*x-1)\r\nif w<0 or h<0:\r\n print(0)\r\nelse:\r\n print(max(w+h,1))\r\n" ]

[ "n=int(input())\r\nq={}\r\nl=[]\r\nr=[]\r\ndef f(a):\r\n while q[a]!=a:\r\n a=q[a]\r\n return a\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n o,p=\"x\"+a,\"y\"+b\r\n l+=[[o,p]]\r\n r+=[o,p]\r\n q[o]=o\r\n q[p]=p\r\nfor i in range(n):\r\n l[i][0]=f(l[i][0])\r\n l[i][1]=f(l[i][1])\r\n q[l[i][1]]=q[l[i][0]]\r\nfor i in r:\r\n q[i]=f(i)\r\nprint(len(set(q.values()))-1)", "nodes = []\nn = int(input().strip())\nfor _ in range(n):\n\tnodes.append(tuple(map(int, input().strip().split())))\n\nvisited = [False]*n\n\ndef dfs(node):\n\tvisited[node] = True\n\tfor i in range(n):\n\t\tif not visited[i] and (nodes[node][0] == nodes[i][0] or nodes[node][1] == nodes[i][1]):\n\t\t\tdfs(i)\n\nans = 0\nfor i in range(n):\n\tif not visited[i]:\n\t\tdfs(i)\n\t\tans += 1\n\nprint(ans-1)\n", "#editorial is very clear\nfrom collections import *\nimport bisect\nimport heapq\n\nSIZE = 1000\n\ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n\ndef bfs(xy, start):\n\tvisited[xy][start] = True\n\tto_visit = deque()\n\tto_visit.append((xy, start))\n\thave_child = False\n\twhile to_visit:\n\t\txy_, val = to_visit.popleft()\n\t\tfor xy1, val1 in graph[xy_][val]:\n\t\t\thave_child = True\n\t\t\tif not visited[xy1][val1]:\n\t\t\t\tvisited[xy1][val1] = True\n\t\t\t\tto_visit.append((xy1, val1))\n\treturn have_child\n\n\n \nn = ri()\ngraph = [[[] for _ in range(1000)] for xy in [0,1]]\n\nfor i in range(n):\n\tx, y = rl()\n\t#zero indexing\n\tx -= 1\n\ty -= 1\n\t#add edges\n\tgraph[0][x].append([1,y])\n\tgraph[1][y].append([0,x])\n\nconnected_components = 0\nvisited = [[False for _ in range(1000)] for xy in [0,1]]\nfor xy in [0,1]:\n\tfor start in range(1000):\n\t\tif not visited[xy][start]:\n\n\t\t\thave_child = bfs(xy, start)\n\t\t\tif have_child:\n\t\t\t\tconnected_components += 1\n\nprint(connected_components - 1)\n\n", "def dfs(index):\n visited[index] = 0\n for i in range(n):\n if((graph[i][0] == graph[index][0] or graph[i][1] == graph[index][1] ) and visited[i] == -1 ):\n dfs(i)\n\nn = int(input())\nif(n >= 1 and n <= 100):\n visited = []\n graph = {}\n count = -1\n for i in range(n):\n x, y = input().split()\n x = int(x)\n y = int(y)\n graph[i] = (x, y)\n visited.append(-1)\n\n if((x, y) >= (1,1) and (x,y) <= (1000, 1000)):\n for i in range(n):\n if(visited[i] == -1):\n dfs(i)\n count += 1\nprint(count)\n\n\n \t\t\t\t \t\t \t\t\t\t\t \t\t\t \t\t \t\t\t\t \t", "def dfs(ind,point):\r\n visited[ind]=1\r\n for i in range(n):\r\n if (adj[i][0]==point[0] or adj[i][1]==point[1] ) and visited[i]==-1:\r\n dfs(i,adj[i])\r\n\r\nn=int(input())\r\nadj=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n adj.append(a)\r\nvisited=[-1]*n\r\nans=-1\r\nfor i in range(n):\r\n if visited[i]==-1:\r\n dfs(i,adj[i])\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\npoints=[list(map(int, input().split()))+[False] for i in range(n)]\r\n\r\ndef visit(points,point):\r\n point[2]=True\r\n x,y=point[0],point[1]\r\n for point in points:\r\n if not point[2] and (point[0] == x or point[1] == y):\r\n visit(points,point)\r\nc=-1\r\nfor point in points:\r\n if not point[2]:\r\n c+=1\r\n visit(points,point)\r\n\r\nprint(c)", "n = int(input())\r\nx,y = [],[]\r\nvisited = [0]*n\r\nans= -1\r\n# doing first data structure question on codeforces\r\ndef dfs(x,y,v,j):\r\n\tv[j] = 1\r\n\r\n\tfor i in range(n):\r\n\t\tif v[i]==0 and(x[i]==x[j] or y[i]==y[j]):\r\n\t\t\tdfs(x,y,v,i)\r\n\r\n\r\nfor i in range(n):\r\n\ta,b = list(map(int,input().split()))\r\n\tx.append(a)\r\n\ty.append(b)\r\n\r\nfor i in range(n):\r\n\tif visited[i]==0 :\r\n\t\tdfs(x,y,visited ,i)\r\n\t\tans+=1\r\n\r\nprint(ans)", "\nn = int(input())\nmarks = [0] * n\nabscissas = set()\nordenadas = set()\nrest_abs = []\nrest_ords = []\n\nfor i in range(n):\n x, y = list(map(int, input().split()))\n if len(abscissas) == 0 or x in abscissas or y in ordenadas:\n abscissas.add(x)\n ordenadas.add(y)\n else:\n rest_abs.append(x)\n rest_ords.append(y)\n\naditions = 0\nwhile len(rest_abs) > 0:\n k = -1\n for i in range(len(rest_abs)):\n if rest_abs[i] in abscissas or rest_ords[i] in ordenadas:\n k = i\n\n if k == -1:\n aditions += 1\n abscissas.add(rest_abs.pop(0))\n ordenadas.add(rest_ords.pop(0))\n else:\n abscissas.add(rest_abs.pop(k))\n ordenadas.add(rest_ords.pop(k))\n\nprint(aditions)\n \n \n\n\t\t\t \t\t\t \t\t \t \t \t\t\t\t \t \t \t", "def dfs(i):\r\n sn[i] = 1\r\n for j in g[i]:\r\n if sn[j] != 1:\r\n dfs(j)\r\n\r\nt = 1\r\ncomp = 0\r\nN = 1010\r\ng = [[] for _ in range(N)]\r\ngr = []\r\nsn = [0] * N\r\n\r\ndef solve():\r\n global comp\r\n n = int(input())\r\n for _ in range(n):\r\n a, b = map(int, input().split())\r\n gr.append((a, b))\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if gr[i][0] == gr[j][0] or gr[i][1] == gr[j][1]:\r\n g[i].append(j)\r\n\r\n if g[i]:\r\n g[i].append(-1)\r\n\r\n for j in range(n):\r\n if len(g[j]) > 1:\r\n if sn[j] != 1:\r\n comp += 1\r\n dfs(j)\r\n else:\r\n comp += 1\r\n\r\n print(comp - 1)\r\n\r\nif __name__ == \"__main__\":\r\n for _ in range(t):\r\n solve()\r\n", "def read_input():\r\n graph = []\r\n n = int(input())\r\n for _ in range(n):\r\n line = input().strip().split()\r\n graph.append((int(line[0]), int(line[1])))\r\n return n, graph\r\n\r\ndef calculate(graph):\r\n parent = {}\r\n while len(parent) != len(graph):\r\n for i in range(len(graph)):\r\n if graph[i] not in parent:\r\n parent[graph[i]] = None\r\n dfs_visit(graph[i], graph, parent)\r\n x = 0\r\n for i in range(len(graph)):\r\n if parent[graph[i]] is None:\r\n x += 1\r\n return x\r\ndef dfs_visit(k, graph, parent):\r\n adj_list = [graph[i] for i in range(len(graph)) if graph[i] != k and (graph[i][0] - k[0])*(graph[i][1] - k[1]) == 0]\r\n for h in adj_list:\r\n if h not in parent:\r\n parent[h] = k\r\n dfs_visit(h, graph, parent)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, graph = read_input()\r\n print(calculate(graph) - 1)", "n = int(input())\r\n \r\nans = [0]*(n+1)\r\narr = []\r\n \r\ndef dfs(a):\r\n ans[a] = 1\r\n for i in range(n):\r\n if((arr[i][0]==arr[a][0] or arr[i][1]==arr[a][1]) and ans[i]==0):\r\n dfs(i)\r\n \r\nfor i in range(n):\r\n x,y = map(int,input().strip().split())\r\n arr.append([x,y])\r\n \r\nflag = -1\r\n \r\nfor i in range(n):\r\n if(not ans[i]):\r\n dfs(i)\r\n flag+=1\r\n \r\nprint(flag)", "from collections import defaultdict\r\n\r\nn = int(input())\r\ng = defaultdict(lambda: [])\r\na = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n x1, y1, x2, y2 = *a[i], *a[j]\r\n if x1 == x2 or y1 == y2:\r\n g[(x1, y1)].append((x2, y2))\r\n g[(x2, y2)].append((x1, y1))\r\n\r\nv = set(a)\r\ndef dfs(s):\r\n if s not in v: return\r\n v.remove(s)\r\n for c in g[s]: dfs(c)\r\n\r\ncomp = -1\r\nwhile len(v):\r\n who = v.pop()\r\n v.add(who)\r\n dfs(who)\r\n comp += 1\r\nprint(comp)\r\n", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\n\r\n\r\ndef dfs(sv, l, vis, n):\r\n\r\n vis[sv] = True\r\n for i in range(1, n+1):\r\n if not vis[i] and (l[sv][0] == l[i][0] or l[sv][1] == l[i][1]):\r\n dfs(i, l, vis, n)\r\n\r\n\r\nn = ii()\r\nl = [[0,0]]\r\nfor _ in range(n):\r\n a, b = f()\r\n l.append([a, b])\r\nvis = [False for i in range(n+1)]\r\nans = 0\r\nfor i in range(1,n+1):\r\n if not vis[i]:\r\n dfs(i, l, vis, n)\r\n ans += 1\r\nprint(ans-1)\r\n", "n = int(input())\n\ndrifts = []\nfor i in range(n):\n drifts.append([int(x) for x in input().split()] + [0])\ndrifts.sort()\nc = 0\n\n\ndef dfs(i, group):\n if i < 0 or i >= n or drifts[i][2] != 0:\n return 0\n drifts[i][2] = group\n for j in range(n):\n if drifts[j][0] == drifts[i][0] or drifts[i][1] == drifts[j][1]:\n dfs(j, group)\n\n\nfor i in range(n):\n if drifts[i][2] == 0:\n c += 1\n dfs(i, c)\n\nprint(c - 1)\n", "def union(parent,size,a,b):\r\n x=find(parent,a)\r\n y=find(parent,b)\r\n if size[x]>=size[y]:\r\n parent[y]=x \r\n size[x]+=y \r\n else:\r\n parent[x]=y \r\n size[y]+=x \r\n return parent,size \r\ndef find(parent,x):\r\n while x!=parent[x]:\r\n x=parent[x]\r\n return x\r\nn=int(input())\r\np=[]\r\nparent=[i for i in range(n)]\r\nsize=[1]*n \r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n p.append([a,b])\r\ndef ok(i,j):\r\n x1=p[i][0]\r\n y1=p[i][1]\r\n x2=p[j][0]\r\n y2=p[j][1]\r\n return x1==x2 or y1==y2 \r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if ok(i,j):\r\n parent,size=union(parent,size,i,j)\r\ncnt=0 \r\nfor i in range(n):\r\n if find(parent,i)==i:\r\n cnt+=1 \r\nprint(cnt-1)", "n = int(input())\n\ncoordenadas = []\n\nfor i in range(n):\n coordenadas.append( tuple( map( int, input().split())))\n\neixo = {}\nfor coordenada in coordenadas:\n eixo[coordenada] = False\n\n\nconexoes = []\nfor coordenada_i in coordenadas:\n \n if (not eixo[coordenada_i]):\n \n aux = [coordenada_i]\n eixo[coordenada_i] = True\n \n troca = True\n while(troca):\n \n troca = False\n for coordenada_j in coordenadas:\n \n if (not eixo[coordenada_j]):\n \n for aux_coordenada in aux:\n \n if (coordenada_j[0] == aux_coordenada[0] or coordenada_j[1] == aux_coordenada[1]):\n \n if (not eixo[coordenada_j]):\n \n troca = True\n eixo[coordenada_j] = True\n aux.append(coordenada_j)\n \n \n conexoes.append(aux)\n\n\nprint (len(conexoes) - 1)\n\n\t\t\t \t\t \t\t\t\t\t \t\t\t \t\t \t \t", "import bisect,sys\r\nimport queue\r\nfrom collections import deque, namedtuple\r\nsys.setrecursionlimit(20000)\r\nN = 105\r\nvisited = [0]*N\r\nadj = [(0,0)]*N\r\n\r\ndef dfs(s,n):\r\n x,y = adj[s][0],adj[s][1]\r\n visited[s] = 1\r\n for i in range(n):\r\n if (not visited[i]) and (adj[i][0] == x or adj[i][1] == y):\r\n dfs(i,n)\r\n\r\ndef main():\r\n n,ans = int(input()),0\r\n for _ in range(n):\r\n adj[_] = tuple(map(int,input().split()))\r\n for _ in range(n):\r\n if not visited[_]:\r\n ans += 1\r\n visited[_] = 1\r\n dfs(_,n)\r\n print(ans-1)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nx = [0]\r\ny = [0]\r\ndanh_so = [0]*(n+10)\r\nfor _ in range(n):\r\n s = input()\r\n t = s.split()\r\n x += [int(t[0])]\r\n y += [int(t[1])]\r\ndel (s);del(t)\r\ndef dfs(u, s):\r\n global danh_so\r\n danh_so[u] = s\r\n for i in range(1, n+1):\r\n if danh_so[i] == 0 and (x[i] == x[u] or y[i] == y[u]):\r\n dfs (i, s) \r\nt = 0 #thành phần liên thông\r\nfor i in range(1, n+1):\r\n if danh_so[i] == 0:\r\n t += 1\r\n dfs(i, t)\r\nprint(t-1)\r\n", "def find_best_snow_drifts(snow_drifts, i):\n snow_drifts[i]['checked'] = True\n same_line_snow_drifts = get_points_same_line(snow_drifts, i)\n for t in same_line_snow_drifts:\n find_best_snow_drifts(snow_drifts, t)\n\ndef is_same_line(point1, point2):\n return point1[0] == point2[0] or point1[1] == point2[1]\n\ndef get_points_same_line(snow_drifts, i):\n i_points = []\n for t in range(len(snow_drifts)):\n if ((not snow_drifts[t]['checked']) and t != i and is_same_line(snow_drifts[i]['point'], snow_drifts[t]['point'])):\n i_points.append(t)\n return i_points\n\nif __name__ == \"__main__\":\n n = int(input())\n snow_drifts = []\n solution = 0\n\n for i in range(n):\n coordinates = [int(n) for n in input().split(' ')]\n snow_drifts.append(coordinates)\n\n snow_drifts = [{'point': p, 'checked': False} for p in snow_drifts]\n\n for i in range(len(snow_drifts)):\n if not snow_drifts[i]['checked']:\n find_best_snow_drifts(snow_drifts, i)\n solution += 1\n\n print(solution - 1)", "n=int(input())\r\nans=1\r\nx1=[]\r\ny1=[]\r\nfor i in range(n):\r\n x,y=list(map(int,input().split()))\r\n x1.append({x})\r\n y1.append({y})\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if x1[i]&x1[j] or y1[i]&y1[j]:\r\n x1[j]|=x1[i]\r\n y1[j]|=y1[i]\r\n ans+=1\r\n break\r\nprint(n-ans)\r\n", "entrada = input()\nn = int(entrada)\nresposta = 1\narray_x = []\narray_y = []\n\nfor i in range(n):\n\tx, y = map(int, input().split())\n\tarray_x.append({x})\n\tarray_y.append({y})\n \nfor i in range(n - 1):\n\tfor j in range(i + 1, n):\n\t\t\tif array_x[i] & array_x[j] or array_y[i] & array_y[j]:\n\t\t\t\t\tarray_x[j] |= array_x[i]\n\t\t\t\t\tarray_y[j] |= array_y[i]\n\t\t\t\t\tresposta += 1\n\t\t\t\t\tbreak\n \nprint(n - resposta)\n\t\t \t \t \t\t \t\t\t\t \t\t\t \t\t\t \t\t", "# Problem from Codeforces\r\n# http://codeforces.com/problemset/problem/217/A\r\n\r\n\r\nparent = dict()\r\nranks = dict()\r\n\r\n\r\ndef make_set(N):\r\n global parent, ranks\r\n parent = [i for i in range(N + 5)]\r\n ranks = [0 for i in range(N + 5)]\r\n\r\n\r\ndef find_set(u):\r\n if parent[u] != u:\r\n parent[u] = find_set(parent[u])\r\n return parent[u]\r\n\r\n\r\ndef union_set(u, v):\r\n up = find_set(u)\r\n vp = find_set(v)\r\n\r\n if up == vp:\r\n return\r\n if ranks[up] > ranks[vp]:\r\n parent[vp] = up\r\n elif ranks[up] < ranks[vp]:\r\n parent[up] = vp\r\n else:\r\n parent[up] = vp\r\n ranks[vp] += 1\r\n\r\n\r\ndef solution():\r\n\r\n n_drifts = int(input())\r\n make_set(n_drifts)\r\n drifts = []\r\n for i in range(n_drifts):\r\n x, y = map(int, input().split())\r\n drifts.append([x, y])\r\n\r\n for i in range(n_drifts - 1):\r\n for j in range(i + 1, n_drifts):\r\n if drifts[i][0] == drifts[j][0] or drifts[i][1] == drifts[j][1]:\r\n union_set(i, j)\r\n\r\n leaders = dict()\r\n for i in range(n_drifts):\r\n leader = find_set(i)\r\n if leaders.get(leader) is not None:\r\n leaders[leader] += 1\r\n else:\r\n leaders[leader] = 1\r\n\r\n print(len(leaders) - 1)\r\n\r\n\r\nsolution()\r\n", "# -*- coding: utf-8 -*-\r\n\r\nimport sys\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n drifts = dict()\r\n for _ in range(n):\r\n i, j = map(int, input().split())\r\n drifts[i] = drifts.get(i, set()) | set([j])\r\n drifts = [drifts[k] for k in drifts]\r\n groups = []\r\n\r\n i = 0\r\n group = set()\r\n while i < len(drifts):\r\n if not group:\r\n group |= drifts[i]\r\n j = i + 1\r\n modified = False\r\n while j < len(drifts):\r\n if group & drifts[j]:\r\n group |= drifts.pop(j)\r\n modified = True\r\n break\r\n j += 1\r\n if not modified:\r\n i += 1\r\n groups.append(group)\r\n group = set()\r\n\r\n print(len(groups) - 1)\r\n\r\nif __name__ == '__main__':\r\n sys.exit(main())", "n = int(input())\n\npoint = []\n\nfor i in range(n):\n newx, newy = map(int, input().split())\n point.append((newx, newy))\n\nvisited = [False for i in range(n)]\n\nans = 0\nfor i in range(n):\n if visited[i]:\n continue\n ans += 1\n stack = [i]\n visited[i] = True\n while stack:\n x = stack[-1]\n stack.pop()\n for j in range(n):\n if visited[j]:\n continue\n if point[j][0] != point[x][0] and point[j][1] != point[x][1]:\n continue\n stack.append(j)\n visited[j] = True\n\nprint(ans - 1)", "import sys\r\nsys.setrecursionlimit(10**5)\r\n\r\nn = int(input())\r\nedges = []\r\nfor _ in range(n):\r\n edges.append(list(map(int, input().split())))\r\n \r\nadj = [[] for _ in range(n)]\r\nfor i in range(n-1):\r\n for j in range(i+1, n):\r\n if edges[i][0] == edges[j][0] or edges[i][1] == edges[j][1]:\r\n adj[i].append(j)\r\n adj[j].append(i)\r\n\r\ncount = 0\r\nvis = [False for _ in range(n)]\r\n\r\ndef rec(node):\r\n vis[node] = True\r\n for nei in adj[node]:\r\n if not vis[nei]:\r\n rec(nei)\r\n\r\nfor i in range(n):\r\n if not vis[i]:\r\n count += 1\r\n rec(i)\r\n \r\nprint(count - 1)", "class DisjointSetUnion:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.size = [1] * n\r\n self.num_sets = n\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n a, b = self.find(a), self.find(b)\r\n if a != b:\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n\r\n self.num_sets -= 1\r\n self.parent[b] = a\r\n self.size[a] += self.size[b]\r\n\r\n def set_size(self, a):\r\n return self.size[self.find(a)]\r\n\r\n def __len__(self):\r\n return self.num_sets\r\n\r\n\r\nn = int(input())\r\n\r\n\r\narr = [list(map(int, input().split())) for _ in range(n)]\r\ndsu = DisjointSetUnion(len(arr))\r\n\r\nfor i in range(len(arr)):\r\n ax, ay = arr[i]\r\n for j in range(i + 1, len(arr)):\r\n bx, by = arr[j]\r\n if ax == bx or ay == by:\r\n dsu.union(i, j)\r\n\r\nprint(len(dsu) - 1)\r\n\r\n", "n=int(input())\ncont=1\nxi=[]\nyi=[]\nfor i in range(n):\n x,y=map(int,input().split())\n xi.append({x})\n yi.append({y})\nfor i in range(n-1):\n for j in range(i+1,n):\n if xi[i]&xi[j] or yi[i]&yi[j]:\n \txi[j]|=xi[i]\n \tyi[j]|=yi[i]\n \tcont+=1\n \tbreak\nprint(n-cont)\n\t\t \t \t \t\t \t\t \t\t \t \t", "def solve(x_to_point, y_to_point, visited, x, y, points):\r\n for yi in x_to_point[x]:\r\n if (x, yi) not in visited:\r\n visited.add((x, yi))\r\n if (x, yi) in points:\r\n points.remove((x, yi))\r\n solve(x_to_point, y_to_point, visited, x, yi, points)\r\n \r\n for xi in y_to_point[y]:\r\n if (xi, y) not in visited:\r\n visited.add((xi, y))\r\n if (xi, y) in points:\r\n points.remove((xi, y))\r\n solve(x_to_point, y_to_point, visited, xi, y, points)\r\n \r\n \r\nn = int(input())\r\nx_to_point = {}\r\ny_to_point = {}\r\npoints = set()\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n if x not in x_to_point.keys():\r\n x_to_point[x] = [y]\r\n else:\r\n x_to_point[x].append(y)\r\n \r\n if y not in y_to_point.keys():\r\n y_to_point[y] = [x]\r\n else:\r\n y_to_point[y].append(x)\r\n \r\n points.add((x, y))\r\n \r\nans = -1\r\nwhile len(points) > 0:\r\n ans += 1\r\n visited = set()\r\n point = points.pop()\r\n visited.add(point)\r\n solve(x_to_point, y_to_point, visited, point[0], point[1], points)\r\n \r\nprint(ans)\r\n ", "from collections import deque, defaultdict\r\nn = int(input())\r\npts = [tuple(map(int, input().split())) for i in range(n)]\r\n\r\nG = defaultdict(list)\r\nfor i in range(n):\r\n x, y = pts[i][0], pts[i][1]\r\n for j in range(i+1, n):\r\n if (x == pts[j][0]) or (y == pts[j][1]):\r\n G[(x, y)].append(pts[j])\r\n G[pts[j]].append((x, y))\r\n\r\nvis = set()\r\ncomponents = 0\r\nfor x, y in pts:\r\n if (x,y) not in vis:\r\n components += 1\r\n dq = deque([(x, y)])\r\n vis.add((x, y))\r\n while dq:\r\n p, q = dq.popleft()\r\n for i, j in G[(p, q)]:\r\n if (i, j) not in vis:\r\n dq.append((i, j))\r\n vis.add((i, j))\r\n\r\nprint(components-1)\r\n", "# coding: utf-8\nn = int(input())\ncoords = []\ngraph = {}\n\nfor i in range(n):\n x, y = input().split(\" \")\n coords.append([int(x), int(y)])\n graph[i] = []\n\nfor i in range(n):\n for j in range(n):\n if i != j:\n if coords[i][0] == coords[j][0] or coords[i][1] == coords[j][1]:\n graph[i].append(j)\n graph[j].append(i)\n\nmarked = n * [0]\n\ndef mark(current):\n marked[current] = 1\n for i in graph[current]:\n if not marked[i]:\n mark(i)\n\ncount = -1\nfor i in range(n):\n if not marked[i]:\n mark(i)\n count = count + 1\n\nprint(count)\n\t \t\t\t\t\t \t \t\t \t\t\t \t\t\t \t\t \t\t", "MAXN = 1001\n\nadj_list = {}\nvisited = {}\n\ndef visit(idx):\n if visited[idx]: return\n visited[idx] = True\n for e in adj_list[idx]:\n visit(e)\n\ndef count_components():\n count = 0\n for i in adj_list.keys():\n if not visited[i]:\n count += 1\n visit(i)\n return count\n\nlines = []\ncols = []\nfor i in range(MAXN):\n lines.append(None)\n cols.append(None)\n\nn = int(input())\nfor i in range(n):\n x, y = list(map(int, input().split()))\n if (x,y) not in adj_list:\n adj_list[(x,y)] = []\n visited[(x,y)] = False\n if lines[x]: \n adj_list[(x,y)].append(lines[x])\n adj_list[lines[x]].append((x,y))\n else: lines[x] = (x,y)\n if cols[y]: \n adj_list[(x,y)].append(cols[y])\n adj_list[cols[y]].append((x,y))\n else: cols[y] = (x,y)\n\nprint(count_components() - 1)", "n = int(input())\r\np = []\r\n\r\ndef dfs(i):\r\n p[i][-1] = res\r\n for j in range(n):\r\n if p[j][-1] == -1 and (p[i][0] == p[j][0] or p[i][1] == p[j][1]):\r\n dfs(j)\r\n\r\nres = -1\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n p.append([x, y, -1])\r\nfor i in range(n):\r\n if p[i][-1] == -1:\r\n res += 1\r\n dfs(i)\r\nprint(res)\r\n", "arrayX = []\r\narrayY = []\r\narray = []\r\n\r\nfor i in range(101):\r\n arrayX.append(None)\r\n arrayY.append(None)\r\n array.append(None)\r\n \r\nentrada = int(input())\r\nvalorAux = 0\r\n \r\ndef calc(i):\r\n array[i]=1\r\n for j in range(1, entrada+1):\r\n if(array[j]!=1 and (arrayX[i]==arrayX[j] or arrayY[i]==arrayY[j])):\r\n calc(j)\r\n return\r\n \r\nfor i in range(1, entrada+1):\r\n valores = input().split()\r\n x = int(valores[0])\r\n y = int(valores[1])\r\n arrayX.insert(i, x)\r\n arrayY.insert(i, y)\r\nfor i in range(1, entrada+1):\r\n if(array[i]!=1): \r\n calc(i)\r\n valorAux+=1\r\n \r\nprint(valorAux-1)", "def clc(): \r\n n = int(input())\r\n res = 0\r\n arr= []\r\n from collections import defaultdict\r\n graph = defaultdict(lambda:[])\r\n for _ in range(n):\r\n a,b = map(int,input().split())\r\n arr.append((a,b))\r\n for i in range(0,n):\r\n for j in range(i+1,n):\r\n if arr[i][0] == arr[j][0] or arr[i][1] == arr[j][1]:\r\n graph[i].append(j)\r\n graph[j].append(i)\r\n \r\n def dfs(node):\r\n vis.add(node)\r\n for ele in graph[node]:\r\n if ele not in vis:\r\n dfs(ele)\r\n \r\n vis = set()\r\n count = 0\r\n for i in range(0,n):\r\n if i not in vis:\r\n dfs(i)\r\n count+=1\r\n\r\n\r\n res= count-1\r\n print(res)\r\n \r\n\r\n return True\r\ncc = clc()\r\n\r\nif not cc :\r\n print(0)\r\n ", "import sys\n\ndef main():\n\n n = int(input())\n dics = dict()\n\n for _ in range(n):\n\n i, j = map(int, input().split())\n dics[i] = dics.get(i, set()) | set([j])\n\n dics = [dics[k] for k in dics]\n teams = []\n\n i = 0\n g = set()\n\n while i < len(dics):\n if not g:\n g |= dics[i]\n j = i + 1\n f = False\n while j < len(dics):\n if g & dics[j]:\n g |= dics.pop(j)\n f = True\n break\n j += 1\n if not f:\n i += 1\n teams.append(g)\n g = set()\n\n print(len(teams) - 1)\n\nif __name__ == '__main__':\n sys.exit(main())\n\t \t \t\t \t \t \t \t\t\t \t\t\t", "def get(k):\n if d[k] != k:\n d[k] = get(d[k])\n return d[k]\n\n\nn = int(input())\nd = {}\ndrifts = [[c for c in input().split()] for _ in range(n)]\n\nfor i in range(len(drifts)):\n x1, y1 = drifts[i]\n for j in range(i+1, len(drifts)):\n x2, y2 = drifts[j]\n if x1 == x2 or y1 == y2:\n d.setdefault(i, i)\n d.setdefault(j, j)\n k = get(i)\n l = get(j)\n if k != l:\n d[k] = l\n n -= 1\nprint(n-1)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [-1]*2005\r\n\r\ndef find(x):\r\n if d[x] < 0:\r\n d[x] = x\r\n if d[x] != x:\r\n d[x] = find(d[x])\r\n return d[x]\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n b += 1000\r\n n -= (d[a] >=0) + (d[b] >=0) - (find(a) == find(b))\r\n d[find(a)] = find(b)\r\nprint(n-1)", "\r\n#cf 217 a\r\nxvisited = [False for i in range(1001)]\r\nyvisited = [False for i in range(1001)]\r\ndef dfs(g1, g2, n, axis):\r\n\tif(axis == True):\r\n\t\txvisited[n] = True\r\n\t\tfor node in g1[n]:\r\n\t\t\tif (yvisited[node]==False):\r\n\t\t\t\t\tdfs(g2, g1, node, False)\r\n\r\n\telse:\r\n\t\tyvisited[n] = True\r\n\t\tfor node in g1[n]:\r\n\t\t\tif (xvisited[node]==False):\r\n\t\t\t\t\tdfs(g2, g1, node, True)\r\n\r\nn = int(input ())\r\n#declare g as an empty dict\r\ngx = {}\r\ngy = {}\r\nfor i in range (n):\r\n\tx, y = input().split(\" \")\r\n\tx = int(x); y=int(y)\r\n\tif x not in gx:\r\n\t\tgx[x] = [y]\r\n\telse:\r\n\t\tgx[x].append(y)\r\n\t\r\n\tif y not in gy:\r\n\t\tgy[y] = [x]\r\n\telse:\r\n\t\tgy[y].append(x)\r\n\t\r\n\r\ncount = 0\r\nfor k in gx:\r\n\tif(xvisited[k] == False):\r\n\t\tcount+=1\r\n\t\tdfs(gx, gy, k, True)\r\n\r\nprint(count-1)", "n, xd, yd, val = int(input()), [], [], 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n xd.append({x})\r\n yd.append({y})\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if xd[i] & xd[j] or yd[i] & yd[j]:\r\n xd[j] |= xd[i]\r\n yd[j] |= yd[i]\r\n val += 1\r\n break\r\nprint(n - val - 1)\r\n", "\r\n\r\ndef makeSet(MAX):\r\n global parent,ranks\r\n parent= [i for i in range(MAX )]\r\n ranks = [1 for i in range(MAX )]\r\n# Path compression\r\ndef findSet(u):\r\n if parent[u] != u:\r\n parent[u] = findSet(parent[u])\r\n return parent[u]\r\n\r\ndef unionSet(u,v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n if up == vp:\r\n return -2\r\n else:\r\n if ranks[up] > ranks[vp]:\r\n ranks[up] += ranks[vp]\r\n parent[vp] = up\r\n else:\r\n ranks[vp] += ranks[up]\r\n parent[up] = vp\r\nif __name__ == \"__main__\":\r\n N = int(input())\r\n x = [0 for _ in range(N)]\r\n y = [0 for _ in range(N)]\r\n for i in range(N):\r\n x[i], y[i] = map(int, input().split())\r\n makeSet(N)\r\n ans = 0\r\n for i in range(N):\r\n for j in range(i+1,N):\r\n if x[i] == x[j] or y[i] == y[j]:\r\n unionSet(i,j)\r\n for i in range(N):\r\n for j in range(i+1,N):\r\n xt = unionSet(i,j)\r\n if xt != -2:\r\n ans += 1\r\n print(ans)\r\n# Complexity O(Test*N)", "import sys\r\nsys.setrecursionlimit(10000)\r\n \r\nn = int(input())\r\nentrada =[]\r\nfor i in range(n):\r\n \ta, b = map(int,input().split())\r\n \tentrada.append((a,b))\r\n \r\nvis = [0 for i in range(n)]\r\n \r\ndef alcanca(i, j, i2, j2):\r\n\treturn i == i2 or j == j2\r\n \r\ndef DFS(i, j, indice):\r\n\tvis[indice] = 1\r\n\tfor m in range(n):\r\n\t\tif vis[m] == 0 and alcanca(i, j, entrada[m][0], entrada[m][1]):\r\n\t\t\tDFS(entrada[m][0], entrada[m][1], m)\r\ncomponentes = 0\r\nfor i in range(n):\r\n\tif vis[i] == 0:\r\n\t\tcomponentes +=1\r\n\t\tDFS(entrada[i][0], entrada[i][1], i)\r\n \r\nprint(componentes -1)\r\n ", "n = int(input())\n\ncoords = []\nx = [0] * n\ny = [0] * n\n\nfor i in range(n):\n x[i], y[i] = map(int, input().split())\n\n\nvisited = [False for _ in range(n)]\n\ndef dfs(i):\n visited[i] = True\n\n for j in range(n):\n if (x[i] == x[j] or y[i] == y[j]) and not visited[j]:\n dfs(j)\n \nans = -1\nfor i in range(n):\n if not visited[i]:\n \n dfs(i)\n ans += 1\n\nprint(ans)\n\n\n", "def dfs(v):\r\n used[v] = True\r\n for u in g[v]:\r\n if not used[u]:\r\n dfs(u)\r\n\r\n\r\nn = int(input())\r\ng = [[] for i in range(n)]\r\nused = [False] * n\r\nlst = [(0, 0) for i in range(n)]\r\nfor i in range(n):\r\n lst[i] = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if lst[i][0] == lst[j][0] or lst[i][1] == lst[j][1]:\r\n g[i].append(j)\r\n g[j].append(i)\r\ncmp = -1\r\nfor i in range(n):\r\n if not used[i]:\r\n cmp += 1\r\n dfs(i)\r\nprint(cmp)\r\n", "from collections import defaultdict\r\n\r\nn=int(input())\r\ncoordsX=defaultdict(list)\r\ncoordsY=defaultdict(list)\r\nfor i in range(n):\r\n inStr=input()\r\n x=int(inStr.split()[0])\r\n y=int(inStr.split()[1])\r\n coordsX[x].append(i)\r\n coordsY[y].append(i)\r\n\r\ngraph=defaultdict(list)\r\nfor k in coordsX.keys():\r\n piles=coordsX[k]\r\n for pile in piles:\r\n graph[pile].extend([p for p in piles if p!=pile])\r\nfor k in coordsY.keys():\r\n piles=coordsY[k]\r\n for pile in piles:\r\n already=graph[pile]\r\n graph[pile].extend([p for p in piles if p!=pile and p not in already])\r\n\r\n\r\n\r\ndef getConnectedComponents(graph, n):\r\n visited=[]\r\n def bfs(k):\r\n queue=[k]\r\n while queue:\r\n vertex=queue.pop(-1)\r\n if vertex not in visited:\r\n visited.append(vertex)\r\n queue.extend([x for x in graph[vertex] if x not in visited])\r\n ans=-1\r\n for el in range(n):\r\n if el not in visited:\r\n ans+=1\r\n bfs(el)\r\n return ans\r\n\r\n\r\n\r\nprint(getConnectedComponents(graph, n))", "n=int(input())\r\nparent=[i for i in range(n)]\r\ndef find(x):\r\n if parent[x]!=x:\r\n parent[x]=find(parent[x])\r\n return parent[x]\r\ndef union(i,j):\r\n pi,pj=find(i),find(j)\r\n parent[pi]=pj\r\narr=[]\r\nfor _ in range(n):\r\n arr.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if arr[i][0]==arr[j][0] or arr[i][1]==arr[j][1]:\r\n union(i,j)\r\nfor i in range(n):\r\n find(i)\r\nprint(len(set(parent))-1)\r\n ", "n, xi, yi, valor = int(input()), [], [], 0\n\nfor i in range(n):\n x, y = map(int, input().split())\n\n xi.append({x})\n yi.append({y})\n\n\nfor i in range(n - 1):\n for j in range(i + 1, n):\n\n if xi[i] & xi[j] or yi[i] & yi[j]:\n\n xi[j] |= xi[i]\n yi[j] |= yi[i]\n \n valor += 1\n \n break\n\nvalor_saida = n - valor - 1\n\nprint(valor_saida)\n\t\t \t \t \t \t\t\t\t\t \t \t\t \t\t\t \t", "def dfs(v):\n global us, k\n us[v] = True\n for j in range(len(k)):\n if (k[j][0] == k[v][0] or k[j][1] == k[v][1]) and not us[j]:\n dfs(j)\n\nn = int(input())\nk = []\nfor i in range(n):\n s, d = [int(i) for i in input().split()]\n k.append([s, d])\nus = [False] * len(k)\ne = -1\nfor i in range(len(k)):\n if not us[i]:\n e += 1\n dfs(i)\nprint(e)\n \t\t \t\t\t\t\t \t\t \t \t \t \t", "# @author godmar\n\nn = int(input())\nxy = [[int(x) for x in input().split()] for i in range(n)]\n\n# count number of connected components\nvisited = [False] * n\nconnected_components = 0\nfor i in range(n):\n if not visited[i]:\n connected_components += 1\n visited[i] = True\n queue = [i]\n while len(queue) > 0:\n j = queue.pop()\n for k in range(n):\n if j != k \\\n and (xy[j][0] == xy[k][0] or xy[j][1] == xy[k][1]) \\\n and not visited[k]:\n visited[k] = True\n queue.append(k)\n\nprint (connected_components-1) \n", "MAXN = int(1e3 + 1)\nN = 0\nMAP = [0] * MAXN\nPARENT = [0] * MAXN\n\ndef entrypoint():\n global N, MAP\n extract_coods = lambda coords : { 'x': coords[0], 'y': coords[1] }\n\n N = int(input())\n populate_parents(N)\n\n for i in range(N):\n coords = list(map(int, input().split()))\n MAP[i] = extract_coods(coords)\n\ndef populate_parents(N):\n for i in range(N):\n PARENT[i] = i\n\ndef find(x):\n if PARENT[x] == x: return x\n ret = find(PARENT[x])\n PARENT[x] = ret\n return ret\n\ndef union_set(a, b):\n parentA = find(a)\n parentB = find(b)\n\n if parentA == parentB: return\n PARENT[parentB] = parentA\n\ndef run():\n answer = -1\n\n for i in range(N):\n for j in range(N):\n if MAP[i]['x'] == MAP[j]['x'] or MAP[i]['y'] == MAP[j]['y']:\n union_set(i, j)\n \n for i in range(N):\n if find(i) == i:\n answer += 1\n \n return answer\n\n\ndef main():\n entrypoint()\n print(run())\n\nif __name__ == '__main__':\n main()", "N = 1000\r\narr, x, y, ans = [0] * N, [0] * N, [0] * N, 0\r\n\r\n\r\ndef find(root):\r\n if root == arr[root]: return root\r\n\r\n arr[root] = find(arr[root])\r\n return arr[root]\r\n\r\n\r\ndef merge(a, b):\r\n idxa, idxb = find(a), find(b)\r\n if idxa == idxb: return\r\n arr[idxa] = idxb\r\n\r\nn = int(input())\r\n\r\nfor index in range(1, n + 1):\r\n _x, _y = map(int, input().split())\r\n \r\n x[index] = _x\r\n y[index] = _y\r\n\r\nfor index in range(1, n + 1): \r\n arr[index] = index\r\n\r\nfor a in range(1, n + 1):\r\n for b in range(a + 1, n + 1):\r\n if x[a] == x[b] or y[a] == y[b]:\r\n merge(a, b)\r\n\r\nfor index in range(1, n + 1):\r\n if arr[index] == index: \r\n ans += 1\r\n\r\nprint(str(ans - 1))\r\n", "\ndrifts = []\nvisited = set()\n\nfor _ in range(int(input())):\n x, y = map(int, input().split(\" \"))\n drifts.append((x, y))\n \ndef is_possible(x, y):\n if x[0] == y[0] or x[1] == y[1]:\n return True\n return False\n \n \ncount = -1\nfor i in range(len(drifts)):\n if i not in visited: \n count += 1\n stack = [i]\n while stack:\n x = stack.pop()\n visited.add(x)\n for y in range(i + 1, len(drifts)):\n if is_possible(drifts[x], drifts[y]) and y not in visited:\n stack.append(y)\nprint(count)\n \n \t\t\t \t \t \t\t \t \t\t \t", "n = int(input())\r\narr = []\r\ng = {}\r\n\r\nfor _ in range(n):\r\n arr.append(list(map(int, input().split())))\r\n g[_] = []\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n if arr[i][0] == arr[j][0] or arr[i][1] == arr[j][1]:\r\n g[i].append(j)\r\n g[j].append(i)\r\n \r\nvis = [0] * n\r\ndef dfs(u):\r\n st = [u]\r\n vis[u] = 1\r\n while st:\r\n u = st.pop()\r\n for v in g[u]:\r\n if not vis[v]:\r\n vis[v] = 1\r\n st.append(v)\r\n\r\nc = -1\r\nfor i in range(n):\r\n if not vis[i]:\r\n dfs(i)\r\n c += 1\r\n\r\nprint(c)", "MAX_N = 105\r\nroot = [[] for _ in range(MAX_N)]\r\n\r\nn = int(input().strip())\r\n\r\nfor i in range(n):\r\n u, v = map(int, input().strip().split())\r\n root[i] = [u, v, i]\r\n\r\n\r\ndef find_root(u):\r\n if root[u[2]][2] == u[2]:\r\n return u[2]\r\n else:\r\n root[u[2]][2] = find_root(root[u[2]])\r\n return root[u[2]][2]\r\n\r\n\r\ndef union_set(u, v):\r\n root_u = find_root(u)\r\n root_v = find_root(v)\r\n if root_u != root_v:\r\n if root_u < root_v:\r\n root[root_u][2] = root_v\r\n else:\r\n root[root_v][2] = root_u\r\n\r\n\r\nans = n\r\n\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if root[i][0] == root[j][0] or root[i][1] == root[j][1]:\r\n if find_root(root[i]) != find_root(root[j]):\r\n ans -= 1\r\n union_set(root[i], root[j])\r\n\r\nprint(\"%s\" % (ans - 1))\r\n", "from collections import deque\ndef main():\n n = int(input())\n graph = {}\n vertices = []\n\n for i in range(n):\n edges = []\n vertex=tuple(map(int,input().split()))\n for i in vertices:\n if i[0]==vertex[0] or i[1]==vertex[1]:\n edges.append(i)\n graph[i].append(vertex)\n\n vertices.append(vertex)\n graph[vertex]=edges\n\n visited = dict.fromkeys(vertices,False)\n print(connected_component(visited,graph, vertices)-1)\n\n\ndef connected_component(visited, graph, vertices):\n connected_comp = 0\n for i in vertices:\n if not visited[i]:\n connected_comp += 1\n d = deque()\n d.append(i)\n while d:\n t = d.popleft()\n if not visited[t]:\n for edges in graph[t]:\n d.append(edges)\n visited[t] = True\n return connected_comp\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\ncoor=[]\r\ngraph=[]\r\ncnt=0\r\nfor i in range(n):\r\n xy=tuple(map(int,input().split()))\r\n coor.append(xy)\r\n flag=0\r\n for j in range(len(graph)):\r\n if xy[0] in graph[j][0]:\r\n graph[j][1].add(xy[1])\r\n flag=1\r\n if xy[1] in graph[j][1]:\r\n graph[j][0].add(xy[0])\r\n flag=1\r\n\r\n if flag==0:\r\n graph.append([{xy[0]},{xy[1]}])\r\n\r\nwhile True:\r\n l=len(graph)\r\n flag,i=0,0\r\n while i<l:\r\n j=i+1\r\n while j<l:\r\n if max(len(graph[i][0].intersection(graph[j][0])),len(graph[i][1].intersection(graph[j][1])))>0:\r\n graph[i][0]=graph[i][0].union(graph[j][0])\r\n graph[i][1]=graph[i][1].union(graph[j][1]) \r\n l-=1\r\n flag=1\r\n graph.pop(j)\r\n else:\r\n j+=1\r\n i+=1 \r\n if flag==0:\r\n break \r\n \r\nprint(len(graph)-1) \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\nr = defaultdict(list)\r\nc = defaultdict(list)\r\narr = []\r\ncnt = 0\r\nvis = set()\r\n\r\nfor _ in range(n):\r\n\tx, y = map(int, input().split())\r\n\tr[x].append((x, y))\r\n\tc[y].append((x, y))\r\n\tarr.append((x, y))\r\n\r\ndef process(p):\r\n\tif p in vis:\r\n\t\treturn\r\n\tvis.add(p)\r\n\tfor x in r[p[0]]:\r\n\t\tprocess(x)\r\n\tfor y in c[p[1]]:\r\n\t\tprocess(y)\r\n\r\nfor p in arr:\r\n\tif p in vis:\r\n\t\tcontinue\r\n\tcnt += 1\r\n\tprocess(p)\r\n\r\nprint(cnt - 1)\r\n", "class Node:\r\n def __init__(self, parent, rank):\r\n self.parent = parent\r\n self.rank = rank\r\n\r\n def print(self):\r\n print(self.parent)\r\n print(self.rank)\r\n\r\ndef findRoot(s, u):\r\n if s[u].parent != u:\r\n s[u].parent = findRoot(s, s[u].parent)\r\n return s[u].parent\r\n\r\ndef union(s, u, v):\r\n ru = findRoot(s, u)\r\n rv = findRoot(s, v)\r\n if ru != rv:\r\n if s[ru].rank < s[rv].rank:\r\n s[ru].parent = rv\r\n elif s[ru].rank > s[rv].rank:\r\n s[rv].parent = ru\r\n else:\r\n s[rv].parent = ru\r\n s[ru].rank += 1\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input()) \r\n s = []\r\n for i in range(n):\r\n s.append(Node(i, 0))\r\n a = []\r\n for i in range(n):\r\n u, v = map(int, input().split())\r\n a.append((u, v))\r\n for i in range(n):\r\n for j in range(n):\r\n if a[i][0] == a[j][0] or a[i][1] == a[j][1]:\r\n union(s, i, j)\r\n c = set()\r\n for i in range(n):\r\n c.add(findRoot(s, i))\r\n print(len(c) - 1)", "n = int(input())\r\n\r\np = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n p.append((x, y))\r\n\r\nvisit = [False] * 101\r\ndef dfs(no):\r\n if visit[no]: return\r\n visit[no] = True\r\n for i in range(n):\r\n if p[no][0] == p[i][0] or p[no][1] == p[i][1]:\r\n dfs(i)\r\n\r\nanswer = 0\r\nfor no in range(n):\r\n if visit[no] == False:\r\n answer += 1\r\n dfs(no)\r\n\r\nprint(answer - 1)\r\n", "from collections import defaultdict\r\n\r\n\r\nn=int(input())\r\n\r\npoints=[]\r\ngraph = defaultdict(list)\r\n\r\n\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n points.append([a,b])\r\n\r\nfor i in range(n):\r\n graph[i]=[]\r\n\r\n\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n x1=points[i][0]\r\n y1=points[i][1]\r\n\r\n x2=points[j][0]\r\n y2=points[j][1]\r\n\r\n if x1==x2 or y1==y2:\r\n graph[i].append(j)\r\n graph[j].append(i)\r\n\r\n#print(graph)\r\nvisited=[]\r\ncount=0\r\nqueue=[]\r\n\r\n\r\nfor i in range(n):\r\n if i not in visited:\r\n count+=1\r\n queue.append(i)\r\n\r\n while len(queue)!=0:\r\n node = queue.pop(0)\r\n for node2 in graph[node]:\r\n if node2 not in visited:\r\n queue.append(node2)\r\n visited.append(node2)\r\n\r\n\r\nprint(count-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nn = int(input())\r\nsets = []\r\n\r\nfor i in range(n):\r\n x,y = [int(k) for k in input().split()]\r\n loc1 = -1\r\n loc2 = -1\r\n for i,v in enumerate(sets):\r\n if x in v[0]:\r\n loc1 = i\r\n if y in v[1]:\r\n loc2 = i\r\n #print(x,y, loc1,loc2)#, sets[loc1],sets[loc2])\r\n if loc1 != -1 and loc2 != -1 and loc1 != loc2:\r\n #combine sets at loc1 and loc2\r\n sets.append((sets[loc1][0].union(sets[loc2][0]),sets[loc1][1].union(sets[loc2][1])))\r\n #print(sets)\r\n a = min(loc1,loc2)\r\n b = max(loc1,loc2)\r\n #print(\"here\", loc1, sets[a])\r\n del sets[a]\r\n #print(\"here\", loc2, sets[b-1])\r\n del sets[b-1]\r\n elif loc1 != -1:\r\n sets[loc1][0].add(x)\r\n sets[loc1][1].add(y)\r\n elif loc2 != -1:\r\n sets[loc2][0].add(x)\r\n sets[loc2][1].add(y)\r\n else:\r\n sets.append((set([x]), set([y])))\r\n #print(sets)\r\nprint(len(sets)-1)", "from collections import defaultdict\r\nclass DisjSet: \r\n def __init__(self): \r\n self.rank = defaultdict(lambda:1)\r\n self.parent = defaultdict(lambda:-1) \r\n def find(self, x): \r\n if self.parent[x] == -1 or self.parent[x] == x: \r\n self.parent[x]=x\r\n else:\r\n self.parent[x] = self.find(self.parent[x]) \r\n return self.parent[x] \r\n def sol(self,x,y):\r\n self.parent[x] = y\r\n \r\n\r\n def Union(self, x, y): \r\n\r\n xset = self.find(x) \r\n yset = self.find(y) \r\n\r\n\r\n if xset == yset: \r\n return\r\n\r\n if self.rank[xset] < self.rank[yset]: \r\n self.parent[xset] = yset \r\n\r\n elif self.rank[xset] > self.rank[yset]: \r\n self.parent[yset] = xset \r\n\r\n else: \r\n self.parent[yset] = xset \r\n self.rank[xset] = self.rank[xset] + 1\r\nvisitedr=defaultdict(lambda:False)\r\nvisitedc=defaultdict(lambda:False)\r\ncnt=-1\r\nans=[]\r\nobj=DisjSet()\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n ans.append((a,b))\r\n if visitedr[a]:\r\n obj.Union(visitedr[a],(a,b))\r\n else:\r\n visitedr[a]=(a,b)\r\n if visitedc[b]:\r\n obj.Union(visitedc[b],(a,b))\r\n else:\r\n visitedc[b]=(a,b) \r\nvis=defaultdict(lambda:False) \r\nfor val in ans:\r\n if not vis[obj.find(val)]:\r\n cnt+=1\r\n vis[obj.find(val)]=True\r\nprint(cnt)\r\n#temp=defaultdict(lambda:0)\r\n \r\n ", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn = int(input())\nl1 = []\nl2 = []\nr = 1\n\nfor i in range(n):\n x, y = map(int, input().split())\n l1.append([x])\n l2.append([y])\n\nfor i in range(n-1):\n for j in range(i+1, n):\n if set(l1[i]) & set(l1[j]) or set(l2[i]) & set(l2[j]):\n l1[j] += l1[i]\n l2[j] += l2[i]\n r += 1\n break\nprint(n-r)\n \t \t\t\t \t\t\t\t \t\t\t \t\t \t \t \t\t", "X,Y = {},{}\r\nvisited = {}\r\n\r\ndef dfs(x,y):\r\n visited[(x,y)] = 1\r\n for k in X[x]:\r\n if (x,k) not in visited:\r\n dfs(x,k)\r\n for k in Y[y]:\r\n if (k,y) not in visited:\r\n dfs(k,y)\r\n \r\n\r\nn = int(input())\r\npoints = []\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n if x not in X:\r\n X[x] = [y]\r\n else :\r\n X[x].append(y)\r\n \r\n if y not in Y:\r\n Y[y] = [x]\r\n else :\r\n Y[y].append(x)\r\n points.append((x,y))\r\n \r\nconnected_components = 0\r\n\r\nfor p in points:\r\n x,y = p[0],p[1]\r\n if (x,y) not in visited:\r\n dfs(x,y)\r\n connected_components+=1\r\nprint(connected_components-1)", "def dfs(v):\r\n visited[v] = True\r\n for u in graph[v]:\r\n if not visited[u]:\r\n dfs(u)\r\n\r\n\r\nn = int(input())\r\ngraph = [[] for _ in range(1000*2)]\r\nfor _ in range(n):\r\n a, b = map(lambda x: int(x) - 1, input().split())\r\n graph[a].append(1000+b)\r\n graph[1000+b].append(a)\r\nvisited = [False] * len(graph)\r\ncomp_cnt = 0\r\nfor i in range(len(graph)):\r\n if not visited[i] and graph[i]:\r\n dfs(i)\r\n comp_cnt += 1\r\nprint((comp_cnt - 1) if comp_cnt else 0)\r\n", "MAX_N = 105\r\nroot = [0 for _ in range(MAX_N)]\r\nn = int(input().strip())\r\nx = []\r\ny = []\r\n\r\ndef findRoot(u):\r\n if root[u] == u:\r\n return u\r\n else:\r\n root[u] = findRoot(root[u])\r\n return root[u]\r\n \r\nfor i in range(n):\r\n valx, valy = map(int, input().strip().split())\r\n x.append(valx)\r\n y.append(valy)\r\n \r\nfor i in range(n):\r\n root[i] = i\r\n \r\nres = n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if x[i] == x[j] or y[i] == y[j]:\r\n rootu = findRoot(i)\r\n rootv = findRoot(j)\r\n \r\n if rootu != rootv:\r\n res -= 1\r\n root[rootu] = rootv\r\n \r\nprint(res - 1)", "# https://codeforces.com/problemset/problem/217/A\n\nn = int(input())\npairs = []\nfor _ in range(n):\n a,b = map(int,input().split())\n pairs.append((a,b))\n\nparent = [i for i in range(n)]\n\ndef FIND(x):\n if x!=parent[x]:\n parent[x] = FIND(parent[x])\n return parent[x]\n\ndef union(x,y):\n xRoot = FIND(x)\n yRoot = FIND(y)\n if xRoot != yRoot:\n parent[xRoot]=parent[yRoot]\n\nfor x in range(n):\n for y in range(x+1,n):\n if pairs[x][0]==pairs[y][0] or pairs[x][1]==pairs[y][1]:\n union(x,y)\ncomps = set()\nfor ind in range(n):\n comps.add(FIND(ind))\nprint(len(comps)-1)\n", "points = []\nvisited = []\ndrifts = 0\n\ndef visit(elem):\n visited[elem] = True\n for i in range(len(points)):\n if not visited[i] and (points[i][1] == points[elem][1] or points[i][0] == points[elem][0]):\n visit(i)\n\nn = int(input())\nfor i in range(n):\n points.append(list(map(int, input().split())))\n visited.append(False)\n\nfor j in range(n):\n if not visited[j]:\n drifts += 1\n visit(j)\n\nprint(drifts - 1)\n", "import string\nfrom collections import defaultdict\n\ndef main():\n n = int(input())\n coordis = []\n xs = defaultdict(set)\n ys = defaultdict(set)\n for i in range(n):\n coordis.append([int(x) for x in input().split()])\n xs[coordis[-1][0]].add(i)\n ys[coordis[-1][1]].add(i)\n\n visited = [False for _ in coordis]\n def dfsvisit(node):\n x,y = coordis[node]\n if visited[node]:\n return\n else:\n visited[node]=True\n neibs = xs.get(x,set()) | ys.get(y,set())\n for n in neibs:\n dfsvisit(n)\n\n ccp = 0\n for idx,node in enumerate(coordis):\n if not visited[idx]:\n dfsvisit(idx)\n ccp+=1\n print(ccp-1)\n\n\nmain()", "from collections import defaultdict as d\r\nn=int(input())\r\nl=[]\r\nadj=d(list)\r\nused=[False]*(n+1)\r\ndef dfs(src):\r\n global used\r\n\r\n used[src]=True\r\n if src in adj:\r\n for i in adj[src]:\r\n if not used[i]:\r\n dfs(i)\r\n \r\n \r\n\r\n\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n l.append((x,y))\r\n\r\n\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if l[i][0]==l[j][0] or l[i][1]==l[j][1]:\r\n adj[i+1].append(j+1)\r\n adj[j+1].append(i+1)\r\n\r\ncnt=0\r\nfor i in range(1,n+1):\r\n if not used[i]:\r\n dfs(i)\r\n cnt+=1\r\n\r\n\r\nprint(cnt-1) \r\n", "class DisjointSet:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n \r\n def find(self, i):\r\n if self.parent[i] != i:\r\n self.parent[i] = self.find(self.parent[i])\r\n return self.parent[i]\r\n \r\n def union(self, i, j):\r\n pi = self.find(i)\r\n pj = self.find(j)\r\n if pi != pj:\r\n self.parent[pi] = pj\r\n\r\nn = int(input())\r\ndrifts = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n drifts.append((x, y))\r\n\r\ndsu = DisjointSet(n)\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if drifts[i][0] == drifts[j][0] or drifts[i][1] == drifts[j][1]:\r\n dsu.union(i, j)\r\n\r\nprint(len(set(dsu.find(i) for i in range(n))) - 1)\r\n", "from __future__ import division, print_function\r\nimport sys\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\nimport os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\n#from functools import lru_cache #use @lru_cache(None)\r\nif os.path.exists('in.txt'): sys.stdin=open('in.txt','r')\r\nif os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')\r\n#\r\ndef input(): return sys.stdin.readline()\r\ndef mapi(arg=0): return map(int if arg==0 else str,input().split())\r\n#------------------------------------------------------------------\r\n\r\n\r\n#METHOSD 2 - USING dfs\r\nn = int(input())\r\npair = []\r\nfor i in range(n): pair.append(list(mapi()))\r\nvis = {}\r\ndef dfs(s):\r\n for i in range(n):\r\n if i in vis: continue\r\n if pair[i][0]==pair[s][0] or pair[i][1]==pair[s][1]:\r\n vis[i]=1\r\n dfs(i)\r\nres = 0\r\nfor i in range(n):\r\n if i in vis: continue\r\n vis[i] = 1\r\n dfs(i)\r\n res+=1\r\nprint(res-1)\r\n", "def dfs(src, visited, count):\r\n if src in visited:\r\n return visited, count\r\n stack = [src]\r\n while stack != []:\r\n (x, y) = stack.pop()\r\n for i in dx[x]:\r\n if i not in visited:\r\n stack.append(i)\r\n visited.append(i)\r\n for i in dy[y]:\r\n if i not in visited:\r\n stack.append(i)\r\n visited.append(i)\r\n return visited, count + 1\r\n\r\nn = int(input())\r\ndx = {}\r\ndy = {}\r\nl = []\r\nfor i in range(0, n):\r\n x, y = map(int, input().split())\r\n if x not in dx:\r\n dx[x] = []\r\n if y not in dy:\r\n dy[y] = []\r\n dx[x].append((x, y))\r\n dy[y].append((x, y))\r\n l.append((x, y))\r\n\r\ncount = 0\r\nvisited = []\r\nfor i in l:\r\n visited, count = dfs(i, visited, count)\r\nprint(count - 1)", "n = int(input())\r\nd = [[int(x) for x in input().split()] for i in range(n)]\r\n\r\nns = 0\r\nd = [[x, y, False] for x, y in d]\r\n\r\n\r\ndef walk(i):\r\n cur = d[i]\r\n cur[2] = True\r\n for j in range(n):\r\n if not d[j][2]:\r\n other = d[j]\r\n if cur[0] == other[0] or cur[1] == other[1]:\r\n walk(j)\r\n\r\n\r\nfor i in range(n):\r\n if not d[i][2]:\r\n ns += 1\r\n walk(i)\r\n\r\nprint(ns-1)", "import sys\r\n\r\n\r\ndef dfs(now, used, graf):\r\n used[now] = 1\r\n for i in graf[now]:\r\n if used[i] == 0:\r\n dfs(i, used, graf)\r\n return\r\n\r\n\r\nsys.setrecursionlimit(10000)\r\n\r\nn = int(input())\r\nd = {}\r\ngraf = {}\r\nused = [0] * n\r\nk = 0\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n d[i] = (a, b)\r\n graf[i] = []\r\n\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if d[i][0] == d[j][0] or d[i][1] == d[j][1]:\r\n graf[i].append(j)\r\n graf[j].append(i)\r\n\r\nfor i in range(n):\r\n if used[i] == 0:\r\n dfs(i, used, graf)\r\n k += 1\r\n\r\nprint(k - 1)", "n=int(input())\r\npar=[-1]*10000\r\ndef find_p(x):\r\n if par[x]==-1:\r\n par[x]=x\r\n elif par[x]!=x:\r\n par[x]=find_p(par[x])\r\n return par[x]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n b+=1000\r\n n-=(par[a]>=0)+(par[b]>=0)-(find_p(a)==find_p(b))\r\n par[find_p(a)]=find_p(b)\r\nprint(n-1)", "t = int(input())\ncoord = []\nfor _ in range(t):\n\tcoord.append(tuple([int(p) for p in input().split()]))\ndsu = []\nfor i in range(1001):\n\tdsu.append(set())\nfor i in range(len(coord)):\n\tx, y = coord[i]\n\tdsu[x].add(y)\n\ndsu.sort(key=lambda x:len(x))\n\nfor i in range(len(dsu)):\n\tcounter = 0\n\tfor j in range(i+1, len(dsu)):\n\t\tif dsu[i].intersection(dsu[j]):\n\t\t\tdsu[j] = dsu[j].union(dsu[i])\n\t\t\tcounter += 1\n\tif counter:\n\t\tdsu[i].clear()\n\ntotal = 0\nfor i in range(len(dsu)):\n\tif dsu[i]:\n\t\ttotal += 1\nprint(total-1)", "def solve(P, N):\r\n components = []\r\n for p in P:\r\n join = False\r\n prev = False\r\n which_join = -1\r\n which_prev = -1\r\n for i in range(len(components)):\r\n if p[0] in components[i][0]:\r\n prev = True\r\n which_prev = i\r\n for j in range(i+1, len(components)):\r\n if p[1] in components[j][1]:\r\n join = True\r\n which_join = j\r\n break\r\n break\r\n elif p[1] in components[i][1]:\r\n prev = True\r\n which_prev = i\r\n for j in range(i+1, len(components)):\r\n if p[0] in components[j][0]:\r\n join = True\r\n which_join = j\r\n break\r\n break\r\n if join:\r\n components[which_prev][0] = components[which_prev][0].union(components[which_join][0])\r\n components[which_prev][1] = components[which_prev][1].union(components[which_join][1])\r\n components.remove(components[which_join])\r\n elif prev:\r\n components[which_prev][0].add(p[0])\r\n components[which_prev][1].add(p[1])\r\n else:\r\n components.append([set([p[0]]), set([p[1]])])\r\n return len(components) - 1\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n points = []\r\n for i in range(n):\r\n tmp = [int(_) for _ in input().strip().split(' ')]\r\n points.append(tmp)\r\n print(solve(points, n))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nvisit=[0 for i in range(n+1)]\r\nm=[0]\r\ncount=0\r\nfor i in range(n):\r\n v,v2=map(int,input().split())\r\n m.append([v,v2]) \r\n \r\ndef s(h):\r\n \r\n for j in range(1,n+1):\r\n if h==j:\r\n continue\r\n if (m[h][0]==m[j][0] or m[h][1]==m[j][1]) and visit[j]==0:\r\n visit[j]=1\r\n s(j)\r\nfor i in range(1,n+1):\r\n if visit[i]==0:\r\n count+=1\r\n s(i)\r\n'''for i in range(1,n+1):\r\n if visit[i]==0:\r\n count+=1'''\r\n \r\nprint(count-1)", "n = int(input())\n\ndrifts = list()\n\nfor i in range(n):\n drifts.append(list(map(int, input().split())))\n\ngraph = {}\n\nfor i, d in enumerate(drifts):\n graph[i] = set()\n for j, e in enumerate(drifts):\n if i != j and (d[0] == e[0] or d[1] == e[1]):\n graph[i].add(j)\n\ncolors = 0\ncolorMap = {}\n\nwhile len(colorMap) != n:\n seed = -1\n for i in range(n):\n if not i in colorMap:\n seed = i\n colorMap[i] = colors\n colors += 1\n break\n \n queue = []\n queue.append(seed)\n while (len(queue) != 0):\n node = queue.pop()\n for n_node in graph[node]:\n if not n_node in colorMap:\n colorMap[n_node] = colorMap[node]\n queue.append(n_node)\n\nprint(colors - 1)\n \t \t \t \t\t \t \t \t \t\t \t\t\t\t\t", "def drift(visited,dx,dy,x,y):\r\n for a in dx[x]:\r\n if (x,a) not in visited and a!=y:\r\n visited.append((x,a))\r\n drift(visited,dx,dy,x,a)\r\n for b in dy[y]:\r\n if (b,y) not in visited and b!=x:\r\n visited.append((b,y))\r\n drift(visited,dx,dy,b,y)\r\n return\r\n\r\nn=int(input())\r\nvisited=[]\r\ndx={}\r\ndy={}\r\nlenprevious,total=0,0\r\nfor __ in range(n):\r\n x,y=map(int, input().split())\r\n dx[x]=dx.get(x,[])+[y]\r\n dy[y]=dy.get(y,[])+[x]\r\nfor x in dx:\r\n for y in dx[x]:\r\n if (x,y) not in visited:\r\n visited.append((x,y))\r\n drift(visited,dx,dy,x,y)\r\n connected=len(visited)-lenprevious-1\r\n lenprevious=len(visited)\r\n total+=connected\r\nprint(n-total-1)", "'''input\r\n20\r\n1 1\r\n2 2\r\n3 3\r\n3 9\r\n4 4\r\n5 2\r\n5 5\r\n5 7\r\n5 8\r\n6 2\r\n6 6\r\n6 9\r\n7 7\r\n8 8\r\n9 4\r\n9 7\r\n9 9\r\n10 2\r\n10 9\r\n10 10\r\n'''\r\nclass DSU:\r\n\tdef __init__(self, sz):\r\n\t\tself.parent = list(range(sz))\r\n\t\tself.size = [1] * sz\r\n\r\n\tdef find(self, x):\r\n\t\tif self.parent[x] == x: return x\r\n\t\tself.parent[x] = self.find(self.parent[x])\r\n\t\treturn self.parent[x]\r\n\r\n\tdef union(self, a, b):\r\n\t\ta = self.find(a)\r\n\t\tb = self.find(b)\r\n\t\tif a!=b:\r\n\t\t\tif self.size[a] < self.size[b]:\r\n\t\t\t\tself.parent[a] = b\r\n\t\t\t\tself.size[b] += self.size[a]\r\n\t\t\telse:\r\n\t\t\t\tself.parent[b] = a\r\n\t\t\t\tself.size[a] += self.size[b]\r\n\r\n\tdef is_connected(self,a,b):\r\n\t\treturn self.find(a) == self.find(b)\r\n\r\nn = int(input().strip())\r\nd = DSU(n)\r\narr = []\r\nfor i in range(n):\r\n\tarr.append(tuple(map(int, input().strip().split())))\r\n\r\nfor i in range(n-1):\r\n\tfor j in range(i+1, n):\r\n\t\tif arr[i][0]==arr[j][0] or arr[i][1]==arr[j][1]:\r\n\t\t\td.union(i,j)\r\n\r\nprint(len(set([d.find(i) for i in range(n)]))-1)", "d = {}\r\nb = -1\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = (int(k) for k in input().split())\r\n if not x in d: d[x] = {y}\r\n else: d[x].add(y)\r\nk = d.keys()\r\nfor x in k:\r\n for x1 in k:\r\n if x - x1:\r\n if d[x] & d[x1]:\r\n d[x] = d[x]|d[x1]\r\n d[x1] = set()\r\nfor x in k:\r\n if d[x]: b += 1\r\nprint(b)", "class DisjointSet(object):\r\n def __init__(self, n):\r\n self.n = n\r\n # list of components of each set\r\n self.set_lists = [[i] for i in range(n)]\r\n # pointing to the set of each component\r\n self.set = [i for i in range(n)]\r\n\r\n def find(self, u):\r\n return self.set[u]\r\n\r\n def unite(self, u, v):\r\n u_set, v_set = self.find(u), self.find(v)\r\n if u_set == v_set: # u and v are in the same component\r\n return False\r\n\r\n # set u to the smaller list\r\n if len(self.set_lists[u_set]) > len(self.set_lists[v_set]):\r\n u_set, v_set = v_set, u_set\r\n\r\n # merging the smaller list into the large list\r\n for i in self.set_lists[u_set]:\r\n self.set_lists[v_set].append(i)\r\n # updating set of each element\r\n self.set[i] = v_set\r\n\r\n return True\r\n\r\n def get_count(self):\r\n count = 0\r\n for i in range(self.n):\r\n if self.set[i] == i:\r\n count += 1\r\n return count\r\n\r\n\r\ndef solve(n, points):\r\n assert len(points) == n\r\n dsu = DisjointSet(n)\r\n for i in range(n):\r\n for j in range(i + 1, n):\r\n if points[i][0] == points[j][0] or points[i][1] == points[j][1]:\r\n dsu.unite(i, j)\r\n\r\n return dsu.get_count() - 1\r\n\r\n\r\nn = int(input())\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split(\" \"))\r\n points.append((x, y))\r\nprint(solve(n, points))\r\n", "n=int(input())\nsnowdrifts=[]\nfor s in range(n):\n \n snowdrifts.append(list(map(int,input().split()))+[None])\ndef dfs(current):\n current[2]=True\n for snowdrift in snowdrifts:\n if not snowdrift[2] and (current[0]==snowdrift[0] or current[1]==snowdrift[1]):\n dfs(snowdrift)\na=0\nfor s in snowdrifts:\n if not s[2]:\n a+=1\n dfs(s)\nprint(a-1)\n\t\t\t\t\t\t \t\t \t\t\t \t\t\t \t \t\t\t\t", "# Mateus Brito de Sousa Rangel - 117110914\n \ndef DFS(a,b,x,y,visited):\n \n\tfor i in range(len(a)):\n\t\tif visited[i] == False and (a[i] == x or b[i] == y):\n\t\t\tvisited[i] = True\n\t\t\tDFS(a,b,a[i],b[i],visited)\n \nn = int(input())\na, b = [], []\n \nfor i in range(n):\n \n\tx, y = map(int, input().split())\n\ta.append(x)\n\tb.append(y)\n \nvisited = [False for i in range(n)]\ngroups = 0\n \nfor i in range(n):\n \n\tif visited[i] == False:\n\t\tvisited[i] = True\n \n\t\tDFS(a,b,a[i],b[i],visited)\n\t\tgroups = groups + 1\n \nprint(groups-1)\n \t \t \t \t \t \t \t\t \t \t", "x = [0] * 1005\r\ny = [0] * 1005\r\nv = [False] * 105\r\n\r\ndef dfs(j):\r\n v[j] = True\r\n for i in range(1, n+1):\r\n if not v[i] and (x[i] == x[j] or y[i] == y[j]):\r\n dfs(i)\r\n\r\nn = int(input())\r\n\r\nfor i in range(1, n+1):\r\n x[i], y[i] = map(int, input().split())\r\n\r\nans = 0\r\n\r\nfor i in range(1, n+1):\r\n if not v[i]:\r\n ans += 1\r\n dfs(i)\r\n\r\nprint(ans - 1)\r\n", "from sys import stdin\r\ninput = stdin.buffer.readline\r\n\r\nn = int(input())\r\npoints = []\r\n\r\nfor _ in range(n) :\r\n points.append(list(map(int , input().split())))\r\n\r\ncount = 0 \r\nvisit = set() \r\n\r\ndef dfs(x , y) :\r\n visit.add((x , y))\r\n\r\n for i , j in points :\r\n if (i , j) not in visit and (i == x or j == y) :\r\n dfs(i , j)\r\n\r\nfor x , y in points :\r\n if (x , y) not in visit :\r\n count += 1\r\n dfs(x , y)\r\n\r\nprint(count - 1)", "# juntar em grupos onde é possível chegar de algum deles\n# um grupo são elementos que um pode chegar em outro sem gastar snow drifts extras, ou seja, possui x ou y igual\n# o valor final vai ser qtdGrupos - 1\n\nteste = [[1,2],[4,2],[3,8],[7,6],[6,6],[8,2],[8,8],[6,10],[2,1],[2,8]]\n\nn = int(input())\n\nvisitados = {}\nX = {}\nY = {}\n\ndef dfs(grafo, vertice, visitados):\n visitados.add(vertice)\n for vizinho in grafo[vertice]:\n if vizinho not in visitados:\n dfs(grafo, vizinho, visitados)\n\n# for t in range(len(teste)):\n# i,j = teste[t]\nfor _ in range(n):\n i, j = [int(k) for k in input().split(' ')]\n\n if X.get(i):\n X[i].append(j)\n else:\n X[i] = [j]\n\n if Y.get(j):\n Y[j].append(i)\n else:\n Y[j] = [i]\n\ngrafo = {}\n\nfor key in X.keys():\n grafo[key] = []\n for v in X[key]:\n for z in Y[v]:\n if z not in grafo[key]:\n grafo[key].append(z)\n\ngroups = 0\n\nvisitados = set()\n\nfor node in grafo.keys():\n\n if node not in visitados:\n groups += 1\n dfs(grafo, node, visitados)\n\nprint(groups-1)\n\t \t \t \t \t\t\t\t \t\t\t \t\t \t\t \t", "# Aluno: Matheus Augusto Silva Do Nascimento\n# UFCG \n# Algoritimos Avançados\n# Questão - H - Ice Skating\n\nn = int(input())\nval = 110\nx = [0] * val\ny = [0] * val\nf = [0] * val\ncont = 0\n\ndef resultado(i):\n f[i] = 1\n for j in range(1,n):\n if(f[j]!=1 and (x[i] == x[j] or y[i] == y[j])):\n resultado(j)\n return\n\nfor i in range(n):\n a,b = map(int, input().split())\n x[i] = a\n y[i] = b\n\nfor i in range(n):\n if(f[i] != 1):\n resultado(i)\n cont += 1\n\nprint(cont-1)\n \t \t\t\t \t\t\t \t\t\t \t\t \t\t\t\t", "def depth_first_search(index):\n visited[index] = 0\n for i in range(n):\n if ((graph[i][0] == graph[index][0] or graph[i][1] == graph[index][1]) and visited[i] == -1):\n depth_first_search(i)\n\nif __name__ == '__main__':\n n = int(input())\n if (n >= 1 and n <= 100):\n visited = []\n graph = {}\n cnt = -1\n for i in range(n): \n x, y = input().split()\n x = int(x)\n y = int(y)\n graph[i] = (x, y)\n for i in range(n):\n visited.append(-1)\n if ((x, y) >= (1, 1) and (x, y) <= (1000, 1000)):\n for i in range(n):\n if (visited[i] == -1):\n depth_first_search(i)\n cnt += 1\n print(cnt) \n\t\t \t\t\t\t \t \t \t \t \t\t \t\t\t\t\t", "import sys\nfrom collections import deque\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nn = int(input())\ncomp_count = 0\nseen = set()\nnodes = deque()\nxs = [[] for _ in range(1000)]\nys = [[] for _ in range(1000)]\nfor _ in range(n):\n x, y = map(lambda x: int(x) - 1, input().split())\n xs[x].append((x, y))\n ys[y].append((x, y))\n nodes.append((x, y))\n\nwhile nodes:\n node = nodes.pop()\n\n if node in seen:\n continue\n \n comp_count += 1\n comp = set()\n comp.add(node)\n seen.add(node)\n \n while comp:\n #print(comp)\n node = comp.pop()\n x, y = node\n\n for dx, dy in xs[x]:\n if not (dx, dy) in seen:\n comp.add((dx, dy))\n seen.add((dx, dy))\n \n for dx, dy in ys[y]:\n if not (dx, dy) in seen:\n comp.add((dx, dy))\n seen.add((dx, dy))\n\nprint(comp_count-1)\n\n\n", "# Ice Skating\r\nparent = []\r\nranks = []\r\n\r\ndef make_set(n):\r\n global parent, ranks\r\n parent = [i for i in range(n)]\r\n ranks = [i for i in range(n)]\r\n\r\ndef find_set(u):\r\n global parent\r\n if parent[u] != u:\r\n parent[u] = find_set(parent[u])\r\n return parent[u]\r\n\r\ndef union_set(u, v):\r\n global parent, ranks\r\n up = find_set(u)\r\n vp = find_set(v)\r\n\r\n if up == vp:\r\n return\r\n\r\n if ranks[up] > ranks[vp]:\r\n parent[vp] = up\r\n elif ranks[up] < ranks[vp]:\r\n parent[up] = vp\r\n else:\r\n parent[up] = vp\r\n ranks[vp] += 1\r\n\r\nn = int(input())\r\n\r\nx = [0 for _ in range(n)]\r\ny = [0 for _ in range(n)]\r\n\r\nfor i in range(n):\r\n px, py = list(map(int, input().split()))\r\n x[i] = px\r\n y[i] = py\r\n\r\nmake_set(n)\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if x[i] == x[j] or y[i] == y[j]:\r\n u = find_set(i)\r\n v = find_set(j)\r\n\r\n if u != v:\r\n union_set(u, v)\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n if parent[i] == i:\r\n ans += 1\r\n\r\nans -= 1\r\nprint(ans)", "def fun1(k):\r\n result[k] = 1\r\n for l in range(n):\r\n if not result[l] and (x[k] == x[l] or y[k] == y[l]):\r\n fun1(l)\r\nn = int(input())\r\nx = [0] * n\r\ny = [0] * n\r\nresult = [0] * n\r\nfor i in range(n):\r\n x[i], y[i] = map(int, input().split())\r\nans = -1\r\nfor i in range(n):\r\n if not result[i]:\r\n fun1(i)\r\n ans += 1\r\nprint(ans)", "from sys import stdin,stdout,setrecursionlimit\r\nsetrecursionlimit(10**5)\r\nfrom collections import defaultdict\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\ndef dfs(src):\r\n vis[src]=1\r\n for neigh in g[src]:\r\n if not vis[neigh]:\r\n dfs(neigh)\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n g=defaultdict(list)\r\n l=[lst() for i in range(n)]\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n if l[i][0]==l[j][0] or l[i][1]==l[j][1]:\r\n g[i]+=[j]\r\n g[j]+=[i]\r\n cc=0\r\n vis=[0]*n\r\n for i in range(n):\r\n if not vis[i]:\r\n cc+=1\r\n dfs(i)\r\n print(cc-1)\r\n", "n = int(input())\r\nused = [False]*(n+1)\r\narr = []\r\n\r\ndef dfs(a):\r\n used[a] = True\r\n for i in range(n):\r\n if((arr[i][0]==arr[a][0] or arr[i][1]==arr[a][1]) and not used[i]):\r\n dfs(i)\r\n\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n arr.append([x,y])\r\n\r\nans = -1\r\n\r\nfor i in range(n):\r\n if(not used[i]):\r\n dfs(i)\r\n ans+=1\r\n\r\nprint(ans)\r\n", "def find_connect(point, data, tab):\n\tx = point[0]\n\ty = point[1]\n\tfor point in data:\n\t\tp_x = point[0]\n\t\tp_y = point[1]\n\t\tif (p_x == x or p_y == y) and point not in tab:\n\t\t\ttab.append(point)\n\t\t\tfind_connect(point, data, tab)\n\treturn tab\n\nn = int(input())\nconnect = []\ndata = []\nfor i in range(n):\n\tx, y = [int(i) for i in input().split()]\n\tdata.append([x, y])\ncout = 0\nwhile len(data):\n\ttab = []\n\ttab.append(data[0])\n\ttab = find_connect(data[0], data, tab)\n\tfor p in tab:\n\t\tdata.remove(p)\n\tcout += 1\n\nprint(cout - 1)\n\n'''\n3 \n3 3\n7 4\n3 4\n'''", "n = int(input(\"\"))\r\nnodes = []\r\nedge_list = { i : [] for i in range(n)}\r\nclass Node():\r\n def __init__(self, id, data):\r\n self.id = id\r\n self.x, self.y = data\r\n\r\nfor i in range( n):\r\n curr_x, curr_y = map(int, input(\"\").split())\r\n curr_node = Node(i, (curr_x, curr_y))\r\n nodes.append(curr_node)\r\n\r\nfor i in range(n-1):\r\n x, y = nodes[i].x, nodes[i].y\r\n for j in range(i+1, len(nodes)):\r\n if nodes[j].x == x or nodes[j].y == y:\r\n edge_list[i].append(j)\r\n edge_list[j].append(i)\r\n\r\nvisited = []\r\n\r\n\r\ndef explore(node_id):\r\n if node_id in visited:\r\n return\r\n else:\r\n visited.append(node_id)\r\n for end_node in edge_list[node_id]:\r\n #print(\"end node is {}\".format(end_node))\r\n explore(end_node)\r\n#print(edge_list)\r\ndef dfs():\r\n cc = 0\r\n for node_id in edge_list.keys():\r\n if node_id not in visited:\r\n #print(\"going to visit node_id {}\".format(node_id))\r\n explore(node_id)\r\n cc += 1\r\n return cc\r\ncc = dfs()\r\n\r\nprint(cc-1)", "n = int(input())\r\narr = []\r\nfor _ in range(n):\r\n\tarr.append(list(map(int, input().split())))\r\nans = 0\r\nvisited = [False for i in range(n)]\r\n\r\ndef dfs(v):\r\n\tvisited[v] = True\r\n\tfor j in range(n):\r\n\t\tif visited[j] is False:\r\n\t\t\tif arr[j][0] == arr[v][0] or arr[j][1] == arr[v][1]:\r\n\t\t\t\tdfs(j)\r\n\r\n\r\n# COUNT NUMBER OF UNCONNECTED COMPONENETS IN AN UNDIRECTED GRAPH\r\nans = 0\r\nfor i in range(n):\r\n\tif not visited[i]:\r\n\t\tdfs(i)\r\n\t\tans += 1\r\nprint(ans-1)", "entrada = int(input())\ncontador = 0\n \nlista_x = []\nlista_y = []\npercorrido = [0] * entrada\n\n\nfor e in range(entrada):\n\tax, ay = [int(a) for a in input().split()]\n\tlista_x.append(ax)\n\tlista_y.append(ay)\ndef aux(posicao):\n percorrido[posicao] = 1\n for index in range(entrada):\n if not percorrido[index] and (lista_x[index] == lista_x[posicao] or lista_y[index] == lista_y[posicao]):\n aux(index)\nfor index in range(entrada):\n\tif not percorrido[index]:\n\t\taux(index)\n\t\tcontador += 1\n \nprint(contador-1)\n \t\t \t\t \t\t\t \t\t \t\t\t\t", "coordinates = []\nvisited = set()\ndef BFS(coor):\n queue = [coor]\n while queue:\n node = queue.pop(0)\n visited.add(node)\n for xy in [t for t in coordinates if (t[0] == node[0] or t[1] == node[1]) and t not in visited]:\n queue.append(xy)\n\nn = int(input())\nfor _ in range(n):\n x, y = map(int, input().split())\n coordinates.append((x, y))\n\ngroups = 0\nfor coor in coordinates:\n if coor not in visited:\n groups += 1\n BFS(coor)\n\nprint(groups - 1)\n", "n=int(input())\r\nx=[0]*(n+1);y=[0]*(n+1)\r\nvis=[0]*(n+1)\r\ndef dfs(v):\r\n vis[v]=1\r\n for i in range(1,n+1):\r\n if vis[i]==0 and (x[i]==x[v] or y[i]==y[v]):\r\n dfs(i)\r\nfor i in range(1,n+1):\r\n l,m=map(int,input().split())\r\n x[i]=l;y[i]=m\r\nans=-1\r\nfor i in range(1,n+1):\r\n if vis[i]==0:\r\n dfs(i)\r\n ans+=1\r\nprint(ans)", "from collections import defaultdict\r\nn = int(input())\r\n\r\npoints = []\r\nfor _ in range(n):\r\n points.append(list(map(int, input().split())))\r\n\r\nparent = [node for node in range(n)]\r\nrank = [1]*n\r\n\r\ndef find(node):\r\n while node != parent[node]:\r\n parent[node] = parent[parent[node]]\r\n # the cool comprehension\r\n node = parent[node]\r\n return node\r\n\r\ndef union(node1, node2):\r\n parent1, parent2 = find(node1), find(node2)\r\n \r\n if parent1 == parent2:\r\n return [node1, node2]\r\n \r\n node1, node2 = parent1, parent2\r\n if rank[node1] > rank[node2]:\r\n parent[node2] = node1\r\n \r\n elif rank[node1] < rank[node2]:\r\n parent[node1] = node2\r\n \r\n else:\r\n parent[node2] = node1\r\n rank[node1] += 1\r\n \r\n return []\r\n\r\n\r\n\r\ngraph = defaultdict(list)\r\nfor idx in range(n):\r\n for idx2 in range(idx-1, -1, -1):\r\n\r\n if points[idx][0] == points[idx2][0] or points[idx][1] == points[idx2][1]:\r\n union(idx, idx2)\r\n\r\n\r\ncomps = set()\r\nfor p in parent:\r\n comps.add(find(p))\r\n\r\nprint(len(comps)-1)\r\n", "MAX = 101\r\nparent = []\r\n\r\ndef makeSet():\r\n global parent\r\n parent = [i for i in range(MAX + 1)]\r\n\r\ndef findSet(u):\r\n while u != parent[u]:\r\n u = parent[u]\r\n return u\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n parent[up] = vp\r\n\r\nmakeSet()\r\nn = int(input())\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n x.append(a)\r\n y.append(b)\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if x[i] == x[j] or y[i] == y[j]:\r\n unionSet(i, j)\r\n\r\nres = 0\r\nfor i in range(n):\r\n if parent[i] == i:\r\n res += 1\r\n\r\nprint(res - 1)", "\r\nimport sys\r\n\r\n\r\n# sys.stdin = open(\"input01.txt\")\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().strip('\\r\\n')\r\n\r\n\r\ndef print_arr(arr):\r\n sys.stdout.write(\"\\n\".join(map(str, arr)) + '\\n')\r\n\r\n\r\ndef print_matrix(matrix):\r\n strings = []\r\n for arr in matrix:\r\n strings.append(\"\".join(map(str, arr)))\r\n print_arr(strings)\r\n\r\n\r\nclass DisjointSet:\r\n def __init__(self, n):\r\n self.parents = [-1] * n\r\n self.size = [1] * n\r\n self.num_sets = 0\r\n\r\n def make_set(self, v):\r\n self.parents[v] = v\r\n self.num_sets += 1\r\n\r\n def find_set(self, v):\r\n visited = []\r\n while self.parents[v] != v:\r\n visited.append(v)\r\n v = self.parents[v]\r\n\r\n # Path compression\r\n for u in visited:\r\n self.parents[u] = v\r\n\r\n return v\r\n\r\n def union_sets(self, a, b):\r\n a = self.find_set(a)\r\n b = self.find_set(b)\r\n\r\n if a != b:\r\n # Union by size\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n self.parents[b] = a\r\n self.size[a] += self.size[b]\r\n self.num_sets -= 1\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n coords = []\r\n ds = DisjointSet(n)\r\n for i in range(n):\r\n coords.append([*map(int, input().split())])\r\n ds.make_set(i)\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if coords[i][0] == coords[j][0] or coords[i][1] == coords[j][1]:\r\n ds.union_sets(i, j)\r\n\r\n print(ds.num_sets - 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import defaultdict\r\n\r\nclass Graph:\r\n def __init__(self):\r\n self.graph=defaultdict(list)\r\n def addEdge(self,u,v):\r\n self.graph[u].append(v)\r\n def DFSUntil(self,v,visited,res):\r\n visited.add(v)\r\n # print(v,end=\" \")\r\n res.add(v)\r\n for neighbour in self.graph[v]:\r\n if neighbour not in visited:\r\n self.DFSUntil(neighbour,visited,res)\r\n return res\r\n def DFS(self,v):\r\n visited=set()\r\n res=set()\r\n return self.DFSUntil(v,visited,res)\r\ng=Graph()\r\n\r\n# g.addEdge((0,1),(0,2))\r\n# g.addEdge((0,1),(0,3))\r\n# g.addEdge((0,1),(0,4))\r\n# g.addEdge((0,1),(0,5))\r\n# g.addEdge((0,2),(2,2))\r\n# g.addEdge((2,2),(0,7))\r\n# print(g.DFS((0,1)))\r\nt=int(input())\r\nar=[]\r\nfor _ in range(t):\r\n x,y=map(int,input().split())\r\n ar.append((x,y))\r\nfor i in range(len(ar)-1):\r\n for j in range(i+1,len(ar)):\r\n if ar[i][0]==ar[j][0] or ar[i][1]==ar[j][1]:\r\n g.addEdge(ar[i],ar[j])\r\n g.addEdge(ar[j],ar[i])\r\ncnt=0\r\nwhile len(ar)>0:\r\n k=g.DFS(ar[0])\r\n ar=set(ar)\r\n ar=ar-k\r\n cnt+=1\r\n ar=list(ar)\r\nprint(cnt-1)\r\n", "def resolve_2(snow_drift, snow_drifts):\r\n if len(snow_drifts) > 0:\r\n list_group = []\r\n for snow_drift_ in snow_drifts:\r\n if snow_drift[0] == snow_drift_[0] or snow_drift[1] == snow_drift_[1]:\r\n list_group.append(snow_drift_)\r\n\r\n for snow_drift in list_group:\r\n snow_drifts.remove(snow_drift)\r\n \r\n for snow_drift in list_group:\r\n resolve_2(snow_drift, snow_drifts)\r\n\r\n\r\ndef resolve(snow_drifts):\r\n n_groups = 0\r\n while len(snow_drifts) > 0:\r\n n_groups += 1\r\n snow_drift = snow_drifts.pop(0)\r\n resolve_2(snow_drift, snow_drifts)\r\n\r\n\r\n return n_groups - 1\r\n\r\nquant = int(input())\r\nsnow_drifts = []\r\n\r\nfor i in range(quant):\r\n snow_drifts.append([int(i) for i in input().split(\" \")])\r\n\r\nprint(resolve(snow_drifts))", "n=int(input())\r\ng=[[] for i in range(n)]\r\n\r\nr=[]\r\n\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n r.append([i,x,y])\r\n \r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if r[i][1]==r[j][1]:\r\n g[i].append(j)\r\n g[j].append(i)\r\n if r[i][2]==r[j][2]:\r\n g[i].append(j)\r\n g[j].append(i)\r\nused=[0]*n\r\ncomponent=0\r\ndef bfs(s):\r\n used[s]=1\r\n queue=[s]\r\n while queue!=[]:\r\n for v in g[queue[0]]:\r\n if used[v]==0:\r\n used[v]=1\r\n queue.append(v)\r\n del(queue[0])\r\n \r\nwhile used.count(0)!=0:\r\n k=used.index(0)\r\n bfs(k)\r\n component+=1\r\n\r\nprint(component-1)", "n=int(input())\r\nlevel=[-1]*n\r\ndef bfs(k1):\r\n global level\r\n level[k1]=0\r\n q = [k1]\r\n while q:\r\n v=q.pop(0)\r\n for w in s[v]:\r\n if level[w]==-1:\r\n level[w]=level[v]+1\r\n q.append(w)\r\na=[]\r\ns=[]\r\nfor z2 in range(n):\r\n s.append([]*n)\r\nfor z in range(n):\r\n x,y=map(int,input().split())\r\n a.append([x,y])\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if (a[i][0]==a[j][0] and a[i][1]!=a[j][1]) or (a[i][0]!=a[j][0] and a[i][1]==a[j][1]):\r\n s[i].append(j)\r\n s[j].append(i)\r\n\r\ng=0\r\nfor k1 in range(n-1):\r\n bfs(k1)\r\n if level[k1+1]==-1:\r\n g+=1\r\nprint(g)", "#!/usr/bin/env python3\n\nfrom collections import defaultdict\nfrom math import inf as oo\n\ndef dfs(visited, adj, curr):\n visited[curr] = True\n for v in adj[curr]:\n if not visited[v]: dfs(visited,adj,v)\n\n\nind = [tuple(map(int, input().split())) for _ in range(int(input()))]\nadj = defaultdict(list)\nfor i in ind:\n for j in ind[1:]:\n if (i[0] == j[0] or i[1] == j[1]):\n adj[i].append(j)\n adj[j].append(i)\nvisited = {k:False for k in ind}\nans=0\nfor i in ind:\n if not visited[i]:\n ans += 1\n dfs(visited,adj,i)\nprint(ans-1)", "G={}\r\ndef cnt():\r\n global G\r\n X=set()\r\n Y=set()\r\n used=set()\r\n c=-1\r\n while len(used)<n:\r\n k,(x,y)=G.popitem()\r\n used.add(k)\r\n X.add(x)\r\n Y.add(y)\r\n c+=1\r\n l=0\r\n while l!=len(G):\r\n l=len(G)\r\n for v in G:\r\n (x,y)=G[v]\r\n if x in X or y in Y:\r\n (x,y)=G.pop(v)\r\n used.add(v)\r\n X.add(x)\r\n Y.add(y)\r\n break\r\n return c\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n G[i]=(x,y)\r\nprint(cnt())\r\n", "def build_graph(n, snow_drifts):\r\n graph = {}\r\n for i in range(1, n + 1):\r\n graph[i] = []\r\n\r\n for i in range(n):\r\n xi, yi = snow_drifts[i]\r\n for j in range(i + 1, n):\r\n xj, yj = snow_drifts[j]\r\n if xi == xj or yi == yj:\r\n graph[i + 1].append(j + 1)\r\n graph[j + 1].append(i + 1)\r\n\r\n return graph\r\n\r\ndef dfs(node, graph, visited):\r\n visited.add(node)\r\n for neighbor in graph[node]:\r\n if neighbor not in visited:\r\n dfs(neighbor, graph, visited)\r\n\r\ndef find_connected_components(graph):\r\n visited = set()\r\n connected_components = 0\r\n\r\n for node in graph:\r\n if node not in visited:\r\n dfs(node, graph, visited)\r\n connected_components += 1\r\n\r\n return connected_components\r\n\r\n# Example usage:\r\nn = int(input())\r\nsnow_drifts = [tuple(map(int, input().split())) for _ in range(n)]\r\ngraph = build_graph(n, snow_drifts)\r\nnum_connected_components = find_connected_components(graph)\r\nprint(num_connected_components-1)\r\n", "n = int(input())\r\nx, y = [], []\r\nsum = 1\r\n \r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n x.append({a})\r\n y.append({b})\r\n \r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if x[i]&x[j] or y[i]&y[j]:\r\n x[j] |= x[i]\r\n y[j] |= y[i]\r\n sum += 1\r\n break\r\n \r\nprint(n - sum)", "n = int(input())\nvisited = [False] * 1001\nnodes = []\n \ndef verify(i):\n visited[i] = True\n for j in range(n):\n if not visited[j] and (nodes[i][0] == nodes[j][0] or nodes[i][1] == nodes[j][1]):\n verify(j)\n \nfor i in range(n):\n cordinates = tuple(map(int, input().split()))\n nodes.append(cordinates)\n \ndrifts = 0\nfor i in range(n):\n if not visited[i]:\n verify(i)\n drifts += 1\n \nprint (drifts - 1)", "n = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append((x, y))\n\nv = [False] * n\n\n\ndef f(x):\n for i in range(n):\n if v[i]:\n continue\n if a[i][0] == a[x][0] or a[i][1] == a[x][1]:\n v[i] = True\n f(i)\n\n\nc = 0\nfor i in range(n):\n if v[i]:\n continue\n v[i] = True\n c += 1\n f(i)\n\nprint(c-1)\n", "\r\n# MADE BY ASTRIK WITH LOVE\r\n#start the code from here\r\nn=int(input())\r\nglobal parent\r\nparent=[i for i in range(n)]\r\n# n is total number of nodes \r\n# finding parent of a node\r\ndef find(w):\r\n\tglobal parent\r\n\tif parent[w]==w:\r\n\t\t\treturn w\r\n\telse:\r\n\t\treturn find(parent[w])\r\n\r\n\r\ndef union(a,b):\r\n\tglobal parent\r\n\tw=find(a)\r\n\ty=find(b)\r\n\tif w==y:\r\n\t\treturn \r\n\tparent[y]=w\r\n\r\n\r\n#start the code from here\r\nl=[]\r\nans=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tfor u in range(len(l)):\r\n\t\tif l[u][0]==a or l[u][1]==b:\r\n\t\t\tunion(u,i)\r\n\t\telse:\r\n\t\t\tans+=1\r\n\tl.append([a,b])\r\npset=set()\r\nfor i in range(len(l)):\r\n\tpset.add(find(i))\r\nprint(len(pset)-1)\r\n", "n = int(input())\ng = []\nfor i in range(n):\n t = input().split()\n g.append([ int(t[0]), int(t[1]), False ])\ndef visita(i):\n g[i][2] = True\n for j in range(n):\n if g[j][2] == False and (g[i][0] == g[j][0] or g[i][1] == g[j][1]):\n visita(j)\ncnt = -1\nfor i in range(n):\n if g[i][2] == False:\n cnt += 1\n visita(i)\nprint(cnt)\n", "import sys\r\n\r\nsys.setrecursionlimit(10 ** 6)\r\n\r\n\r\nclass DisjointSetUnion:\r\n def __init__(self, num_nodes):\r\n self.id = [i for i in range(num_nodes)]\r\n self.parent = [i for i in range(num_nodes)]\r\n self.size = [1 for _ in range(num_nodes)]\r\n self.cnt = num_nodes\r\n\r\n def find(self, p):\r\n while p != self.parent[p]:\r\n p = self.parent[p]\r\n return p\r\n\r\n def count(self):\r\n return self.cnt\r\n\r\n def connected(self, p, q):\r\n return self.find(p) == self.find(q)\r\n\r\n def union(self, p, q):\r\n root_p = self.find(p)\r\n root_q = self.find(q)\r\n if root_p == root_q: return\r\n if self.size[root_p] < self.size[root_q]:\r\n self.parent[root_p] = root_q\r\n self.size[root_q] += self.size[root_p]\r\n else:\r\n self.parent[root_q] = root_p\r\n self.size[root_p] += self.size[root_q]\r\n\r\n self.cnt -= 1\r\n\r\n\r\n\r\ncoordinates = None\r\nn = 0\r\n\r\n\r\ndef main():\r\n sc = sys.stdin\r\n line = sc.readline().strip()\r\n\r\n global coordinates, n\r\n n = int(line)\r\n coordinates = []\r\n dsu = DisjointSetUnion(10**6)\r\n for _ in range(n):\r\n line = sc.readline().strip()\r\n x, y = map(int, line.split())\r\n coordinates.append((x, y))\r\n\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if dsu.connected(i, j):\r\n continue\r\n if coordinates[i][0] == coordinates[j][0] \\\r\n or coordinates[i][1] == coordinates[j][1]:\r\n dsu.union(i, j)\r\n\r\n\r\n cnt = 0\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if not dsu.connected(i, j):\r\n dsu.union(i, n+cnt)\r\n dsu.union(j, n+cnt)\r\n\r\n cnt += 1\r\n print(cnt)\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "P = {tuple(input().split()) for _ in range(int(input()))}\r\nx, y = P.pop()\r\nX, Y, k = {x}, {y}, 0\r\n\r\nwhile P:\r\n R = set()\r\n \r\n for x, y in P:\r\n if x in X or y in Y:\r\n X.add(x)\r\n Y.add(y)\r\n R.add((x, y))\r\n \r\n P -= R\r\n \r\n if not R:\r\n x, y = P.pop()\r\n X.add(x)\r\n Y.add(y)\r\n k += 1\r\n\r\nprint(k)", "n=int(input())\r\nans=1\r\nxl=[]\r\nyl=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n xl.append({x})\r\n yl.append({y})\r\n\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if xl[i]&xl[j] or yl[i]&yl[j]:\r\n xl[j]|=xl[i]\r\n yl[j]|=yl[i]\r\n ans += 1\r\n break\r\n\r\nprint(n - ans)", "from collections import deque\nn = int(input())\n\ncoord = deque([])\nfor i in range(n):\n\tcoord.append((tuple(input().split())))\n\nnao_visitados = n * [True]\ncont = 0\nfor j in range(n):\t\n\tif nao_visitados[j]:\n\t\tcont += 1\n\t\tfila = deque([coord[j]])\n\t\tnao_visitados[j] = False\n\t\twhile fila:\n\t\t\tx, y = fila.popleft()\n\t\t\tfor e in range(n):\n\t\t\t\tif nao_visitados[e]:\n\t\t\t\t\tif x == coord[e][0] or y == coord[e][1]:\n\t\t\t\t\t\tfila.append(coord[e])\n\t\t\t\t\t\tnao_visitados[e] = False\n\nprint(cont -1)\n\n\t \t \t \t \t \t \t \t \t \t\t\t \t", "import sys\r\nimport collections\r\n\r\nn = int(input())\r\ndrifts = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nx_idx_dict, y_idx_dict = {}, {}\r\nfor i, (x, y) in enumerate(drifts):\r\n if x not in x_idx_dict:\r\n x_idx_dict[x] = []\r\n x_idx_dict[x].append(i)\r\n if y not in y_idx_dict:\r\n y_idx_dict[y] = []\r\n y_idx_dict[y].append(i)\r\n \r\nnum_clique = 0\r\nseen = set()\r\nfor i, (x, y) in enumerate(drifts):\r\n if i in seen: continue\r\n \r\n num_clique += 1\r\n q = collections.deque()\r\n q.append(i)\r\n while q:\r\n j = q.popleft()\r\n seen.add(j)\r\n xx, yy = drifts[j]\r\n for k in x_idx_dict[xx] + y_idx_dict[yy]:\r\n if k not in seen:\r\n q.append(k)\r\n \r\nprint(num_clique - 1)", "def connected_com(graph):\r\n def dfs(graph,v):\r\n visited[v]=True\r\n for i in graph[v]:\r\n if not visited[i]:\r\n dfs(graph,i)\r\n visited=dict();count=0\r\n for i in graph:\r\n visited[i]=False\r\n for i in graph:\r\n if not visited[i]:\r\n dfs(graph,i)\r\n count+=1\r\n return count-1\r\n\r\ndrifts=int(input())\r\ncoordinates=[[*map(int,input().split())] for _ in[0]*drifts]\r\ngraph=dict()\r\nfor i in coordinates:graph[tuple(i)]=[]\r\nfor i in range(drifts-1):\r\n for j in range(i+1,drifts):\r\n if coordinates[i][0]==coordinates[j][0] or coordinates[i][1]==coordinates[j][1]:\r\n graph[(coordinates[i][0],coordinates[i][1])]+=(coordinates[j][0],coordinates[j][1]),\r\n graph[(coordinates[j][0],coordinates[j][1])]+=(coordinates[i][0],coordinates[i][1]),\r\nprint(connected_com(graph))", "# cook your dish here\r\n# cook your dish here\r\nvisited=[]\r\ndef DFs(queue):\r\n if len(queue)==0:\r\n return queue\r\n else:\r\n t=queue.pop(0)\r\n if t not in visited:\r\n while j<n:\r\n if visited[j]==0 and i==j:\r\n visited[j]=count\r\n count+=1\r\n elif i!=j and visited[j]==0:\r\n if y[i][0]==y[j][0] or y[i][1]==y[j][1]:\r\n visited[j]=visited[i]\r\n j+=1\r\n\r\n\r\n\r\nn=int(input())\r\ny=[]\r\nfor _ in range(n):\r\n x,y1=map(int,input().split(\" \"))\r\n y.append([x,y1])\r\n\r\nvisited=[0]*n\r\nvis=[]\r\nqueue=[]\r\ni=0\r\ncount=1\r\nwhile i<n:\r\n if y[i] not in vis:\r\n vis.append(y[i])\r\n queue.append(y[i])\r\n visited[i]=count\r\n count+=1\r\n while len(queue)!=0:\r\n t=queue.pop(0)\r\n j=0\r\n while j<n:\r\n if visited[j]==0:\r\n if t[0]==y[j][0] or t[1]==y[j][1]:\r\n visited[j]=visited[i]\r\n queue.append(y[j])\r\n vis.append(y[j])\r\n \r\n j+=1\r\n i+=1\r\nprint(len(set(visited))-1)\r\n \r\n ", "def dfs(vis,g,i):\r\n vis[i] = 1\r\n for item in g:\r\n if item != g[i] and vis[g.index(item)] == 0 \\\r\n and (item[0] == g[i][0] or item[1] == g[i][1]):\r\n vis[g.index(item)] = 1\r\n dfs(vis,g,g.index(item))\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n g = [map(int,input().split()) for i in range(n)]\r\n g = [list(i) for i in g]\r\n vis = [0 for i in range(n)]\r\n ans = -1\r\n for i in range(n):\r\n if vis[i] == 0:\r\n dfs(vis,g,i)\r\n ans += 1\r\n print(ans)", "import threading\r\nfrom sys import stdin,stdout,setrecursionlimit\r\nfrom collections import defaultdict\r\n\r\nsetrecursionlimit(1 << 30)\r\nthreading.stack_size(1 << 27)\r\n\r\ndef main():\r\n def dfs(s):\r\n vis[s] = 1\r\n for i in range(1, sz+1):\r\n # if x or y coords are same then we can move on it\r\n if not vis[i] and (adj[s][0] == adj[i][0] or adj[s][1] == adj[i][1]):\r\n dfs(i)\r\n\r\n\r\n n = int(input())\r\n adj = {}\r\n for i in range(1, n+1):\r\n x, y = map(int, input().split())\r\n adj[i] = (x, y)\r\n\r\n ans = 0\r\n sz = n\r\n vis = [0] * (n+1)\r\n\r\n for i in range(1, n+1):\r\n if not vis[i]:\r\n ans += 1\r\n dfs(i)\r\n\r\n print(ans-1)\r\n\r\nmain_thread = threading.Thread(target=main)\r\nmain_thread.start()\r\nmain_thread.join()\r\n", "from typing import List, Dict, Tuple\r\n\r\ndef dfs(v: List[List[int]], visit: List[bool], start: int):\r\n visit[start - 1] = True\r\n for i in range(0, len(v[start-1])):\r\n if not visit[v[start - 1][i] - 1]:\r\n dfs(v, visit, v[start - 1][i])\r\n\r\ndef main():\r\n amount: int = int(input().strip())\r\n\r\n drift_data: List[Tuple[int, int]] = [(0, 0)] * amount\r\n dp: List[List[int]] = [[] for _ in range(amount)]\r\n been: List[bool] = [False] * amount\r\n # print(drift_data, '\\amount', dp, '\\amount', been)\r\n\r\n for i in range(0, amount):\r\n inn_list = input().strip().split(' ')\r\n inn_list = [*map(int, inn_list)]\r\n drift_data[i] = (inn_list[0], inn_list[1])\r\n\r\n # print(drift_data, '\\amount', dp, '\\amount', been)\r\n\r\n for i in range(0, amount-1):\r\n for j in range(i+1, amount):\r\n if drift_data[i][0] == drift_data[j][0] or drift_data[i][1] == drift_data[j][1]:\r\n # print(\"*****: \", i, \" \", j, \" \")\r\n # print(dp)\r\n dp[i].insert(len(dp[i]), j+1)\r\n dp[j].insert(len(dp[j]), i+1)\r\n # dp[i].append(j + 1)\r\n # dp[j].append(i + 1)\r\n # print(dp)\r\n\r\n # print(drift_data, '\\amount', dp, '\\amount', been)\r\n\r\n nc: int = 0\r\n for i in range(0, amount):\r\n if not been[i]:\r\n dfs(dp, been, i+1)\r\n nc += 1\r\n\r\n # print(\"res: \")\r\n print(nc - 1)\r\n\r\nmain()\r\n", "numberofsnowdrift = int(input())\r\n\r\nsnowDrifts = [[] for sd in range(numberofsnowdrift)]\r\nsnowDriftsX = [[] for i in range(1001)]\r\nsnowDriftsY = [[] for i in range(1001)]\r\nconnections = [i for i in range(numberofsnowdrift)]\r\nranks = [0 for i in range(numberofsnowdrift)]\r\n\r\ndef findSet(friends , p):\r\n if friends[p] != p:\r\n friends[p] = findSet(friends, friends[p])\r\n return friends[p]\r\n\r\ndef Union(connections, ranks, p1, p2):\r\n p1F = findSet(connections, p1)\r\n p2F = findSet(connections, p2)\r\n if p1F == p2F:\r\n return\r\n if ranks[p1F] > ranks[p2F]:\r\n connections[p2F] = p1F\r\n elif ranks[p1F] < ranks[p2F]:\r\n connections[p1F] = p2F\r\n else:\r\n connections[p1F] = p2F\r\n ranks[p2F] += 1\r\n\r\nfor sd in range(numberofsnowdrift):\r\n x, y = map(int,input().split())\r\n snowDrifts[sd] = [x, y]\r\n for sdx in snowDriftsX[x]:\r\n Union(connections, ranks, sd, sdx)\r\n for sdy in snowDriftsY[y]:\r\n Union(connections, ranks, sd, sdy)\r\n snowDriftsX[x].append(sd)\r\n snowDriftsY[y].append(sd)\r\n\r\ncount = 0\r\nfor sd in range(numberofsnowdrift):\r\n if(connections[sd] == sd):\r\n count += 1\r\nprint(count - 1)", "from sys import stdin\n\nn = int(stdin.readline().strip())\n\np = []\n\ndef check(i):\n p[i][2] = cnt\n for j in range(n):\n if p[j][2] != -1:\n continue\n if p[i][0] == p[j][0] or p[i][1] == p[j][1]:\n check(j)\n\ncnt = -1\nfor i in range(n):\n x, y = map(int, stdin.readline().split())\n p.append([x, y, -1])\n\nfor i in range(n):\n if p[i][2] == -1:\n cnt += 1\n check(i)\n\nprint(cnt)", "\r\n\r\nn = int(input())\r\n\r\ncoord = []\r\npai = []\r\nfor i in range(n):\r\n\tcoord.append(list(map(int,input().split())))\r\n\tpai.append(i)\r\n\r\n\r\ndef find(x):\r\n\tif(x == pai[x]):\r\n\t\treturn x\r\n\tpai[x] = find(pai[x])\r\n\treturn pai[x]\r\n\r\ndef join(x,y):\r\n\tx = find(x)\r\n\ty = find(y)\r\n\tif(x != y):\r\n\t\tpai[x] = y\r\n\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif(i != j and (coord[i][1] == coord[j][1] or coord[i][0] == coord[j][0])):\r\n\t\t\tjoin(i,j)\r\n\r\ncusto = 0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif(find(i) != find(j)):\r\n\t\t\tcusto += 1\r\n\t\t\tjoin(i,j)\r\n\r\n\r\nprint(custo)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ndrifts = [None]*n\r\nx = [None]*n\r\ny = [None]*n\r\ng = {}\r\nans = 0\r\nfor i in range(n):\r\n x[i], y[i] = map(int, input().split())\r\n drifts[i] = [x[i], y[i]]\r\nfor i in range(n):\r\n g[i] = []\r\n for j in range(n):\r\n if j!=i:\r\n if x[i]==x[j] or y[i]==y[j]:\r\n g[i].append(j)\r\ndef go(g, i, v):\r\n v[i] = True\r\n for j in g[i]:\r\n if v[j]==False:\r\n go(g, j, v)\r\nv = [False]*n\r\nfor i in range(n):\r\n if v[i]==False:\r\n ans+=1\r\n go(g, i, v)\r\nprint(ans-1)", "import sys\n\nx = 1000 * [0]\ny = 1000 * [0]\nv = 100 * [False]\n\n\ndef dfs(j):\n v[j] = True\n for i in range(n):\n if not v[i] and (x[i] == x[j] or y[i] == y[j]):\n dfs(i)\n\n\nn = int(input())\n\nfor i in range(n):\n ipt = input().split()\n x[i] = int(ipt.pop(0))\n y[i] = int(ipt.pop(0))\n\n\nans = 0\nfor i in range(n):\n if not v[i]:\n ans += 1\n dfs(i)\n\nprint(ans - 1)\n\n\t\t \t \t \t \t \t \t \t\t \t", "n = int(input())\n\ncont = 0\n\nx = []\ny = []\nvisited = [0] * n\n\nfor e in range(n):\n\tax, ay = [int(a) for a in input().split()]\n\tx.append(ax)\n\ty.append(ay)\n\ndef dfs(u):\n\tvisited[u] = 1\n\tfor i in range(n):\n\t\tif not visited[i] and (x[i] == x[u] or y[i] == y[u]):\n\t\t\tdfs(i)\n \nfor i in range(n):\n\tif not visited[i]:\n\t\tdfs(i)\n\t\tcont += 1\n\nprint(cont-1)\n\n \t \t \t \t\t \t \t\t \t \t \t", "n = int(input())\r\nx = []\r\ny = []\r\ncount = 0\r\nv = [-1]*n\r\nfor i in range(n):\r\n\ta, b = list(map(int, input().split()))\r\n\tx.append(a)\r\n\ty.append(b)\r\n\r\ndef dfs(i):\r\n\tstack = []\r\n\tstack.append(i)\r\n\r\n\twhile not stack == []:\r\n\t\tif v[stack[-1]] == 0:\r\n\t\t\tstack.pop()\r\n\t\telse:\r\n\t\t\tv[stack[-1]] = 0\r\n\t\t\tnow = stack.pop()\r\n\t\t\tfor j in range(n):\r\n\t\t\t\tif x[j] == x[now] or y[j] == y[now]:\r\n\t\t\t\t\tstack.append(j)\r\nfor i in range(n):\r\n\tif v[i] == -1:\r\n\t\tcount += 1\r\n\t\tdfs(i)\r\n\r\nprint(count - 1)\r\n\r\n\r\n", "n = int(input())\n\ndrifts = []\nfor i in range(n):\n cell = list(map(int, input().split()))\n drifts.append((cell[0], cell[1]))\n\ng = [[] for i in range(n)]\n\nfor i in range(n):\n x = drifts[i][0]\n y = drifts[i][1]\n for j in range(n):\n if i == j:\n continue\n if drifts[j][0] == x or drifts[j][1] == y:\n g[i].append(j)\n\nvisited = [False for i in range(n)]\nres = 0\nfor i in range(n):\n if visited[i]:\n continue\n stack = [i]\n while len(stack) > 0:\n s = stack.pop()\n visited[s] = True\n for j in g[s]:\n if visited[j] == False:\n stack.append(j)\n res += 1\n\nprint(res - 1)\n", "n = int(input())\r\ngraph = []\r\nvisited = []\r\nresult = -1\r\n\r\ndef dfs(node):\r\n if not visited[node]: \r\n visited[node] = True\r\n for i in range(n):\r\n if graph[node][0] == graph[i][0] or graph[node][1] == graph[i][1]:\r\n dfs(i)\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n graph.append((x, y))\r\n visited.append(False)\r\n \r\nfor i in range(n):\r\n if not visited[i]:\r\n result += 1\r\n dfs(i)\r\n\r\nprint(result)", "# Mateus Brito de Sousa Rangel - 117110914\r\n \r\ndef DFS(a,b,x,y,visited):\r\n \r\n\tfor i in range(len(a)):\r\n\t\tif visited[i] == False and (a[i] == x or b[i] == y):\r\n\t\t\tvisited[i] = True\r\n\t\t\tDFS(a,b,a[i],b[i],visited)\r\n \r\nn = int(input())\r\na, b = [], []\r\n \r\nfor i in range(n):\r\n \r\n\tx, y = map(int, input().split())\r\n\ta.append(x)\r\n\tb.append(y)\r\n \r\nvisited = [False for i in range(n)]\r\ngroups = 0\r\n\r\nfor i in range(n):\r\n \r\n\tif visited[i] == False:\r\n\t\tvisited[i] = True\r\n \r\n\t\tDFS(a,b,a[i],b[i],visited)\r\n\t\tgroups = groups + 1\r\n \r\nprint(groups-1)\r\n", "x = 1000 * [0]\ny = 1000 * [0]\nv = 100 * [False]\n\n\ndef search(j):\n v[j] = True\n for i in range(n):\n if (not v[i] and (x[i] == x[j] or y[i] == y[j])):\n search(i)\n\nn = int(input())\n\nfor i in range(n):\n a,b = map(int,input().split())\n x[i] = a\n y[i] = b\n\nresult = 0\n\nfor i in range(n):\n if (not v[i]):\n result+=1\n search(i)\n\nprint(result -1)\n\n\t\t \t \t\t\t \t\t \t \t\t \t \t\t\t \t", "class CodeforcesTask217ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.drifts = []\n\n def read_input(self):\n self.n = int(input())\n for x in range(self.n):\n self.drifts.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n x_edges = {}\n y_edges = {}\n for x in range(self.n):\n drift = self.drifts[x]\n if drift[0] in x_edges:\n x_edges[drift[0]].append(x + 1)\n else:\n x_edges[drift[0]] = [x + 1]\n if drift[1] in y_edges:\n y_edges[drift[1]].append(x + 1)\n else:\n y_edges[drift[1]] = [x + 1]\n graph = [[] for x in range(self.n)]\n for x in range(self.n):\n for conn in x_edges[self.drifts[x][0]]:\n if x + 1 != conn:\n graph[x].append(conn)\n for conn in y_edges[self.drifts[x][1]]:\n if x + 1 != conn:\n graph[x].append(conn)\n comp_cnt = 0\n component = [0] * self.n\n for x in range(self.n):\n if not component[x]:\n comp_cnt += 1\n to_visit = graph[x][::]\n while to_visit:\n visiting = to_visit.pop(-1)\n if not component[visiting - 1]:\n component[visiting - 1] = comp_cnt\n to_visit += graph[visiting - 1]\n self.result = str(comp_cnt - 1)\n\n\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask217ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\n\ncoord = []\nfor _ in range(n):\n coord.append(tuple(input().split()))\n\nnao_visitados = set(range(n))\ncont = 0\n\nwhile nao_visitados:\n cont += 1\n fila = [coord[nao_visitados.pop()]]\n\n while fila:\n x, y = fila.pop(0)\n\n for i, c in enumerate(coord):\n if i in nao_visitados:\n if x == c[0] or y == c[1]:\n fila.append(c)\n nao_visitados.remove(i)\n\nprint(cont - 1)\n\n \t\t\t\t\t \t \t \t\t \t\t \t\t\t \t", "import math\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n x_y = [[int(j) for j in input().split(\" \")] for i in range(n)]\r\n #print(x_y)\r\n root = 0\r\n roots = [-1 for i in range(n)]\r\n for i in range(len(x_y)):\r\n for j in range(i + 1, len(x_y)):\r\n if i != j:\r\n if x_y[i][0] == x_y[j][0] or x_y[i][1] == x_y[j][1]:\r\n if roots[i] == -1 and roots[j] == -1:\r\n roots[i] = root\r\n roots[j] = root\r\n root += 1\r\n elif roots[i] != -1 and roots[j] == -1:\r\n roots[j] = roots[i]\r\n elif roots[i] == -1 and roots[j] != -1:\r\n roots[i] = roots[j]\r\n elif roots[i] != roots[j]:\r\n target = roots[j]\r\n for y in range(len(roots)):\r\n if roots[y] == target:\r\n roots[y] = roots[i]\r\n hash = {}\r\n counter = 0\r\n for i in roots:\r\n if i == -1:\r\n counter += 1\r\n else:\r\n if i not in hash:\r\n hash[i] = 1\r\n counter += 1\r\n print(counter - 1)\r\n #print(hash)\r\n #print(roots)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "\"\"\"\r\nhttp://codeforces.com/contest/217/problem/A\r\n\r\nNotice that the existence of a snow drift at the point (x, y) implies that \r\n\"if I'm on the horizontal line at y then I am certainly able to get to the\r\n vertical line at x, and vice versa\".\r\n\r\n2\r\n2 1\r\n1 2\r\n\r\n\"\"\"\r\n\r\nfrom collections import defaultdict\r\nn=int(input())\r\n\r\ndef DFS(x,y,visited_coords,s):\r\n\tvisited_coords[s]=True\r\n\tfor i in range(n):\r\n\t\tif(not visited_coords[i] and (x[s]==x[i] or y[s]==y[i])):\r\n\t\t\tDFS(x,y,visited_coords,i)\r\n\r\nvisited_coords=defaultdict(lambda:False,{})\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n\tx1,y1=[int(m) for m in input().split()]\r\n\tx.append(x1)\r\n\ty.append(y1)\r\n\r\nunique_visits=0 \r\n\r\nfor i in range(n):\r\n\tif(not visited_coords[i]):\r\n\t\tDFS(x,y,visited_coords,i)\r\n\t\tunique_visits+=1 \r\n\r\nprint(unique_visits-1)\r\n", "\r\ndef findSet(u):\r\n if parent[u] != u:\r\n parent[u] = findSet(parent[u])\r\n return parent[u]\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n\r\n if up == vp:\r\n return\r\n\r\n if ranks[up] > ranks[vp]:\r\n parent[vp] = up\r\n elif ranks[up] < ranks[vp]:\r\n parent[up] = vp\r\n else:\r\n parent[up] = vp\r\n ranks[vp] += 1\r\n\r\ndef countGroup():\r\n res = 0\r\n for i in range(len(parent)):\r\n if parent[i] == i:\r\n res += 1\r\n return res\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n ax = []\r\n ay = []\r\n parent = [i for i in range(n)]\r\n ranks = [0 for i in range(n)]\r\n\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n v = i\r\n\r\n if x in ax:\r\n u = ax.index(x)\r\n unionSet(u, v)\r\n if y in ay:\r\n u = ay.index(y)\r\n unionSet(u, v)\r\n\r\n ax.append(x)\r\n ay.append(y)\r\n\r\n # print(parent)\r\n # print(ranks)\r\n\r\n print(countGroup() - 1)\r\n", "def dfs(node):\n visited[node] = True\n\n for adj in X[nodes[node][0]]:\n if not visited[adj]:\n dfs(adj)\n\n for adj in Y[nodes[node][1]]:\n if not visited[adj]:\n dfs(adj)\n\n\nn = int(input())\nnodes = [None]*(n+1)\nvisited = [False]*(n+1)\nMAXN = 1001\nX = [[] for _ in range(MAXN)]\nY = [[] for _ in range(MAXN)]\n\nfor i in range(1, n+1):\n x, y = map(int, input().split())\n X[x].append(i)\n Y[y].append(i)\n nodes[i] = (x, y)\n\nresult = 0\n\nfor node in range(1, n+1):\n if not visited[node]:\n result += 1\n dfs(node)\n\nprint(result-1)\n", "montes = int(input())\nx = [None] * 101\ny = [None] * 101\nvertices = [None] * 101\nresposta = -1\n\ndef dfs(a):\n vertices[a] = 1\n for i in range(1, montes + 1):\n if((x[i] == x[a] or y[i] == y[a]) and vertices[i] == None):\n dfs(i)\n \nfor p in range(1, montes + 1):\n posMonte = str(input()).split()\n x[p] = posMonte[0]\n y[p] = posMonte[1]\n \nfor o in range(1, montes + 1):\n if(vertices[o] == None):\n dfs(o)\n resposta += 1\n\nprint(resposta)\n \t\t \t\t\t \t \t \t \t\t \t\t \t\t", "n=int(input())\r\nc,x,y=[],[0]*n,[0]*n\r\nfor i in range(n):\r\n x[i],y[i]=list(map(int, input().split()))\r\nv=[0 for i in range(n)]\r\ndef dfs(i):\r\n v[i]=1\r\n for j in range(n):\r\n if (x[i]==x[j] or y[i]==y[j]) and not v[j]:\r\n dfs(j)\r\nans=-1\r\nfor i in range(n):\r\n if not v[i]:\r\n dfs(i)\r\n ans+=1\r\nprint(ans)", "from sys import stdin\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef dfs(points, visited, current, n, queue):\r\n for i in range(n):\r\n if visited[i] == False and (current[0] == points[i][0] or current[1] == points[i][1]):\r\n visited[i] = True\r\n queue.append(points[i])\r\n \r\n while len(queue) > 0:\r\n dfs(points, visited, queue.pop(), n, queue)\r\n \r\n\r\n\r\nn = int(input())\r\npoints = []\r\nfor _ in range(n):\r\n points.append(list(map(int, input().rstrip().split(\" \"))))\r\n\r\nvisited = [False] * n\r\n\r\ncounter = 0\r\nfor i in range(n):\r\n if visited[i] == False:\r\n visited[i] = True\r\n dfs(points, visited, points[i], n, [])\r\n counter += 1\r\n\r\nprint(counter - 1)\r\n", "n = int(input())\r\nx = {}\r\ny = {}\r\nvisited_x = {}\r\nvisited_y = {}\r\nfor i in range(n):\r\n cur_x, cur_y = map(int, input().split())\r\n x[cur_x] = x.get(cur_x, set())\r\n x[cur_x].add(cur_y)\r\n visited_x[cur_x] = False\r\n y[cur_y] = y.get(cur_y, set())\r\n y[cur_y].add(cur_x)\r\n visited_y[cur_y] = False\r\n\r\ndef dfs(cur_node):\r\n global visited_x\r\n global visited_y\r\n global x\r\n global y\r\n visited_x[cur_node] = True\r\n for i in x[cur_node]:\r\n if not visited_y[i]:\r\n visited_y[i] = True\r\n for j in y[i]:\r\n if not visited_x[j]:\r\n dfs(j)\r\n\r\ndfs(list(x.keys())[0])\r\nres = 0\r\nwhile False in visited_x.values():\r\n for i in visited_x:\r\n if not visited_x[i]:\r\n dfs(i)\r\n res += 1\r\n break\r\nprint(res)", "n = int(input())\r\n\r\n\r\nclass Node:\r\n def __init__(self, type, value):\r\n self.axis = type\r\n self.value = value\r\n self.adj = []\r\n\r\nys = {}\r\nxs = {}\r\n\r\nfor i in range(n):\r\n tmp = [int(i) - 1 for i in input().split()]\r\n x = tmp[0]\r\n y = tmp[1]\r\n if x in xs:\r\n xs[x].append(y)\r\n else:\r\n xs[x] = [y]\r\n if y in ys:\r\n ys[y].append(x)\r\n else:\r\n ys[y] = [x]\r\n\r\nunvisited = []\r\nfor key in xs.keys():\r\n unvisited.append(key)\r\n\r\nreverse = {'x': 'y', 'y':'x'}\r\nnum_of_component = 0\r\nwhile len(unvisited) != 0:\r\n node = unvisited.pop(0)\r\n num_of_component += 1\r\n\r\n queue = [(node, 'x')]\r\n\r\n visited = set()\r\n\r\n while len(queue) != 0:\r\n val, type = queue.pop(0)\r\n visited.add((val, type))\r\n if type == 'x':\r\n if val in unvisited:\r\n unvisited.remove(val)\r\n source = xs if type == 'x' else ys\r\n for value in source[val]:\r\n if (value, reverse[type]) not in visited:\r\n queue.append((value, reverse[type]))\r\nprint(num_of_component - 1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\n\ndrifts = []\n\ni = 0\nx = []\ny = []\nused = []\nadditions = 0\n\nwhile i < n:\n i += 1\n point = [int(item) for item in input().split(' ')]\n x.append(point[0])\n y.append(point[1])\n used.append(False)\n\n\ndef dfs(i):\n used[i] = True\n for t in range(n):\n if not used[t]:\n if x[i] == x[t] or y[i] == y[t]:\n dfs(t)\n\n\nfor i in range(n):\n if used[i]:\n continue\n dfs(i)\n additions += 1\n\nprint(additions - 1)\n", "def slide(i):\r\n visited[i] = True\r\n for point in range(n):\r\n if (not visited[point]):\r\n if (snow_drifts[i][0] == snow_drifts[point][0] or \r\n snow_drifts[i][1] == snow_drifts[point][1]):\r\n slide(point)\r\n\r\nn = int(input())\r\nsnow_drifts, visited = [], [False for x in range(n)]\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n snow_drifts.append((x,y))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if (not visited[i]):\r\n slide(i)\r\n count += 1\r\nprint(count - 1)", "def find(parent, cords):\r\n\tx, y = cords\r\n\twhile parent[cords] != cords:\r\n\t\tcords = parent[cords]\r\n\r\n\tparent[(x, y)] = cords\r\n\r\n\treturn cords\r\n\r\ndef union(parent, height, cord1, cord2):\r\n\tcord1 = find(parent, cord1)\r\n\tcord2 = find(parent, cord2)\r\n\r\n\tif cord1 == cord2:\r\n\t\treturn\r\n\tif height[cord1] > height[cord2]:\r\n\t\tparent[cord2] = cord1\r\n\t\theight[cord2] += height[cord1]\r\n\telse:\r\n\r\n\t\tparent[cord1] = cord2\r\n\t\theight[cord1] += height[cord2]\r\n\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input())\t\r\n\t\r\n\tcords = list()\r\n\tparent = dict()\r\n\theight = dict()\r\n\tfor i in range(n):\r\n\t\tx, y = map(int, input().split())\r\n\t\tparent[(x, y)] = (x, y)\r\n\t\theight[(x, y)] = 1\r\n\t\tcords.append((x, y))\r\n\r\n\tfor i in cords:\r\n\t\tfor j in cords:\r\n\t\t\tif i != j and i[0] == j[0]:\r\n\t\t\t\tunion(parent, height, i, j)\r\n\t\t\telif i != j and i[1] == j[1]:\r\n\t\t\t\tunion(parent, height, i, j)\r\n\r\n\tdisctinct_groups = set()\r\n\tfor i in cords:\r\n\t\tdisctinct_groups.add(find(parent, i))\r\n\t\r\n\t# print(parent)\r\n\tprint(len(disctinct_groups)-1)\r\n\r\n", "def bfs(snowdrifts, start, visited):\r\n queue = deque( [start] )\r\n\r\n while queue:\r\n v = queue.popleft()\r\n\r\n for i,coordinate in enumerate(snowdrifts):\r\n if visited[i]:\r\n continue\r\n\r\n if v[0] == coordinate[0] or v[1] == coordinate[1]:\r\n visited[i] = True\r\n queue.append(coordinate)\r\n\r\n return visited\r\n\r\nfrom collections import deque\r\n\r\nn = int(input())\r\n\r\nsnowdrifts = []\r\nfor i in range(n):\r\n snowdrift = tuple(map(int, input().split()))\r\n snowdrifts.append(snowdrift)\r\n\r\nvisited = [False] * n\r\n\r\ngraphs = []\r\nfor i in range(n):\r\n if visited[i]:\r\n continue\r\n\r\n visited[i] = True\r\n graphs.append(bfs(snowdrifts, snowdrifts[i], visited))\r\n\r\nanswer = len(graphs) - 1\r\nprint(answer)", "def neighbour(v):\n global vs, used\n ns = []\n for i in range(len(vs)):\n if v[2] != i and (vs[i][0] == v[0] or vs[i][1] == v[1]) and used[vs[i][2]] == False:\n ns.append(vs[i])\n return ns\n\n\ndef dfs(v):\n global vs, used\n used[v[2]] = True\n for elem in neighbour(v):\n dfs(elem)\n\n\nvs = []\nn = int(input())\nfor i in range(n):\n x, y = map(int, input().split())\n vs.append([x, y, i])\n\nused = [False] * n\nres = 0\nfor i in range(n):\n if used[i] == False:\n dfs(vs[i])\n res += 1\nprint(res-1)\n \t\t \t \t\t\t \t \t \t\t\t\t\t", "# cook your dish here\r\nimport sys\r\nimport math\r\ndef dfs(z):\r\n vis[z]=1 \r\n for i in range(n):\r\n if(vis[i]==0 and (x[i]==x[z] or y[i]==y[z])):\r\n dfs(i)\r\n \r\nn=int(input())\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n l=[int(i) for i in input().split()]\r\n x.append(l[0])\r\n y.append(l[1])\r\n \r\nres=0\r\nvis=[0]*n \r\nfor i in range(n):\r\n if(vis[i]==0):\r\n dfs(i)\r\n res+=1 \r\nprint(res-1)\r\n\r\n\r\n \r\n\r\n \r\n \r\n ", "from math import inf\r\nfrom collections import Counter as cntr\r\ndef cin():\r\n\treturn map(int, input().split(' '))\r\ndef dfs(heap):\r\n\tglobal heaps\r\n\tglobal visited\r\n\tfor h in heaps:\r\n\t\tif visited[h] == False and (h[0]==heap[0] or h[1]==heap[1]):\r\n\t\t\tvisited[h] = True\r\n\t\t\tdfs(h)\r\n\r\n\r\nn = int(input())\r\nheaps = []\r\nvisited = {}\r\nfor i in range(n):\r\n\tx, y = cin()\r\n\theaps.append((x,y))\r\n\tvisited[(x,y)] = False\r\ncount= -1\r\n\r\nfor heap in heaps:\r\n\tif visited[heap] == False:\r\n\t\tvisited[heap] = True\r\n\t\tcount += 1\r\n\t\tdfs(heap)\r\n\r\nprint(count)\r\n\r\n", "def findSet(u, parent):\r\n if u != parent[u]:\r\n parent[u] = findSet(parent[u], parent)\r\n return parent[u]\r\n\r\ndef unionSet(u, v, parent, ranks):\r\n up = findSet(u, parent)\r\n vp = findSet(v, parent)\r\n\r\n if up == vp:\r\n return\r\n \r\n if ranks[up] > ranks[vp]:\r\n parent[vp] = up\r\n elif ranks[up] < ranks[vp]:\r\n parent[up] = vp\r\n else:\r\n parent[up] = vp\r\n ranks[vp] += 1\r\n\r\nn = int(input())\r\nparent = [i for i in range(n)]\r\nranks = [0 for _ in range(n)]\r\n\r\ndrift = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n drift.append((x, y))\r\n \r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if drift[i][0] == drift[j][0] or drift[i][1] == drift[j][1]:\r\n unionSet(i, j, parent, ranks)\r\n\r\nprint(sum(1 for i in range(n) if i == parent[i]) - 1)", "def indo( A , n , c) :\r\n \r\n for i in range ( len(A) ) :\r\n \r\n if A[i][0][c] == n :\r\n \r\n return i\r\n \r\n if A[i][0][c] > n :\r\n \r\n return -1\r\n \r\n else :\r\n \r\n return -1\r\n\r\nn = int ( input() )\r\n\r\nP = [ [] for i in range (n) ]\r\n\r\nfor i in range (n) :\r\n \r\n a,b = map ( int , input().split() )\r\n \r\n P[i] = [a,b]\r\n \r\nA = [ [[] , 0] for i in range (n) ]\r\n\r\nfor i in range (n) :\r\n \r\n A[i] = [ P[i] , i ]\r\n \r\nB = list(A)\r\n\r\nA.sort(key = lambda x : x[0][0] )\r\n\r\nB.sort(key = lambda x : x[0][1] )\r\n\r\nV=[0]*n\r\n\r\nW = 0\r\n\r\nfor i in range (n) :\r\n \r\n if V[i] :\r\n \r\n continue\r\n \r\n W+=1\r\n \r\n X = []\r\n \r\n Y = []\r\n \r\n newX = [P[i][0]]\r\n \r\n newY = [P[i][1]]\r\n \r\n while True :\r\n \r\n newnewX = []\r\n \r\n newnewY = []\r\n \r\n for j in newX :\r\n \r\n xx= indo( A , j , 0 )\r\n \r\n while True :\r\n \r\n if xx >= n :\r\n \r\n break\r\n if A[xx][0][0] != j :\r\n \r\n break\r\n \r\n if A[xx][0][1] not in Y :\r\n \r\n newnewY += [A[xx][0][1]]\r\n \r\n V[A[xx][1]] = 1\r\n \r\n xx+=1\r\n \r\n for j in newY :\r\n \r\n xx= indo( B , j , 1 )\r\n \r\n while True :\r\n \r\n if xx >= n :\r\n \r\n break\r\n if B[xx][0][1] != j :\r\n \r\n break\r\n \r\n if B[xx][0][0] not in X :\r\n \r\n newnewX += [B[xx][0][0]]\r\n \r\n V[B[xx][1]] = 1\r\n \r\n xx+=1\r\n \r\n X += newnewX\r\n Y += newnewY\r\n \r\n newX = list(newnewX)\r\n newY = list(newnewY)\r\n \r\n if newX==[] and newY==[] :\r\n \r\n break\r\n \r\n \r\n \r\n\r\nprint(W-1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "def ehDoGrupo(cordenada, grupo):\n for cord in grupo:\n if cord[0] == cordenada[0] or cord[1] == cordenada[1]:\n return True\n return False\n\ndef match(grupo1, grupo2):\n for valor in grupo2:\n if ehDoGrupo(valor, grupo1):\n return True\n return False\n\ndef append(grupos, posicao=-1, valores = []):\n if posicao < 0:\n grupos.append(valores)\n else:\n valoresAdd = valores\n for valor in valoresAdd:\n if not valor in grupos[posicao]:\n grupos[posicao].append(valor)\ndef merge(grupos, i):\n j = i + 1\n if i >= len(grupos): return\n\n while(j < len(grupos)):\n if match(grupos[i], grupos[j]):\n append(grupos,i, grupos[j])\n grupos.pop(j)\n merge(grupos, 0)\n j += 1\n merge(grupos, i + 1)\n\n\n\ndef insereNoGrupo(grupos, cordenada):\n grupos.append([cordenada])\n merge(grupos, 0)\n\nn = int(input())\ncordenadas = []\ngrupos = []\nfor i in range(n):\n entrada = input().split(\" \")\n insereNoGrupo(grupos,(int(entrada[0]), int(entrada[1])))\nprint(len(grupos) - 1)", "import sys\n\ndef main():\n\n numero = int(input())\n\n rabiadas = dict()\n\n for _ in range(numero):\n\n i, j = map(int, input().split())\n\n rabiadas[i] = rabiadas.get(i, set()) | set([j])\n\n rabiadas = [rabiadas[k] for k in rabiadas]\n equipes = []\n\n i = 0\n grupo = set()\n\n while i < len(rabiadas):\n if not grupo:\n grupo |= rabiadas[i]\n j = i + 1\n bandeira = False\n while j < len(rabiadas):\n if grupo & rabiadas[j]:\n grupo |= rabiadas.pop(j)\n bandeira = True\n break\n j += 1\n if not bandeira:\n i += 1\n equipes.append(grupo)\n grupo = set()\n\n print(len(equipes) - 1)\n\nif __name__ == '__main__':\n sys.exit(main())\n\t \t \t \t \t\t\t \t \t\t\t", "def change_to_0(array,x,y):\n if array[y][x]==0:\n return\n array[y][x]=0\n orient=[[1,0],[-1,0],[0,1],[0,-1]]\n for i in orient:\n ax=x\n ay=y\n while ax in range(0,len(array)) and ay in range(0,len(array)):\n if array[ay][ax] !=0:\n change_to_0(array,ax,ay)\n ax+=i[0]\n ay+=i[1]\n\nplan=[[0]*1001 for i in range(1001)]\nn=int(input(\"\") )\nfor i in range(n):\n x,y=map(int,input(\"\").split())\n plan[y][x]=1\nres=-1\nfor i in range(1001):\n for j in range(1001):\n if plan[i][j]==1:\n res+=1\n change_to_0(plan,j,i)\nprint(res)\n\n\n\n\t \t \t \t\t\t\t \t \t \t\t\t\t\t \t\t \t", "def dfs(visited, result, v, adj):\n visited[v] = True\n result.append(v)\n for s in adj[v]:\n if not visited[s]:\n dfs(visited, result, s, adj)\n\n\ndef conn_comp(n, adj):\n visited = [False for _ in range(n)]\n cc = []\n for v in range(n):\n if not visited[v]:\n result = []\n dfs(visited, result, v, adj)\n cc.append(result)\n return cc\n\n\nif __name__ == '__main__':\n n = int(input())\n\n drifts = []\n for i in range(n):\n x, y = map(int, input().split())\n drifts.append((x, y))\n\n adj = [list() for i in range(n)]\n for i, coord in enumerate(drifts):\n for j in range(i+1, len(drifts)):\n if coord[0] == drifts[j][0] or coord[1] == drifts[j][1]:\n adj[i].append(j)\n adj[j].append(i)\n\n print(len(conn_comp(n, adj)) - 1)\n\t \t\t\t \t\t\t \t\t\t \t \t \t \t \t\t \t \t", "import sys\r\nsys.setrecursionlimit(10000)\r\n\r\ndef find(u):\r\n if parent[u] != u:\r\n parent[u] = find(parent[u])\r\n return parent[u]\r\n\r\ndef UnionSet(u,v):\r\n up = find(u)\r\n vp = find(v)\r\n if up == vp:\r\n return\r\n if ranks[up] > ranks[vp]:\r\n parent[vp] = up\r\n elif ranks[up] < ranks[vp]:\r\n parent[up] = vp\r\n else:\r\n parent[up] = vp\r\n ranks[vp] += 1\r\n\r\nn = int(input())\r\nparent = {}\r\nranks = {}\r\nX = []\r\nY = []\r\nfor i in range (n):\r\n x,y = map(int,input().split())\r\n X.append(x)\r\n Y.append(y)\r\n parent[(x,y)] = (x,y)\r\n ranks[(x,y)] = 0\r\n\r\nfor i in range (n):\r\n for j in range (n):\r\n if X[i] == X[j] or Y[j] == Y[i]:\r\n UnionSet((X[i],Y[i]),(X[j],Y[j]))\r\n\r\ndrifs = []\r\nfor i in parent:\r\n a = find(i)\r\n if a not in drifs:\r\n drifs.append(a)\r\n\r\nprint(len(drifs)-1)", "def dfs(graph,visit,vertex):\n if visit[vertex] == False:\n visit[vertex] = True\n for i in graph[vertex]:\n dfs(graph,visit,i)\n\n\nn = int(input())\nxAry = []\nyAry = []\ngraph = []\nfor i in range(n):\n x,y = map(int,input().split())\n xAry.append(x)\n yAry.append(y)\n graph.append([])\nfor i in range(n):\n for j in range(n):\n if i != j:\n if xAry[i] == xAry[j] or yAry[i] == yAry[j]:\n graph[i].append(j)\nres = -1\nvisit = [False]*n\nfor i in range(n):\n if visit[i] == False:\n dfs(graph,visit,i)\n res+=1\nprint(res)\n", "import sys\r\nimport os\r\n \r\ncin = [\r\n\tlambda: input(),\r\n\tlambda: int(input()),\r\n\tlambda: input().split(),\r\n\tlambda: [int(a) for a in input().split()],\r\n]\r\n\r\ndef solve():\r\n\tn = cin[1]()\r\n\r\n\tl = []\r\n\tans = 0\r\n\tfor i in range(n):\r\n\t\ta, b = cin[-1]()\r\n\r\n\t\tfor j in range(ans):\r\n\t\t\tif a in l[j][0] or b in l[j][1]:\r\n\t\t\t\tl[j][0].add(a) \r\n\t\t\t\tl[j][1].add(b) \r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tans += 1\r\n\t\t\tl.append((set(), set()))\r\n\t\t\tl[ans-1][0].add(a) \r\n\t\t\tl[ans-1][1].add(b)\r\n\r\n\tcnt = 0\r\n\tfor i in range(ans):\r\n\t\tfor j in range(i+1, ans):\r\n\t\t\tif len(l[i][0].intersection(l[j][0])) != 0 or len(l[i][1].intersection(l[j][1])) != 0:\r\n\t\t\t\tl[j] = (l[j][0].union(l[i][0]), l[j][1].union(l[i][1]))\r\n\t\t\t\tl[i] = -1\r\n\t\t\t\tcnt += 1\r\n\t\t\t\tbreak\r\n\r\n\tprint(ans-cnt-1)\r\n\r\ndef main():\r\n\tif os.path.exists('input.txt'):\r\n\t\tsys.stdin = open('input.txt', 'r')\r\n\t\tsys.stdout = open('output.txt', 'w')\r\n\r\n\tt = 1\r\n\t# t = cin[1]()\r\n\r\n\twhile t:\r\n\t\tt -= 1\r\n\t\tsolve()\r\n \r\nmain()", "from collections import defaultdict\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append([x,y])\r\ngraph=defaultdict(list)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n continue\r\n if a[i][0]==a[j][0] or a[i][1]==a[j][1]:\r\n graph[i].append(j)\r\nvis=[0]*n\r\ndef dfs(n):\r\n vis[n]=1\r\n for i in graph[n]:\r\n if not vis[i]:\r\n dfs(i)\r\nans=-1\r\nfor i in range(n):\r\n if not vis[i]:\r\n dfs(i)\r\n ans+=1\r\nprint(ans)", "#E - Ice Skating\ndef dfs(no):\n visitado.add(no)\n for i in range(1, nSnowDr + 1):\n if i not in visitado and (lista[no][0] == lista[i][0] or lista[no][1] == lista[i][1]):\n dfs(i)\n\nnSnowDr = int(input())\nlista = [[] for e in range(nSnowDr + 1)]\nvisitado = set()\nfor e in range(1, nSnowDr + 1):\n x, y = map(int, input().split())\n lista[e] = [x, y]\n\ncount = -1\nfor i in range(1, nSnowDr + 1):\n if i not in visitado:\n dfs(i)\n count += 1\n\nprint(count)\n\t\t \t \t \t\t \t \t \t\t\t", "n = int(input())\n\nval = 110\nx = [0] * val\ny = [0] * val\nf = [0] * val\ncont = 0\n \ndef result(i):\n f[i] = 1\n for j in range(1, n):\n if(f[j] != 1 and (x[i] == x[j] or y[i] == y[j])):\n result(j)\n return\n \nfor i in range(n):\n a, b = map(int, input().split())\n x[i] = a\n y[i] = b\n \nfor i in range(n):\n if(f[i] != 1):\n result(i)\n cont += 1\n \nprint(cont - 1)\n \t \t \t\t\t \t\t \t \t\t\t \t\t \t\t\t\t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jun 22 07:28:09 2023\r\n\r\n@author: MARIA\r\n\"\"\"\r\n\r\n# Ice Skating\r\n\r\n#Input\r\nn_monticulos = int(input())\r\nmonticulos = []\r\nfor i in range(n_monticulos):\r\n coor = input().split()\r\n coor[0] = int(coor[0])\r\n coor[1] = int(coor[1])\r\n monticulos.append(coor)\r\ngrupos_monticulos=0\r\ndef dfs():\r\n grupos_monticulos=0\r\n visited=[]\r\n \r\n for k in range(n_monticulos):\r\n if monticulos[k] in visited:\r\n continue\r\n \r\n nodo_ini=monticulos[k]\r\n pila = [nodo_ini]\r\n while pila!=[]:\r\n nodo = pila.pop()\r\n visited.append(nodo)\r\n for j in range(n_monticulos):\r\n if (nodo[0]==monticulos[j][0] or nodo[1]==monticulos[j][1]) and (monticulos[j] not in visited):\r\n pila.append(monticulos[j])\r\n visited.append(monticulos[j])\r\n \r\n grupos_monticulos = grupos_monticulos + 1\r\n return grupos_monticulos\r\n \r\nprint(dfs()-1)\r\n\r\n\r\n", "n=int(input())\r\na=[-1]*9999\r\n\r\ndef f(x):\r\n if a[x]<0:\r\n a[x]=x\r\n if x!=a[x]:\r\n a[x]=f(a[x])\r\n return a[x]\r\nd=n\r\nfor i in range(d):\r\n x,y=map(int,input().split())\r\n y+=1000\r\n if a[x]>=0:\r\n n-=1\r\n if a[y]>=0:\r\n n-=1\r\n if f(x)==f(y):\r\n n+=1\r\n\r\n a[f(x)]=f(y)\r\n\r\nprint(n-1)\r\n", "def read_input():\r\n global n, p, edge\r\n n = int(input())\r\n p = []\r\n edge = []\r\n for i in range(n):\r\n u, v = map(int, input().split())\r\n p.append((u,v))\r\n for i in range(n-1):\r\n for j in range(i+1,n):\r\n if p[i][0] == p[j][0] or p[i][1] == p[j][1]:\r\n edge.append((i,j))\r\n\r\ndef init():\r\n global lab\r\n lab = [-1] * n\r\n\r\ndef find_set(u):\r\n global lab\r\n if lab[u] < 0:\r\n return u\r\n lab[u] = find_set(lab[u])\r\n return lab[u]\r\n\r\n\r\ndef union(r,s):\r\n global lab\r\n lab[r] = s\r\n\r\ndef solve():\r\n global edge, cc\r\n init()\r\n cc = n\r\n for e in edge:\r\n r = find_set(e[0])\r\n s = find_set(e[1])\r\n if r != s:\r\n union(r, s)\r\n cc -= 1\r\n print(cc-1)\r\nif __name__ == '__main__':\r\n read_input()\r\n solve()", "def dfs(s):\r\n finished.add(s)\r\n for i, j in snow_locs - finished:\r\n if i == s[0] or j == s[1]:\r\n dfs((i, j))\r\n\r\n\r\ninl = lambda: tuple(map(int, input().split()))\r\nsnow_locs = set(inl() for _ in range(int(input())))\r\n\r\nfinished = set()\r\npaths_count = 0\r\nwhile len(snow_locs - finished):\r\n paths_count += 1\r\n start = next(iter(snow_locs - finished))\r\n path = set()\r\n dfs(start)\r\nprint(paths_count - 1)\r\n", "from collections import defaultdict\r\n\r\n\r\nn = int(input())\r\n\r\npoints = []\r\nfor _ in range(n):\r\n points.append(list(map(int, input().split())))\r\n\r\ngraph = defaultdict(list)\r\nfor idx in range(n):\r\n for idx2 in range(idx-1, -1, -1):\r\n\r\n if points[idx][0] == points[idx2][0] or points[idx][1] == points[idx2][1]:\r\n graph[idx].append(idx2)\r\n graph[idx2].append(idx)\r\n\r\n\r\nvisited = [False for _ in range(n)]\r\n\r\ncnt = 0\r\nfor idx in range(n):\r\n if not visited[idx]:\r\n visited[idx] = True\r\n stack = [idx]\r\n\r\n while stack:\r\n cur = stack.pop()\r\n\r\n for neig in graph[cur]:\r\n if not visited[neig]:\r\n visited[neig] = True\r\n stack.append(neig)\r\n \r\n cnt += 1\r\n\r\nprint(cnt - 1)\r\n\r\n", "n = int(input().strip())\r\nq = []\r\nfor i in range(n):\r\n q.append(list(map(int, input().strip().split())))\r\ncnt = 0\r\ndef dfs(u):\r\n used[u] = 1\r\n for i in range(n):\r\n if used[i] == 0 and (q[u][0]==q[i][0]or q[u][1]==q[i][1]):\r\n dfs(i)\r\nused = [0 for i in range(n)]\r\nfor i in range(n):\r\n if used[i] == 0:\r\n cnt += 1\r\n dfs(i)\r\nprint(cnt-1)", "v = [0]*100\r\ndef dfs(b,i):\r\n v[i] =1\r\n for k in range(len(b)):\r\n # print(b[k][0],',',b[k][1],\" \",b[i][0],',',b[i][1], \" \" , v[k]);\r\n if (b[k][0] == b[i][0] or b[k][1] == b[i][1]) and v[k] == 0:\r\n dfs(b,k)\r\n\r\n\r\n\r\na = int(input())\r\nb = []\r\nc = 0\r\nfor i in range(a):\r\n p,q = map(int,input().split())\r\n b.append((p,q))\r\nfor i in range(a):\r\n if v[i] == 0 :\r\n dfs(b,i)\r\n c+=1\r\nprint(c-1)\r\n\r\n", "N=int(input())\r\ndrifts=[]\r\nfor i in range(N):\r\n line=input().split(\" \")\r\n drifts.append((int(line[0]), int(line[1])))\r\nadjacency_list={}\r\n\r\nfor drift in drifts:\r\n adjacency_list[drift]=[]\r\n\r\nfor i, value_i in enumerate(drifts):\r\n for j, value_j in enumerate(drifts):\r\n if i!=j:\r\n if value_i[0]==value_j[0] or value_i[1]==value_j[1]:\r\n adjacency_list[value_i].append(value_j)\r\n\r\n\r\ndef BFS(start, visited):\r\n queue=[start]\r\n while queue!=[]:\r\n V=queue[0]\r\n for neig in adjacency_list.get(V):\r\n if neig not in visited:\r\n queue.append(neig)\r\n visited.add(neig)\r\n del queue[0]\r\n\r\nvisited=set([])\r\nnumof_components=-1\r\nfor drift in drifts:\r\n if drift not in visited:\r\n numof_components+=1\r\n BFS(drift, visited)\r\nprint(numof_components)\r\n", "n = int(input())\r\nl = []\r\nans = n - 1\r\nfor i in range(n):\r\n\tx, y = [int(x) for x in input().split()]\r\n\tl.append((x, y))\r\ns = list(range(n))\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i == j or s[i] == s[j]:\r\n\t\t\tcontinue\r\n\t\tif l[i][0] == l[j][0] or l[i][1] == l[j][1]:\r\n\t\t\tfor k in range(n):\r\n\t\t\t\tif k == j:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\tif s[k] == s[j]:\r\n\t\t\t\t\ts[k] = s[i]\r\n\t\t\ts[j] = s[i]\r\nprint(len(set(s)) - 1)", "import sys\r\nimport queue\r\nsys.setrecursionlimit(100000)\r\n\r\n# global constant\r\nINF = int(1e7+1)\r\nMAX = 100005\r\n\r\n# For testing\r\n#sys.stdin = open(\"INP.txt\", 'r')\r\n#sys.stdout = open(\"OUT.txt\", 'w')\r\n\r\n# global variables\r\nparents = []\r\nranks = []\r\nsize = []\r\nn = 0\r\n\r\n# classes\r\n\r\n\r\nclass Pair:\r\n def __init__(self, a, b):\r\n self.first = a\r\n self.second = b\r\n\r\n\r\n# functions\r\ndef init():\r\n global parents, ranks, size\r\n parents = [i for i in range(n)]\r\n ranks = [0 for i in range(n)]\r\n size = [1 for i in range(n)]\r\n\r\n\r\ndef findSet(u):\r\n if(parents[u] != u):\r\n parents[u] = findSet(parents[u])\r\n return parents[u]\r\n\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n if up == vp:\r\n return\r\n if ranks[up] < ranks[vp]:\r\n parents[up] = vp\r\n elif ranks[vp] < ranks[up]:\r\n parents[vp] = up\r\n else:\r\n ranks[vp] += 1\r\n parents[up] = vp\r\n\r\n\r\n# main function\r\ndef main():\r\n global n\r\n n = int(input())\r\n init()\r\n a = []\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(Pair(x, y))\r\n for i in range(n):\r\n for j in range(n):\r\n if a[i].first == a[j].first or a[i].second == a[j].second:\r\n unionSet(i, j)\r\n S = set()\r\n for i in range(n):\r\n S.add(findSet(i))\r\n print(len(S)-1)\r\n\r\n\r\nmain()\r\n", "n = int(input())\r\nX = []\r\nY = []\r\nclass G:\r\n def __init__(self,i):\r\n self.index = i\r\n self.child = set()\r\n self.parity = i\r\ng = []\r\nfor i in range(n):\r\n a,b = map(int,input().strip().split())\r\n X.append(a)\r\n Y.append(b)\r\n g.append(G(i)) \r\nfor i in range(len(X)-1):\r\n for j in range(i+1,len(X)):\r\n if X[i] == X[j] or Y[i] == Y[j]:\r\n g[i].child.add(g[j])\r\n g[j].child.add(g[i])\r\ndef dfs(a,p):\r\n if a==None or a in visited:\r\n return\r\n visited.add(a)\r\n a.parity = p\r\n for c in a.child:\r\n dfs(c,p)\r\n \r\nfor i in range(len(g)):\r\n if g[i].parity==i:\r\n visited = set()\r\n dfs(g[i],g[i].parity)\r\ns = set()\r\nfor i in range(len(g)):\r\n if (g[i].parity in s)==False:\r\n s.add(g[i].parity)\r\nprint(len(s)-1)", "from typing import List, Tuple\n\n\ndef solv(coords: List[Tuple[int, int]]) -> int:\n c1map = dict()\n c2map = dict()\n for c1, c2 in coords:\n if c1 not in c1map:\n c1map[c1] = [(c1, c2)]\n else:\n c1map[c1].append((c1, c2))\n\n if c2 not in c2map:\n c2map[c2] = [(c1, c2)]\n else:\n c2map[c2].append((c1, c2))\n\n graph = dict()\n for c1, c2 in coords:\n graph[(c1, c2)] = set(c1map[c1] + c2map[c2])\n\n visited = dict()\n\n def mark_group(src, group):\n if src in visited:\n return\n\n visited[src] = group\n neibs = graph[src]\n for neib in neibs:\n mark_group(neib, group)\n\n for k, cord in enumerate(coords):\n mark_group(cord, k)\n\n return len(set(visited.values())) - 1\n\n\nLINES = int(input())\ncoords = [None] * LINES\n\nfor i in range(LINES):\n coords[i] = tuple(map(int, input().split()))\n\nprint(solv(coords))\n", "n=int(input())\r\np=[]\r\nvis={}\r\nr=[[] for i in range(1001)]\r\nc=[[] for i in range(1001)]\r\ndef dfs(tup):\r\n x,y=tup\r\n if (x,y) in vis:\r\n return\r\n vis[(x,y)]=True\r\n for t in r[x]:\r\n i,j=t\r\n if (i,j) not in vis:\r\n dfs((i,j))\r\n for t in c[y]:\r\n i,j=t\r\n if (i,j) not in vis:\r\n dfs((i,j))\r\nfor i in range(n):\r\n p.append(tuple(map(int,input().split())))\r\nfor x,y in p:\r\n c[y].append((x,y))\r\n r[x].append((x,y))\r\nans=0\r\nfor x,y in p:\r\n if (x,y) not in vis:\r\n dfs((x,y))\r\n ans+=1\r\nprint(ans-1)\r\n \r\n", "from collections import deque\r\n\r\ndef bfs(g, start):\r\n q = deque()\r\n visited = []\r\n q.append(start)\r\n while q:\r\n node = q.popleft()\r\n if node not in visited:\r\n for v in g[node]:\r\n q.append(v)\r\n visited.append(node)\r\n\r\n return visited\r\n\r\ndef main():\r\n n = int(input())\r\n g = {i:[] for i in range(n)}\r\n cords = []\r\n for i in range(n):\r\n x, y = list(map(int, input().split()))\r\n cords.append([x, y])\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n if cords[i][0] == cords[j][0] or cords[i][1] == cords[j][1]:\r\n g[i].append(j)\r\n g[j].append(i)\r\n ans = 0\r\n used = [0 for i in range(n)]\r\n for i in range(n):\r\n if not used[i]:\r\n comp = bfs(g, i)\r\n for v in comp:\r\n used[v] = 1\r\n ans += 1\r\n print(ans-1)\r\nif __name__ == \"__main__\":\r\n main()", "'''\r\nCreated on Jan 2, 2015\r\n\r\n@author: Yehiaaa\r\n\r\n'''\r\ndef dfs(i):\r\n if i == size + 1:\r\n return\r\n temp[i] = False\r\n for j in range(size):\r\n if (X[j] == X[i] or Y[j] == Y[i]) and temp[j] :\r\n dfs(j) \r\n \r\n\r\n\r\nsize = int(input())\r\n\r\nX = [] \r\nY = []\r\ntemp = []\r\nfor i in range(size):\r\n temp.append(True)\r\n\r\n\r\nfor i in range(size):\r\n t = input().split()\r\n X.append(int(t[0]))\r\n Y.append(int(t[1]))\r\nslon = -1\r\n\r\nfor i in range(size):\r\n if temp[i]:\r\n dfs(i)\r\n slon+=1\r\nprint(slon)", "from sys import stdin\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\na=[]\r\nfor i in range(I()):\r\n\tx,y=R();flg=True\r\n\tfor i in range(len(a)):\r\n\t\tif flg:\r\n\t\t\tif x in a[i][0] or y in a[i][1]:\r\n\t\t\t\ta[i][0]+=x,\r\n\t\t\t\ta[i][1]+=y,\r\n\t\t\t\tp=i\r\n\t\t\t\tflg=False\r\n\t\telse:\r\n\t\t\tif x in a[i][0] or y in a[i][1]:\r\n\t\t\t\ta[p][0]+=a[i][0];a[i][0].clear()\r\n\t\t\t\ta[p][1]+=a[i][1];a[i][1].clear()\r\n\tif flg:a.append([[x],[y]])\r\nans=0\r\nfor i in a:\r\n\tif i[0]:ans+=1\r\nprint(ans-1)", "##Find connected components using dsu\n\ncc = 0\n\nn = int(input(\"\"))\n\ndef dfs(node):\n\tcoordinates[node][-1] = res\n\n\tfor i in range(n):\n\t\tif coordinates[i][-1] == -1 and (coordinates[node][0] == coordinates[i][0] or coordinates[node][1] == coordinates[i][1]):\n\t\t\tdfs(i)\n\ncoordinates = []\nfor i in range(n):\n\tx,y = tuple(map(int,input(\"\").split(\" \")))\n\n\tcoordinates.append([x,y,-1])\n\nres = 0\nfor i in range(n):\n\tif coordinates[i][-1] == -1:\n\t\tdfs(i)\n\t\tres +=1 \n\nprint(res-1)\n\n\n", "MAX = 1001\r\ndef findSet(u):\r\n while u!= parent[u]:\r\n u = parent[u]\r\n return u\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v)\r\n if vp != up:\r\n parent[up] = vp\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n x = [0 for i in range(MAX)]\r\n y = [0 for i in range(MAX)]\r\n for i in range(n):\r\n x[i], y[i] = map(int, input().split())\r\n parent = [i for i in range(n)]\r\n cnt = [1 for i in range(n)]\r\n for i in range(n):\r\n for j in range(i + 1, n):\r\n if (x[i] == x[j] or y[i] == y[j]):\r\n unionSet(i, j)\r\n res = 0\r\n for i in range(n):\r\n if parent[i] == i:\r\n res += 1\r\n print(res - 1)", "n = int(input())\r\nsnow_drifts = []\r\nvisited = []\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n snow_drifts.append((x,y))\r\n visited.append(False)\r\n\r\ndef check_groups(i):\r\n visited[i] = True\r\n for j in range(n):\r\n if(not visited[j]):\r\n if (snow_drifts[i][0] == snow_drifts[j][0] or \r\n snow_drifts[i][1] == snow_drifts[j][1]):\r\n check_groups(j)\r\n\r\ngroups = 0\r\nfor i in range(n):\r\n if(not visited[i]):\r\n check_groups(i)\r\n groups += 1\r\n\r\nprint(groups - 1)", "num = int(input())\ncont = 0\n \narray_x = []\narray_y = []\nused = [0] * num\n\n\nfor i in range(num):\n\tax, ay = [int(j) for j in input().split()]\n\tarray_x.append(ax)\n\tarray_y.append(ay)\ndef aux(elem):\n used[elem] = 1\n for i in range(num):\n if not used[i] and (array_x[i] == array_x[elem] or array_y[i] == array_y[elem]):\n aux(i)\nfor i in range(num):\n\tif not used[i]:\n\t\taux(i)\n\t\tcont = cont + 1\n \nprint(cont-1)\n\t \t \t\t \t \t \t\t\t\t \t\t\t \t", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf():\r\n return [int(i) for i in get().split()]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join(map(str, a)) + end)\r\n\r\ndef main():\r\n n = int(get())\r\n d = [i for i in range(n)]\r\n q = []\r\n for i in range(n):\r\n x, y = getf()\r\n q.append([x, y])\r\n for i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if(q[i][0] == q[j][0] or q[i][1] == q[j][1]):\r\n x = d[i]\r\n y = d[j]\r\n for k in range(n):\r\n if(d[k] == y):\r\n d[k] = x\r\n put(len(set(d)) - 1)\r\nmain()\r\n", "n = int(input())\r\nxl = []\r\nyl = []\r\nans = 1\r\nfor i in range(n):\r\n x,y = map(int , input().split(' '))\r\n xl.append({x})\r\n yl.append({y})\r\nfor i in range(n-1):\r\n for j in range(i+1 , n):\r\n if xl[i] & xl[j] or yl[i] & yl[j]:\r\n xl[j] |= xl[i]\r\n yl[j] |= yl[i]\r\n ans += 1\r\n break\r\nprint(n -ans)", "\ndef findSet(ump,u):\n\tr=u\n\twhile(ump[r]>=0):\n\t\tr=ump[r]\n\twhile(u != r):\n\t\tpar=ump[u]\n\t\tump[u]=r\n\t\tu=par\n\treturn r\ndef setUnion(ump,u,v):\n\tu=findSet(ump,u)\n\tv=findSet(ump,v)\n\tif(u==v): return False\n\ttotalChilds=ump[u]+ump[v]\n\tif(ump[u]<=ump[v]):\n\t\tump[v]=u\n\t\tump[u]=totalChilds\n\telse :\n\t\tump[u]=v\n\t\tump[v]=totalChilds\n\treturn True\ndef preferedUnion(ump,u,v):\n u=findSet(ump,u)\n v=findSet(ump,v)\n if(u==v): return False\n totalChilds=ump[u]+ump[v]\n ump[v]=u\n ump[u]=totalChilds\n return True\nn=int(input())\nump=[-1 for _ in range(n)]\nmx={}\nmy={}\nfor _ in range(n):\n x,y=map(int,input().split())\n if x in mx:\n setUnion(ump,mx[x],_)\n else :\n mx[x]=_\n if y in my:\n setUnion(ump,my[y],_)\n else :\n my[y]=_\ncomps = 0\nfor num in ump:\n if num<0:\n comps+=1\nprint(comps-1)", "n_snow_drifts = int(input())\n\nsnow_drifts = []\ngroups = 0\n\ndef signalize(u):\n if snow_drifts[u][2] == 0:\n snow_drifts[u][2] = 1\n for i in range(n_snow_drifts):\n if snow_drifts[i][0] == snow_drifts[u][0] or snow_drifts[i][1] == snow_drifts[u][1]:\n signalize(i)\n \n\nfor i in range(n_snow_drifts):\n aux_input1, aux_input2 = input().split(\" \")\n snow_drifts.append([aux_input1, aux_input2, 0])\n\n\nfor i in range(n_snow_drifts):\n if snow_drifts[i][2] == 0:\n groups+=1\n signalize(i)\n\nprint(groups-1)", "#Problem 217A from codeforces\n#In order to make all snow drifts connect, we need to add n_comp - 1\n#snow drifts, where n_comp is the number of components\n\ndef main():\n n = int(input())\n points = []\n for _ in range(n):\n points.append([int(x) for x in input().split()])\n\n visited = [False for _ in range(n)]\n n_components = 0\n\n # Graph traversal to count components\n # O(n^2)\n for i in range(n):\n if not visited[i]:\n visited[i] = True\n n_components += 1\n nodes_queue = [i]\n while nodes_queue != []:\n node = nodes_queue.pop(0)\n visited[node] = True\n for j in range(n):\n if not visited[j]:\n if (points[j][0] == points[node][0]) or \\\n (points[j][1] == points[node][1]):\n #\n nodes_queue.append(j)\n \n print(n_components - 1)\n\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\narr=[]\ng={}\nfor _ in range(n):\n\tarr.append(list(map(int,input().split())))\n\tg[_]=[]\nfor i in range(n):\n\tfor j in range(n):\n\t\tif i!=j:\n\t\t\tif arr[i][0]==arr[j][0] or arr[i][1]==arr[j][1]:\n\t\t\t\tg[i].append(j)\n\t\t\t\tg[j].append(i)\nvis=[0]*n\n\ndef dfs(u):\n\tvis[u]=1\n\tfor x in g[u]:\n\t\tif not vis[x]:\n\t\t\tdfs(x)\n\nc=-1\nfor i in range(n):\n\tif not vis[i]:\n\t\tdfs(i)\n\t\tc+=1\nprint(c)\n\t \t\t \t\t\t \t\t \t \t \t \t \t\t\t", "import sys\r\n#sys.setrecursionlimit(10**7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Ice_Skating2():\r\n def do_dfs(startNode):\r\n node_index = total_nodes.index(startNode)\r\n visited[node_index] = True \r\n\r\n for neighbour in neighbours_dict[startNode]:\r\n node_index = total_nodes.index(neighbour)\r\n if visited[node_index] == False: \r\n do_dfs(neighbour)\r\n\r\n n = inp()\r\n\r\n neighbours_dict = {}\r\n total_nodes = []\r\n for i in range(n):\r\n xi,yi = invr()\r\n node1 = str(xi) + '_x'\r\n node2 = str(yi) + '_y'\r\n\r\n if node1 not in neighbours_dict.keys():\r\n neighbours_dict[node1] = []\r\n total_nodes.append(node1)\r\n \r\n if node2 not in neighbours_dict.keys():\r\n neighbours_dict[node2] = []\r\n total_nodes.append(node2)\r\n\r\n neighbours_dict[node1].append(node2)\r\n neighbours_dict[node2].append(node1)\r\n \r\n for node in neighbours_dict.keys():\r\n neighbours_dict[node] = list(set(neighbours_dict[node]))\r\n \r\n visited = [False]*len(total_nodes)\r\n\r\n number_of_connected_components = 0\r\n while visited.count(False) > 0:\r\n number_of_connected_components += 1\r\n index_False = visited.index(False)\r\n node = total_nodes[index_False]\r\n do_dfs(node)\r\n \r\n print(number_of_connected_components-1)\r\n return\r\n\r\nIce_Skating2()", "n = int(input())\n\ncoordX = []\ncoordY = []\n\nanswer = 0\n\nfor i in range(n):\n a, b = map(int, input().split())\n coordX.append({a})\n coordY.append({b})\n\nfor i in range(n - 1):\n for j in range(i + 1, n):\n if coordX[i] & coordX[j] or coordY[i] & coordY[j]:\n coordX[j] = coordX[j] | coordX[i]\n coordY[j] = coordY[j] | coordY[i]\n \n answer += 1\n \n break\nanswer = n - answer - 1\n\nprint (answer)\n \t \t\t\t \t\t \t \t \t \t \t\t\t", "from collections import deque\r\n\r\nmaxn = 1003\r\nvis = [[0] * maxn for _ in range(maxn)]\r\nlevel = [[0] * maxn for _ in range(maxn)]\r\nv = []\r\nsx = [[] for _ in range(1003)]\r\nsy = [[] for _ in range(1003)]\r\n\r\ndef reset():\r\n for i in range(maxn):\r\n vis[i] = [0] * maxn\r\n level[i] = [0] * maxn\r\n\r\ndef bfs(x, y):\r\n q = deque()\r\n q.append((x, y))\r\n vis[x][y] = 1\r\n\r\n while q:\r\n x, y = q.popleft()\r\n\r\n for cx, cy in sx[x]:\r\n if not vis[cx][cy]:\r\n vis[cx][cy] = 1\r\n level[cx][cy] = level[x][y] + 1\r\n q.append((cx, cy))\r\n\r\n for cx, cy in sy[y]:\r\n if not vis[cx][cy]:\r\n vis[cx][cy] = 1\r\n level[cx][cy] = level[x][y] + 1\r\n q.append((cx, cy))\r\n\r\ndef main():\r\n reset()\r\n n = int(input())\r\n\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n v.append((x, y))\r\n sx[x].append((x, y))\r\n sy[y].append((x, y))\r\n\r\n cnt = 0\r\n for x, y in v:\r\n if not vis[x][y]:\r\n cnt += 1\r\n bfs(x, y)\r\n\r\n print(cnt - 1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nvis=[]\r\nl=[]\r\n\r\ndef is_reachable(x1,x2,y1,y2):\r\n return x1==x2 or y1==y2\r\n\r\ndef DFS(i):\r\n vis[i]=True\r\n xi,yi=l[i]\r\n for j in range(n):\r\n val=l[j] \r\n if is_reachable(xi,val[0],yi,val[1]) and (not vis[j]):\r\n #print(i,j,l[i],l[j],xi,yi)\r\n DFS(j)\r\n \r\n \r\n \r\nfor i in range(n):\r\n xi,yi=map(int,input().split()) \r\n l.append((xi,yi))\r\n vis.append(False)\r\n \r\n#print(l)\r\nc=0\r\nfor i in range(n):\r\n #print(vis)\r\n if not vis[i]:\r\n DFS(i)\r\n c+=1\r\n \r\nprint(c-1)\r\n \r\n \r\n \r\n\r\n \r\n", "# Ice Skating\r\n# https://codeforces.com/problemset/problem/217/A\r\n# AC\r\n\r\n\r\ndef makeSet(size):\r\n global parent, ranks\r\n parent = [i for i in range(size + 1)]\r\n ranks = [1 for i in range(size + 1)]\r\n \r\n\r\ndef findSet(u):\r\n if (u != parent[u]):\r\n parent[u] = findSet(parent[u])\r\n return parent[u]\r\n\r\n\r\ndef unionSet(u, v):\r\n up = findSet(u)\r\n vp = findSet(v) \r\n \r\n if (up == vp):\r\n return\r\n \r\n if (ranks[up] > ranks[vp]):\r\n parent[vp] = up\r\n \r\n elif (ranks[up] < ranks[vp]):\r\n parent[up] = vp \r\n \r\n else:\r\n parent[up] = vp\r\n ranks[vp] += 1\r\n\r\n\r\ndef drif(i,j):\r\n if (cd[i][0] == cd[j][0]) or (cd[i][1] == cd[j][1]):\r\n return True\r\n else:\r\n return False\r\n \r\n \r\nif __name__ == '__main__':\r\n # import sys\r\n # sys.stdin = open('INP.txt', 'r')\r\n\r\n n = int(input())\r\n cd = [' ']\r\n \r\n makeSet(n)\r\n \r\n for i in range(1,n+1):\r\n x, y = map(int, input().split())\r\n cd.append([x, y])\r\n \r\n for i in range(1,n):\r\n for j in range(i+1,n+1):\r\n if drif(i,j):\r\n unionSet(i, j)\r\n \r\n cnt = 0\r\n for i in range(1,n+1):\r\n if (i == parent[i]):\r\n cnt += 1 \r\n \r\n print(cnt-1)\r\n\r\n\"\"\"\r\n3\r\n\r\n3 4\r\n1 2\r\n3 3\r\n1 3\r\n2 2\r\n3 2\r\n2 4\r\n\"\"\"", "snow_drifts = []\n\ndef check_groups(i):\n snow_drifts[i][2] = True\n for j in range(n):\n if not snow_drifts[j][2]:\n if snow_drifts[i][0] == snow_drifts[j][0] or snow_drifts[i][1] == snow_drifts[j][1]:\n check_groups(j)\n\nn = int(input())\nfor i in range(n):\n x, y = map(int, input().split())\n snow_drifts.append([x, y, False])\n\ngroups = -1\nfor i in range(n):\n if not snow_drifts[i][2]:\n check_groups(i)\n groups += 1\n\nprint(groups)\n\t\t \t\t \t\t \t\t \t \t\t \t \t \t", "def busca_em_profundidade(coordenada):\n flag = False\n if coordenada in alcancaveis:\n flag = True\n else:\n alcancaveis.append(coordenada)\n for i in range(len(grafo)):\n if (grafo[i] != coordenada):\n if((grafo[i][0] == coordenada[0]) or (grafo[i][1] == coordenada[1])):\n busca_em_profundidade(grafo[i])\n if(flag):\n return\n\nnum_de_montes_de_neve = int(input())\n\ngrafo = []\nfor i in range(num_de_montes_de_neve):\n\tcoordenadas = list(map(int, input().split()))\n\tgrafo.append(coordenadas)\n\nalcancaveis = []\nmin_montes_criados = 0\nfor i in range(len(grafo)):\n\tif grafo[i] not in alcancaveis :\n\t\tbusca_em_profundidade(grafo[i])\n\t\tmin_montes_criados += 1\n\nprint(min_montes_criados - 1)\n \t \t\t\t\t\t \t \t\t \t \t\t\t\t\t\t\t", "def find_root(x):\r\n\tif x==root[x]: return x\r\n\telse: root[x]=find_root(root[x])\r\n\treturn root[x] #GOM TẤT CẢ ROOT VỀ ROOT CHUNG NHẤT\r\n\r\ndef dsu(x,y,root):\r\n\tx = find_root(x)\r\n\ty = find_root(y)\r\n\tif (x == y): return False\r\n\troot[y] = x\r\n\treturn True\r\n\r\nn=int(input())\r\nroot=[i for i in range(n)]\r\ndr=[] #drifts\r\n\r\nfor _ in range(n):\r\n\ta,b=map(int,input().split())\r\n\tdr.append((a,b))\r\n\r\nfor i in range(0,n-1,1):\r\n\tfor j in range(i+1,n,1):\r\n\t\tif dr[i][0]==dr[j][0] or dr[i][1]==dr[j][1]:\r\n\t\t\tdsu(i,j,root) #2 đỉnh đã được nối với nhau\r\nfor i in range(n): root[i]=find_root(i)\r\n\r\nadd=len(set(root))-1\r\nprint(add)\r\n", "ndrifts = int(input())\ndrifts = []\ngrid = [[False for i in range(1001)] for j in range(1001)]\nvisited = [[False for i in range(1001)] for j in range(1001)]\nfor i in range(ndrifts):\n drifts.append([int(x) for x in input().split()])\n grid[drifts[i][0]][drifts[i][1]] = True\n\ndef dfs(x, y):\n global visited\n global grid\n visited[x][y] = True\n for i in range(1, 1001):\n if grid[x][i] and not visited[x][i]:\n dfs(x, i)\n for i in range(1, 1001):\n if grid[i][y] and not visited[i][y]:\n dfs(i, y)\n\nans = -1\nfor coord in drifts:\n if not visited[coord[0]][coord[1]]:\n dfs(coord[0], coord[1])\n ans += 1\n\nprint(max(ans, 0))\n\t \t\t \t\t\t \t\t \t \t \t \t \t \t\t", "n = int(input())\n\ndef dfs(x):\n if x not in visited:\n visited.append(x)\n for i in range(len(graph)):\n if (graph[i] != x) and ((graph[i][0] == x[0]) or (graph[i][1] == x[1])):\n dfs(graph[i])\n\n\ngraph = []\nvisited = []\ncont = 0\n\nfor i in range(n):\n coordinates = list(map(int, input().split()))\n graph.append(coordinates)\n\nfor i in range(len(graph)):\n if graph[i] not in visited:\n dfs(graph[i])\n cont += 1\n\nprint(cont-1)\n\t \t \t \t \t \t \t \t \t\t\t\t\t \t\t", "entrada = int(input())\nx,y,f = [0]*110,[0]*110,[0]*110\nsoma = -1\ndef defSoma(i):\n f[i] = 1\n for j in range(1,entrada):\n if(f[j]!=1):\n if((x[i] == x[j] or y[i] == y[j])):\n defSoma(j)\n return\n\nfor i in range(entrada):\n a,b = map(int, input().split())\n x[i] = a\n y[i] = b\nfor i in range(entrada):\n if(f[i] != 1):\n defSoma(i)\n soma += 1\nprint(soma)\n\n \t \t \t\t\t\t\t \t\t \t\t\t\t \t\t\t\t", "n = int(input())\r\n \r\ncoords = []\r\nfor i in range(n):\r\n x, y = input().split()\r\n coords.append(({int(x)}, {int(y)}))\r\n \r\nfor i in range(n-1, -1, -1):\r\n j = i - 1\r\n while j >= 0 and i < len(coords):\r\n if len(coords[j][0].intersection(coords[i][0])) or len(coords[j][1].intersection(coords[i][1])):\r\n coords[i][0].update(coords[j][0])\r\n coords[i][1].update(coords[j][1])\r\n coords.pop(j)\r\n j -= 1\r\n \r\nprint(len(coords) - 1)", "n = int(input())\r\nx = [0] * 1001\r\ny = [0] * 1001\r\nvisited = [False] * 1001\r\n\r\nfor i in range(1, n + 1):\r\n x[i], y[i] = map(int, input().split())\r\n\r\n\r\ndef dfs(i):\r\n visited[i] = True\r\n for j in range(1, n + 1):\r\n if not visited[j] and (x[i] == x[j] or y[i] == y[j]):\r\n dfs(j)\r\n\r\n\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n if not visited[i]:\r\n dfs(i)\r\n count += 1\r\n\r\nprint(count - 1)\r\n", "n = int(input())\r\nsnowdrifts = []\r\nfor s in range(n):\r\n snowdrifts.append(list(map(int, input().split())) + [None])\r\n\r\n\r\ndef dfs(current):\r\n current[2] = True\r\n for snowdrift in snowdrifts:\r\n if not snowdrift[2] and (current[0] == snowdrift[0] or current[1] == snowdrift[1]):\r\n dfs(snowdrift)\r\n\r\n\r\na = 0\r\nfor s in snowdrifts:\r\n if not s[2]:\r\n a += 1\r\n dfs(s)\r\n\r\nprint(a - 1)", "def iceSkating(num, value, xi, yi): \n for i in range(num):\n x, y = map(int, input().split())\n xi.append({x})\n yi.append({y})\n for i in range(num - 1):\n for j in range(i + 1, num):\n if xi[i] & xi[j] or yi[i] & yi[j]:\n xi[j] |= xi[i]\n yi[j] |= yi[i]\n value += 1 \n break\n\n snowDrifts = num - value - 1\n print(snowDrifts)\n\nnum, xi, yi, value = int(input()), [], [], 0\n\niceSkating(num, value, xi, yi)\n \t \t\t\t \t\t \t\t \t\t \t\t \t\t", "n = int(input())\r\n\r\ncont = 0\r\n\r\nx = []\r\ny = []\r\nvisited = [0] * n\r\n\r\nfor e in range(n):\r\n\tax, ay = [int(a) for a in input().split()]\r\n\tx.append(ax)\r\n\ty.append(ay)\r\n\r\ndef dfs(u):\r\n\tvisited[u] = 1\r\n\tfor i in range(n):\r\n\t\tif not visited[i] and (x[i] == x[u] or y[i] == y[u]):\r\n\t\t\tdfs(i)\r\n \r\nfor i in range(n):\r\n\tif not visited[i]:\r\n\t\tdfs(i)\r\n\t\tcont += 1\r\n\r\nprint(cont-1)\r\n", "n=int(input())\r\nz,x,y=1,[],[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x.append({a}); y.append({b})\r\n \r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if x[i]&x[j] or y[i]&y[j]:\r\n x[j]|=x[i]; y[j]|=y[i]; z+=1\r\n break\r\nprint(n-z)", "from collections import deque\r\nn = int(input())\r\ngrafs = dict()\r\nxx = set();yy = set()\r\nskautnes = []\r\nfor e in range(n):\r\n x, y = map(int, input().split()) \r\n xx.add(str(x) + 'x');yy.add(str(y) + 'y')\r\n skautnes.append( (str(x) + 'x',str(y) + 'y') )\r\nfor i in xx.union(yy):\r\n grafs[i] = set()\r\nfor s in skautnes:\r\n grafs[s[0]].add(s[1])\r\n grafs[s[1]].add(s[0])\r\n\r\ndef bfs(grafs, root):\r\n apmekletie = set(root)\r\n rinda = deque([root])\r\n while rinda:\r\n tgd = rinda.popleft()\r\n for neighbour in grafs[tgd]:\r\n if neighbour not in apmekletie:\r\n apmekletie.add(neighbour)\r\n rinda.append(neighbour)\r\n return(apmekletie)\r\n\r\ndalas = []\r\napmekletasvirsotnes = set()\r\nfor e in grafs:\r\n if e not in apmekletasvirsotnes:\r\n dala = bfs(grafs, e)\r\n dalas.append(dala)\r\n apmekletasvirsotnes.update(dala)\r\n\r\nprint(len(dalas) - 1)", "n = int(input())\r\nans = -1\r\nx = [0]*101\r\ny = [0]*101\r\nv = [False]*101\r\n\r\ndef dfs(i):\r\n v[i] = True\r\n for j in range(n):\r\n if not v[j] and (x[i] == x[j] or y[i] == y[j]):\r\n dfs(j)\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n x[i] = a\r\n y[i] = b\r\n\r\nfor i in range(n):\r\n if not v[i]:\r\n dfs(i)\r\n ans += 1\r\n\r\nprint(ans)", "import sys\r\nfrom math import log2,floor,ceil,sqrt,gcd\r\nimport bisect\r\n# from collections import deque\r\nsys.setrecursionlimit(10**5)\r\n\r\nRi = lambda : [int(x) for x in sys.stdin.readline().split()]\r\nri = lambda : sys.stdin.readline().strip()\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\ndef list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\r\ndef ceil(x, y=1): return int(-(-x // y))\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]\r\ndef Yes(): print('Yes')\r\ndef No(): print('No')\r\ndef YES(): print('YES')\r\ndef NO(): print('NO')\r\nINF = 10 ** 18\r\nMOD = 1000000007\r\n\r\ndef fd(a):\r\n if par[a] == a:\r\n return a\r\n temp = fd(par[a])\r\n par[a] = temp\r\n return temp\r\n\r\ndef un(a,b):\r\n pa = fd(a)\r\n pb = fd(b)\r\n par[pb] =pa\r\n\r\n\r\nn = int(ri())\r\nlis = []\r\npar = [i for i in range(n+1)]\r\nfor i in range(n):\r\n x,y = Ri()\r\n lis.append([x,y])\r\ncnt = n\r\nfor i in range(n):\r\n for j in range(0,i):\r\n # print(par[i],par[j])\r\n # print(lis)\r\n if lis[i][0] == lis[j][0] or lis[i][1] == lis[j][1]:\r\n if fd(i) == fd(j):\r\n continue\r\n else:\r\n # print(\"fs\")\r\n cnt -=1\r\n un(i,j)\r\nprint(cnt-1)\r\n", "n = int(input())\ncolor = {}\naux = 0\nfor _ in range(n):\n a = tuple(map(int, input().split(' ')))\n found = False\n clist = []\n for b in color.keys():\n if a[0] == b[0] or a[1] == b[1]:\n clist.append(color[b])\n aux += 1\n if len(clist) == 0:\n color[a] = aux\n else:\n cset = set(clist)\n for o in color.keys():\n if color[o] in cset:\n color[o] = aux\n color[a] = aux\n\nprint(len(set(color.values())) - 1)\n\n \t \t\t \t\t\t \t \t \t \t \t \t", "n = int(input())\n\nsnowpatch = [input().split() for i in range(n)]\n\nnewnode = 0\n\nvisited = [ False for i in range(n)]\n\nfor i in range(n):\n if visited[i] == True:\n continue\n visited[i] = True\n newnode += 1\n stack = [i]\n\n while stack:\n x = stack[-1]\n stack.pop()\n for j in range(n):\n if visited[j] == True:\n continue\n if snowpatch[j][0] == snowpatch[x][0] or snowpatch[j][1] == snowpatch[x][1]:\n stack.append(j)\n visited[x] = True\n\nprint(newnode - 1)\n", "from sys import stdin, stdout\n\ndef getRoot(i,par):\n while i!=par[i]:\n i = par[i]\n return i\n\ndef find(a,b,par):\n return getRoot(a,par)==getRoot(b,par)\n\ndef doUnion(a,b,par,size):\n if find(a,b,par):\n return -1\n r1 = getRoot(a,par)\n r2 = getRoot(b,par)\n s1 = size[r1]\n s2 = size[r2]\n if s1 > s2:\n par[r2] = r1\n size[r1] += s2\n else:\n par[r1] = r2\n size[r2] += s1\n return 1\n\nn = int(stdin.readline())\npoints = []\nl = 1\nfor i in range(n):\n x, y = map(int,stdin.readline().split())\n points.append( [x,y,l] )\n l+=1\npar = [i for i in range(n+1)]\nsize = [1 for i in range(n+1)]\n\nfor i in range(n-1):\n for j in range(i+1,n):\n x1,y1 = points[i][0],points[i][1]\n x2,y2 = points[j][0],points[j][1]\n if x1==x2 or y1==y2:\n poss = doUnion(points[i][2],points[j][2],par,size)\ncomp = {}\nfor i in range(1,n+1):\n p = getRoot(i,par)\n comp[p] = 1\n# print(comp)\nstdout.write(\"{}\\n\".format(len(comp)-1))\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef dfs(start):\r\n if start not in searched:\r\n searched.add(start)\r\n for i in range(n):\r\n if start[0] == piles[i][0] or start[1] == piles[i][1]: # follow the axes\r\n dfs(piles[i])\r\n\r\nn, num_piles, piles, searched = int(input()), 0, [], set()\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n piles.append((a, b))\r\nfor i in range(n):\r\n if piles[i] not in searched:\r\n num_piles += 1\r\n dfs(piles[i])\r\nprint(num_piles - 1)\r\n", "n = int(input())\r\ncoords = []\r\nneighborsX = dict()\r\nneighborsY = dict()\r\nfor i in range(n):\r\n coord = tuple(map(int, input().split()))\r\n if coord[0] not in neighborsX:\r\n neighborsX[coord[0]] = []\r\n neighborsX[coord[0]].append(coord)\r\n if coord[1] not in neighborsY:\r\n neighborsY[coord[1]] = []\r\n neighborsY[coord[1]].append(coord)\r\n coords.append(coord)\r\n\r\n\r\ndef dfs(coord, coords, neighborsX, neighborsY, visited):\r\n if coord in visited:\r\n return\r\n visited.add(coord)\r\n for ncoord in neighborsX[coord[0]]:\r\n dfs(ncoord, coords, neighborsX, neighborsY, visited)\r\n for ncoord in neighborsY[coord[1]]:\r\n dfs(ncoord, coords, neighborsX, neighborsY, visited)\r\n\r\n \r\n\r\nvisited = set()\r\ndisjoinSet = 0\r\nfor coord in coords:\r\n if coord in visited:\r\n continue\r\n dfs(coord, coords, neighborsX, neighborsY, visited)\r\n disjoinSet += 1\r\nprint(disjoinSet - 1)", "from collections import defaultdict\r\n\r\nn = int(input())\r\n \r\ndef dfs(x, y, visited_coords, s):\r\n\tvisited_coords[s]=True\r\n\tfor i in range(n):\r\n\t\tif(not visited_coords[i] and (x[s]==x[i] or y[s]==y[i])):\r\n\t\t\tdfs(x,y,visited_coords,i)\r\n \r\nvisited_coords=defaultdict(lambda:False,{})\r\nx=[]\r\ny=[]\r\n\r\n# Registering coordinates\r\nfor i in range(n):\r\n\tx1, y1 = [int(m) for m in input().split()]\r\n\tx.append(x1)\r\n\ty.append(y1)\r\n \r\nunique_visits=0 \r\n \r\nfor i in range(n):\r\n\tif(not visited_coords[i]):\r\n\t\tdfs(x,y,visited_coords,i)\r\n\t\tunique_visits+=1 \r\n \r\nprint(unique_visits-1)", "from collections import defaultdict \r\nclass Graph: \r\n \r\n def __init__(self): \r\n self.graph = defaultdict(list) \r\n def addEdge(self,u,v): \r\n self.graph[u].append(v) \r\n def BFS(self, s):\r\n path=[]\r\n d2={}\r\n queue = [] \r\n queue.append(s) \r\n d2[s]=1\r\n \r\n while queue: \r\n s = queue.pop(0) \r\n path.append(s) \r\n for i in self.graph[s]: \r\n if i not in d2:\r\n queue.append(i)\r\n d2[i]=1\r\n return path\r\ng=Graph()\r\nn=int(input())\r\nd1={}\r\nl1=[]\r\nfor i in range(0,n):\r\n x,y=map(int,input().split())\r\n if x not in d1:\r\n d1[x]=1\r\n l1.append(x)\r\n if -1*y not in d1:\r\n d1[-1*y]=1\r\n l1.append(-1*y)\r\n g.addEdge(x,-1*y)\r\n g.addEdge(-1*y,x)\r\n \r\n \r\ncomponents=0\r\nfor item in l1:\r\n if len(d1)==0:\r\n break\r\n else :\r\n if item in d1:\r\n components+=1\r\n path=g.BFS(item)\r\n for x in path:\r\n del d1[x]\r\nprint(components-1)", "from collections import defaultdict\r\nfrom sys import stdin, stdout\r\nfin = stdin.readline\r\nfout = stdout.write\r\n\r\ndef dfs(i, vis, st, gr):\r\n vis.add(i)\r\n\r\n for j in gr[i]:\r\n if not j in vis:\r\n dfs(j, vis, st, gr)\r\n\r\n st.append(i)\r\n\r\ndef solve():\r\n n = int(fin())\r\n c = []\r\n\r\n for i in range(n):\r\n a, b = fin().split()\r\n c.append([int(a), int(b)])\r\n\r\n gr = defaultdict(list)\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if j != i:\r\n if c[i][0] == c[j][0] or c[i][1] == c[j][1]:\r\n gr[i].append(j)\r\n gr[j].append(i)\r\n\r\n st = []\r\n\r\n dfs(i, set(), st, gr)\r\n\r\n g2 = defaultdict(list)\r\n\r\n for i in gr:\r\n for j in gr[i]:\r\n g2[j].append(i)\r\n\r\n vis = set()\r\n r = 0\r\n \r\n for i in range(n):\r\n if not i in vis:\r\n st = []\r\n dfs(i, vis, st, g2)\r\n r += 1\r\n\r\n fout(str(r-1))\r\n\r\n\r\nsolve()\r\n", "def find(u, parent):\r\n if u != parent[u]:\r\n parent[u] = find(parent[u], parent)\r\n return parent[u]\r\n\r\n\r\ndef union(u, v, parent, ranks):\r\n root_u = find(u, parent)\r\n root_v = find(v, parent)\r\n if root_v == root_u:\r\n return\r\n if ranks[root_v] > ranks[root_u]:\r\n parent[root_u] = root_v\r\n elif ranks[root_u] > ranks[root_v]:\r\n parent[root_v] = root_u\r\n else:\r\n parent[root_u] = root_v\r\n ranks[root_v] += 1\r\n\r\n\r\ndef solver():\r\n V = int(input())\r\n arr = []\r\n for i in range(V):\r\n x, y = map(int, input().split())\r\n arr.append((i, x, y))\r\n\r\n # make set\r\n parent = [i for i in range(V)]\r\n ranks = [0 for _ in range(V)]\r\n for i in range(V):\r\n for j in range(V):\r\n (v1, x1, y1) = arr[i]\r\n (v2, x2, y2) = arr[j]\r\n if x1 == x2 or y1 == y2:\r\n union(v1, v2,parent,ranks)\r\n for i in range(V): find(i, parent)#path compression\r\n components = {}\r\n for i in parent:\r\n if i not in components:\r\n components[i]=1\r\n print(len(components)-1)\r\nsolver()", "n=int(input())\na=[-1]*9999\n\ndef f(x):\n if a[x]<0:\n a[x]=x\n if x!=a[x]:\n a[x]=f(a[x])\n return a[x]\nd=n\nfor i in range(d):\n x,y=map(int,input().split())\n y+=1000\n if a[x]>=0:\n n-=1\n if a[y]>=0:\n n-=1\n if f(x)==f(y):\n n+=1\n\n a[f(x)]=f(y)\n\nprint(n-1)\n\n\t\t \t\t \t\t\t\t\t \t \t \t\t", "import sys\r\nsys.setrecursionlimit(10**6)\r\n\r\ndebug_mode = True if len(sys.argv) > 1 and sys.argv[1] == \"-d\" else False\r\nif debug_mode:\r\n import os\r\n infile = open(os.path.abspath(__file__).replace(\".py\", \".in\"))\r\n\r\n def input():\r\n return infile.readline()\r\n\r\n\r\n# ==============================================================\r\n\r\nfrom collections import defaultdict, deque\r\n\r\n\r\ndef main():\r\n n = int(input().strip())\r\n G = defaultdict(list)\r\n X, Y = \"x\", \"y\"\r\n for _ in range(n):\r\n xi, yi = list(map(int, input().strip().split()))\r\n G[(X, xi)].append((Y, yi))\r\n G[(Y, yi)].append((X, xi))\r\n\r\n # find the number of connected components\r\n Q, cnt, S = deque(), 0, set() # to visit, component count, visited\r\n for u in G:\r\n if u in S:\r\n continue\r\n cnt += 1\r\n Q.append((u, cnt))\r\n while Q:\r\n curr, cnt = Q.popleft()\r\n if curr in S:\r\n continue\r\n S.add(curr)\r\n for v in G[curr]:\r\n Q.append((v, cnt))\r\n\r\n print(cnt - 1)\r\n\r\n\r\nmain()\r\n\r\n# ==============================================================\r\n\r\nif debug_mode:\r\n infile.close()\r\n", "n = int(input())\r\n\r\nnodes = [list(map(int, input().split())) for i in range(n)]\r\n\r\nparent = [i for i in range(n)]\r\n \r\ndef find(i):\r\n if i != parent[i]:\r\n parent[i] = find(parent[i])\r\n return parent[i]\r\n\r\ndef union(i, j):\r\n pi, pj = find(i), find(j)\r\n if pi != pj:\r\n parent[pi] = pj\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(2):\r\n if i != j and nodes[i][k] == nodes[j][k]:\r\n union(i, j)\r\n\r\ncomponents = set()\r\nfor i in range(n):\r\n components.add(find(i))\r\nprint(len(components) - 1)", "\ndef count_cc():\n cc = 0\n for i in range(n):\n if not visited[i]:\n dfs(nodes, visited, i)\n cc +=1\n return cc\n \ndef dfs(nodes, visited, i):\n stack = [i]\n while len(stack):\n t = stack.pop()\n if not visited[t]:\n visited[t] = True\n for j in range(n):\n if nodes[j][0] == nodes[t][0] or nodes[j][1] == nodes[t][1]:\n if not visited[j]:\n stack.append(j)\n\nn = int(input())\nc = 0\nnodes = []\nwhile c<n:\n c+=1\n x, y = list(map(int,input().split()))\n nodes.append([x,y])\n\nvisited = [False for node in range(n)]\nprint(count_cc()-1)\n \t\t\t\t \t\t \t\t\t \t \t \t \t\t \t\t\t", "def dfs(no):\r\n x, y = no\r\n vis[no] = True\r\n \r\n for c in vis.keys():\r\n if c[0] == x or c[1] == y:\r\n if not vis[c]:\r\n dfs(c)\r\n\r\n\r\nn = int(input())\r\n\r\nadj = [[0 for i in range(1001)] for i in range(1001)]\r\n\r\nvis = {}\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n\r\n adj[b][a] = 1\r\n adj[a][b] = 1\r\n\r\n vis[(a, b)] = False\r\n\r\ncomps = 0\r\n#print(vis.keys())\r\nfor k in vis.keys():\r\n# print(k)\r\n if not vis[k]:\r\n comps += 1\r\n dfs(k)\r\n\r\nprint(comps - 1)\r\n", "from collections import defaultdict\nn=int(input())\nvertex=defaultdict(bool)\nx_Edge=defaultdict(list)\ny_Edge=defaultdict(list)\nfor i in range(n):\n\ta,b=list(map(int,input().split())) \n\tvertex[(a,b)]=True #True indicate the vertex is yet to be visited\n\tx_Edge[a].append((a,b))\n\ty_Edge[b].append((a,b))\n\nisland=0\nfor i in vertex:\n\tif vertex[i]:\n\t\tQueue=[i]\n\t\tisland+=1\n\t\twhile Queue:\n\t\t\tval=Queue.pop()\n\t\t\tif vertex[val]:\n\t\t\t\tvertex[val]=False\n\t\t\t\t\n\t\t\t\tfor x in x_Edge[val[0]]:\n\t\t\t\t\tQueue.append(x)\n\n\t\t\t\tfor y in y_Edge[val[1]]:\n\t\t\t\t\tQueue.append(y)\nprint(island-1)", "def dfs(v):\r\n global ans\r\n used[v] = True\r\n for i in range(len(sv[v])):\r\n to = sv[v][i]\r\n if(not used[to]):\r\n dfs(to)\r\n\r\n\r\nn = int(input())\r\nused = []\r\nsd = []\r\nsv = []\r\nans = 0\r\nfor i in range(101):\r\n sv.append([])\r\n used.append(False)\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n sd.append((a, b))\r\nfor i in range(n):\r\n for j in range(n):\r\n if(sd[i][0] == sd[j][0] or sd[i][1] == sd[j][1]):\r\n sv[i].append(j)\r\nfor i in range(n):\r\n if(not used[i]):\r\n dfs(i)\r\n ans += 1\r\nprint(ans - 1)", "n = int(input())\ninputs_ = []\nvisited = []\nfor i in range(n):\n x,y = input().split()\n inputs_.append((int(x),int(y)))\n\ndef dfs(point):\n visited[point]=0\n for i in range(n):\n if((inputs_[i][0] == inputs_[point][0] or inputs_[i][1] == inputs_[point][1]) and visited[i] == -1):\n dfs(i)\n\nresult = -1\nfor i in range(n):\n visited.append(-1)\n\nfor i in range(n):\n if (visited[i] == -1):\n dfs(i)\n result += 1\n\nprint(result)\n \t\t\t \t \t \t \t\t\t \t \t \t \t \t", "n=int(input())\r\nx=[]\r\ny=[]\r\nk=-1\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x.append(a)\r\n y.append(b)\r\nwhile set(x)!={0}:\r\n k+=1\r\n c1=[]\r\n c2=[]\r\n for i in range(n):\r\n if x[i]!=0:s=i;break\r\n c1.append(x[s])\r\n c2.append(y[s])\r\n for z in range(n):\r\n for i in range(n):\r\n if x[i]!=0 and x[i]in c1 or y[i]in c2:\r\n c1.append(x[i])\r\n c2.append(y[i])\r\n x[i]=0\r\n y[i]=0\r\nprint(k)\r\n \r\n", "# Soma do maximo de valores do eixo X com o maximo do eixo Y\nMAX = 2007\n\n# utilizado para determinar onde termina o eixo X\n# e onde começa o eixo Y\nseparador = 1003\nparent = [0]*(MAX)\n\n# Mostra o pivo de um grupo formado na união dos eixos\ndef find(i):\n if i != parent[i]:\n parent[i] = find(parent[i])\n return parent[i]\n\n# utilizado para unir o eixo X e o Y de cada vertice\ndef union(i, j):\n pi, pj = find(i), find(j)\n if pi != pj:\n parent[pi] = pj\n\n# os parentes do no são eles mesmos\nfor i in range(MAX): \n parent[i] = i\n\n\nn = int(input())\n\n# armazena as posições de ambos os eixos a serem checadas\nchecks = []\nfor i in range(n):\n u, v = list(map(int, input().split()))\n\n checks.append(u)\n checks.append(separador+v)\n\n # une o eixo X com o Y\n # fazendo com que todos os pontos nesse eixo X\n # se conectem com todos os pontos nesse eixo Y\n union(u, separador+v)\n\nresp = set()\n\n# Verifica os pivos de grupos existentes\n# se existem pivos diferente então existem mais de um grupo\n# logo teremos que conecta-los\nfor i in checks:\n resp.add(find(i))\n\nprint(len(resp)-1)\n \n\n\n \t\t\t \t \t \t\t \t \t", "n_snowdrifts = int(input())\r\n\r\nsnowdrifts = list()\r\n\r\nfor _ in range(n_snowdrifts):\r\n x, y = map(int, input().split())\r\n snowdrifts.append((x, y))\r\n\r\nsnowdrifts_connections = {sd: [] for sd in snowdrifts}\r\n\r\nfor s1 in snowdrifts:\r\n for s2 in snowdrifts:\r\n if s1 != s2:\r\n if s1[0] == s2[0] or s1[1] == s2[1]:\r\n snowdrifts_connections[s1].append(s2)\r\n\r\ndef dfs(u, graph, visited, comp):\r\n visited[u] = True\r\n comp.append(u)\r\n for v in graph[u]:\r\n if not visited[v]:\r\n dfs(v, graph, visited, comp)\r\n return comp\r\n\r\ndef find_comps(graph):\r\n visited = {sd: False for sd in graph}\r\n \r\n comps = list()\r\n\r\n for sd in graph:\r\n if not visited[sd]:\r\n comp = list()\r\n\r\n dfs(sd, graph, visited, comp)\r\n\r\n comps.append(comp)\r\n\r\n return comps \r\n\r\ncomps = find_comps(snowdrifts_connections)\r\n\r\nprint(len(comps) - 1)\r\n", "n = int(input())\nvisited = set()\ngraph = {}\n\n\ndef dfs(node):\n visited.add(node)\n\n for neighbor in graph[node]:\n if neighbor not in visited:\n dfs(neighbor)\n\n\ndef is_connected(x, y):\n return x[0] == y[0] or x[1] == y[1]\n\n\nfor i in range(n):\n x, y = map(int, input().split())\n neighbors = []\n for node in graph:\n if is_connected(node, (x, y)):\n graph[node].append((x, y))\n neighbors.append(node)\n graph[(x, y)] = neighbors\n\n\ncomponents = 0\nfor node in graph:\n if node not in visited:\n components += 1\n dfs(node)\n\nprint(components - 1)\n", "from collections import defaultdict, deque\nfrom itertools import product\n\ndebug = False\n\nn = int(input().strip())\nadj = [set() for _ in range(n)]\nx_to_v, y_to_v = defaultdict(set), defaultdict(set)\nfor i in range(n):\n x, y = map(int, input().strip().split(\" \"))\n x_to_v[x - 1].add(i)\n y_to_v[y - 1].add(i)\n \nfor x, i_s in x_to_v.items():\n for v1, v2 in product(i_s, i_s):\n if v1 != v2:\n adj[v1].add(v2)\n adj[v2].add(v1)\n \nfor x, i_s in y_to_v.items():\n for v1, v2 in product(i_s, i_s):\n if v1 != v2:\n adj[v1].add(v2)\n adj[v2].add(v1)\n\nif debug:\n print(adj)\n \ndef dfs(v, g):\n q = deque([v])\n\n visited = set()\n while q:\n v = q.pop()\n visited.add(v)\n for neib in adj[v]:\n if neib not in visited:\n q.append(neib)\n \n return visited\n\nvisited = set()\nc = 0\nfor i in range(n):\n if i not in visited:\n c += 1\n r = dfs(i, adj)\n if debug:\n print(r)\n print(visited)\n visited.update(r)\n \nprint(c - 1)", "n=int(input())\nans=1\nx=[]\ny=[]\nfor i in range(n):\n a,b=map(int,input().split())\n x.append({a})\n y.append({b})\nfor i in range(n-1):\n for j in range(i+1,n):\n if x[i]&x[j] or y[i]&y[j]:\n x[j]|=x[i]\n y[j]|=y[i]\n ans+=1\n break\nprint(n-ans)", "n = int(input())\r\nl = []\r\ngraph = {}\r\nfor i in range(n):\r\n graph[i] = []\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nc = 0 \r\nfor i in range(n):\r\n op = False\r\n for j in range(i+1,n):\r\n if i == j :\r\n continue \r\n if l[i][0] == l[j][0] or l[i][1] == l[j][1]:\r\n graph[i].append(j)\r\n graph[j].append(i)\r\nvis = [0]*(n)\r\nlevel = [-1]*(n+1)\r\n \r\ndef bfs(start,graph):\r\n queue = [start]\r\n vis[start] = 1 \r\n level[start]=1\r\n \r\n while queue :\r\n parent = queue.pop(0)\r\n for i in range(len(graph[parent])):\r\n child = graph[parent][i]\r\n if not vis[child]:\r\n vis[child] = 1 \r\n level[child] = level[parent]+1\r\n queue.append(child)\r\n \r\nfor i in range(n):\r\n if not vis[i]:\r\n bfs(i,graph)\r\nfor i in level :\r\n if i ==1 :\r\n c+=1\r\nprint(c-1)", "'''\nCreated on 22/03/2018\n\n@author: \n\nXXX:\n'''\n\nimport logging\nfrom queue import Queue\n\nnivel_log = logging.ERROR\nnivel_log = logging.DEBUG\nlogger_cagada = None\n\nclass Node():\n def __init__(self, k, x, y):\n self.k = k\n self.x = x\n self.y = y\n self.v = []\n\nif __name__ == '__main__':\n FORMAT = \"[%(filename)s:%(lineno)s - %(funcName)20s() ] %(message)s\"\n logging.basicConfig(level=nivel_log, format=FORMAT)\n logger_cagada = logging.getLogger(\"asa\")\n logger_cagada.setLevel(nivel_log)\n \n nodos_x = {}\n nodos_y = {} \n \n nodos = []\n \n n = int(input())\n \n for i in range(n):\n x, y = [int(a) for a in input().split(\" \")]\n nn = Node(i, x, y)\n nodos_x.setdefault(x, []).append(nn)\n nodos_y.setdefault(y, []).append(nn)\n nodos.append(nn)\n \n for cn in nodos:\n cn.v.extend(nodos_x[cn.x] + nodos_y[cn.y])\n \n s = set()\n \n c = 0\n for cn in nodos:\n if (cn.k not in s):\n c += 1\n q = Queue()\n q.put(cn)\n s.add(cn.k)\n while(not q.empty()):\n cn_bfs = q.get()\n for v in cn_bfs.v:\n if(v.k not in s):\n q.put(v)\n s.add(v.k)\n print(\"{}\".format(c - 1))\n \n \n\n \n", "import sys\r\nimport io\r\nimport os\r\n\r\ntotal = 0\r\nfailed = 0\r\ndef debug(*args):\r\n if('LOCALTEST' in os.environ):\r\n print(*args, file=sys.stderr)\r\ndef run(test,res):\r\n x = io.StringIO()\r\n with io.StringIO(test) as sys.stdin:\r\n with x as sys.stdout:\r\n work()\r\n z = x.getvalue().strip()\r\n sys.stdout = sys.__stdout__\r\n print(\"Passed?\", z == res)\r\n print(\"Expected: \", res)\r\n print(\"Actual : \", z)\r\n global total, failed\r\n total += 1\r\n failed += 1 if (z != res) else 0\r\n\r\ndef work():\r\n n = int(input())\r\n c = -1\r\n w = [0 for i in range(n)]\r\n p = []\r\n for i in range(n):\r\n p.append(list(map(int, input().split())))\r\n debug(p)\r\n\r\n def dfs(i):\r\n if w[i] == 1:\r\n return\r\n w[i] = 1\r\n for j in range(n):\r\n if i!=j:\r\n if p[i][0]==p[j][0] or p[i][1]==p[j][1]:\r\n debug(i, j, p[i], p[j])\r\n dfs(j)\r\n\r\n for i in range(n):\r\n if w[i] == 0:\r\n c += 1\r\n dfs(i)\r\n print(c)\r\n\r\n\r\ndef test():\r\n run(\"\"\"2\r\n2 1\r\n1 2\"\"\", \"\"\"1\"\"\")\r\n run(\"\"\"2\r\n2 1\r\n4 1\"\"\", \"\"\"0\"\"\")\r\n\r\nif('LOCALTEST' in os.environ):\r\n test()\r\n print(\"\\n Result: %s (%d total, %d failed)\" % (\"FAILED\" if (failed>0) else \"PASSED\", total, failed))\r\nelse:\r\n work()\r\n", "def dfs(i,v,n,x,y):\r\n\tv[i]=1\r\n\tfor j in range(n):\r\n\t\tif not v[j] and (x[i]==x[j] or y[i]==y[j]): dfs(j,v,n,x,y)\r\n\r\ndef main():\r\n\tn=int(input())\r\n\tx=[]\r\n\ty=[]\r\n\tfor i in range(n):\r\n\t\txi,yi=list(map(int,input().split()))\r\n\t\tx.append(xi)\r\n\t\ty.append(yi)\r\n\r\n\tans=0\r\n\tv=[0]*n\r\n\tfor i in range(n):\r\n\t\tif not v[i]:\r\n\t\t\tdfs(i,v,n,x,y)\r\n\t\t\tans+=1\r\n\tprint(ans-1)\r\n\r\nif __name__=='__main__': main()", "a = int(input())\nmas = [[] for i in range(a)]\narr = [input().split() for i in range(a)]\nfor i in range(a):\n for j in range(i+1 ,a):\n if arr[i][0]==arr[j][0] or arr[i][1]==arr[j][1]:\n mas[i].append(j)\n mas[j].append(i)\nused = [False for i in range(a)]\ncount = 0\ndef dfs(v):\n if used[v]:\n return\n used[v]=True\n for vv in mas[v]:\n dfs(vv)\nfor i in range(a):\n if not used[i]:\n count+=1\n dfs(i)\nprint(count-1)", "from collections import defaultdict\r\nfrom os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\nclass DSU:\r\n def __init__(self, n: int):\r\n self.n = n\r\n self.parent = list(range(n))\r\n self.rank = [1] * n\r\n\r\n def find(self, i: int) -> int:\r\n if self.parent[i] != i:\r\n self.parent[i] = self.find(self.parent[i])\r\n return self.parent[i]\r\n\r\n def union(self, i: int, j: int):\r\n id1 = self.find(i)\r\n id2 = self.find(j)\r\n if id1 == id2:\r\n return\r\n if self.rank[id1] > self.rank[id2]:\r\n self.parent[id2] = id1\r\n else:\r\n self.parent[id1] = id2\r\n if self.rank[id1] == self.rank[id2]:\r\n self.rank[id2] += 1\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n indexes_x = defaultdict(list)\r\n indexes_y = defaultdict(list)\r\n for i in range(n):\r\n x, y = [int(num) for num in input().split()]\r\n indexes_x[x].append(i)\r\n indexes_y[y].append(i)\r\n dsu = DSU(n)\r\n for indexes in indexes_x.values():\r\n for v, u in zip(indexes, indexes[1:]):\r\n dsu.union(v, u)\r\n for indexes in indexes_y.values():\r\n for v, u in zip(indexes, indexes[1:]):\r\n dsu.union(v, u)\r\n print(len({dsu.find(i) for i in range(n)}) - 1)\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\n \ncoodenadas = []\nfor i in range(n):\n x, y = input().split()\n coodenadas.append(({int(x)}, {int(y)}))\n \nfor i in range(n-1, -1, -1):\n j = i - 1\n while j >= 0 and i < len(coodenadas):\n if len(coodenadas[j][0].intersection(coodenadas[i][0])) or len(coodenadas[j][1].intersection(coodenadas[i][1])):\n coodenadas[i][0].update(coodenadas[j][0])\n coodenadas[i][1].update(coodenadas[j][1])\n coodenadas.pop(j)\n j -= 1\n \nprint(len(coodenadas) - 1)\n \t\t\t\t\t\t \t\t \t\t\t\t \t\t \t\t", "import itertools\n\n\ndef main(inp):\n n = int(inp())\n from_x = defaultdict(list)\n from_y = defaultdict(list)\n all_nodes = set()\n for i in range(n):\n x, y = split_inp_int(inp)\n from_x[x].append((x, y))\n from_y[y].append((x, y))\n all_nodes.add((x, y))\n\n connectivity = defaultdict(set)\n for nodes in itertools.chain(from_x.values(), from_y.values()):\n for i in range(len(nodes)-1):\n node_1, node_2 = nodes[i], nodes[i+1]\n connectivity[node_1].add(node_2)\n connectivity[node_2].add(node_1)\n\n group_num = 0\n while all_nodes:\n group_num += 1\n root = all_nodes.pop()\n queue = {root}\n visited = {root}\n while queue:\n cur = queue.pop()\n if cur in all_nodes:\n all_nodes.remove(cur)\n visited.add(cur)\n for child in connectivity[cur]:\n if child not in visited:\n queue.add(child)\n print(group_num - 1)\n\n\ndef split_inp_int(inp):\n return list(map(int, inp().split()))\n\n\ndef use_fast_io():\n import sys\n\n class InputStorage:\n def __init__(self, lines):\n lines.reverse()\n self.lines = lines\n\n def input_func(self):\n if self.lines:\n return self.lines.pop()\n else:\n return \"\"\n\n input_storage_obj = InputStorage(sys.stdin.readlines())\n return input_storage_obj.input_func\n\n\nfrom collections import Counter, defaultdict\nfrom functools import reduce\nimport operator\nimport math\n\n\ndef product(arr_):\n return reduce(operator.mul, arr_, 1)\n\nif __name__ == \"__main__\":\n\n main(use_fast_io())\n", "# from debug import debug\r\nimport sys\r\ninf = int(1e10)\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ngraph = [tuple(map(int, input().split())) for i in range(n)]\r\n\r\nv = [0]*n\r\ndef dfs(x, y):\r\n\tfor i in range(n):\r\n\t\tif not v[i]:\r\n\t\t\tif graph[i][0] == x or graph[i][1] == y:\r\n\t\t\t\tv[i] = 1\r\n\t\t\t\tdfs(graph[i][0], graph[i][1])\r\n\r\nc = 0\r\nfor i in range(n):\r\n\tif not v[i]:\r\n\t\tc+=1\r\n\t\tdfs(graph[i][0], graph[i][1])\r\nprint(c-1)", "read_many = lambda type_: list(map(type_, input().split()))\r\ndef main():\r\n n = int(input())\r\n visited = [False] * n\r\n coordinates = [read_many(int) for _ in range(n)]\r\n\r\n def check_coordinates(i):\r\n visited[i] = True\r\n for j in range(n):\r\n axis_met = coordinates[i][0] == coordinates[j][0] or \\\r\n coordinates[i][1] == coordinates[j][1]\r\n if not visited[j] and axis_met:\r\n check_coordinates(j)\r\n\r\n output = 0\r\n for i in range(n): \r\n if not visited[i]: \r\n check_coordinates(i)\r\n output += 1\r\n print(output-1)\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()", "from collections import deque\r\n\r\nn = int(input())\r\ncords, graph, sv = [], {}, []\r\n\r\ndef bfs(graph, start, search):\r\n queue, visited = deque(), []\r\n queue += graph[str(start)]\r\n while queue:\r\n node = queue.popleft()\r\n if node == search:\r\n return True\r\n elif node not in visited:\r\n queue += graph[str(node)]\r\n visited.append(node)\r\n return False\r\nfor i in range(n):\r\n s = input().split()\r\n x, y = int(s[0]), int(s[1])\r\n cords.append((x, y))\r\n\r\nfor i in range(n):\r\n arr = []\r\n for j in range(n):\r\n if i != j:\r\n if cords[i][0] == cords[j][0] or cords[i][1] == cords[j][1]:\r\n arr.append(j)\r\n graph[str(i)] = arr\r\n\r\nfor i in range(n):\r\n comp = []\r\n for j in range(n):\r\n if bfs(graph, i, j):\r\n comp.append(j)\r\n if comp not in sv and len(comp):\r\n sv.append(comp)\r\n elif len(comp) == 0:\r\n sv.append(comp)\r\n\r\nprint(len(sv)-1)\r\n\r\n", "def dfs(st, group, gr, used):\n used[st] = group\n for it in gr[st]:\n if used[it] == 0:\n dfs(it, group, gr, used)\n\n\ndef solve():\n n = int(input())\n pts = [tuple(map(int, input().split())) for _ in range(n)]\n gr = [[] for _ in range(n)]\n for i in range(n):\n for j in range(n):\n if i != j and (pts[i][0] == pts[j][0] or pts[i][1] == pts[j][1]):\n gr[i].append(j)\n gr[j].append(i)\n\n used = [0 for _ in range(n)]\n cur_gr = 1\n for i in range(n):\n if used[i] == 0:\n dfs(i, cur_gr, gr, used)\n cur_gr += 1\n\n print(cur_gr - 2)\n\nif __name__ == \"__main__\":\n solve()", "# Ice Skating\n\nfrom collections import defaultdict\n\ndef build(graph, connected):\n for i in range(len(connected)):\n node1 = connected[i]\n for j in range(i+1, len(connected)):\n node2 = connected[j]\n graph[node1].add(node2)\n graph[node2].add(node1)\n\ndef dfs(graph, visited, node):\n visited[node] = True\n for n in graph[node]:\n if not visited[n]:\n dfs(graph, visited, n)\n\nn = int(input())\nx = defaultdict(lambda: [])\ny = defaultdict(lambda: [])\nfor i in range(n):\n xi, yi = map(int, input().split())\n x[xi].append(i)\n y[yi].append(i)\n\ngraph = { x: set() for x in range(n) }\nfor k in x:\n connected = x[k]\n build(graph, connected)\n\nfor k in y:\n connected = y[k]\n build(graph, connected)\n\ncomponents = 0\nvisited = [False for x in graph]\nfor node in range(len(graph)):\n if not visited[node]:\n dfs(graph, visited, node)\n components += 1\n\nprint(components - 1)\n", "def dfs(i):\n\n if not visited[i]:\n\n visited[i] = True\n for k in ladj[i]:\n dfs(k)\n\n\nn = int(input())\ndrifts, ladj, visited = [], [[] for _ in range(n)], [False for _ in range(n)]\n\nfor i in range(n):\n a, b = map(int, input().split())\n drifts.append((a, b))\n\nfor i in range(n):\n for j in range(n):\n\n if i == j:\n continue\n\n if drifts[i][0] == drifts[j][0] or drifts[i][1] == drifts[j][1]:\n ladj[i].append(j)\n ladj[j].append(i)\n\nc = 0\nfor i in range(n):\n\n if not visited[i]:\n c += 1\n dfs(i)\n\nprint(c-1)\n", "def find_root(x):\r\n if parent[x] == -1:return x\r\n else:\r\n parent[x] = find_root(parent[x])\r\n return parent[x]\r\nn = int(input())\r\nparent = [-1 for i in range(105)]\r\nx = [-1];y = [-1]\r\nfor i in range(1,n+1):\r\n tep_x,tep_y = map(int,input().split())\r\n x.append(tep_x);y.append(tep_y)\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if x[i] != x[j] and y[i] != y[j]:continue\r\n tep1 = find_root(i)\r\n tep2 = find_root(j)\r\n if tep1 != tep2:\r\n parent[tep1] = tep2\r\nans = 0\r\nfor i in range(1,n+1):\r\n if parent[i] == -1:\r\n ans += 1\r\nprint(ans-1)", "MAX_N = 105\r\nroot = [i for i in range(MAX_N)]\r\nx = []\r\ny = []\r\n\r\nn = int(input().strip())\r\n\r\nfor i in range(n):\r\n u, v = map(int, input().strip().split())\r\n x.append(u)\r\n y.append(v)\r\n\r\n\r\ndef find_root(u):\r\n if root[u] == u:\r\n return u\r\n else:\r\n root[u] = find_root(root[u])\r\n return root[u]\r\n\r\n\r\ndef union_set(u, v):\r\n root_u = find_root(u)\r\n root_v = find_root(v)\r\n if root_u != root_v:\r\n if root_u < root_v:\r\n root[root_u] = root_v\r\n else:\r\n root[root_v] = root_u\r\n\r\n\r\nans = n\r\n\r\nfor i in range(n - 1):\r\n u = (x[i], y[i])\r\n for j in range(i + 1, n):\r\n v = (x[j], y[j])\r\n if u[0] == v[0] or u[1] == v[1]:\r\n if find_root(i) != find_root(j):\r\n ans -= 1\r\n union_set(i, j)\r\n\r\nprint(\"%s\" % (ans - 1))\r\n", "\r\n\r\nn = int(input())\r\na = []\r\nvisited = [False] * n\r\nadj = [[] for i in range(n)]\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append([x, y])\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if a[i][0] == a[j][0] or a[i][1] == a[j][1]:\r\n adj[i].append(j)\r\n adj[j].append(i)\r\n\r\ndef dfs(v):\r\n visited[v] = True\r\n for u in adj[v]:\r\n if not visited[u]:\r\n dfs(u)\r\n \r\nans = 0\r\nfor i in range(n):\r\n if not visited[i]:\r\n ans += 1\r\n dfs(i)\r\nprint(ans - 1)\r\n\r\n\r\n", "n = int(input())\r\n\r\nans = [0] * (n + 1)\r\narr = []\r\n\r\ndef solve(a):\r\n ans[a] = 1\r\n for i in range(n):\r\n if((arr[i][0] == arr[a][0] or arr[i][1] == arr[a][1]) and ans[i] == 0):\r\n solve(i)\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().strip().split())\r\n arr.append([x, y])\r\n\r\nflag = -1\r\n\r\nfor i in range(n):\r\n if not ans[i]:\r\n solve(i)\r\n flag += 1\r\n\r\nprint(flag)", "# link: https://codeforces.com/problemset/problem/217/A\r\n\r\ndef dfs(at, points, visited, n):\r\n visited[at] = 1\r\n for j in range(n):\r\n if not visited[j] and (points[at][0] == points[j][0] or points[at][1] == points[j][1]):\r\n dfs(j, points, visited, n) \r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n points = [list(map(int, input().split())) for i in range(n)]\r\n cc = 0\r\n visited = [0 for i in range(101)]\r\n for i in range(n):\r\n if not visited[i]:\r\n dfs(i, points, visited, n)\r\n cc += 1\r\n print(cc - 1) ", "\nn = int(input())\nvisited = [False for i in range(n)]\ncoords = []\ncomponents = 0\nfor i in range(n):\n x, y = map(int, input().split())\n coords.append((x, y))\n\ndef dfs(i):\n visited[i] = True\n\n for j in range(n):\n if (not visited[j] and (coords[i][0] == coords[j][0] or coords[i][1] == coords[j][1])):\n dfs(j)\n\n\nfor i in range(n):\n if not visited[i]:\n dfs(i)\n components += 1\n\nprint(components - 1)\n \t \t\t \t \t\t\t \t \t \t \t\t", "import collections\r\n\r\n\r\ndef bfs(graphX, graphY, root):\r\n queue = collections.deque([root])\r\n visited.add(root)\r\n while queue:\r\n vertex = queue.popleft()\r\n vertex_content = coords[vertex]\r\n for neighbour in graphX[vertex_content[0]]:\r\n if neighbour not in visited:\r\n visited.add(neighbour)\r\n queue.append(neighbour)\r\n for neighbour in graphY[vertex_content[1]]:\r\n if neighbour not in visited:\r\n visited.add(neighbour)\r\n queue.append(neighbour)\r\n\r\n\r\nvisited = set()\r\ncoords = list()\r\n\r\ngraphX = dict()\r\ngraphY = dict()\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n coords.append((x, y))\r\n if x in graphX:\r\n graphX[x].add(i)\r\n else:\r\n graphX[x] = {i}\r\n if y in graphY:\r\n graphY[y].add(i)\r\n else:\r\n graphY[y] = {i}\r\n\r\ncnt = 0\r\n\r\nfor i in range(0, n):\r\n if i not in visited:\r\n cnt += 1\r\n bfs(graphX, graphY, i)\r\n\r\nprint(cnt - 1)\r\n", "#Coding is about expressing your feeling and there is always a better way to express your feeling_feelme\r\nimport sys\r\ntry:sys.stdin,sys.stdout=open('in.txt','r'),open('out.txt','w')\r\nexcept:pass\r\nii1=lambda:int(sys.stdin.readline().strip()) # for interger\r\nis1=lambda:sys.stdin.readline().strip() # for str\r\niia=lambda:list(map(int,sys.stdin.readline().strip().split())) # for List[int]\r\nisa=lambda:sys.stdin.readline().strip().split() # for List[str]\r\nmod=int(1e9 + 7);from collections import *;from math import *\r\n\r\n###################### Start Here ######################\r\ndef fun():\r\n n = ii1()\r\n points = []\r\n x = defaultdict(list)\r\n y = defaultdict(list)\r\n for i in range(n):\r\n a,b = iia()\r\n a-=1\r\n b-=1\r\n x[a].append(b)\r\n y[b].append(a)\r\n points.append([a,b])\r\n parent = defaultdict(tuple)\r\n def find(c):\r\n if parent.get(c,-1)==-1:return c\r\n parent[c]=find(parent[c])\r\n return parent[c]\r\n def union(u,v):\r\n pu = find(u)\r\n pv = find(v)\r\n if pu!=pv:\r\n parent[pu]=pv\r\n for key,lis in x.items():\r\n for val in range(1,len(lis)):\r\n union((key,lis[0]),(key,lis[val]))\r\n for key,lis in y.items():\r\n for val in range(1,len(lis)):\r\n union((lis[0],key),(lis[val],key))\r\n unique = {}\r\n for a,b in points:\r\n unique[find((a,b))]=1\r\n print(len(unique)-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n fun()\r\n\r\n", "def main():\n n = int(input())\n l = list(tuple(map(int, input().split())) for _ in range(n))\n\n def dfs(a):\n x, y = l[a]\n l[a] = False\n for b, xy in enumerate(l):\n if xy:\n x1, y1 = xy\n if x == x1 or y == y1:\n dfs(b)\n\n res = -1\n for i, _ in enumerate(l):\n if _:\n res += 1\n dfs(i)\n\n print(res)\n\n\nif __name__ == '__main__':\n main()\n\n\n\n", "from queue import Queue\r\n\r\nn = int(input())\r\n\r\ncoords = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n coords.append((x, y))\r\n\r\ng = [[] for i in range(n)]\r\nvisited = [False] * n\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if(coords[i][0] == coords[j][0] or coords[i][1] == coords[j][1]):\r\n g[i].append(j)\r\n g[j].append(i)\r\n\r\nq = Queue()\r\n\r\ndef bfs():\r\n while(not q.empty()):\r\n v = q.get()\r\n visited[v] = True\r\n for to in g[v]:\r\n if(visited[to]):\r\n continue\r\n q.put(to)\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n if(visited[i]):\r\n continue\r\n ans += 1\r\n q.put(i)\r\n bfs()\r\n\r\nprint(ans - 1)\r\n", "n = int(input())\nx, y = [], []\namount = 1\n \nfor i in range(n):\n xi, yi = map(int, input().split())\n x.append({xi})\n y.append({yi})\n \nfor i in range(n - 1): \n for j in range(i + 1, n):\n if x[i]&x[j] or y[i]&y[j]:\n x[j] |= x[i]\n y[j] |= y[i]\n amount += 1\n break\n \nprint(n - amount)", "n=int(input())\r\nx=[[] for i in range(1001)]\r\ny=[[] for i in range(1001)]\r\npt=[]\r\na=[[] for i in range(n)]\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n pt.append([l,r])\r\n x[l].append(i)\r\n y[r].append(i)\r\n \r\nfor i in range(1001):\r\n if len(x[i])>0:\r\n root=x[i][0]\r\n for j in range(1,len(x[i])):\r\n a[root].append(x[i][j])\r\n a[x[i][j]].append(root)\r\n \r\n if len(y[i])>0:\r\n root=y[i][0]\r\n for j in range(1,len(y[i])):\r\n a[root].append(y[i][j])\r\n a[y[i][j]].append(root)\r\nvis=[0]*(n+1)\r\nans=0\r\nfor i in range(n):\r\n if vis[i]==0:\r\n st=[i]\r\n vis[i]=1\r\n while st:\r\n p=st.pop(0)\r\n for j in a[p]:\r\n if vis[j]==0:\r\n vis[j]=1\r\n st.append(j)\r\n ans+=1\r\nprint(ans-1) \r\n \r\n ", "def main():\n def aux(element):\n visited[element] = 1\n for j in range(cases):\n if not visited[j] and (buff[j][0] == buff[element][0] or buff[j][1] == buff[element][1]):\n aux(j)\n\n cases = int(input())\n buff = []\n count = 0\n visited = [0] * cases\n\n for i in range(cases):\n buff.append(list(map(int, input().split(\" \"))))\n\n for i in range(cases):\n if not visited[i]:\n aux(i)\n count += 1\n print(count - 1)\n\n\nif __name__ == \"__main__\":\n main()\n\n\t\t \t \t\t\t \t \t \t\t\t\t \t \t\t \t\t\t", "def DFS(x, mark, a, v):\r\n mark[x] = True\r\n for i in v[a[x][0]]:\r\n if mark[i]:\r\n continue\r\n DFS(i, mark, a, v)\r\n for i in v[a[x][1]+1000]:\r\n if mark[i]:\r\n continue\r\n DFS(i, mark, a, v)\r\nn = int(input())\r\na = []\r\nv = []\r\nfor i in range(2001):\r\n v.append(list([]))\r\nfor i in range(n):\r\n s = input()\r\n s = s.split()\r\n x = int(s[0])\r\n y = int(s[1])\r\n a.append((x,y))\r\n v[x].append(i)\r\n v[1000+y].append(i)\r\nmark = list([False]*n)\r\nans = 0\r\nfor i in range(n):\r\n if mark[i]:\r\n continue\r\n ans += 1\r\n DFS(i, mark, a, v)\r\nprint(ans-1)", "lista = []\nvisitados = []\n\ndef dfs(point):\n visitados[point] = 0\n for i in range(n):\n if((lista[i][0] == lista[point][0] or lista[i][1] == lista[point][1]) and visitados[i] == -1):\n dfs(i)\n\nn = int(input())\n\nfor i in range(n):\n x, y = input().split()\n x = int(x)\n y = int(y)\n\n lista.append((x, y))\n\nresposta = -1\nfor i in range(n):\n visitados.append(-1)\n\nfor i in range(n):\n if (visitados[i] == -1):\n dfs(i)\n resposta += 1\n\nprint(resposta)\n \t \t\t \t \t \t \t \t \t\t", "def dfs(i, visited):\n visited[i] = True\n for j in range(n):\n if(not visited[j] and \n ((coordinates_tuples[i][0] == coordinates_tuples[j][0]) or \n (coordinates_tuples[i][1] == coordinates_tuples[j][1]))):\n dfs(j, visited)\n\ndef get_minimal_snow_drifts():\n visited = [False] * 1001\n minimal_number = 0\n for i in range(n):\n if(not visited[i]):\n dfs(i, visited)\n minimal_number += 1\n return minimal_number - 1\n\nn = int(input())\ncoordinates_tuples = []\nfor i in range(n):\n coordinates = tuple(map(int, input().split()))\n coordinates_tuples.append(coordinates)\n\nprint(get_minimal_snow_drifts())\n \t\t\t\t \t \t \t \t \t\t\t \t \t\t\t \t\t", "# maa chudaaye duniya\r\nn = int(input())\r\npoints = {}\r\n\r\nparents = [i for i in range(n)]\r\nrank = [1 for i in range(n)]\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n points[i] = (a, b)\r\n\r\n# print(points) \r\n\r\ndef find(x):\r\n if parents[x] != x:\r\n parents[x] = find(parents[x])\r\n return parents[x]\r\n\r\ndef union(x, y):\r\n xs = find(x)\r\n ys = find(y)\r\n if xs == ys:\r\n return\r\n else:\r\n x1, y1 = points[x]\r\n x2, y2 = points[y]\r\n if x1 == x2 or y1 == y2:\r\n if rank[xs] < rank[ys]:\r\n parents[xs] = ys\r\n elif rank[xs] > rank[ys]:\r\n parents[ys] = xs\r\n else:\r\n parents[xs] = ys\r\n rank[ys] += 1\r\n\r\nfor i in range(n):\r\n for j in range(i, n):\r\n # print('CHECKING POINTS : ',points[i], points[j])\r\n union(i, j)\r\np_dict = {}\r\nfor x in range(n):\r\n el = find(x)\r\n if el in p_dict:\r\n p_dict[el] += 1\r\n else:\r\n p_dict[el] = 1\r\nprint(len(p_dict) - 1)", "n = int(input())\nli = []\nfor i in range(n):\n x, y = [int(x) for x in input().split()]\n li.append((x, y))\ns = list(range(n))\nfor i in range(n):\n for j in range(n):\n if i == j or s[i] == s[j]:\n continue\n if li[i][0] == li[j][0] or li[i][1] == li[j][1]:\n for k in range(n):\n if k == j:\n continue\n if s[k] == s[j]:\n s[k] = s[i]\n s[j] = s[i]\nprint(len(set(s)) - 1)\n\n \t\t\t\t\t \t \t\t\t \t \t\t\t\t\t \t\t\t\t\t", "from __future__ import division, print_function\r\nimport sys\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\nimport os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\n#from functools import lru_cache #use @lru_cache(None)\r\nif os.path.exists('in.txt'): sys.stdin=open('in.txt','r')\r\nif os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')\r\n#\r\ndef input(): return sys.stdin.readline()\r\ndef mapi(arg=0): return map(int if arg==0 else str,input().split())\r\n#------------------------------------------------------------------\r\n\r\nn = int(input())\r\nsize =[1]*(n+1)\r\npar = [i for i in range(n+1)]\r\ndef find(x):\r\n if par[x]==x:return x\r\n par[x] = find(par[x])\r\n return par[x]\r\ndef union(a,b):\r\n a = find(a)\r\n b = find(b)\r\n if a==b: return\r\n if size[a]>size[b]: a,b = b,a\r\n size[b]+=size[a]\r\n par[a] = b\r\n\r\npair = []\r\nfor i in range(n): pair.append(list(mapi()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if pair[i][0]==pair[j][0] or pair[i][1]==pair[j][1]:\r\n union(i,j)\r\nres = 0\r\nfor i in range(n):\r\n if par[i]==i:\r\n res+=1\r\nprint(res-1)\r\n\r\n", "xd = []\r\nyd = []\r\nf = []\r\nfor i in range(106):\r\n xd.append(None)\r\n yd.append(None)\r\n f.append(None)\r\n\r\nn = int(input())\r\nans = 0\r\n\r\ndef dfs(i):\r\n f[i]=1\r\n for j in range(1, n+1):\r\n if(f[j]!=1 and (xd[i]==xd[j] or yd[i]==yd[j])):\r\n dfs(j)\r\n return\r\n\r\nfor i in range(1, n+1):\r\n x, y = map(int, input().split())\r\n xd.insert(i, x)\r\n yd.insert(i, y)\r\nfor i in range(1, n+1):\r\n if(f[i]!=1): \r\n dfs(i)\r\n ans+=1\r\n \r\nprint(ans-1)", "\r\n\r\ndef dfs(x):\r\n for i in range(len(adjList[x])):\r\n cur = adjList[x][i]\r\n if occ[cur] == 0:\r\n occ[cur] = 1\r\n dfs(cur)\r\n\r\n\r\ndef traverse():\r\n count = 0\r\n for i in range(1, n + 1):\r\n if occ[i] == 0:\r\n occ[i] = 1\r\n dfs(i)\r\n count += 1\r\n return count\r\n\r\n\r\nsnow = []\r\nn = int(input())\r\nadjList = [[] for i in range(n + 1)]\r\nocc = [0 for i in range(n + 1)]\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n snow.append((a, b))\r\n# create adjacency list\r\nfor i in range(n):\r\n for j in range(n):\r\n if j != i:\r\n if snow[j][0] == snow[i][0] or snow[j][1] == snow[i][1]:\r\n adjList[i + 1].append(j + 1)\r\ncount = traverse() - 1\r\nprint(count)\r\n", "n=int(input())\na=[]\nfor i in range(n):\n x,y=map(int,input().split())\n a.append([x,y,False])\n\n\ndef dfs(x):\n x[2]=True\n for s in a:\n if not s[2] and (x[0]==s[0] or x[1]==s[1]):\n dfs(s)\n\nrj=0\n\nfor i in a:\n if not i[2]:\n rj+=1\n dfs(i)\n\nprint(rj-1)\n\n\t \t \t\t \t \t\t\t\t\t \t\t\t \t \t", "n=int(input(''))\r\nr=[-1 for i in range(2005)]\r\ndef f(v):\r\n if r[v]<0:\r\n r[v]=v\r\n if r[v]!=v:\r\n r[v]=f(r[v])\r\n return r[v]\r\n \r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n y+=1000\r\n n-=(r[x]>=0)+(r[y]>=0)-(f(x)==f(y))\r\n r[f(x)]=f(y)\r\nprint(n-1)", "class DSU:\r\n\troot = []\r\n\trank = []\r\n\tsz = 0\r\n\tdef init(self, x):\r\n\t\tself.sz = x\r\n\t\tself.root = [int(0)] * (x + 1)\r\n\t\tself.rank = [int(0)] * (x + 1)\r\n\t\tfor i in range (x + 1):\r\n\t\t\tself.root[i] = i\r\n\t\t\tself.rank[i] = 1\r\n\tdef findr(self, x):\r\n\t\t# while (x != self.root[x]):\r\n\t\t# \tself.root[x] = self.root[self.root[x]]\r\n\t\t# \tx = self.root[x]\r\n\t\t# return x\r\n\t\tif (x == self.root[x]):\r\n\t\t\treturn x\r\n\t\telse: \r\n\t\t\tself.root[x] = self.findr(self.root[x])\r\n\t\t\treturn self.root[x]\r\n\tdef size(self, x):\r\n\t\treturn self.rank[self.findr(x)]\r\n\tdef same(self, x, y):\r\n\t\treturn (self.findr(x) == self.findr(y))\r\n\tdef unique(self):\r\n\t\tres = set()\r\n\t\tfor i in range (1, self.sz + 1):\r\n\t\t\tres.add(self.findr(i))\r\n\t\treturn len(res)\r\n\tdef merge(self, x, y):\r\n\t\tx = self.findr(x);\r\n\t\ty = self.findr(y);\r\n\t\tif (x == y):\r\n\t\t\treturn False\r\n\t\tif (self.rank[x] < self.rank[y]): \r\n\t\t\tx ^= y\r\n\t\t\ty = x ^ y\r\n\t\t\tx ^= y\r\n\t\tself.rank[x] += self.rank[y]\r\n\t\tself.root[y] = x\r\n\t\treturn True\r\n\tdef print(self):\r\n\t\tfor i in range (1, self.sz + 1):\r\n\t\t\tprint(self.root[i], end = ' ')\r\n\t\tprint()\r\n\r\nn = int(input())\r\nd = DSU()\r\nd.init(n)\r\n\r\na = []\r\n\r\nfor i in range(n):\r\n\tl = input()\r\n\tl = list(map(int, l.split(' ')))\r\n\ta.append(l)\r\n\r\nfor i in range(n - 1):\r\n\tj = i + 1\r\n\tfor j in range(n):\r\n\t\tif (a[i][0] == a[j][0] or a[i][1] == a[j][1]):\r\n\t\t\td.merge(i + 1, j + 1)\r\n\r\nprint(d.unique() - 1)", "class Graph:\r\n def __init__(self, V):\r\n self.V = V\r\n self.adj = [[] for _ in range(V)]\r\n\r\n def DFSUtil(self, temp, v, visited):\r\n\r\n visited[v] = True\r\n temp.append(v)\r\n\r\n for i in self.adj[v]:\r\n if visited[i] == False:\r\n\r\n temp = self.DFSUtil(temp, i, visited)\r\n return temp\r\n\r\n def addEdge(self, v, w):\r\n self.adj[v].append(w)\r\n self.adj[w].append(v)\r\n\r\n def connectedComponents(self):\r\n visited = []\r\n cc = []\r\n for _ in range(self.V):\r\n visited.append(False)\r\n for v in range(self.V):\r\n if visited[v] == False:\r\n temp = []\r\n cc.append(self.DFSUtil(temp, v, visited))\r\n return cc\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n arr = [tuple(input().split()) for _ in range(n)]\r\n\r\n g = Graph(n)\r\n for i in range(n - 1):\r\n for j in range(i + 1, n):\r\n element1, element2 = arr[i], arr[j]\r\n if element1[0] == element2[0] or element1[1] == element2[1]:\r\n g.addEdge(i, j)\r\n print(len(g.connectedComponents()) - 1)\r\n", "n=int(input())\r\nfrom collections import Counter\r\narr=[]\r\nx=[]\r\ny=[]\r\nfor i in range(1001):\r\n x.append([])\r\n y.append([])\r\nfor _ in range(n):\r\n inp=list(map(int,input().split()))\r\n arr.append(tuple(inp))\r\n x[inp[0]].append(inp)\r\n y[inp[1]].append(inp)\r\ndef dfs (x,y,visited,now):\r\n visited[now]+=1\r\n for item in x[now[0]]:\r\n if visited[tuple(item)]==0:\r\n dfs(x,y,visited,tuple(item))\r\n for item in y[now[1]]:\r\n if visited[tuple(item)]==0:\r\n dfs(x,y,visited,tuple(item))\r\nc=0\r\nvisited=Counter([])\r\nfor i in range(len(arr)):\r\n if visited[arr[i]]==0:\r\n c+=1\r\n dfs(x,y,visited,tuple(arr[i]))\r\nprint (c-1)", "x = [0] * 100\r\ny = [0] * 100\r\nf = [0] * 100\r\nresposta = 0\r\n\r\ndef dfs(i):\r\n f[i]=1;\r\n for j in range(n):\r\n if((f[j] != 1) and ((x[i] == x[j]) or (y[i] == y[j]))):\r\n dfs(j);\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n x[i], y[i] = map(int, input().split(' '))\r\n\r\nfor i in range(n):\r\n if(f[i] != 1):\r\n dfs(i)\r\n resposta += 1\r\n\r\nprint(resposta-1)", "MAX = 1005\r\n\r\ndx = [0, 1, 0, -1]\r\ndy = [1, 0, -1, 0]\r\n\r\n\r\ndef pprint(arr):\r\n size = len(arr)\r\n for i in range(1, size):\r\n for j in range(1, size):\r\n print(arr[i][j], end=\" \")\r\n print()\r\n\r\n\r\ndef findSet(parents, u):\r\n x, y = u\r\n if u != parents[x][y]:\r\n parents[x][y] = findSet(parents, parents[x][y])\r\n return parents[x][y]\r\n\r\n\r\ndef unionSet(parents, u, v):\r\n up = findSet(parents, u)\r\n vp = findSet(parents, v)\r\n if up == vp:\r\n return\r\n parents[vp[0]][vp[1]] = up\r\n\r\n\r\ndef count(parents, edges):\r\n count = 0\r\n for x, y in edges:\r\n if parents[x][y] == (x, y):\r\n count += 1\r\n return count\r\n\r\n\r\na = [[False] * MAX for _ in range(MAX)]\r\nparents = [[None] * MAX for _ in range(MAX)]\r\nedges = []\r\nfor i in range(MAX):\r\n for j in range(MAX):\r\n parents[i][j] = (i, j)\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n a[x][y] = True\r\n edges.append((x, y))\r\n\r\nfor u in edges:\r\n for v in edges:\r\n if u[0] == v[0] or u[1] == v[1]:\r\n unionSet(parents, u, v)\r\n\r\nprint(count(parents, edges) - 1)\r\n", "def dfs(x):\n if x not in aux:\n aux.append(x)\n for i in range(len(vertices)):\n if (vertices[i] != x) and ((vertices[i][0] == x[0]) or (vertices[i][1] == x[1])):\n dfs(vertices[i])\n\nvertices = []\naux = []\ndrifts = 0\n\nfor _ in range(int(input())):\n\tvertices.append(list(map(int,input().split())))\n\nfor i in range(len(vertices)):\n\tif vertices[i] not in aux :\n\t\tdfs(vertices[i])\n\t\tdrifts += 1\n \nprint (drifts-1)\n\n \t\t \t\t\t \t\t \t \t \t\t\t\t\t \t\t\t \t\t\t", "def Find(i) :\r\n if par[i] != i : par[i] = Find(par[i]);\r\n return par[i]\r\n\r\ndef Union(a, b) :\r\n a = Find(a)\r\n b = Find(b)\r\n if a == b : return False\r\n par[a] = b\r\n return True\r\n\r\nn, = map(int, input().split())\r\npar = [i for i in range(n)]\r\n\r\nX, Y = [], []\r\nans = n-1\r\n\r\nfor i in range (n) :\r\n x, y = map(int, input().split())\r\n X.append(x)\r\n Y.append(y)\r\n for j in range(i) :\r\n if X[i] == X[j] or Y[i] == Y[j] : ans -= Union(i, j)\r\n\r\nprint(ans)\r\n", "def dfs(start):\r\n prev[start] = True\r\n for i in mas[start]:\r\n if not prev[i]:\r\n dfs(i)\r\n\r\n\r\nn = int(input())\r\nmas = []\r\nfor i in range(2000):\r\n mas.append([])\r\nprev = [True] * 2000\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n mas[x - 1].append(y + 1000 - 1)\r\n mas[y + 1000 - 1].append(x - 1)\r\n prev[x - 1] = False\r\n prev[y + 1000 - 1] = False\r\ncount = 0\r\nfor i in range(2000):\r\n if not prev[i]:\r\n dfs(i)\r\n count += 1\r\nprint(count - 1)", "# coding: utf-8\nn = int(input())\ncoords = []\ngraph = {}\n\nfor i in range(n):\n x, y = input().split(\" \")\n coords.append([int(x), int(y)])\n graph[i] = []\n\nfor i in range(n):\n for j in range(n):\n if i != j:\n if coords[i][0] == coords[j][0] or coords[i][1] == coords[j][1]:\n graph[i].append(j)\n graph[j].append(i)\n\nvisited = n * [0]\n\ndef visit(current):\n visited[current] = 1\n for i in graph[current]:\n if not visited[i]:\n visit(i)\n\ncount = -1\nfor i in range(n):\n if not visited[i]:\n visit(i)\n count = count + 1\n\nprint(count)\n \t\t\t\t\t \t\t\t \t \t \t\t \t \t\t", "visited = [False] * 110\r\nx = [0] * 100\r\ny = [0] * 100\r\nn = int(input(\"\"))\r\n\r\n\r\nfor i in range(n):\r\n x[i], y[i] = map(int, input(\"\").split(\" \"))\r\n\r\n\r\ndef dfs(i):\r\n visited[i] = True\r\n for j in range(n):\r\n if((visited[j] != 1) and ((x[i] == x[j]) or (y[i] == y[j]))):\r\n dfs(j)\r\n\r\n\r\ndef ice_skating(n, i, j=-1, sum_=0):\r\n if i == n:\r\n print(sum_ - 1)\r\n else:\r\n if not visited[i]:\r\n dfs(i)\r\n sum_ += 1\r\n ice_skating(n, i+1, -1, sum_)\r\n\r\n\r\nice_skating(n, 0)\r\n", "n = int(input())\n\ncoodenadas = []\nfor i in range(n):\n x, y = [ int(i) for i in input().split() ]\n coodenadas.append({\n 'x': { x },\n 'y': { y }\n })\n\nfor i in range(n-1, -1, -1):\n j = i - 1\n while j >= 0 and i < len(coodenadas):\n if len(coodenadas[j]['x'].intersection(coodenadas[i]['x'])) or len(coodenadas[j]['y'].intersection(coodenadas[i]['y'])):\n coodenadas[i]['x'].update(coodenadas[j]['x'])\n coodenadas[i]['y'].update(coodenadas[j]['y'])\n coodenadas.pop(j)\n j -= 1\n\nprint(len(coodenadas) - 1)", "n = int(input())\r\nt = [True] * n\r\np = [input().split() for i in range(n)]\r\nq = [[] for i in range(n)]\r\ns = 0\r\nr = [(q[0], i) for i, q in enumerate(p)]\r\nr.sort()\r\nfor i in range(1, n):\r\n if r[i][0] == r[i - 1][0]:\r\n a, b = r[i][1], r[i - 1][1]\r\n q[b].append(a)\r\n q[a].append(b)\r\nr = [(q[1], i) for i, q in enumerate(p)]\r\nr.sort()\r\nfor i in range(1, n):\r\n if r[i][0] == r[i - 1][0]:\r\n a, b = r[i][1], r[i - 1][1]\r\n q[a].append(b)\r\n q[b].append(a)\r\ndef f(i):\r\n if t[i]:\r\n t[i] = False\r\n for j in q[i]:\r\n f(j) \r\nfor i in range(n):\r\n if t[i]:\r\n s += 1\r\n f(i)\r\nprint(s - 1)", "#code\r\nn=int(input());gr=[[] for i in range(n)];pt=[]\r\nfor i in range(n):\r\n a,b=list(map(int,input().split()))\r\n for j in range(len(pt)):\r\n if pt[j][0]==a:\r\n gr[j]+=[i]\r\n gr[i]+=[j]\r\n elif pt[j][1]==b:\r\n gr[j]+=[i]\r\n gr[i]+=[j]\r\n pt.append([a,b])\r\nct=0;vis=[0]*n\r\n#print(gr)\r\nfor i in range(n):\r\n if not vis[i]:\r\n ct+=1;stack=[i]\r\n while stack!=[]:\r\n k=stack.pop()\r\n vis[k]=1\r\n for j in gr[k]:\r\n if not vis[j]:\r\n stack.append(j)\r\n\r\nprint(ct-1)", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn = mint()\r\np = []\r\nxx = [[] for i in range(1001)]\r\nyy = [[] for i in range(1001)]\r\nfor i in range(n):\r\n\tx,y = mints()\r\n\tp.append((x,y))\r\n\txx[x].append((i,x,y))\r\n\tyy[y].append((i,x,y))\r\n\r\nw = [True]*n\r\nq = [0]*n\r\nql = 0\r\nqr = 0\r\nr = 0\r\nfor i in range(n):\r\n\tif w[i]:\r\n\t\tr += 1\r\n\t\tw[i] = False\r\n\t\tq[qr] = (i, p[i][0], p[i][1])\r\n\t\tqr += 1\r\n\t\twhile ql < qr:\r\n\t\t\tj, x, y = q[ql]\r\n\t\t\tql += 1\r\n\t\t\tfor z in xx[x]:\r\n\t\t\t\tif w[z[0]]:\r\n\t\t\t\t\tw[z[0]] = False\r\n\t\t\t\t\tq[qr] = z\r\n\t\t\t\t\tqr += 1\r\n\t\t\tfor z in yy[y]:\r\n\t\t\t\tif w[z[0]]:\r\n\t\t\t\t\tw[z[0]] = False\r\n\t\t\t\t\tq[qr] = z\r\n\t\t\t\t\tqr += 1\r\nprint(r-1)", "n = int(input())\nrows = []\n\np = [-1 for i in range(1001)]\ndef find_parent(x):\n if p[x] == -1:\n return x\n p[x] = find_parent(p[x])\n return p[x]\n\ndef join_union(x, y):\n x = find_parent(x)\n y = find_parent(y)\n if x != y:\n p[y] = x\n\nfor i in range(n):\n rows.append(list(map(int, input().split())))\n\nif n == 1:\n print(0)\n exit()\n\nfor i in range(n-1):\n ax, ay = rows[i]\n for j in range(i+1, n):\n bx, by = rows[j]\n if ax == bx or ay == by:\n join_union(i, j)\n\nans = set()\nfor i in range(n):\n ans.add(find_parent(i))\n\nprint(len(ans)-1)\n\t\t\t\t\t\t \t\t\t \t \t\t\t\t\t \t", "def znajdz(v):\r\n global jakiL\r\n if jakiL[v]==v:\r\n return v\r\n kto=znajdz(jakiL[v])\r\n jakiL[v]=kto\r\n return kto\r\ndef polacz(a,b):\r\n global jakiL\r\n global iloL\r\n global iloS\r\n lida=znajdz(a)\r\n lidb=znajdz(b)\r\n if lida==lidb:\r\n return\r\n if iloL[lida]>iloL[lidb]:\r\n jakiL[lidb]=lida\r\n iloL[lida]+=iloL[lidb]\r\n else:\r\n jakiL[lida]=lidb\r\n iloL[lidb]+=iloL[lida]\r\n iloS-=1\r\niloG=int(input())\r\niloL=[1]*iloG\r\njakiL=[0]*iloG\r\ngorki=[0]*iloG\r\niloS=iloG-1\r\nfor i in range(iloG):\r\n jakiL[i]=i\r\nfor i in range(iloG):\r\n gorki[i]=(list(map(int,input().split())))\r\nfor i in range(iloG-1):\r\n for j in range(i+1,iloG):\r\n if (gorki[i][0]==gorki[j][0])or(gorki[i][1]==gorki[j][1]):\r\n polacz(i,j)\r\nprint(iloS) \r\n", "import sys \r\n \r\n# the setrecursionlimit function is \r\n# used to modify the default recursion \r\n# limit set by python. Using this, \r\n# we can increase the recursion limit \r\n# to satisfy our needs \r\n \r\nsys.setrecursionlimit(10**6)\r\ndef find(parent, i):\r\n \r\n if parent[i] == i:\r\n return i\r\n else: \r\n parent[i]=find(parent, parent[i])\r\n return parent[i]\r\n \r\n# Naive implementation of union()\r\ndef Union(parent, x, y , size):\r\n \r\n xset = find(parent, x)\r\n yset = find(parent, y)\r\n if size[xset]>size[yset]:\r\n xset,yset=yset,xset\r\n parent[xset] = yset\r\n size[yset]+=1\r\nn=int(input())\r\nd=[]\r\np=[]\r\nsize=[1]*n\r\nfor i in range(n):\r\n p.append(i)\r\nfor i in range(n):\r\n x,y=list(map(int,input().split()))\r\n d.append([x,y])\r\nfor i in range(n):\r\n x,y=d[i]\r\n for j in range(i+1,n):\r\n a,b=d[j]\r\n if x==a or y==b:\r\n Union(p,i,j,size)\r\nans=-1\r\nfor i in range(n):\r\n if p[i]==i:\r\n ans=ans+1\r\nprint(ans)", "v = [False] * 100\nx = [0] * 100\ny = [0] * 100\n\nresult = 0\nn = int(input())\n\ndef search(i):\n v[i]=True;\n for j in range(n):\n if((v[j] != 1) and ((x[i] == x[j]) or (y[i] == y[j]))):\n search(j);\n \nfor i in range(n):\n x[i], y[i] = map(int, input().split(' '))\n \nfor i in range(n):\n if(v[i] != 1):\n search(i)\n result += 1\n \nprint(result-1)\n\n\n \t \t\t\t\t \t \t \t \t \t \t", "xy = []\r\nb = []\r\nfor i in range(1000):\r\n xy.append([])\r\n for _ in range(1000):\r\n xy[i].append(42734674)\r\n b.append(False)\r\n\r\ndef dsu(i):\r\n global b\r\n b[i] = True\r\n for j in range(1, n + 1):\r\n if (not b[j]) and (xy[0][i] == xy[0][j] or xy[1][i] == xy[1][j]):\r\n dsu(j)\r\n\r\nn = int(input())\r\nfor i in range(1, n + 1):\r\n xy[0][i], xy[1][i] = map(int, input().split())\r\nans = -1\r\nfor i in range(1, n + 1):\r\n if not b[i]:\r\n dsu(i)\r\n ans += 1\r\nprint(ans)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Jul 22 19:46:27 2020\n\n@author: divyarth\n\"\"\"\n\nimport sys\nimport heapq\nfrom collections import deque\nfrom collections import defaultdict\n#input=sys.stdin.readline\n#print=sys.stdout.write\n#sys.setrecursionlimit(100000)\nI=lambda : list(map(int,input().split(' ')))\n\n'''\nn=int(input())\nlst=I()\nlst1=sorted(lst)\ncnt=0\nfor ele1,ele2 in zip(lst,lst1):\n if ele1!=ele2:\n cnt+=1\n \nif cnt==0 or cnt==2:\n print('YES')\nelse:\n print('NO')\n \n'''\n'''\nn,m,k=I()\nlst=[list(input()) for _ in range(n)]\n\n\ndef get_neighbors(node):\n x,y=node\n ret=[]\n for a,b in [(x+1,y),(x,y-1),(x-1,y),(x,y+1)]:\n if a>=0 and a<n and b>=0 and b<m and lst[a][b]=='.': ret.append((a,b))\n return ret\n \nvisited={}\nlevel={}\n\nfor i in range(n):\n for j in range(m):\n if (i,j) not in visited and lst[i][j]=='.':\n node=(i,j)\n queue=deque()\n queue.append(node)\n visited[node]=1\n level[node]=0\n while queue:\n cur=queue.popleft()\n for w in get_neighbors(cur):\n if w in visited: continue\n visited[w]=1\n level[w]=level[cur]+1\n queue.append(w)\n\nll=sorted([node for node in list(level.keys())],key=lambda x: level[x])\n\nwhile k:\n x,y=ll.pop()\n lst[x][y]='X'\n k-=1\n \nfor i in range(n): print(\"\".join(lst[i]))\n\n'''\nn=int(input())\ndrifts=[tuple(I()) for _ in range(n)]\ngraph=defaultdict(list)\nfor pts in drifts:\n graph[pts]\n for nei in drifts:\n if pts==nei: continue\n elif pts[0]==nei[0] or pts[1]==nei[1]: \n graph[pts].append(nei)\nglobal visited\nvisited={}\ndef dfs(node,cmp):\n visited[node]=cmp\n for w in graph[node]:\n if w in visited: continue\n dfs(w,cmp)\nkeys=list(graph.keys())\ncmp=0\nfor key in keys:\n if key in visited: continue\n dfs(key,cmp)\n cmp+=1\nprint(cmp-1)", "\r\nfrom collections import deque\r\nn =int(input())\r\nadj = [[] for i in range(n+1)]\r\nvis = [0 for i in range(n+1)]\r\narr = [input().split() for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][0]==arr[j][0] or arr[i][1]==arr[j][1]:\r\n adj[i].append(j)\r\n adj[j].append(i)\r\ndef bfs(u):\r\n vis[u]=1\r\n stack = deque()\r\n stack.append(u)\r\n while len(stack):\r\n u = stack.popleft()\r\n for v in adj[u]:\r\n if vis[v]==0:\r\n vis[v]=1\r\n stack.append(v)\r\nc = 0\r\nfor i in range(n):\r\n if vis[i]==0:\r\n c+=1\r\n bfs(i)\r\nprint(c-1)", "components = 0\nn = int(input())\nV = set()\nfor i in range(n):\n\t(x, y) = map(int, input().split())\n\tV.add((x,y))\nE = {v:set() for v in V}\nfor v in E:\n \tfor neighbor in V:\n \t\tif neighbor[0] == v[0] or neighbor[1] == v[1]:\n \t\t\tE[v].add(neighbor)\nstill_false = set(V)\nvisited = {v:False for v in V}\nwhile len(still_false) > 0:\n\tstart = next(iter(still_false))\n\tqueue = [start]\n\tvisited[start] = True\n\tstill_false.remove(start)\n\tcomponents += 1\n\twhile len(queue) > 0:\n\t\tcurrent = queue.pop(0)\n\t\tfor neighbor in E[current]:\n\t\t\tif not visited[neighbor]:\n\t\t\t\tstill_false.remove(neighbor)\n\t\t\t\tvisited[neighbor] = True\n\t\t\t\tqueue.append(neighbor)\nprint(components - 1)\n\n", "def dfs(node):\r\n if visited[node]==1:\r\n return 0\r\n\r\n visited[node]=1\r\n \r\n for i in range(0,len(adj[node])):\r\n dfs(adj[node][i])\r\n\r\n return 1\r\n\r\n\r\n\r\nn=int(input())\r\n\r\nl1=[]\r\nadj=[]\r\n\r\nfor i in range(0,n):\r\n a,b=map(int,input().split())\r\n\r\n l1.append((a,b))\r\n\r\n adj.append([])\r\n\r\n for i in range(0,len(l1)-1):\r\n if l1[i][0]==a or l1[i][1]==b:\r\n adj[i].append(len(l1)-1)\r\n adj[-1].append(i)\r\n\r\nvisited=[0 for i in range(0,len(l1))]\r\ncount=0\r\n\r\n# print (adj)\r\n# print (l1)\r\n\r\nfor j in range(0,len(l1)):\r\n count=count+dfs(j)\r\n\r\nprint (count-1)\r\n \r\n\r\n\r\n", "import sys\r\n\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef dfs(i, grp):\r\n if vis[i]:\r\n return\r\n x_, y_ = points[i]\r\n vis[i] = grp\r\n for j in xd[x_]:\r\n dfs(j, grp)\r\n for j in yd[y_]:\r\n dfs(j, grp)\r\n\r\n\r\n\r\nn = int(input())\r\npoints = []\r\nxd, yd = {}, {}\r\nfor i in range(n):\r\n x_, y_ = map(int, input().split())\r\n points.append((x_, y_))\r\n if x_ in xd:\r\n xd[x_].append(i) \r\n else:\r\n xd[x_] = [i]\r\n\r\n if y_ in yd:\r\n yd[y_].append(i) \r\n else:\r\n yd[y_] = [i]\r\n\r\nvis = [0]*n\r\ngrp = 1\r\nfor i in range(n):\r\n if vis[i]:\r\n continue\r\n dfs(i, grp)\r\n grp += 1\r\n\r\nprint(max(vis)-1)\r\n", "n = int(input())\r\npoints = []\r\nfor _ in range(n):\r\n x, y = list(map(int, input().split()))\r\n points.append((x, y))\r\n \r\nxs = set()\r\nys = set()\r\nfor i in range(n):\r\n xs.add(points[i][0])\r\n ys.add(points[i][1])\r\n \r\n \r\nfrom collections import defaultdict\r\nd = defaultdict(list)\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if points[i][0] == points[j][0] or points[i][1] == points[j][1]:\r\n d[i].append(j)\r\n d[j].append(i)\r\n\r\nfrom queue import Queue\r\nvisited = set()\r\n\r\nn_case = 0\r\nfor i in range(n):\r\n \r\n if i in visited:\r\n continue\r\n \r\n n_case += 1\r\n q = Queue()\r\n q.put(i)\r\n while not q.empty():\r\n el = q.get()\r\n visited.add(el)\r\n for nb in d[el]:\r\n if nb not in visited:\r\n q.put(nb)\r\n \r\nprint(n_case-1)", "n = int(input())\r\n\r\ndef dfs(pos):\r\n global visited, xPos, yPos\r\n toVisit = [pos]\r\n while len(toVisit) != 0:\r\n point = toVisit.pop()\r\n visited.add(point)\r\n for i in xPos[point[0]]:\r\n if (point[0], i) not in toVisit and (point[0], i) not in visited:\r\n toVisit.append((point[0], i))\r\n for i in yPos[point[1]]:\r\n if (i, point[1]) not in toVisit and (i, point[1]) not in visited:\r\n toVisit.append((i, point[1]))\r\n \r\n\r\n\r\n\r\npositions = []\r\nxPos = {}\r\nyPos = {}\r\nfor i in range(n):\r\n positions.append(tuple(map(int,input().split())))\r\n xPos[positions[-1][0]] = xPos.get(positions[-1][0], []) + [positions[-1][1]]\r\n yPos[positions[-1][1]] = yPos.get(positions[-1][1], []) + [positions[-1][0]]\r\n\r\nvisited = set()\r\nptr = 0\r\nctr = -1\r\nfor i in range(n):\r\n if positions[i] not in visited:\r\n dfs(positions[i])\r\n ctr += 1\r\n\r\nprint(ctr)\r\n \r\n", "n = 0\r\nx = [0]*1111\r\ny = [0]*1111\r\nv = [False]*1111\r\n\r\ndef dfs_graph(i):\r\n v[i] = True\r\n for j in range(n):\r\n if(not v[j] and (x[i] == x[j] or y[i] == y[j])):\r\n dfs_graph(j)\r\n\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n a, b = input().split(\" \")\r\n x[i] = int(a)\r\n y[i] = int(b)\r\n\r\naswner = 0\r\n\r\nfor i in range(n):\r\n if(not v[i]):\r\n dfs_graph(i)\r\n aswner+=1 \r\n\r\nprint(aswner-1)", "def dfs(node):\n\tvis[node]=1\n\tfor i in range(n):\n\t\tif (X[i]==X[node] or Y[i]==Y[node]) and vis[i]==0:\n\t\t\tdfs(i)\n\nr=[-1 for i in range(2005)] \nn=int(input()) \nX,Y=[],[] \nvis=[0]*101\nfor i in range(n):\n\tx,y=map(int,input().split())\n\tX.append(x)\n\tY.append(y)\nans=0\nfor i in range(n):\n\tif (vis[i]==0):\n\t\tdfs(i)\n\t\tans+=1\nprint(ans-1)", "def search(coord, start, n):\n if coord[start]['pass']:\n return\n coord[start]['pass'] = True\n for i in range(n):\n if coord[i]['x'] == coord[start]['x'] or coord[i]['y'] == coord[start]['y']:\n search(coord, i, n)\n\nsnow_drifts_number = input()\nsnow_drifts_number = int(snow_drifts_number)\n\ndrift_coord = []\ndrifts_needed = 0\nfor i in range(snow_drifts_number):\n x, y = input().split(' ')\n x = int(x)\n y = int(y)\n drift_coord.append({'x': x, 'y': y, 'pass': False})\n\nfor i in range(snow_drifts_number):\n if drift_coord[i]['pass']:\n continue\n drifts_needed += 1\n search(drift_coord, i, snow_drifts_number)\n\nprint(drifts_needed - 1)\n\t\t\t \t \t \t\t\t\t \t\t\t \t\t\t", "def dfs(n):\n n[2] = True\n for s in a:\n if not s[2] and (n[0] == s[0] or n[1] == s[1]):\n dfs(s)\n\n\nn = int(input())\na = []\nfor i in range(n):\n x, y = map(int, input().split())\n a.append([x, y, False])\n\nrj = 0\nfor i in a:\n if not i[2]:\n rj += 1\n dfs(i)\n\nprint(rj-1)\n\n \t \t\t\t\t \t\t\t\t \t \t \t \t\t \t\t", "n = int(input())\ncoords = []\n\nfor _ in range(n):\n nx, ny = map(int, input().split())\n coords.append((nx, ny))\n\n\ndef search(x, y, v):\n v.append((x, y))\n for nx, ny in coords:\n if (nx == x and ny != y) or (nx != x and ny == y):\n if (nx, ny) not in v:\n search(nx, ny, v)\n return v\n\nc = -1\nwhile coords:\n x, y = coords[0]\n c += 1\n visited = search(x, y, [])\n for coord in visited:\n coords.remove(coord)\nprint(c)\n", "n = int(input())\n\nxis = [] #array com os x\nyip = [] #array com os y\nvis = [] #array de visitados\n\nans = 0 #resposta\n\nfor i in range(110):\n xis.append([0])\n yip.append([0])\n vis.append([0])\n\nfor i in range(n): #le as cordenadas x & y do nó e coloca nos arrays\n x,y = map(int,input().split())\n xis[i] = [x]\n yip[i] = [y]\n\ndef dfs(i): \n vis[i] = 1 \n for j in range(n): \n if vis[j] != 1 and (xis[i] == xis[j] or yip[i] == yip[j]):\n dfs(j)\n\nfor i in range(n):\n if vis[i]!= 1: \n dfs(i)\n ans += 1\n\nprint(ans-1)\n \t \t\t\t\t \t\t \t \t \t \t \t\t\t\t", "from sys import stdin\r\n\r\n\r\ndef dfs(visited, l, i):\r\n visited[i]= True\r\n for j in range(n):\r\n if not visited[j]:\r\n if l[j][0]==l[i][0] or l[j][1]==l[i][1]:\r\n dfs(visited,l,j)\r\n\r\n\r\n\r\nn = int(stdin.readline().rstrip())\r\nl = list()\r\nfor _ in range(n):\r\n a, b = map(int, stdin.readline().rstrip().split(\" \"))\r\n l.append([a,b])\r\nvisited = [False]*n\r\nc = 0\r\nfor i in range(n):\r\n if not visited[i]:\r\n dfs(visited, l, i)\r\n c+=1\r\nprint(c-1)\r\n", "import collections\r\n\r\n\r\ndef breadth_first_search(graph, root):\r\n visited = set()\r\n visited.add(root)\r\n queue = collections.deque([root])\r\n while queue:\r\n vertex = queue.popleft()\r\n for neighbour in graph[vertex]:\r\n if neighbour not in visited:\r\n visited.add(neighbour)\r\n queue.append(neighbour)\r\n return visited\r\n\r\n\r\n# The first line of input contains a single integer n (1 ≤ n ≤ 100) — the number of snow drifts.\r\n# Each of the following n lines contains two integers xi and yi (1 ≤ xi, yi ≤ 1000) — the coordinates of the i-th snow drift.\r\n\r\nN = int(input())\r\ndrifts = []\r\nxcoord = set()\r\nycoord = set()\r\nfor n in range(N):\r\n xi, yi = map(int, input().split())\r\n sxi = 'x' + str(xi)\r\n xcoord.add(sxi)\r\n syi = 'y' + str(yi)\r\n ycoord.add(syi)\r\n drifts.append( (sxi, syi) )\r\n\r\ngraph = dict()\r\nfor v in xcoord | ycoord:\r\n graph[v] = set()\r\n\r\nfor e in drifts:\r\n graph[e[0]].add(e[1])\r\n graph[e[1]].add(e[0])\r\n\r\n# print(graph)\r\n\r\nparts = []\r\nseen = set()\r\nfor v in graph:\r\n if v not in seen:\r\n area = breadth_first_search(graph, v)\r\n parts.append(area)\r\n seen.update(area)\r\nprint(len(parts) - 1)\r\n", "from typing import List, Dict, Tuple\r\n\r\ndef dfs(v: List[List[int]], visit: List[bool], start: int):\r\n visit[start - 1] = True\r\n for i in range(0, len(v[start-1])):\r\n if not visit[v[start - 1][i] - 1]:\r\n dfs(v, visit, v[start - 1][i])\r\n\r\ndef main():\r\n amount: int = int(input().strip())\r\n\r\n drift_data: List[Tuple[int, int]] = [(0, 0)] * amount\r\n dp: List[List[int]] = [[] for _ in range(amount)]\r\n been: List[bool] = [False] * amount\r\n # print(drift_data, '\\amount', dp, '\\amount', been)\r\n\r\n for pos in range(amount):\r\n inn_list = input().strip().split(' ')\r\n inn_list = [*map(int, inn_list)]\r\n drift_data[pos] = (inn_list[0], inn_list[1])\r\n\r\n # print(drift_data, '\\amount', dp, '\\amount', been)\r\n\r\n\r\n\r\n\r\n\r\n for pos in range(amount-1):\r\n for pos_y in range(pos+1, amount):\r\n if drift_data[pos][0] != drift_data[pos_y][0] and \\\r\n drift_data[pos][1] != drift_data[pos_y][1]:\r\n continue\r\n # print(\"*****: \", pos, \" \", pos_y, \" \")\r\n # print(dp)\r\n dp[pos].insert(len(dp[pos]), pos_y+1)\r\n dp[pos_y].insert(len(dp[pos_y]), pos+1)\r\n # dp[pos].append(pos_y + 1)\r\n # dp[pos_y].append(pos + 1)\r\n # print(dp)\r\n\r\n # print(drift_data, '\\amount', dp, '\\amount', been)\r\n\r\n nc: int = 0\r\n for pos in range(0, amount):\r\n if not been[pos]:\r\n dfs(dp, been, pos+1)\r\n nc += 1\r\n\r\n # print(\"res: \")\r\n print(nc - 1)\r\n\r\nmain()\r\n", "n=int(input())\r\nM=[[0 for i in range(1001)] for i in range(1001)]\r\nans=n-1\r\nT=[]\r\nfor i in range(n) :\r\n a,b=map(int,input().split())\r\n M[a][b]=1\r\n T.append([a,b])\r\nfor i in range(n) :\r\n r=T[i]\r\n if M[r[0]][r[1]]!=-1 :\r\n M[r[0]][r[1]]=-1\r\n l=[[r[0],r[1]]]\r\n while len(l)>0 :\r\n g=l[0]\r\n del(l[0])\r\n for j in range(n) :\r\n if T[j][0]==g[0] and M[T[j][0]][T[j][1]]!=-1 or T[j][1]==g[1] and M[T[j][0]][T[j][1]]!=-1 :\r\n l.append([T[j][0],T[j][1]])\r\n M[T[j][0]][T[j][1]]=-1\r\n ans=ans-1\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\na = []\n\nfor i in range(n):\n x, y = map(int, input().split())\n a.append([x,y,False])\n\n\ndef df(x):\n x[2]= True \n for s in a:\n if not s[2] and (x[0] == s[0] or x[1] == s[1]):\n df(s)\n\nrj = 0\n\nfor i in a:\n if not i[2]:\n rj += 1\n df(i)\n\nprint(rj-1)\n \t \t \t \t\t\t \t\t\t \t \t\t\t \t\t \t", "n = int(input())\npoints = []\nfor _ in range(n):\n x, y = list(map(int, input().split(' ')))\n points.append((x, y))\n\nseen = set()\ndef dfs(x, y, tmp):\n seen.add((x, y))\n tmp.append((x, y))\n\n for nx, ny in points:\n if (nx, ny) not in seen and (nx == x or ny == y):\n dfs(nx, ny, tmp)\n\ncc = []\nfor x, y in points:\n if (x, y) not in seen:\n tmp = []\n dfs(x, y, tmp)\n cc.append(tmp)\n\nans = len(cc) - 1\nprint(ans)", "n = int(input())\r\n\r\nxis = [] #array com os x\r\nyip = [] #array com os y\r\nvis = [] #array de visitados\r\n\r\nans = 0 #resposta\r\n\r\nfor i in range(n+1):\r\n xis.append([0])\r\n yip.append([0])\r\n vis.append([0])\r\n\r\nfor i in range(n): #le as cordenadas x & y do nó e coloca nos arrays\r\n x,y = map(int,input().split())\r\n xis[i] = [x]\r\n yip[i] = [y]\r\n\r\ndef dfs(i): \r\n vis[i] = 1 \r\n for j in range(n): \r\n if vis[j] != 1 and (xis[i] == xis[j] or yip[i] == yip[j]):\r\n dfs(j)\r\n\r\nfor i in range(n):\r\n if vis[i]!= 1: \r\n dfs(i)\r\n ans += 1\r\n\r\nprint(ans-1)", "import sys\n\nnumber = int(input())\n\ndrifts = dict()\n\nfor k in range(number):\n\n i, j = list(map(int, input().split(' ')))\n\n drifts[i] = drifts.get(i, set()) | set([j])\n\ndrifts = [drifts[k] for k in drifts]\nteams = []\n\ni = 0\ngroup = set()\n\nwhile(i < len(drifts)):\n if not group:\n group |= drifts[i]\n j = i + 1\n flag = False\n while(j < len(drifts)):\n if group & drifts[j]:\n group |= drifts.pop(j)\n flag = True\n break\n j += 1\n if not flag:\n i += 1\n teams.append(group)\n group = set()\n\nprint(len(teams) - 1)\n\t\t\t\t\t \t \t \t\t \t \t\t \t \t \t", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\ndx = defaultdict(lambda: [])\r\ndy = defaultdict(lambda: [])\r\nlst = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n\r\n dx[x].append((x, y))\r\n dy[y].append((x, y))\r\n lst.append((x, y))\r\n\r\n\r\nused = set()\r\nds = [dx, dy]\r\n\r\n\r\ndef dfs(s):\r\n x, y = s\r\n used.add(s)\r\n\r\n for i in range(2):\r\n d = ds[i]\r\n k = s[i]\r\n for e in d[k]:\r\n if e not in used:\r\n dfs(e)\r\n\r\n\r\ncnt = 0\r\nfor i in lst:\r\n if i not in used:\r\n dfs(i)\r\n cnt += 1\r\n\r\nprint(cnt - 1)\r\n", "MAX = 2007\r\nparent = [0]*(MAX)\r\nsz = [0]*(MAX)\r\n\r\ndef find(i):\r\n if i != parent[i]:\r\n parent[i] = find(parent[i])\r\n return parent[i]\r\n \r\ndef union(i, j):\r\n pi, pj = find(i), find(j)\r\n if pi != pj:\r\n parent[pi] = pj\r\n\r\n\r\nfor i in range(MAX): \r\n parent[i] = i\r\n sz[i] = 1\r\n\r\nn = int(input())\r\n\r\nseparador = 1003\r\n\r\nchecks = []\r\nfor i in range(n):\r\n u, v = list(map(int, input().split()))\r\n\r\n checks.append(u)\r\n checks.append(separador+v)\r\n union(u, separador+v)\r\n\r\nresp = set()\r\nfor i in checks:\r\n resp.add(find(i))\r\n\r\nprint(len(resp)-1)\r\n \r\n\r\n", "def dfs(arr, curr, visited):\n visited[curr] = 1\n for child in arr[curr]:\n if visited[child] == 0:\n dfs(arr, child, visited)\n\nn = int(input())\n\nvertices = []\nfor i in range(n):\n line = input().split()\n x = int(line[0])\n y = int(line[1])\n vertices.append([x, y])\n\nedges = []\nfor vertex in vertices:\n edges_from_vertex = []\n for (index, other) in enumerate(vertices):\n if other != vertex:\n if other[0] == vertex[0] or other[1] == vertex[1]:\n edges_from_vertex.append(index)\n edges.append(edges_from_vertex)\n\nvisited = [0] * n\nnum_components = 0\nfor (index, vertex) in enumerate(vertices):\n if visited[index] == 0:\n num_components += 1\n dfs(edges, index, visited)\n\nprint(num_components - 1)\n\t\t\t \t\t\t \t \t\t\t \t\t\t\t \t \t\t", "done = set()\ndef generate_component(ix):\n done.add(ix)\n for j in adjacency[ix]:\n if j not in done:\n generate_component(j)\n\nn = int(input())\npoints = [None] * n\nfor j in range(n):\n x, y = (int(x) for x in input().split())\n points[j] = (x, y)\nadjacency = [set() for _ in range(n)]\nfor j in range(n):\n for k in range(j + 1, n):\n if points[j][0] == points[k][0] or points[j][1] == points[k][1]:\n adjacency[j].add(k)\n adjacency[k].add(j)\n# print(adjacency)\nc = 0\nfor j in range(n):\n if j not in done:\n generate_component(j)\n c += 1\nprint(c - 1)", "n = input()\nn = int(n)\nposicoes, conectados = [], []\n\nfor i in range(n):\n linha = input().split(\" \")\n posicoes.append(tuple(map(int,linha)))\n\nmarc = {}\nfor pos in posicoes:\n marc[pos] = False\n\n\ndef solucao():\n for pos in posicoes:\n if not marc[pos]:\n p = [pos]\n marc[pos] = True\n changed = True\n while(changed):\n changed = False\n for pos2 in posicoes:\n if not marc[pos2]:\n for pos3 in p:\n if (pos2[0] == pos3[0] or pos2[1] == pos3[1]) and not marc[pos2]:\n marc[pos2] = True\n p.append(pos2)\n changed = True\n conectados.append(p)\n return len(conectados)-1\n\nprint(solucao())\n\t \t\t\t \t\t \t\t \t\t\t \t \t\t\t\t\t", "# input\nnumSnow = int(input())\n\ncoords = [None] * numSnow\nneighbours = [[] for _ in range(numSnow)]\n\n# input each snow drift\nfor i in range(numSnow):\n coords[i] = [int(x) for x in input().strip().split(\" \")]\n\n# build the adjacency list O(n^2)\nfor i in range(numSnow):\n for j in range(numSnow):\n if coords[i][0] == coords[j][0] or coords[i][1] == coords[j][1]:\n # adjacent\n if i == j: # don't add itself\n continue\n neighbours[i].append(j)\n # j will add i later\n\n\n# count how many connected components\nnum_components = 0\nvisited = [False] * numSnow\n\n# start exploring from 0\nvisited[0] = True\nto_process = [0]\n\nwhile True:\n while len(to_process) > 0:\n curr = to_process.pop()\n # process neighbours\n for neighbour in neighbours[curr]:\n # add unvisited\n if visited[neighbour] is False:\n to_process.append(neighbour)\n visited[neighbour] = True\n num_components += 1\n # finished exploring this component are there any more unvisited?\n for i, has_been_visited in enumerate(visited):\n if has_been_visited is False:\n # start exploring again\n visited[i] = True\n to_process.append(i)\n break\n else:\n break # done\n\nprint(num_components - 1) # answer\n", "import fileinput\n\n# Implement DFS\ndef dfs(x, points, visited):\n visited[x] = True\n for y in range(n):\n if not visited[y] and (points[x][0] == points[y][0] or points[x][1] == points[y][1]):\n dfs(y, points, visited)\n\n\n# Add Your Logic Here\ndef solve(n, points, visited):\n count = 0\n for x in range(n):\n if not visited[x]:\n dfs(x, points, visited)\n count += 1\n print(count - 1)\n\n\n\nif __name__ == '__main__':\n f = fileinput.input()\n n = int(f.readline().strip())\n points = []\n visited = [False] * n\n i = 0\n while (i < n):\n i = i + 1\n x, y = [int(_) for _ in f.readline().strip().split(\" \")]\n points.append((x,y))\n solve(n, points, visited)\n", "import sys\nlines = []\nfor Line in sys.stdin:\n lines.append(Line.rstrip('\\n'))\n\n\n# lines=[\"2\",\n# \"2 1\",\n# \"1 2\"]\n\n# lines=[\"2\",\n# \"2 1\",\n# \"4 1\"]\n\nfrom collections import namedtuple\n\nPoint = namedtuple(\"Point\", ['x', 'y','visited'])\n\nn=int(lines[0])\ndel(lines[0])\n\nd=dict()\nfor i in range(n):\n x,y = list(map(int,lines[i].split()))\n d[i]=Point(x,y,0)\n\ndef dfs(j):\n global d\n\n d[j]=d[j]._replace(visited=1)\n for i in range(n):\n if (d[j].x==d[i].x or d[j].y==d[i].y)and(d[i].visited!=1):\n dfs(i)\n \nc=0\nfor i in range(n):\n if d[i].visited!=1:\n dfs(i)\n c+=1\n\nprint(c-1)", "from collections import defaultdict\r\n\r\nn = int(input())\r\ncoordinate = []\r\nfor _ in range(n):\r\n coordinate.append(tuple(list(map(int, input().split()))))\r\n\r\nhorizontal = defaultdict(list)\r\nvertical = defaultdict(list)\r\n\r\nfor x, y in coordinate:\r\n horizontal[x].append(y)\r\n vertical[y].append(x)\r\n\r\nseen = set()\r\ngroup = 0\r\nfor x,y in coordinate:\r\n if (x, y) not in seen:\r\n seen.add((x, y))\r\n stack = [(x, y)]\r\n group += 1\r\n while stack:\r\n x, y = stack.pop()\r\n\r\n for i in horizontal[x]:\r\n if (x, i) not in seen:\r\n stack.append((x, i))\r\n seen.add((x, i))\r\n\r\n for i in vertical[y]:\r\n if (i, y) not in seen:\r\n stack.append((i, y))\r\n seen.add((i, y))\r\n \r\n\r\n\r\nprint(group - 1)", "def dfs(par):\r\n if visitados[par]:\r\n return\r\n\r\n visitados[par] = True\r\n\r\n for i in range(n):\r\n if campo[par][0] == campo[i][0] or campo[par][1] == campo[i][1]:\r\n dfs(i)\r\n\r\n\r\nn = int(input())\r\n\r\npistas = 0\r\ncampo = []\r\nvisitados = [False] * (n+1)\r\n\r\nfor x in range(n):\r\n x,y = map(int,input().split())\r\n campo.append((x,y))\r\n\r\nfor i in range(n):\r\n if visitados[i] == False:\r\n pistas += 1\r\n dfs(i)\r\n\r\nprint(pistas - 1)\r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nN = int(input())\r\n\r\npts = []\r\nfor i in range(N):\r\n a,b = map(int,input().split())\r\n pts.append((a,b))\r\n\r\ngraph = [[] for i in range(N)]\r\n\r\nfor i in range(N):\r\n x,y = pts[i]\r\n for j in range(i+1,N):\r\n a,b = pts[j]\r\n if x==a or y==b:\r\n graph[i].append(j)\r\n graph[j].append(i)\r\n\r\n\r\n\r\nvst = [False for i in range(N)]\r\ncc = 0\r\nfor i in range(N):\r\n if not vst[i]:\r\n q = [i]\r\n cc +=1\r\n while q:\r\n cur_node = q.pop()\r\n if not vst[cur_node]:\r\n vst[cur_node] = True\r\n for nbr in graph[cur_node]:\r\n if not vst[nbr]:\r\n q.append(nbr)\r\n\r\nprint(cc-1)\r\n", "import sys\r\nsys.setrecursionlimit(10000)\r\n \r\nm = 1000\r\n \r\nvis = [0 for i in range(m)]\r\n \r\nx = [0 for i in range(m)]\r\n \r\ny = [0 for i in range(m)]\r\n \r\ndef dfs(i, entrada):\r\n vis[i] = 1\r\n for j in range(entrada):\r\n if(not (vis[j]) and ((x[j] == x[i]) or (y[j] == y[i]))):\r\n dfs(j, entrada)\r\n \r\nsoma = 0\r\n \r\nentrada = int(input())\r\n \r\nfor l in range(entrada):\r\n linha = list(map(int, input().split()))\r\n x[l] = linha[0]\r\n y[l] = linha[1]\r\n \r\nfor o in range(entrada):\r\n if(not vis[o]):\r\n dfs(o, entrada)\r\n soma+=1\r\n \r\nprint(soma-1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jun 16 07:58:20 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\n\r\n\r\nn=int(input())\r\nsnowdrifts=[]\r\nfor s in range(n):\r\n \r\n snowdrifts.append(list(map(int,input().split()))+[None])\r\ndef dfs(current):\r\n current[2]=True\r\n for snowdrift in snowdrifts:\r\n if not snowdrift[2] and (current[0]==snowdrift[0] or current[1]==snowdrift[1]):\r\n dfs(snowdrift)\r\na=0\r\nfor s in snowdrifts:\r\n if not s[2]:\r\n a+=1\r\n dfs(s)\r\nprint(a-1)\r\n \r\n", "from sys import stdin,stdout \r\nvis,x,y = [ [0 for j in range(1001)] for i in range(1001) ], [], []\r\n\r\ndef bfs(a,b,n):\r\n vis[a][b],q = 1, [ [a,b] ]\r\n while len(q):\r\n u = q[0]\r\n del q[0]\r\n for i in range(n):\r\n if not vis[x[i]][y[i]] and (x[i] == u[0] or y[i] == u[1]):\r\n vis[x[i]][y[i]] = 1\r\n q.append([x[i],y[i]])\r\n\r\ndef main():\r\n n = int(stdin.readline())\r\n cnt = 0\r\n for i in range(n):\r\n a,b = map(int,stdin.readline().split())\r\n x.append(a)\r\n y.append(b)\r\n for i in range(n):\r\n if not vis[x[i]][y[i]]:\r\n cnt += 1\r\n bfs(x[i],y[i],n)\r\n stdout.write('%d' % (cnt - 1))\r\n \r\nmain() \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def parent(y,x):\n while grid[y][x]!=(y,x):\n (y,x)=grid[y][x]\n return [y,x]\nn=int(input())\ngrid=[[(i,j) for j in range(1001)] for i in range(1001)]\nv=[list(map(int,input().split())) for i in range(n)]\nfor i in range(n):\n for j in range(i+1,n):\n pi=parent(v[i][0],v[i][1])\n pj=parent(v[j][0],v[j][1])\n if pi!=pj and (v[i][0]==v[j][0] or v[i][1]==v[j][1]):\n grid[pi[0]][pi[1]]=grid[pj[0]][pj[1]]\ns = set()\nfor i in v:\n p=parent(i[0],i[1])\n s.add((p[0],p[1]))\nprint(len(s)-1)\n \n", "x=[]\r\ny=[]\r\nf =[0]*100\r\nres=0\r\ndef dfs(i):\r\n f[i]=1\r\n for j in range(n):\r\n if((f[j]!=1) and ((x[i]==x[j]) or (y[i]==y[j]))):\r\n dfs(j)\r\nn=int(input())\r\nfor i in range(n):\r\n xt, yt = map(int, input().split())\r\n x.append(xt);y.append(yt)\r\n\r\nfor i in range(n):\r\n if(f[i]!=1):\r\n dfs(i)\r\n res+=1\r\nprint(res-1)", "def dfs(a,b,x,y,visited):\r\n\tfor i in range(len(a)):\r\n\t\tif visited[i] == False and (a[i] == x or b[i] == y):\r\n\t\t\tvisited[i] = True\r\n\t\t\tdfs(a,b,a[i],b[i],visited)\r\n \r\nn = int(input())\r\nox, oy = [], []\r\n \r\nfor i in range(n):\r\n\tx, y = map(int, input().split())\r\n\tox.append(x)\r\n\toy.append(y)\r\n \r\nvisited = [False for _ in range(n)]\r\nconnect_compo = 0\r\n \r\nfor i in range(n):\r\n\tif visited[i] == False:\r\n\t\tvisited[i] = True\r\n\t\tdfs(ox,oy,ox[i],oy[i],visited)\r\n\t\tconnect_compo = connect_compo + 1\r\n \r\nprint(connect_compo-1)", "n = int(input())\r\n\r\ncolors = {}\r\n\r\ndrifts = []\r\nfor i in range(n):\r\n drift = tuple(map(int, input().split()))\r\n drifts.append(drift)\r\n colors[drift] = 'w'\r\n\r\ndef is_adjacent(drift_l, drift_r):\r\n return drift_l[0] == drift_r[0] or drift_l[1] == drift_r[1]\r\n\r\ntime = 0\r\ndisc_times = {}\r\nend_times = {}\r\n\r\ndef dfs_visit(i):\r\n global time\r\n global disc_times\r\n global end_times\r\n\r\n colors[drifts[i]] = 'g'\r\n time = time + 1\r\n disc_times[drifts[i]] = time\r\n\r\n for j in range(n):\r\n if i != j and is_adjacent(drifts[i], drifts[j]):\r\n if colors[drifts[j]] == 'w':\r\n dfs_visit(j)\r\n \r\n colors[drifts[i]] = 'b'\r\n time += 1\r\n end_times[drifts[i]] = time\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if colors[drifts[i]] == 'w':\r\n count += 1\r\n dfs_visit(i)\r\n\r\nprint(count-1)", "n = int(input())\r\ndrift = set()\r\nmax_row = 0\r\nmax_col = 0\r\nwhile n:\r\n r, c = map(int, input().split())\r\n max_row = max(max_row, r)\r\n max_col = max(max_col, c)\r\n drift.add(tuple([r, c]))\r\n n = n - 1\r\ncount = []\r\nvisited = set()\r\nfor r, c in drift:\r\n if (r, c) not in visited:\r\n q = [(r, c)]\r\n comp = [(r, c)]\r\n visited.add((r, c))\r\n while q:\r\n curr = q.pop(0)\r\n rd = curr[0]\r\n cd = curr[1]\r\n for R in range(1, max_row + 1):\r\n if (R, cd) in drift and (R, cd) not in visited:\r\n visited.add((R, cd))\r\n q.append((R, cd))\r\n comp.append((R, cd))\r\n for C in range(1, max_col + 1):\r\n if (rd, C) in drift and (rd, C) not in visited:\r\n visited.add((rd, C))\r\n q.append((rd, C))\r\n comp.append((rd, C))\r\n count.append(comp)\r\nprint(len(count) - 1)", "n = int(input())\n\narray = []\n\nfor _ in range(n):\n temp = [int(e) for e in input().split()]\n array.append(temp)\n\nfila = []\ndrifts = 0\nwhile(len(array) > 0):\n fila.append(array.pop(0))\n drifts += 1\n while(len(fila) > 0):\n temp = fila.pop()\n i = 0\n while(i < len(array)):\n if array[i][0] == temp[0] or array[i][1] == temp[1]:\n fila.append(array[i])\n array.pop(i)\n else:\n i += 1\n\nprint(drifts - 1)", "import sys\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n \r\n \r\ntestcases = int(input())\r\ngroup = []\r\nfor testcase in range(testcases):\r\n x, y = get_ints()\r\n if len(group) == 0 :\r\n group.append([(x,y)])\r\n continue \r\n flag = 0 \r\n #print(group)\r\n for subgroup in group:\r\n #print(subgroup)\r\n for pair in subgroup:\r\n #print(pair)\r\n xx = pair[0]\r\n yy = pair[1]\r\n if xx == x or yy == y:\r\n flag = 1 \r\n subgroup.append((x,y))\r\n break \r\n if flag == 1 :\r\n break \r\n if flag == 0:\r\n group.append([(x,y)])\r\nif len(group) == 1:\r\n print(0)\r\nelse:\r\n newans = []\r\n index = 0\r\n \r\n for subgroup in group:\r\n xdicts = {}\r\n ydicts = {}\r\n if index == 0 :\r\n index += 1 \r\n for item in subgroup:\r\n x = item[0]\r\n y = item[1]\r\n if x not in xdicts:\r\n xdicts[x] = 1 \r\n if y not in ydicts:\r\n ydicts[y] = 1 \r\n newans.append([])\r\n newans[0].append(xdicts.copy())\r\n newans[0].append(ydicts.copy())\r\n continue \r\n for item in subgroup:\r\n x = item[0]\r\n y = item[1]\r\n if x not in xdicts:\r\n xdicts[x] = 1 \r\n if y not in ydicts:\r\n ydicts[y] = 1\r\n flag = 0 \r\n getindex = -1\r\n for newgroup in newans:\r\n getindex += 1\r\n newxdicts = newgroup[0]\r\n newydicts = newgroup[1]\r\n for key,value in xdicts.items():\r\n if key in newxdicts:\r\n flag = 1 \r\n break \r\n for key,value in ydicts.items():\r\n if key in newydicts:\r\n flag = 1 \r\n break \r\n if flag == 1:\r\n break \r\n if flag == 1:\r\n newgroup = newans[getindex]\r\n newxdicts = newgroup[0]\r\n newydicts = newgroup[1]\r\n for key, value in xdicts.items():\r\n if key not in newxdicts:\r\n newxdicts[key] = 1 \r\n for key, value in ydicts.items():\r\n if key not in newydicts:\r\n newydicts[key] = 1 \r\n \r\n else:\r\n newans.append([])\r\n newans[-1].append(xdicts.copy())\r\n newans[-1].append(ydicts.copy())\r\n \r\n # else:\r\n # flag = 0 \r\n # getindex = 0 \r\n # xdicts = {}\r\n # ydicts = {}\r\n # for item in subgroup:\r\n # x1 = item[0]\r\n # y1 = item[1]\r\n \r\n # for newgroup in newans:\r\n # for newitem in newgroup:\r\n # xx = newitem[0]\r\n # yy = newitem[1]\r\n # if x1 == xx or yy == y1:\r\n # flag = 1 \r\n if len(newans) == 1:\r\n print(0)\r\n else:\r\n lenans = len(newans)\r\n added = [0 for _ in range(lenans)]\r\n finalans = []\r\n for group in newans:\r\n ansx = group[0]\r\n ansy = group[1]\r\n ans1 = []\r\n ans2 = []\r\n for key, value in ansx.items():\r\n ans1.append(key)\r\n for key, value in ansy.items():\r\n ans2.append(key)\r\n # print(sorted(ans1))\r\n # print(sorted(ans2))\r\n # print()\r\n \r\n for i in range(lenans - 1):\r\n if added[i] == 1:\r\n continue\r\n prevx = newans[i][0]\r\n prevy = newans[i][1]\r\n flag = 0 \r\n for j in range(i + 1 , lenans):\r\n if added[j] == 1:\r\n continue \r\n nowx = newans[j][0]\r\n nowy = newans[j][1]\r\n for key, value in nowx.items():\r\n if key in prevx:\r\n flag = 1 \r\n break \r\n for key, value in nowy.items():\r\n if key in prevy:\r\n flag = 1 \r\n break \r\n \r\n if flag == 1:\r\n added[j] = 1 \r\n for key ,value in nowx.items():\r\n if key not in prevx:\r\n prevx[key] = 1 \r\n for key ,value in nowy.items():\r\n if key not in prevy:\r\n prevy[key] = 1\r\n flag = 0 \r\n # print(added)\r\n finalans.append([prevx,prevy])\r\n # print(finalans )\r\n print(lenans - sum(added) - 1) \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "def find(x):\r\n if x == p[x]: return x\r\n else:\r\n p[x] = find(p[x])\r\n return p[x]\r\n\r\ndef unite(a, b):\r\n global count\r\n a = find(a)\r\n b = find(b)\r\n if a != b:\r\n p[a] = b;\r\n count -= 1\r\n\r\nn = int(input())\r\ngraph = [list(map(int, input().split())) for i in range(n)]\r\ncount = len({graph[i][0] for i in range(n)})\r\np = [i for i in range(1001)]\r\nfor (a, b) in graph:\r\n for (x, y) in graph:\r\n if b == y: unite(a, x)\r\nprint(count - 1)", "def ice_skating(visit_arr, coordenates, index):\n for i in range(len(coordenates)):\n if not visit_arr[i] and (coordenates[index][0] == coordenates[i][0] or coordenates[index][1] == coordenates[i][1]):\n visit_arr[index] = True\n ice_skating(visit_arr, coordenates, i)\n\nnumber = int(input())\nvisit = [False] * number\ncoords = []\npass_count = 0\n\nfor i in range(number):\n coord = list(map(int, input().split()))\n coords.append(coord)\n\nfor n in range(number):\n if not visit[n]:\n pass_count += 1\n ice_skating(visit, coords, n) \n\nprint(pass_count - 1)\n\t \t \t\t\t\t\t\t\t \t \t\t \t\t\t\t\t\t\t \t", "def dfs(snow_drift, visited, adjacency_list):\r\n visited.add(snow_drift)\r\n for neighbor in adjacency_list[snow_drift]:\r\n if neighbor not in visited:\r\n dfs(neighbor, visited, adjacency_list)\r\n\r\nn = int(input())\r\nsnow_drifts = []\r\nadjacency_list = {}\r\n\r\n# Read snow drifts coordinates and create adjacency list\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n snow_drifts.append((x, y))\r\n adjacency_list[(x, y)] = []\r\n\r\n# Populate adjacency list\r\nfor i in range(n):\r\n x1, y1 = snow_drifts[i]\r\n for j in range(i + 1, n):\r\n x2, y2 = snow_drifts[j]\r\n if x1 == x2 or y1 == y2:\r\n adjacency_list[(x1, y1)].append((x2, y2))\r\n adjacency_list[(x2, y2)].append((x1, y1))\r\n\r\nvisited = set()\r\nconnected_components = 0\r\n\r\n# Perform DFS on each unvisited snow drift\r\nfor snow_drift in snow_drifts:\r\n if snow_drift not in visited:\r\n dfs(snow_drift, visited, adjacency_list)\r\n connected_components += 1\r\n\r\n# Output the minimum number of additional snow drifts needed\r\nmin_snow_drifts_needed = connected_components - 1\r\nprint(min_snow_drifts_needed)\r\n", "par = {}\r\ndef find_set(u):\r\n\treturn u if par[u] == u else find_set(par[u])\r\ndef merge_set(u, v):\r\n\tpar[find_set(u)] = find_set(v)\r\n\r\nn = int(input())\r\npoints = []\r\nfor i in range(n):\r\n\tpar[i] = i\r\n\tpoints.append(list(map(int, input().split())))\r\n\r\nfor i in range(n):\r\n\tfor j in range(i):\r\n\t\tif points[i][0] == points[j][0] or points[i][1] == points[j][1]:\r\n\t\t\tmerge_set(i, j)\r\nans = -1\r\nfor i in range(n):\r\n\tif find_set(i) == i:\r\n\t\tans += 1\r\nprint (ans)", "n = int(input())\nvisited = [False] * 1001\nl = []\n \ndef verify(i):\n visited[i] = True\n for j in range(n):\n if not visited[j] and (l[i][0] == l[j][0] or l[i][1] == l[j][1]):\n verify(j)\n \nfor i in range(n):\n tup = tuple(map(int, input().split()))\n l.append(tup)\n \nres = 0\nfor i in range(n):\n if not visited[i]:\n verify(i)\n res += 1\n \nprint (res - 1)\n", "n = int(input())\na = []\nk = [0 for i in range(n)]\nfor i in range(n):\n x, y = [int(i) for i in input().split()]\n a.append((x,y))\ncount=0\nqueue = []\nfor i in range(n):\n if(k[i] == 0):\n queue.append(i)\n k[i] = 1\n count+=1\n while queue:\n node = queue.pop(0)\n for j in range(n):\n if k[j]==1: continue\n if a[node][0] == a[j][0] or a[node][1] == a[j][1]:\n queue.append(j)\n k[j] = 1\nprint(count-1)\n\t\t \t \t\t\t \t\t\t \t\t \t\t\t \t\t\t\t \t\t", "n = int(input())\npoints = []\nfor i in range(n):\n\tpoints.append(list(map(int, input().split()))+[False])\ndef visit(points, point):\n\tpoint[2] = True\n\tx, y = point[0], point[1]\n\tfor point in points:\n\t\tif not point[2] and (point[0] == x or point[1] == y):\n\t\t\tvisit(points, point)\ncount = -1\nfor point in points:\n\tif not point[2]:\n\t\tcount += 1\n\t\tvisit(points, point)\nprint(count)\n", "visited = [False] * 100\r\nx = [0] * 100\r\ny = [0] * 100\r\n\r\n\r\ndef search_path(i):\r\n visited[i] = True\r\n for j in range(n):\r\n if((visited[j] != 1) and ((x[i] == x[j]) or (y[i] == y[j]))):\r\n search_path(j)\r\n\r\n\r\ndef ice_skating(n, i, sum_=0):\r\n if i == n:\r\n print(sum_ - 1)\r\n else:\r\n if not visited[i]:\r\n search_path(i)\r\n sum_ += 1\r\n ice_skating(n, i+1, sum_)\r\n\r\n\r\nn = int(input(\"\"))\r\nfor i in range(n):\r\n x[i], y[i] = map(int, input(\"\").split(\" \"))\r\n\r\nice_skating(n, 0)\r\n", "def dfs(x,y,b1,s):\r\n b1[s]=True\r\n for i in range(n):\r\n if b1[i]==False and (x[s]==x[i] or y[s]==y[i]):\r\n dfs(x,y,b1,i)\r\nn=int(input())\r\nx=[]\r\ny=[]\r\nc=-1\r\nb1=[False]*105;\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x.append(a)\r\n y.append(b)\r\nfor j in range(n):\r\n if b1[j]==False:\r\n dfs(x,y,b1,j)\r\n c=c+1\r\nprint(c)\r\n", "# author: ankan2526\r\n\r\nimport math, bisect, heapq, random, sys, itertools\r\n#sys.setrecursionlimit(10**6)\r\ninput = sys.stdin.readline\r\n \r\ndef gprint(t,ans=''): print(f\"Case #{t+1}:\",ans)\r\nints = lambda : list(map(int,input().split()))\r\nalpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\np2 = [1]\r\n#for i in range(70):p2.append(p2[-1]*2)\r\np = 10**20+7\r\nfact = [1]\r\nANS=[]\r\n\r\nn = int(input())\r\ngraph = [[] for i in range(n)]\r\npts = [ints() for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if pts[i][0]==pts[j][0] or pts[i][1]==pts[j][1]:\r\n graph[i].append(j)\r\n graph[j].append(i)\r\n\r\nvisited = [0]*n\r\nans = -1\r\nfor i in range(n):\r\n if visited[i]==0:\r\n visited[i]=1\r\n ans+=1\r\n queue = [i]\r\n while queue:\r\n q = set()\r\n for j in queue:\r\n for k in graph[j]:\r\n if visited[k]==0:\r\n visited[k]=1\r\n q.add(k)\r\n queue = q\r\n\r\nprint(ans)\r\n" ]

[ "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\nl = 0\nwhile n >= a or n >= b:\n if n >= b and b - c < a:\n nl1 = (n - b) // (b - c)\n nl2 = n // b\n nl = max(nl1, nl2)\n l += nl\n n -= (b - c) * nl\n else:\n nl = n // a\n l += nl\n n -= a * nl\n\nprint(l)\n", "def process(n, a, b, c):\r\n x = b-c\r\n \"\"\"\r\n either m, l -> m-a, l+1 if m >= a\r\n or m, l -> m-b+c, l+1 if m>=b\r\n \r\n n-x*(b-c) < b <= n-x*(b-c)+(b-c)\r\n \r\n n-b < x*(b-c) <= n-c\r\n \"\"\"\r\n if a < b-c or n < b:\r\n answer = n//a\r\n else:\r\n x1 = (n-c)//(b-c)\r\n x = None\r\n for x2 in [x1-2, x1-1, x1, x1+1, x1+2]:\r\n if n-x2*(b-c) < b <= n-(x2-1)*(b-c):\r\n x = x2\r\n break \r\n assert x is not None\r\n answer = x\r\n n-=x*(b-c)\r\n answer+=n//a\r\n print(answer)\r\n return\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nprocess(n, a, b, c)", "import collections\r\nimport math\r\n\r\ndef is_prime(x): \r\n for i in range(2, math.ceil(math.sqrt(x))):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nans = 0\r\nif b - c < a:\r\n if b < n:\r\n ans += (n - b) // (b - c)\r\n n = b + (n - b) % (b - c)\r\n while n >= b:\r\n ans += n // b\r\n n = n % b + n // b * c\r\nans += n // a\r\nprint(ans)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nz=0\r\nif b-c<a and n>c:\r\n z=(n-c)//(b-c)\r\n n-=z*(b-c)\r\nz+=n//a\r\nprint(z)", "get = [int(input()) for i in range(4)]\r\nn, a, b, c = get\r\ncost = min(a, b - c)\r\n\r\nif cost == a:\r\n ans = n // cost\r\nelse:\r\n ans = 0\r\n n = n - c\r\n if n > 0:\r\n ans = n // cost\r\n n -= ans * cost\r\n n += c\r\n ans += n // a\r\n\r\nprint(ans)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nglass = (1 + (n-b)//(b-c)) + (n - (1 + (n-b)//(b-c))*(b-c))//a if n >= b else 0\r\nprint(max(n//a, glass))\r\n\r\n# 100\r\n# 20\r\n# 80\r\n# 65", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\n\nif a > (b - c):\n\tx = ((n - b) // (b - c))\n\tif x < 0:\n\t\tx = n // a\n\t\tprint(x)\n\telse:\n\t\tn -= (x + 1) * (b - c)\n\t\tx += 1\n\t\tx += n // a\n\t\tprint(x)\nelse:\n\tx = (n // a)\n\tprint(x)\n", "from sys import stdin, stdout\r\n\r\nimport sys\r\nimport random\r\nimport datetime\r\n\r\nDEBUG = True\r\nendl = '\\n'\r\n\r\nclass Scan():\r\n def __init__(self):\r\n self.read = stdin.read\r\n self.input = stdin.readline\r\n\r\n def integer(self, count=1):\r\n if count == 1:\r\n return self._integer()\r\n return [self._integer() for _ in range(count)]\r\n\r\n def _integer(self):\r\n sym: str = self.read(1)\r\n while sym != '-' and not sym.isdigit():\r\n sym = self.read(1)\r\n \r\n number, sign = (0, -1) if sym == '-' else (int(sym), 1)\r\n sym: str = self.read(1)\r\n while sym.isdigit():\r\n number = number * 10 + int(sym)\r\n sym = self.read(1)\r\n \r\n return number * sign\r\n \r\n def array(self, func=int, sep=' '):\r\n if func == str:\r\n return input().split(sep)\r\n return list(map(func, input().split(sep)))\r\n\r\n def string(self, count=1):\r\n if count == 1:\r\n return self._string()\r\n return [self._string() for _ in range(count)]\r\n\r\n def _string(self):\r\n sym = self.read(1)\r\n while sym in ('\\n', '\\r', ' '):\r\n sym = self.read(1)\r\n \r\n s = str()\r\n while sym not in ('\\n', '\\r', ' '):\r\n s += sym\r\n sym = self.read(1)\r\n\r\n return s\r\n\r\nclass Write():\r\n def __lshift__(self, other):\r\n stdout.write(str(other))\r\n\r\nclass Number():\r\n def gcd(a, b):\r\n while b > 0:\r\n a, b = b, a % b\r\n return a\r\n \r\n def lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n def sqrt(n):\r\n sqrt_n = int(n ** 0.5)\r\n while sqrt_n * sqrt_n < n:\r\n sqrt_n += 1\r\n\r\n while sqrt_n * sqrt_n > n:\r\n sqrt_n -= 1\r\n\r\n return sqrt_n\r\n \r\n def sum_n(n):\r\n return n * (n + 1) // 2\r\n\r\nclass Constants():\r\n EPS = 10 ** -9\r\n INF = 10 ** 18\r\n MOD = 10 ** 9 + 7\r\n\r\ndef f(m, n, x, b, c):\r\n y = (m - 1) * (b - c)\r\n return n - y - b >= 0 and y + b <= x\r\n\r\ndef calc(n, x, b, c):\r\n l, r = 0, n + 1\r\n while r - l > 1:\r\n m = (l + r) >> 1;\r\n if f(m, n, x, b, c):\r\n l = m\r\n else: \r\n r = m\r\n\r\n return l\r\n\r\ndef solution(scan: Scan, write: Write):\r\n n, a, b, c = scan.integer(4)\r\n x = calc(n, n, b, c)\r\n ans = (n - (b - c) * x) // a + x\r\n ans = max(ans, n // a + calc(n % a, n, b, c))\r\n print(ans)\r\n\r\ndef main():\r\n queries: int = 1\r\n scan, write = Scan(), Write()\r\n #queries = scan.integer()\r\n for _ in range(queries):\r\n solution(scan, write)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, a, b, c = [int(input()) for _ in range(4)]\r\n\r\nif (a <= b - c or n < b):\r\n print(n // a)\r\nelse:\r\n bc = (n - c) // (b - c)\r\n print(bc + (n - bc * (b - c)) // a)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nres = 0\r\nif b - c < a and n > c:\r\n res = (n - c) // (b - c)\r\n n -= res * (b - c)\r\nres += n // a\r\nprint(res)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = b - c\r\ncount = 0\r\nif a <= d or a <= n and b > n:\r\n count = n//a\r\nelif n >= b:\r\n count, _ = divmod(n-c, d)\r\n count += (n-count*d)//a\r\nprint(count)\r\n", "n, a, b, c = int(input()), int(input()), int(input()), int(input())\r\nans = n // a\r\nif n >= b:\r\n ans = max(ans, (n - b) // (b - c) + 1 + ((n - b) % (b - c) + c) // min(b, a))\r\nif n >= a + b:\r\n ans = max(ans, (n - a - b) // a + 2 + ((n - a - b) % a + c) // min(b, a))\r\n ans = max(ans, (n - a - b) // (b - c) + 2 + ((n - a - b) % (b - c) + c) // min(b, a))\r\nprint(ans)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nltr = 0\r\ncen = b - c\r\nif n >= a or n >= b:\r\n if cen < a and n >= c:\r\n ltr = (n-c)//(b-c)\r\n n -= ltr*(b - c)\r\n\r\nltr += n//a\r\nprint(ltr)", "n,a,b,c = [int(input())for i in range(4)]\r\nnum = 0\r\nif n >= b and b - c < a:\r\n num = (n - b) // (b - c) + 1\r\n n -= (b - c) * num\r\nprint(num + n // a)", "import collections\r\nimport math\r\n\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nans = 0\r\nif b - c < a:\r\n if b < n:\r\n ans += (n - b) // (b - c)\r\n n = b + (n - b) % (b - c)\r\n if b <= n:\r\n ans += n // b\r\n n = n % b + n // b * c\r\nans += n // a\r\nprint(ans)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\nd=b-c\r\n\r\nif a<=d:\r\n print(n//a)\r\n\r\nelse:\r\n lb=0\r\n ub=n\r\n \r\n while ub-lb>1 :\r\n mid=(ub+lb)//2\r\n tmp=n-d*(mid-1)\r\n if tmp>=b :\r\n lb=mid\r\n else :\r\n ub=mid\r\n \r\n ans=lb\r\n n-=d*lb\r\n ans+=n//a\r\n print(ans)\r\n\r\n", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\nk = 0\n\nif (n>=b):\n\tk = (n-b)//(b-c) + 1\n\nprint(max(n//a,k + (n - (b-c)*k)//a ))", "n=(int)(input());\r\na=(int)(input());\r\nb=(int)(input());\r\nc=(int)(input());\r\ncnt=a;\r\ncnt=0;\r\ncnt1=a;\r\ncnt1=(int)(n//a);\r\nif (n<b):\r\n while (n//b>0):\r\n cnt+=n//b;\r\n n-=(n//b)*b-n//b*c;\r\n #print (n,\" \",cnt);\r\n #print(n//a,\" \",cnt,\" \",cnt+n//a);\r\n cnt+=n//a;\r\n print((int)(max(cnt,cnt1)));\r\nelse:\r\n n-=b;\r\n #print(n,\" \",b,\" \",c);\r\n #print(cnt);\r\n cnt+=n//(b-c);\r\n n%=(b-c);\r\n n+=b;\r\n #print((int)(cnt));\r\n while (n//b>0):\r\n cnt+=n//b;\r\n n-=(n//b)*b-n//b*c;\r\n #print (n,\" \",(int)(cnt));\r\n #print(n//a,\" \",cnt,\" \",cnt+n//a);\r\n cnt+=n//a;\r\n print((int)(max(cnt,cnt1)));\r\n", "import math\r\nn=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\ng = max(0, (n-c)//(b-c))\r\nprint(max(n//a, g+(n-g*(b-c))//a))\r\n", "n = int(input()); a = int(input()); b = int(input()); c = int(input()); ans = 0\r\nif (b - c < a and n > c):\r\n ans += (n - c) // (b - c)\r\n n -= ans * (b - c)\r\nans += n // a\r\nprint(ans)", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\nq = max(0, 1+(n-b)//(b-c))\nans = max(n//a, q + (n-(q*(b-c)))//a)\nprint(str(ans))\n", "n,a,b,c=int(input()),int(input()),int(input()),int(input())\r\nplas=a\r\nglas=b-c\r\nif(plas<=glas):\r\n print(int(n//plas))\r\nelse:\r\n if(n>=b):\r\n k=int((n-b)//(b-c))+1\r\n n-=((b-c)*k)\r\n if(n>=0):\r\n print(k+int(n//plas))\r\n else:\r\n print(k)\r\n else:\r\n print(int(n//plas))", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = b - c\r\nansa = n // a\r\nans = 0\r\nif n >= b:\r\n x = (n - b) // d + 1\r\n ans += x\r\n n -= d * x\r\n ans += (n // a)\r\nprint(max(ansa, ans, 0))", "N = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nsolution = 0\r\n\r\nif a >= b - c:\r\n if N >= b:\r\n solution = (N - b) // (b - c) + 1\r\n\r\n solution += (N - solution * (b - c)) // a\r\nelse:\r\n solution = N // a\r\n\r\nprint(solution)", "#!/usr/bin/python\r\n\r\nimport sys\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nif b - c < a:\r\n temp = (n - b) // (b - c)\r\n temp += (n - temp * (b - c)) // b\r\n if temp < 0:\r\n temp = 0\r\n print((n - temp * (b - c)) // a + temp)\r\nelse:\r\n print(n // a)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nans = 0\r\nif c >= n:\r\n ans = n // a\r\nelse:\r\n ans += (n - c) // min(b - c, a) + ((n - c) % min(b - c, a) + c) // a\r\nprint(ans)", "n,a,b,c=[int(input()) for i in range(4)]\r\nans=0\r\nif a<=b-c:\r\n ans=n//a \r\nelse:\r\n if n>=b:\r\n ans=(n-b)//(b-c)\r\n n=(n-b)%(b-c)+b\r\n n-=(b-c)\r\n ans+=1\r\n if a<b:\r\n ans+=n//a\r\nprint(ans)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\ninc = b-c\r\nans = 0\r\nif (a > inc and n>= b):\r\n ans =(n-b) // inc+1 \r\n n -= ans * inc\r\n\r\nans += n//a\r\nprint(ans)", "def solve(a,e,f,g):\r\n ans=0\r\n if a<min(e,f):\r\n ans=0\r\n elif e>f-g and a>=f:\r\n ans+=(a-f)//(f-g)+1\r\n a-=ans*(f-g)\r\n ans+=a//e\r\n return ans\r\n\r\na=int(input())\r\ne=int(input())\r\nf=int(input())\r\ng=int(input())\r\nprint(solve(a,e,f,g))\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif (a <= b - c):\r\n print(n // a)\r\n exit(0)\r\notv = n // (b - c)\r\nrazn = b - c\r\nrazn1 = n - b\r\nif ((razn1 // razn) >= 0):\r\n otv = razn1 // razn + 1\r\nelse:\r\n otv = 0\r\notv += (n - otv * (b - c)) // a\r\nprint(otv)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nlitr =0\r\ncen = b-c\r\nif n>=a or n>=b:\r\n if cen < a and n>=c:\r\n litr = (n-c)//(b-c)\r\n n-=litr*(b-c)\r\nlitr += n//a\r\nprint(litr)\r\n", "[n,a,b,c] = list(map(int,[input() for _ in range(4)]))\ns = 0\nif n > c and a > b - c:\n n -= c\n s += n//(b-c)\n n = n%(b-c) + c\nprint(s+n//a)\n", "budget = int(input())\r\nplastic = int(input())\r\nglass = int(input())\r\nrefund = int(input())\r\n\r\nif glass - refund < plastic:\r\n ans = max((budget - refund) // (glass - refund), 0)\r\n budget -= ans * (glass - refund)\r\n ans += budget // plastic\r\n print(ans)\r\nelse:\r\n print(budget // plastic)", "n,a,b,c = [int(input()) for _ in(1,2,3,4)]\r\nk = max(0,(n-c)//(b-c))\r\nprint(max(n//a, k+(n-k*(b-c))//a))", "from math import ceil\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif a < b - c:\r\n dec = a\r\n fin = a\r\n elfin = b\r\n eldec = b - c\r\nelse:\r\n dec = b - c\r\n fin = b\r\n elfin = a\r\n eldec = a\r\nl = 0\r\nr = 1000000000000000000000\r\nwhile l != r - 1:\r\n c = (r + l) // 2\r\n if n - c * dec < fin:\r\n r = c\r\n else:\r\n l = c\r\nif n - l * dec >= fin:\r\n plus = 1\r\nelse:\r\n plus = 0\r\ncount = l + plus\r\nn -= (l + plus) * dec\r\nl = 0\r\nr = 1000000000000000000\r\nwhile l != r - 1:\r\n c = (r + l) // 2\r\n if n - c * eldec < elfin:\r\n r = c\r\n else:\r\n l = c\r\nif n - l * eldec >= elfin:\r\n plus = 1\r\nelse:\r\n plus = 0\r\ncount += (l + plus)\r\nprint(count)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nif (a <= b - c or n < b):\r\n print(n // a)\r\nelse:\r\n dec = b - c\r\n diff = n - (b - 1)\r\n turns = diff // dec\r\n if (diff % dec != 0):\r\n turns += 1\r\n n -= dec * turns\r\n print(turns + n // a)\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif a<=b-c: print(n//a)\r\nelif n<b: print(n//a)\r\nelse:\r\n print((n-c)//(b-c)+((n-c)%(b-c)+c)//a)" ]

[ "myMap = map(int , input().split())\r\nmyMap = list(myMap)\r\nn , k , sum = myMap[0] , myMap[1] , 0\r\n\r\nfor i in range(n) :\r\n temp = map(int , input().split())\r\n temp = list(temp)\r\n sum+= (temp[1] - temp[0]) + 1\r\nsum = sum%k\r\nif sum !=0 :\r\n sum = k - sum\r\nprint(sum)", "n, k = input().split()\nn=int(n)\nk=int(k)\nseg = 0\nfor i in range(n):\n l, r = input().split()\n l=int(l)\n r=int(r)\n seg+=((r - l) + 1)\n#print(seg)\nq=(k - (seg % k)) % k\nprint(q)\n \t\t\t \t \t \t \t\t \t\t \t\t\t \t\t\t", "n , k = map(int,input().split())\r\nls = []\r\nfor i in range(n):\r\n\tl , r = map(int,input().split())\r\n\tls.append([l,r])\r\nans = 0\r\nfor i in range(n):\r\n\tans+=(ls[i][1]-ls[i][0]+1)\r\nif (ans%k==0):\r\n\tprint(0)\r\nelse:\r\n\tprint((k-ans%k)%k)\r\n", "n,k = map(int, input().split())\r\ns = 0\r\nfor _ in range(n):\r\n a,b = map(int, input().split())\r\n s += b - a + 1\r\nprint(0 if s % k == 0 else (k - s % k) % k)", "ip1 = list(map(int, input().strip().split()))\r\nsz = ip1[0]\r\nk = ip1[1]\r\ncovered = 0\r\nfor i in range(sz):\r\n ip = list(map(int, input().strip().split()))\r\n covered += (ip[1] - ip[0]) + 1\r\nif covered % k == 0:\r\n print(0)\r\nelse:\r\n print(k - (covered % k))", "import sys\r\nimport math\r\nfrom typing import Callable\r\n\r\n\r\ndef main() -> None:\r\n\tread: Callable[[], str] = sys.stdin.readline\r\n\tn, k = (int(i) for i in read().split())\r\n\ttotal_length_covered = 0\r\n\tfor _ in range(n):\r\n\t\tl, r = (int(i) for i in read().split())\r\n\t\ttotal_length_covered += r - l + 1\r\n\r\n\tmultiplier = math.ceil(total_length_covered / k)\r\n\tsteps = k * multiplier - total_length_covered\r\n\tprint(steps)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "def solve():\r\n n, k = map(int, input().split())\r\n x = 0\r\n for _ in range(n):\r\n l, r = map(int, input().split())\r\n x += (r-l) + 1\r\n movs = 0\r\n while x % k != 0: \r\n movs += 1\r\n x+=1\r\n print(movs)\r\n\r\nsolve()", "import math\r\n\r\n\r\ndef findmin(num1, num2):\r\n if num1<num2:\r\n return num1\r\n return num2\r\n\r\n\r\nn, k = input().split()\r\n\r\nn = int(n)\r\nk = int(k)\r\n\r\nsum = 0\r\n\r\nwhile(n):\r\n n -= 1\r\n t1, t2 = input().split()\r\n t1 = int(t1)\r\n t2 = int(t2)\r\n\r\n sum += abs(t1-t2) + 1\r\n\r\nmod = sum % k\r\nif (mod==0):\r\n print(0)\r\nelse:\r\n mul = (int(sum/k)+1)*k-sum\r\n print(mul)\r\n ", "n, k = map(int, input().split())\n\nprint((sum(l - r for l, r in [map(int, input().split()) for i in range(n)]) - n) % k)", "n,k=map(int,input().split())\r\nlst=[]\r\ncovered=0\r\nfor i in range(n):\r\n s,e=map(int,input().split())\r\n covered+=e-s+1\r\ncovered=covered%k\r\nif covered!=0:\r\n covered=k-covered\r\nprint(covered)", "n, k = list(map(int, input().split()))\r\ndiv = 0\r\nfor _ in range(n):\r\n li, ri = list(map(int, input().split()))\r\n div += ri - li + 1 \r\nprint((k - div % k) % k)", "m=0\r\nn,k= map(int, input().split())\r\nfor i in range(0,n):\r\n l,r= map(int, input().split())\r\n m+=r+1-l\r\nif m%k:\r\n m=k-m%k\r\n print(str(m))\r\nelse:\r\n print(0)", "n,k = map(int, input().split())\r\nval = 0\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n val+=r-l+1\r\nif val%k!=0:\r\n print(k-val%k)\r\nelse:\r\n print(0)", "n,k=(input().split(\" \"))\r\nc,z=0,0\r\n\r\nfor i in range(int(n)):\r\n \r\n e,s=(input()).split(\" \")\r\n c+=int(s)-int(e)+1\r\n \r\nif c%int(k)==0:\r\n print(0)\r\nelse:\r\n if c<int(k):\r\n print(int(k)-c)\r\n else:\r\n while True:\r\n c+=1\r\n z+=1\r\n if c%int(k)==0:\r\n print(z)\r\n break\r\n ", "n,k=list(map(int,input().split()))\r\ncovered=0;\r\nfor i in range (n):\r\n start,end=list(map(int,input().split()))\r\n covered+=(end-start)+1\r\n\r\ncovered%=k\r\n\r\nif(covered!=0):\r\n covered =k-covered\r\n\r\nprint(covered) \r\n ", "n, k = map(int, input().split())\r\nsegments = []\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n segments.append([l, r])\r\ns = 0\r\ncount = 0\r\nfor i in range(n):\r\n s += segments[i][1] + 1 - segments[i][0]\r\nif s % k == 0:\r\n print(0)\r\nelse:\r\n while 1:\r\n s += 1\r\n count += 1\r\n if s % k == 0:\r\n print(count)\r\n break", "n,k=map(int,input().split())\r\nrange_number=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n range_number=range_number+(b-a)+1\r\nif range_number%k==0:\r\n print(0) \r\nelse: \r\n print(k-(range_number%k))", "def penguin_segments (k,seg) :\r\n num_integers = 0\r\n for x,y in seg :\r\n num_integers += y-x + 1\r\n\r\n if num_integers%k == 0:\r\n return 0\r\n else:\r\n return k - (num_integers%k)\r\n\r\nn,k = list(map(int,input().split()))\r\nseg = []\r\nfor x in range(n):\r\n inp = list(map(int,input().split()))\r\n seg.append(inp)\r\n\r\nprint (penguin_segments(k,seg))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "#\r\n# Author: eloyhz\r\n# Date: Sep/04/2020\r\n#\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = [int(x) for x in input().split()]\r\n s = 0\r\n for _ in range(n):\r\n l, r = [int(x) for x in input().split()]\r\n s += r - l + 1\r\n print(k - s % k if s % k else 0)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque\r\np = print\r\nr = range\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('YES' if b else 'NO')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn, k = II()\r\nt = 0\r\nfor i in r(n):\r\n a, b = II()\r\n t += (b-a)+1\r\nt%=k\r\nif t:\r\n p(k-t)\r\nelse:\r\n p(0)", "from math import ceil\r\n \r\nn,k = map(int, input().split())\r\nx = 0\r\nfor i in range(n):\r\n r = [int(j) for j in input().split()]\r\n x += r[1]-r[0]+1\r\n \r\nprint((ceil(x/k)*k)-x)", "n, k = list(map(int, input().split()))\r\ntotal = 0\r\nfor _ in range(n):\r\n l, r = list(map(int, input().split()))\r\n total += r - l + 1\r\n\r\nre = total % k\r\nprint((k - re) % k)", "n,k = [int(x) for x in input().split()]\r\n\r\ns=0\r\nfor o in range(n):\r\n x, y = [int(x) for x in input().split()]\r\n s=s+y-x+1\r\nif s%k==0:\r\n print(0)\r\nelse:\r\n print(k-(s%k))", "x = list(map(int, input().split()))\r\nresult = 0\r\nfor i in range(x[0]):\r\n vals = list(map(int, input().split()))\r\n result += vals[1] - vals[0] + 1\r\nprint(x[1] - (result % x[1]) if result % x[1] != 0 else result % x[1])\r\n", "a,b=map(int,input().split())\r\n\r\nc=0\r\nf=[]\r\nfor i in range(a):\r\n x,y =map(int,input().split())\r\n \r\n c+=(y-x+1)\r\n f.append(x)\r\n f.append(y)\r\n\r\n\r\nif c%b==0:\r\n print(0)\r\n\r\nelif c<b:\r\n print(b-c)\r\n \r\n\r\nelif c>b:\r\n w=(((c//b)+1)*b)-c\r\n v=c-((c//b)*b)\r\n t=v\r\n if f[0]!=1:\r\n pass\r\n else:\r\n for i in range(2,len(f),2):\r\n s=f[i]-f[i-1]-1\r\n\r\n if s==0:\r\n continue\r\n else:\r\n v-=s\r\n if v<=0:\r\n break\r\n if v<=0:\r\n print(min([w,t]))\r\n else:\r\n print(w)\r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = [int(x) for x in input().split()]\r\nsumm = 0\r\n\r\nfor _ in range(n):\r\n\tl, r = list(map(int, input().split()))\r\n\tsumm += r-l+1\r\n\r\nif summ % k == 0: print(0)\r\nelse: print((summ//k+1)*k-summ)", "n, k = map(int, input().strip().split())\r\n\r\npairs = [list(map(int, input().split())) for i in range(n)]\r\ncovered = 0\r\nfor p in pairs:\r\n if p[0] == p[1]:\r\n covered += 1\r\n else:\r\n covered += (p[1] - p[0] + 1)\r\n\r\nprint(k - covered % k if covered % k != 0 else covered % k)\r\n", "n,k = map(int,input().split())\nnums = 0\nfor i in range(n):\n l,r = map(int,input().split())\n nums += r-l + 1\nif nums % k == 0 :\n print(0)\nelse :\n print(k-nums%k)", "n, k = map(int, input().split())\r\ncelkovo = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n h = y - x + 1\r\n celkovo += h\r\nprint(-celkovo%k)", "n,k=[int(x) for x in input().split()]\r\ns=0\r\nfor i in range(n):\r\n l,r=[int(x) for x in input().split()]\r\n s+=r-l+1\r\nc=0\r\nif s%k!=0:\r\n c=k-(s%k)\r\nelse:\r\n c=0 \r\nprint(c)\r\n \r\n ", "n,k=map(int,input().split(' '))\r\ncovered = 0\r\nfor i in range(0,n):\r\n l,r=map(int,input().split(' '))\r\n if(l+1==r):\r\n covered = covered + 2\r\n elif(l==r):\r\n covered = covered + 1\r\n else:\r\n covered = covered + r - l + 1\r\n\r\nprint((k-covered % k)%k)", "n,k=[int(x) for x in input().split()]\r\narr=[]\r\nfor i in range(n):\r\n l_r=[int(x) for x in input().split()]\r\n arr.append(l_r)\r\ns=0\r\n \r\nfor i in range(n):\r\n s+=arr[i][1]-arr[i][0]+1 \r\nc=0\r\nif s%k!=0:\r\n c=k-(s%k)\r\nelse:\r\n c=0 \r\nprint(c)\r\n \r\n ", "n,k=map(int, input().split())\r\ns = 0\r\nfor i in range(int(n)):\r\n a,b = map(int , input().split())\r\n s+=(b-a+1)\r\n\r\nif s % k == 0:\r\n print(0)\r\nelse:\r\n c = 0\r\n while s % k != 0:\r\n s += 1\r\n c += 1\r\n print(c) ", "a=input().split()\r\nn=int(a[0])\r\nk=int(a[1])\r\np=0\r\nfor i in range(n):\r\n b=input().split()\r\n p=int(b[1])-int(b[0])+1+p\r\n\r\n\r\nif p%k==0:\r\n print(0)\r\nelse:\r\n s=(k-(p%k))%k\r\n\r\n print(s)", "n,k=map(int,input().split())\r\ncoverd=0\r\nfor i in range (0,n):\r\n start,end=map(int,input().split())\r\n coverd=coverd+(end-start+1)\r\n \r\ncoverd=coverd%k\r\nif (coverd!=0):\r\n coverd=k-coverd\r\n \r\nprint(coverd)", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n c+=(r-l)+1\r\nprint((k-c)%k)", "n,k=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n x,y=list(map(int,input().split()))\r\n sum+=y-x+1\r\n\r\nprint((k-sum%k)%k)", "n,k=list(map(int,input().split(\" \")))\r\ns=[None]*n\r\ncnt=0\r\nfor i in range(n):\r\n s[i]=list(map(int,input().split(\" \")))\r\n cnt+=s[i][1]-s[i][0]+1\r\ni=0\r\nwhile(True):\r\n if(cnt%k==0):\r\n break\r\n cnt+=1\r\n i+=1\r\nprint(i)", "n, k = map(int, input().split())\r\ncovered = 0\r\n\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n covered += (r - l + 1)\r\n\r\nprint(0 if not(covered % k) else k - (covered % k))\r\n", "n,k=map(int,input().split())\r\nL={\"\"}\r\nfor i in range(n):\r\n m,f=input().split()\r\n for i in range (int(m),int(f)+1):\r\n L |= {i}\r\nL.remove(\"\")\r\nx=len(L)\r\ni=0\r\nwhile x%k!=0:\r\n x+=1\r\n i+=1\r\nprint(i)", "n, k = map(int, input().split(\" \"))\r\nresult = 0\r\nfor _ in range(n):\r\n left, right = map(int, input().split(\" \"))\r\n result += right - left + 1\r\nif result % k == 0:\r\n print(0)\r\nelse:\r\n print(k - result % k)\r\n", "n, m = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n ans +=y-x\r\n\r\nans+=n\r\nif ans%m==0:\r\n print(0)\r\nelse:\r\n print(m-(ans%m))", "N,k=input().split()\nN=int(N)\nk=int(k)\nx=0\nfor i in range(N):\n A,B=input().split()\n A=int(A)\n B=int(B)\n x+=(max(A,B)-min(A,B)+1)\n\nanswer=(x%k)\nif(answer!=0):\n answer=k-answer\n\nprint(answer)\n", "n, k = map(int, input().split())\nx = 0\n\nfor _ in range(n):\n l, r = map(int, input().split())\n x += r - l + 1\n\nif x % k == 0:\n print(0)\nelse:\n print(k - (x % k))\n", "q=0\r\nn,k=map(int,input().split())\r\nfor i in range(n): \r\n a,b=map(int,input().split())\r\n q=(b-a+1)+q \r\nif q%k==0:\r\n print(0)\r\nelse:\r\n print(k-(q%k))\r\n #no of elements remaining\r\n ", "# A. Police Recruits\r\nn, k = map(int, input().split())\r\nres = 0\r\nfor i in range(n):\r\n start, end = map(int, input().split())\r\n res += end - start + 1\r\nprint(0 if not res%k else k - res%k)\r\n", "n, m = map(int, input().split())\ntot = sum(map(lambda x: x[1] - x[0] + 1, [[int(x) for x in input().split()] for i in range(n)]))\nprint ((m - tot % m) % m)\n", "n, k = map(int, input().split())\r\ntotal = 0\r\nfor _ in range(n):\r\n l,r = map(int, input().split())\r\n total += abs(r - l + 1)\r\nif total % k == 0:\r\n print(0)\r\nelse:\r\n c = 0\r\n while total % k != 0:\r\n total += 1\r\n c += 1\r\n print(c)\r\n", "n, k = [int(i) for i in input().split()]\r\npairs = set()\r\nfor _ in range(n):\r\n pairs.add(tuple(int(i) for i in input().split()))\r\n\r\ncol_x = 0\r\nfor i in pairs:\r\n col_x += i[1] - i[0] + 1\r\n\r\nif col_x % k == 0:\r\n print(0)\r\n\r\nelse:\r\n print(k - col_x % k)", "n,k=map(int,input().split())\r\nseto=set()\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n for j in range(l,r+1):\r\n seto.add(j)\r\n\r\nprint(k-len(seto)%k)if(len(seto)%k!=0)else print(0)", "n,k = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n put = input().split()\r\n l.append(put)\r\n\r\ns = 0\r\nfor i in l:\r\n s += (int(i[1]) - int(i[0]))+1\r\nif s%k == 0:\r\n print(0)\r\nelse:\r\n print(k-s%k)", "n,k = map(int,input().split())\ncovered = 0\nfor i in range(n):\n start,end = map(int,input().split())\n covered += end - start +1\n\nif covered % k == 0 :\n print(0)\nelse :\n print((((covered // k)+1) *k) - covered)", "n, k = map(int, input().split())\r\ncovered = 0\r\n\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n covered += (r - l + 1)\r\n\r\nprint((k - (covered % k)) % k)\r\n", "def main():\r\n # your code goes here\r\n pass\r\n N= list(map(int,input().split()))\r\n covered = 0\r\n for x in range(N[0]):\r\n Temp = list(map(int,input().split()))\r\n covered += (Temp[-1]-Temp[0]+1)\r\n moves = (N[-1]-(covered % N[-1])) % N[-1]\r\n print(moves)\r\n \r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "segmentsNumber, k = tuple(map(int, input().split()))\r\n\r\nsum = 0\r\n\r\nfor _ in range(segmentsNumber):\r\n left, right = tuple(map(int, input().split()))\r\n sum += right - left + 1\r\n\r\nprint((k - (sum % k)) % k)", "def check(s1, s2):\r\n return True if s2[0] > s1[1] else False\r\n\r\ndef sm(s):\r\n if s[0] == s[1]:\r\n return 1\r\n else:\r\n return abs(s[1] - s[0]) + 1\r\n\r\nn, k = list(map(int, input().split(\" \")))\r\nt = n\r\narr = []\r\nwhile t > 0:\r\n t -= 1\r\n arr.append(list(map(int, input().split(\" \"))))\r\ncount = 0\r\nfor i in arr:\r\n count += sm(i)\r\n\r\nif count % k == 0:\r\n print(0)\r\nelse:\r\n print((k - (count % k)))\r\n", "SUMM = 0\r\ndef solve():\r\n\tglobal SUMM\r\n\trang = list(map(int, input().split()))\r\n\tval = rang[1] - rang[0] + 1\r\n\tSUMM += val\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\nfor _ in range(n):\r\n\tsolve()\r\n\r\nans = 0\r\nwhile True:\r\n\tif (SUMM + ans) % k == 0:\r\n\t\tprint(ans)\r\n\t\tbreak\r\n\tans += 1", "s = [int(s) for s in input().split()]\r\nd = []\r\ntotal = 0\r\ntotal_init = 0\r\nfor i in range(s[0]):\r\n d.append([int(d) for d in input().split()])\r\nfor i in d:\r\n total += i[1] - i[0] + 1\r\ntotal_init = total\r\nif total % s[1] == 0:\r\n print(0)\r\nelse:\r\n while total % s[1] != 0:\r\n total += 1\r\n print(total - total_init)", "from math import ceil\r\n\r\nn, k = map(int, input().split())\r\n\r\nsuma = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n suma += (r - l + 1)\r\n\r\nfactor = ceil(suma / k)\r\nans = factor * k - suma\r\nprint(ans)", "\r\nimport sys\r\nimport math\r\n \r\nn, k = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nvsum = 0\r\nfor i in range(n):\r\n l, r = [int(x) for x in (sys.stdin.readline()).split()]\r\n vsum += (r - l + 1)\r\n \r\nif(vsum % k == 0):\r\n print(0)\r\nelse:\r\n print(k - (vsum % k))\r\n ", "n, k = map(int, input().split())\r\nseg = []\r\nx = 0\r\nkk = k\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n seg.append([l, r])\r\nfor i in seg:\r\n x += i[-1] - i[0] + 1\r\nwhile kk < x:\r\n kk += k\r\nprint(kk - x)", "a,b = map(int, input().split())\r\nc = 0\r\n\r\nfor i in range(a):\r\n d,e = map(int, input().split())\r\n c += (e-d+1)\r\n\r\nif not(c%b):\r\n print(0)\r\nelse:\r\n print((b-(c%b))%b)", "\r\nn , k = map(int,input().split())\r\n\r\nl2 = []\r\nfor i in range(n):\r\n l ,r = map(int,input().split())\r\n l2.append(r - l + 1)\r\n\r\nsm = sum(l2)\r\nr = 0\r\nwhile sm % k != 0 :\r\n sm +=1\r\n r +=1\r\n\r\nprint(r)", "n, k = map(int, input().split())\r\nres = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n res += r - l + 1\r\nprint((k - res % k) % k)\r\n", "import math\r\nimport sys\r\n#!pip install numpy\r\n\r\n#import numpy as np \r\n\r\ne1,e=input().split()\r\n\r\nv=0\r\nfor i in range(int(e1)):\r\n n=input().split()\r\n v=v+(int(n[1])-int(n[0]))+1\r\n\r\nif(v%int(e)):\r\n print(int(e)-v%int(e))\r\nelse:\r\n print(v%int(e))", "n,k=(input().split(\" \"))\r\nc,z,n,k=0,0,int(n),int(k)\r\nfor i in range(n):\r\n \r\n e,s=(input()).split(\" \")\r\n c+=int(s)-int(e)+1\r\n \r\n\r\nwhile c % k !=0 :\r\n c+=1\r\n z+=1\r\nprint(z)\r\n", "n, k = map(int, input().split())\r\nc = 0\r\nm = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n c += r-l+1\r\nwhile(c%k>0):\r\n c+=1\r\n m += 1\r\nprint(m)", "def main():\r\n n, k = map(int, input().split())\r\n count = 0\r\n for _ in range(n):\r\n a, b = map(int, input().split())\r\n count += b - a + 1\r\n\r\n moves = (k - (count % k)) % k\r\n print(moves)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\r\n\r\nn , k = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n x , y = map(int,input().split())\r\n coc = y - x + 1\r\n a.append(coc)\r\n\r\nif sum(a) % k == 0 :\r\n print('0')\r\n\r\nelse:\r\n print(k - (sum(a) % k ))\r\n\r\n", "from sys import stdin ,stdout \r\ninput=stdin.readline \r\ninp = lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\na,b=inp()\r\nn=0\r\nfor i in range(a):\r\n c,d=inp()\r\n if c==d:\r\n n+=1\r\n elif d-c==1:\r\n n+=2\r\n elif d > c:\r\n n+=(d-c)+1\r\nm=n%b\r\nif m > 0:\r\n print(abs(m-b))\r\nelse:\r\n print(m)", "n,k = map(int,input().split())\r\ncovered = 0 \r\nfor i in range(n):\r\n start,end = map(int,input().split())\r\n covered += end-start+1\r\nprint((k-(covered%k))%k)\r\n", "n,x = map(int,input().split())\r\ncoverd=0\r\nfor i in range(n):\r\n s,e=map(int,input().split())\r\n coverd += (e-s)+1\r\n \r\ncoverd = coverd%x\r\nif (coverd!=0):\r\n coverd= x-coverd\r\n \r\nprint(coverd)", "n,k=map(int,input().split())\r\nL={\"\"}\r\nfor i in range(n):\r\n m,f=input().split()\r\n for i in range (int(m),int(f)+1):\r\n L |= {i}\r\nL.remove(\"\")\r\nx=len(L)\r\nif x%k==0:\r\n print(\"0\")\r\nelse: \r\n print(k-x%k)", "n,k = map(int,input().split())\r\nc= 0\r\nfor i in range(n):\r\n f,s = map(int,input().split())\r\n c+=s-f+1\r\nprint(0 if c%k == 0 else k-(c%k))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 26 16:50:06 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 78 - CF289-DIV2A\r\n\"\"\"\r\n\r\nsz, goal = map(int,input().split())\r\ntrack = 0\r\nans = 0\r\nfor i in range(sz):\r\n l,r = map(int,input().split())\r\n track += r-l+1\r\n\r\nif track%goal == 0:\r\n ans = 0\r\nelse:\r\n ans = goal - track%goal\r\nprint(ans)", "n, k = map(int, input().split())\r\n\r\ntotal = 0\r\nfor i in range(0,n):\r\n l,r = map(int, input().split())\r\n\r\n total+= r-l +1\r\n\r\nmod = total%k\r\nif mod == 0:\r\n print(0)\r\nelse:\r\n print(k-mod)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n n,k= map(int,input().split())\r\n ans = 0\r\n for _ in range(n):\r\n x,y=(map(int,input().split()))\r\n ans += y-x\r\n ans +=n\r\n if((ans)%k== 0):\r\n print(0)\r\n else:\r\n print((ans//k*k+k) - ans)\r\n \r\nif __name__ == '__main__':\r\n main()", "import math\r\nimport string\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n l_r = [[int(i) for i in input().split(\" \")] for j in range(n)]\r\n counter = 0\r\n for i in l_r:\r\n l, r = i\r\n counter += r - l + 1\r\n x = counter % k\r\n if x == 0:\r\n print(0)\r\n else:\r\n print(k - x)\r\n\r\nmain_function()\r\n", "# Wadea #\r\n\r\nn,k = map(int,input().split())\r\nw = 0\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n w += (r-l+1)\r\n\r\nw = w % k\r\nif w == 0:\r\n print(0)\r\nelse:\r\n print(k - w)\r\n", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r██████╗ ██╗██╗ ███████╗██╗ ██╗ ██████╗ ██████╗\r\n██╔══██╗██║██║ ██╔════╝██║ ██║██╔═══██╗██╔══██╗\r\n██║ ██║██║██║ ███████╗███████║██║ ██║██║ ██║\r\n██║ ██║██║██║ ╚════██║██╔══██║██║ ██║██║ ██║\r\n██████╔╝██║███████╗███████║██║ ██║╚██████╔╝██████╔╝\r\n╚═════╝ ╚═╝╚══════╝╚══════╝╚═╝ ╚═╝ ╚═════╝ ╚═════╝\r\n\"\"\"\r\nn, k = map(int, input().split())\r\nb = 0\r\nfor i in range(n):\r\n\tx, y = map(int ,input().split())\r\n\tb += y - x\na = 0\r\nb += n\r\nwhile b % k != 0:\r\n\tb += 1\r\n\ta += 1\r\nprint(a)\n", "import math\r\n\r\nn,k = map(int,input().split())\r\nval_s = 0\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n val_s += r - l + 1\r\n\r\nprint(k * math.ceil(val_s/k) - val_s)", "n,h = list(map(int,input().strip().split()))\nval = 0\nfor i in range(n):\n\tl,r = list(map(int,input().strip().split()))\n\tif(l==r):\n\t\tl=r\n\tval+=(r-l+1)\n\nmov = 0\nwhile(not val%h==0):\n\tval+=1\n\tmov+=1\n\n\nprint(mov)", "def segments():\r\n n, k = map(int, input().split())\r\n x = 0\r\n movements = 0\r\n for i in range(n):\r\n l,r = map(int, input().split())\r\n x += (r - l + 1)\r\n if x % k == 0:\r\n return movements\r\n elif x < k:\r\n return k-x\r\n else:\r\n while True:\r\n x += 1\r\n movements += 1\r\n if x %k == 0:\r\n return movements\r\nprint(segments())", "n, k = map(int, input().split())\r\n\r\nsum = 0\r\nfor i in range(0,n):\r\n l,r = map(int, input().split())\r\n sum += r - l + 1\r\nif (sum % k == 0):\r\n res = sum\r\nelse:\r\n res = (sum // k + 1) * k\r\nprint(res - sum)\r\n\r\n", "import logging\nl = logging.Logger(\"\")\nh = logging.StreamHandler()\nf = logging.Formatter(fmt=\"[{filename}:{lineno}] {msg}\", style=\"{\")\nh.setFormatter(f)\nl.addHandler(h)\nbug=l.info\n\n# To disable uncomment the next line\n# bug = lambda x:None\n\n# teste=(1,2,3,4)\n# bug(f'{teste=}')\n# bug(f'{2*teste=}')\n\n# -------------------------------------------------------------------- #\nn, k = map(int, input().split())\nx = 0\nfor i in range(n):\n s = tuple(map(int, input().split()))\n x += len(range(s[0], s[1] + 1))\n\nprint(k - (x % k) if x % k > 0 else 0)\n\n\t\t\t \t\t \t \t \t \t\t\t", "num_rows,k = map(int, input().split())\r\nres=0\r\nfor row in range(num_rows):\r\n i,j = map(int, input().split())\r\n res += j-i + 1\r\nmoves=0\r\nwhile res%k != 0:\r\n res += 1\r\n moves += 1\r\nprint(moves)\r\n \r\n\r\n\r\n \r\n", "n, k = [int(x) for x in input().split()]\r\nsegments = [[int(x) for x in input().split()] for _ in range(n)]\r\nvalue = lambda x: x[1] - x[0] + 1\r\nseg_value = sum(value(segment) for segment in segments)\r\nreminder = seg_value % k\r\nminimum_number_of_moves = k - (reminder) if reminder else 0 \r\nprint(minimum_number_of_moves)", "n,k = map(int,input().split())\r\narr = []\r\ncnt = 0\r\nfor i in range(n):\r\n a,b =map(int,input().split())\r\n arr.append(a)\r\n arr.append(b)\r\n cnt+=(b-a+1)\r\nm = cnt\r\nif (cnt%k==0):print(0) ; quit()\r\nprint(k-(m%k))", "n,k = map(int,input().split())\r\nsize=0\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n size += (r -l) +1\r\nif size %k==0:\r\n print(0)\r\nelse:\r\n print(k - size%k)\r\n\r\n", "l=list(map(int,input().split()))\r\nn,k=l[0],l[1]\r\ni=0\r\nsum=0\r\nwhile(i<n):\r\n l=list(map(int,input().split()))\r\n l=list(range(l[0],l[1]+1))\r\n sum+=len(l)\r\n i+=1\r\nif(sum%k==0):\r\n print(0)\r\nelse:\r\n print(((sum//k)+1)*k - sum)\r\n \r\n", "import sys\r\nimport math\r\nfrom typing import Callable\r\n\r\n\r\ndef main() -> None:\r\n\tread: Callable[[], str] = sys.stdin.readline\r\n\tn, k = (int(i) for i in read().split())\r\n\ttotal_length_covered = 0\r\n\tfor _ in range(n):\r\n\t\tl, r = (int(i) for i in read().split())\r\n\t\ttotal_length_covered += r - l + 1\r\n\r\n\t# The val we need to return is the difference between k and total_length_covered, because we need to take increase\r\n\t# the interval by that difference so that total_length_covered becomes divisible by k\r\n\t# But Since k can be smaller than the total_length_covered, we need to find the smallest multiple of k\r\n\t# that is greater than total_length_covered\r\n\t# We know that total_length_covered % k returns the remainder, which in other words is how is left after dividing\r\n\t# total_length_covered by k. Then the length remaining for total_length_covered to reach k would have to be\r\n\t# k - (total_length_covered % k)\r\n\t# And to handle the case where total_length_covered % k, we need to % k the result since the number of steps in that\r\n\t# case would have to be 0\r\n\tprint((k - (total_length_covered % k)) % k)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "x = input()\r\nx = x.split()\r\nn = int(x[0])\r\nk = int(x[1])\r\no = 0\r\nc = 0\r\nfor i in range(n):\r\n seg = input()\r\n seg = seg.split()\r\n o += (int(seg[1])-int(seg[0]))+1\r\nwhile True:\r\n if o%k == 0:\r\n break\r\n o+=1\r\n c+=1\r\nprint(c)", "\"\"\"\r\n2 3\r\n1 2\r\n3 4\r\n\r\n\r\n3 7\r\n1 2\r\n3 3\r\n4 7\r\n\r\n\"\"\"\r\nn, k = (int(i) for i in input().split())\r\nsegs = 0\r\nfor i in range(n):\r\n s1, s2 = (int(s) for s in input().split())\r\n segs += s2 - s1 + 1\r\n\r\nresult = segs % k\r\nif result == 0:\r\n print(result)\r\nelse:\r\n result = k - result\r\n print(result)\r\n", "n, k = map(int, input().split())\r\nli = []\r\nres = 0\r\nfor _ in range(n):\r\n\ta, b = map(int, input().split())\r\n\tres += b-a+1\r\n\r\nr = 0\r\nwhile res % k != 0:\r\n\tres += 1\r\n\tr += 1\r\nprint(r)\r\n", "a=input().split(' ')\r\nlista=[]\r\ncontador=0\r\ncontador2=0\r\nfor i in range(0,int(a[0])):\r\n b=input().split(' ')\r\n lista.append(b)\r\nfor j in range(0,len(lista)):\r\n contador+=int(lista[j][0])\r\n contador2+=int(lista[j][1])\r\n\r\nformula=((contador-int(a[0]))-contador2)%int(a[-1])\r\nprint(formula)\r\n\r\n", "def solve(segments, k):\r\n value = sum(segment[1] - segment[0] + 1 for segment in segments)\r\n mult = value // k + (1 if value % k != 0 else 0)\r\n return mult * k - value\r\n\r\n\r\ndef main():\r\n n, k = [int(s) for s in input().split()]\r\n segments = []\r\n for _ in range(n):\r\n segments.append([int(s) for s in input().split()])\r\n print(solve(segments, k))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = list(map(int, input().split()))\r\n\r\np = 0\r\nfor _ in range(n):\r\n l, r = list(map(int, input().split()))\r\n p += r - l + 1\r\n\r\nprint(0) if k%p == 1 else print( (k - (p%k))%k )", "\r\nnum,k = list(map(int, input().split(' ')))\r\ncount = 0\r\nfor i in (range(num)):\r\n rang = list(map(int, input().split(' ')))\r\n count += rang[1]-rang[0]+1\r\ncount= count%k\r\nif( count!=0 ):\r\n count = k-count\r\nprint(count)", "n, k = map(int, input().split())\r\nivs = [ list(map(int, input().split())) for i in range(n)]\r\n\r\nnos = 0\r\nfor i in range(n):\r\n nos += abs(ivs[i][1]-ivs[i][0])+1\r\nif nos%k == 0:\r\n print(0)\r\nelse:\r\n print(k-nos%k)", "n , k = map(int,input().split())\r\ns = 0\r\nfor _ in range(n):\r\n\tl , r = map(int,input().split())\r\n\ts +=r-l+1\r\nt = s%k\r\nif t==0:\r\n\tprint(t)\r\nelse:\r\n\tprint(k-t)\r\n\r\n\r\n", "x=input()\r\nl=x.split(' ')\r\nn=int(l[0])\r\nk=int(l[1])\r\nsum=0\r\nfor i in range(n):\r\n x=input()\r\n l=x.split()\r\n sum+=(int(l[1])-int(l[0])+1)\r\nif sum%k==0:\r\n print(0)\r\nelse:\r\n print(k-(sum%k))\r\n", "n, k = map(int, input().split())\r\nvalue, c = 0, 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n value += r - l + 1\r\nwhile (value % k != 0):\r\n value += 1\r\n c += 1\r\nprint(c)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nc = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n c += b-a+1\r\nprint(k-c%k if c%k != 0 else 0)", "n, k = map(int, input().split())\r\nl = 0\r\nfor i in range(n):\r\n\tx, y = map(int ,input().split())\r\n\tl += y - x\r\nz = 0\r\nl += n\r\nwhile(l % k != 0):\r\n\tl += 1\r\n\tz += 1\r\nprint(z)", "n, k = map(int, input().split())\r\n\r\nset_count = 0\r\nfor i in range(n):\r\n\ta,b = map(int, input().split())\r\n\tset_count+= len(range(a,b+1))\r\n\r\nif set_count%k == 0:\r\n\tprint(0)\r\nelse:\r\n\tprint(k-(set_count%k))", "n , k = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n ans += r-l + 1\r\nif ans % k == 0:\r\n print(0)\r\nelse: print(k - ans%k)", "n,k = map(int, input().split())\r\ncnt = 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n cnt += abs(a-b) +1\r\nif cnt%k == 0: print(0)\r\nelse: print(abs(((cnt//k)+1)*k-cnt))", "n, k = map(int, input().split())\n\nvalue = 0\nfor i in range(n):\n s,t = map(int, input().split())\n\n value += t - s + 1\n\nif value % k == 0:\n print(0)\nelse:\n print(k - (value % k))\n", "n, k = map(int, input().split())\r\nprint((sum(int(l) - int(r) for l, r in [input().split() for i in range(n)]) - n) % k)", "n,k=map(int,input().split())\r\no=0\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n o+=(r-l+1)\r\nif o%k==0:\r\n print(0)\r\nelse:\r\n print(k-(o%k))\r\n \r\n ", "n, k=map(int, input().split())\r\np=0\r\nfor _ in range(n):\r\n\ta, b=map(int, input().split())\r\n\tp+=b-a+1\r\nif p%k==0:\r\n\tprint(0)\r\nelse:\r\n\tl=p\r\n\twhile p%k!=0:\r\n\t\tp+=1\r\n\tprint(p-l)\r\n", "Sum = 0\r\nX = list(map(int, input().split()))\r\nfor i in range(X[0]):\r\n Temp = list(map(int, input().split()))\r\n Sum += Temp[1] - Temp[0] + 1\r\nprint(X[1] - (Sum % X[1]) if Sum % X[1] != 0 else Sum % X[1])\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: So Close man!! Take it easy!!!!\r\n# CodeNumber: 653\r\n", "from sys import *\r\n\r\nN, K = map(int, input().split())\r\n\r\ncur = 0\r\n\r\nfor i in range(N):\r\n l, r = map(int, stdin.readline().split())\r\n cur += (r - l) + 1\r\n\r\nif cur % K == 0:\r\n print(0)\r\n\r\nelse:\r\n print(K - (cur % K))\r\n ", "\r\nn, k = [int(x) for x in input().split()]\r\nseg = 0\r\nfor i in range(n):\r\n s, e = [int(x) for x in input().split()]\r\n seg += len(range(s, e+1))\r\nprint(0 if seg % k == 0 else k-(seg % k))\r\n", "n, k = map(int, input().split())\r\nx = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n x += r - l + 1\r\n\r\nminMoves = 0\r\nwhile x % k != 0: \r\n minMoves += 1\r\n x += 1\r\n\r\nprint(minMoves)\r\n", "def solve():\r\n n,k = map(int, input().split())\r\n z = 0\r\n for i in range(n):\r\n x,y = map(int, input().split())\r\n z+=(y-x+1)\r\n if z%k == 0:\r\n print(0)\r\n else:\r\n print(k-(z%k))\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nHomura = [int(i) for i in input().split()]\r\nn = Homura[0]\r\nk = Homura[1]\r\n\r\ntotal = 0\r\nfor i in range(n):\r\n\tKumiko = [int(i) for i in input().split()]\r\n\ttotal += Kumiko[1] - Kumiko[0] + 1\r\n\r\nr = total%k\r\nif r == 0:\r\n\tprint(0)\r\nelse:\r\n\tprint(k-r)\r\n", "n,k=map(int,input().split())\r\ns=0\r\nfor i in range(n):\r\n L,R=map(int,input().split())\r\n s+=R-L+1\r\nprint((k-s%k)%k)\r\n", "n, k = list(map(int, input().split(\" \")))\r\nans = 0\r\nval = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split(\" \")))\r\n val += (a[1] - a[0] + 1)\r\nwhile val % k != 0:\r\n val += 1\r\n ans += 1\r\nprint(ans)\r\n", "import sys\r\n\r\ndef covered_segments(nsegments):\r\n covered_points = 0\r\n\r\n for i in range(nsegments):\r\n\r\n x, y = map(int, sys.stdin.readline().split())\r\n covered_points += (y - x) + 1\r\n \r\n return covered_points\r\n\r\ndef result(covered_points, k):\r\n if covered_points % k == 0:\r\n return 0\r\n elif k < covered_points:\r\n return k - (covered_points % k)\r\n else:\r\n return k - covered_points\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, sys.stdin.readline().split())\r\n\r\n covered_points = covered_segments(n)\r\n print(result(covered_points, k))", "class CodeforcesTask289ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n_k = []\r\n self.segments = []\r\n\r\n def read_input(self):\r\n self.n_k = [int(x) for x in input().split(\" \")]\r\n for x in range(self.n_k[0]):\r\n self.segments.append([int(x) for x in input().split(\" \")])\r\n\r\n def process_task(self):\r\n curr = 0\r\n for seg in self.segments:\r\n curr += seg[1] - seg[0] + 1\r\n moves = self.n_k[1] - curr % self.n_k[1]\r\n if moves == self.n_k[1]:\r\n moves = 0\r\n self.result = str(moves)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask289ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n,k = map(int,input().split(' '))\r\ncount = 0\r\nwhile n:\r\n n-=1\r\n l, r = map(int,input().split(' '))\r\n count+= r-l+1\r\nprint(0 if count%k==0 else k-count%k )", "\r\n\r\nif __name__ == '__main__':\r\n n,k = map(int,input().split())\r\n sm = 0\r\n for i in range(n):\r\n a,b = map(int,input().split())\r\n sm += b-a+1\r\n if sm%k == 0:\r\n print(0)\r\n else:\r\n print(k-sm%k)\r\n", "I = lambda: map(int, input().split())\r\n\r\nn, k = I()\r\ns = 0\r\n\r\nfor _ in range(n):\r\n L, R = I()\r\n s += R-L+1\r\n\r\nprint((-s%k) % k)", "n, k = map(int, input().split())\r\ncovered= 0\r\nfor i in range(n):\r\n\tl, r = list(map(int, input().split()))\r\n\tcovered += r+1-l\r\nif covered % k == 0 :\r\n\tprint(\"0\")\r\nelse:\r\n\tprint(k - covered % k)\r\n\r\n", "n,k = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n temp = [int(x) for x in input().split()]\r\n ans += (temp[1] - temp[0] + 1)\r\nif ans%k==0:\r\n print(0)\r\nelse:\r\n print(k - ans%k)", " \r\ndef main():\r\n\tn, k = map(int, input().split())\r\n\r\n\tlr = []\r\n\tfor _ in range(n):\r\n\t\tlr.append([int(i) for i in input().split()])\r\n\r\n\tcnt = 0\r\n\tfor i in range(n):\r\n\t\tcnt += lr[i][1] - lr[i][0] + 1\r\n\r\n\tif cnt % k == 0:\r\n\t\tprint(0)\r\n\t\treturn\r\n\r\n\tt = 0\r\n\twhile cnt % k != 0:\r\n\t\tt += 1\r\n\t\tcnt += 1\r\n\r\n\tprint(t)\r\n\r\n \r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n\r\n", "import math\r\nx=input().split(\" \")\r\nga=0\r\nfor i in range(int(x[0])):\r\n z=input().split(\" \")\r\n ga+=int(z[1])-int(z[0])+1\r\n \r\n\r\no=float(ga)/int(x[1]) \r\nif o!=math.floor(o):\r\n o=math.ceil(o)*int(x[1])-ga\r\nelse:\r\n o=0\r\n\r\nprint(o) \r\n", "a,b=map(int,input().split())\r\nz=0\r\nsum1=0\r\nwhile(z<a):\r\n c,d=map(int,input().split())\r\n if(d!=c):\r\n sum1+=1\r\n sum1+=d-c\r\n if(d==c):\r\n sum1+=1\r\n z+=1\r\nif(sum1%b==0):\r\n print(0)\r\nelse:\r\n\r\n print(b-(sum1%b)) ", "n,k = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append([int(x) for x in input().split()])\r\nc = 0\r\nfor i in l:\r\n c+= max(i)-min(i)+1\r\nprint((k-c)%k)", "n, k = map(int, input().split())\r\n\r\nsumm=0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n summ += b-a+1\r\n \r\nprint((k-(summ%k))%k)", "n, k = map(int, input().split())\r\npairs = []\r\nsum = 0\r\ncount = 0\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n sum += b - a + 1\r\n\r\n dif = b - a + 1\r\n if dif != 0 and dif != 1 and dif >= k:\r\n count += 1\r\n\r\nif sum % k == 0:\r\n print(0)\r\n exit()\r\none = sum % k\r\nif count <= one:\r\n print(k - one)\r\nelse:\r\n print(min(k - one, one))\r\n", "n, k = map(int, input().split())\r\n\r\nsum = 0\r\nwhile n > 0:\r\n a, b = map(int, input().split())\r\n n -= 1\r\n sum += b - a + 1\r\n\r\nprint((k - sum % k) % k)", "# 78\r\nx,y=list(map(int,input().split()))\r\nc=0\r\nr=0\r\nfor i in range (x):\r\n a,b=map(int,input().split())\r\n c+=b-a+1\r\nr=c%y\r\n\r\nif (r != 0):\r\n r=y-r \r\n \r\nprint(r)\r\n \r\n", "N , K = [int(i) for i in input().split()]\r\nC0 = 0\r\nC = 0\r\nfor i in range(N):\r\n S0 , S1 = [int(i) for i in input().split()]\r\n C0 += S1 - S0 + 1\r\nwhile C0 % K != 0:\r\n C0 += 1 \r\n C += 1\r\nprint(C)", "\r\nn , k = map(int,input().split())\r\nb = 0\r\nfor i in range(n):\r\n x , y = map(int,input().split())\r\n b += y - x\r\n\r\na = 0\r\nb+=n\r\n\r\nwhile b % k != 0 :\r\n b +=1\r\n a+=1\r\n\r\nprint(a)\r\n\r\n\r\n\r\n", "n,k=list(map(int,input().split(\" \")))\r\nseg=[]\r\nfor i in range(n):\r\n seg.append(list(map(int,input().split(\" \"))))\r\ncoverd=0\r\nfor i in seg:\r\n coverd+=i[1]-i[0]+1\r\nprint(k-(coverd%k) if coverd%k!=0 else 0)\r\n", "n, k = [int(x) for x in input().split()]\r\n\r\ns = 0\r\nfor _ in range(n):\r\n r, l = [int(x) for x in input().split()]\r\n s += (l-r) + 1\r\n\r\nprint((k-(s % k)) % k)\r\n", "n, k = map(int, input().split())\r\n\r\nvalue = 0\r\n\r\npositions = {} \r\n\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n value += r-l+1\r\n \r\nprint((((value+k)-(value+k)%k)-value)%k)", "\r\nn, k = map(int, input().split())\r\ndiff = 0\r\nfor _ in range(n):\r\n\tstart, end = map(int, input().split())\r\n\tdiff += end - start + 1\r\n\r\nif diff % k == 0:\r\n\tprint(0)\r\nelse:\r\n\tprint(k - diff % k)", "n, k = map(int, input().split())\r\ns = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n s += len(range(a, b + 1))\r\n\r\nif s % k == 0:\r\n print(0)\r\nelse:\r\n print((k * (int(s / k) + 1)) - s)", "x = list(map(int, input().split()))\r\ncoverage = 0\r\nfor i in range(x[0]):\r\n segment = list(map(int, input().split()))\r\n coverage += segment[1] - segment[0] + 1\r\n\r\ncoverage = coverage % x[1]\r\nif coverage == 0:\r\n print(0)\r\n exit()\r\nprint(x[1] - coverage)", "def yzd_solution():\r\n n, k = map(int, input().split())\r\n\r\n sum = 0\r\n\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n sum += (r-l)+ 1\r\n\r\n if (sum % k == 0): \r\n return \"0\" \r\n else:\r\n counter = 0\r\n while (sum + counter) % k != 0:\r\n counter += 1\r\n return counter\r\n \r\n\r\nprint(yzd_solution())", "n, k=map(int, input().split())\r\nnumsOfSets=[n]\r\ncoverd=0\r\nfor i in range(n):\r\n l ,r=map(int, input().split())\r\n coverd+=(r-l)+1\r\nif(coverd%k==0):\r\n print(0)\r\nelse:\r\n print(k-coverd%k) \r\n \r\n\r\n\r\n", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(a):\r\n z,x=map(int,input().split())\r\n c+=x-z+1\r\nif c%b:\r\n print(b-(c%b))\r\nelse:\r\n print(0)", "n,k = [int(i) for i in input().split()]\r\ntotal = 0\r\nfor x in range(n):\r\n l,r = [int(i) for i in input().split()]\r\n total = total+(abs(l-r)+1)\r\ncount = 0\r\nwhile total%k!=0:\r\n total+=1\r\n count+=1\r\n\r\nprint(count)\r\n", "n, k = map( int, input().strip().split() )\r\n\r\nl = list()\r\nr = list()\r\ns = 0\r\nres = 0\r\nfor i in range( n ):\r\n x, y = map( int, input().strip().split() )\r\n if (x == y):\r\n s += 1\r\n elif (abs( x - y ) == 1):\r\n s += 2\r\n else:\r\n s += abs( x - y ) + 1\r\n\r\nwhile s%k != 0 :\r\n s+=1\r\n res+=1\r\n\r\nprint (res)", "# all those moments will be lost in time , like tears in rain \r\nn , k = map(int , input().split()) \r\nsmm = 0\r\nfor i in range(n) : \r\n l = list(map(int , input().split()))\r\n smm += l[1] -l[0] + 1 \r\nres = k - (smm % k) \r\nif res == k :\r\n print(0)\r\nelse:\r\n print(res)\r\n", "import math\r\nnum,k = list(map(int, input().split(' ')))\r\ncount = 0\r\nfor i in (range(num)):\r\n rang = list(map(int, input().split(' ')))\r\n count += rang[1]-rang[0]+1\r\n\r\ncount = k* math.ceil(count/k) - count\r\nprint(count)", "n, k = map(int, input().split())\r\nans = 0\r\nfor _ in range(n):\r\n\ta, b = map(int, input().split())\r\n\tans += b - a + 1\r\n#print(ans)\r\nif ans % k == 0: print(0)\r\nelse: print(k - ans % k)", "n, k = map(int, input().split())\r\n\r\ndistance = 0\r\narr = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n distance += b - a + 1\r\n\r\n\r\nif distance % k == 0:\r\n print(0)\r\nelse:\r\n mul = distance // k\r\n print(k - (distance % k))", "from math import ceil\r\n\r\nn,k = map(int, input().split())\r\nc = 0\r\nfor i in range(n):\r\n r = [int(j) for j in input().split()]\r\n c += r[1]-r[0]+1\r\n\r\nprint((ceil(c/k)*k)-c)", "n, k = map(int, input().split())\r\nres = 0\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n res += r - l + 1\r\nif res % k == 0:\r\n print(0)\r\nelse:\r\n print(k - res % k)\r\n", "n, k = map(int, input().split())\r\n\r\ncurrent = 0\r\n\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n current += (r - l) + 1\r\n\r\nif current % k == 0:\r\n print(0)\r\nelse:\r\n print(k - (current % k))", "from sys import stdin, stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor i in range(1):#nmbr()):\r\n n,c=lst()\r\n ans=0\r\n for i in range(n):\r\n a,b=lst()\r\n ans+=b-a+1\r\n if ans%c==0:print(0);continue\r\n next=ans//c*c+c\r\n print(next-ans)", "n,x=map(int,input().rstrip().split());summ=0;count=0\r\nfor _ in range(n):\r\n l,r=map(int,input().rstrip().split());summ+=(r-l)+1\r\nwhile summ%x!=0:count+=1;summ+=1\r\nprint(count)", "from math import factorial\r\n\r\nn, k = [int(x) for x in input().split(\" \")]\r\nanswer, s = 0, 0\r\nmin_l, prev_l = 9999999999999, -10\r\ns_left = 0\r\nfor i in range(n):\r\n l, r = [int(x) for x in input().split(\" \")]\r\n if l < min_l:\r\n min_l = l\r\n s += r - l + 1\r\n if prev_l != -10:\r\n s_left += l - prev_l - 1\r\n prev_l = r\r\ns_left += min_l - 1\r\nif s % k == 0:\r\n print(0)\r\nelse:\r\n s1, s2, c1 = s, s, 0\r\n while s1 % k != 0 and s2 % k != 0:\r\n s1 += 1\r\n if s_left > 0:\r\n s2 -= 1\r\n s_left -= 1\r\n c1 += 1\r\n print(c1)\r\n", "n,k = map(int,input().split())\r\nt = 0\r\nfor i in range(n):\r\n\tli,ri = map(int,input().split())\r\n\tt = t + (ri-li+1)\r\nif t%k == 0:\r\n\tprint(0)\r\n\texit()\r\nprint(k-t%k)", "n , k = [int(i) for i in input().split()]\r\n \r\nx = 0\r\nfor i in range(n):\r\n s = [int(j) for j in input().split()]\r\n x += s[1] - s[0] + 1\r\n \r\nprint(-x % k)", "n,k=map(int,input().split())\r\narr=[]\r\nc=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c=c+b-a+1\r\n\r\nif c%k==0:\r\n print(0)\r\nelse:\r\n print(k-c%k)", "n,k=map(int,input().split())\r\nvalue=0\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n diff=r-l+1\r\n value+=diff\r\nif value%k==0: print('0')\r\nelse :\r\n print((value//k+1)*k-value)\r\n", "#اللهم صل على نبينا محمد\r\ni,n=input().split()\r\ni,n=int(i),int(n)\r\ncount=0\r\ncount2=0\r\nfor i in range(i):\r\n j,k=input().split()\r\n j,k=int(j),int(k)\r\n count=count+(k-j+1)\r\nistrue= True\r\nif count%n==0:\r\n print(0)\r\n exit(0)\r\nwhile istrue:\r\n if count%n!=0:\r\n count+=1\r\n count2+=1\r\n else: break\r\nprint(count2) \r\n", "n, k = map(int, input().split())\r\nvalue, c = 0, 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n value += r - l + 1\r\nc = value % k\r\nif (c != 0):\r\n c=k-c\r\n\r\nprint(c)\r\n", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Polo the Penguin and Segments\"\r\n# Class: A\r\n\r\nfrom math import ceil\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, k = list(map(int, input().split()))\r\n Sum = 0\r\n for _ in range(n):\r\n l, r = list(map(int, input().split()))\r\n Sum+=(r-l+1)\r\n \r\n print(ceil(Sum/k)*k-Sum)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "a,b=map(int,input().split())\r\ns=0\r\nfor i in range(a):\r\n l,r=map(int,input().split())\r\n s=(s+r-l+1)%b\r\nprint((b-s)%b)", "n, k = map(int, input().split())\r\nans = 0\r\n\r\nfor _ in range(n):\r\n i, j = map(int, input().split())\r\n ans += (j-i+1)\r\n\r\nif not(ans%k):\r\n print(0)\r\nelse:\r\n print((k-(ans%k))%k)\r\n", "n, k = map(int, input().split())\r\ns = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n s += l - r\r\nprint((s - n) % k)", "def min_moves_to_divisible(n, k, segments):\r\n total_segments = 0\r\n for li, ri in segments:\r\n total_segments += (ri - li + 1)\r\n\r\n remainder = total_segments % k\r\n return (k - remainder) % k\r\n\r\nn, k = map(int, input().split())\r\nsegments = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nresult = min_moves_to_divisible(n, k, segments)\r\nprint(result)", "n, k = map(int, input().split())\np = 0\nfor i in range(n):\n l, r = map(int, input().split())\n p += r - l + 1\nif p == 1: print(k - 1)\nelse :print(0 if not(k % p) else (k - (p % k)) % k)", "n, k = [int(x) for x in input().split()]\ns = 0\nfor i in range(n):\n\tl, r = [int(x) for x in input().split()]\n\ts += r - l + 1\nprint((k - s % k) % k)\n", "n, t = map(int, input().split())\r\nres = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n res += r - l + 1\r\nif res % t == 0:\r\n print(0)\r\nelse:\r\n print(t - (res % t))", "n,k = map(int,input().split())\r\nln = 0\r\nfor x in range(n) : \r\n l,r=map(int,input().split())\r\n ln+=len(range(l,r+1))\r\nres=k-(ln%k)\r\nif res==k :\r\n print(0)\r\nelse : \r\n print(res)\r\n", "n, k = list( map(int, input().split()) )\r\nx = 0\r\n\r\nfor _ in range(n):\r\n l, r = list( map(int, input().split()) )\r\n x += (r-l)+1\r\n\r\nif x%k == 0:\r\n print(0)\r\nelse:\r\n print(k - x%k)\r\n", "from sys import stdin\r\nn,k=map(int,stdin.readline().split())\r\nans=0\r\nfor i in range(n):\r\n l,r=map(int,stdin.readline().split())\r\n p=r-l+1\r\n ans+=p\r\nr=ans%k\r\nif r==0:\r\n print(0)\r\nelse:\r\n print(k-r)", "n, k = map(int, input().split())\r\nc = 0\r\ns = list()\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n s.append(y-x+1)\r\nz = sum(s)\r\nwhile 1:\r\n if z % k == 0:\r\n print(c)\r\n exit()\r\n else:\r\n z += 1\r\n c += 1", "n,k=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\narr1=[] \r\nsumm=0\r\nfor i in arr:\r\n if i[0] in arr1 and i[1] in arr1 and i[1]!=i[0]:\r\n summ+=i[1]-i[0]-1\r\n elif i[0] in arr1 or i[1] in arr1:\r\n summ+=i[1]-i[0]\r\n else:\r\n summ+=(i[1]-i[0])+1\r\nx=summ\r\nif summ%k==0:\r\n print(0)\r\nelse:\r\n while True:\r\n if summ%k==0:\r\n print(summ-x)\r\n break\r\n summ+=1\r\n \r\n ", "n , k = map(int,input().split())\r\na = []\r\n\r\nfor i in range(n):\r\n l ,r = map(int,input().split())\r\n d = r - l + 1\r\n a.append(d)\r\n\r\nif sum(a) % k == 0 :\r\n print(0)\r\n exit()\r\nelse:\r\n print(k - sum(a)%k)\r\n exit()\r\n\r\n\r\n\r\n", "n, k = [int(x) for x in input().split()]\r\ns = 0\r\nfor i in range(n):\r\n\tl, r = [int(x) for x in input().split()]\r\n\ts += r - l + 1\r\nprint((k - s % k) % k)", "n, k = map(int,input().split())\r\n\r\n# Segements are disjoint\r\nval = 0\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n val += r-l+1\r\n\r\nprint((k - val%k)%k)" ]

[ "n = int(input())\r\ncells = input()\r\nif cells.find('0') == -1:\r\n print(n)\r\nelse:\r\n before = int(cells[::-1], 2)\r\n after = before + 1\r\n print(str(bin(before ^ after)).count('1'))\r\n", "n = int(input())\r\ns = (input())\r\n\r\nnum = (s[::-1])\r\nans = 0\r\nrem = 1\r\nwhile num:\r\n x = int(num)%10\r\n num = num[:-1]\r\n \r\n if x==1 and rem==1:\r\n ans+=1\r\n rem = 1\r\n \r\n elif x==0 and rem==1:\r\n ans += 1\r\n rem = 0\r\n \r\n else:\r\n rem = 0\r\n \r\nprint(ans)", "input()\nx = input()\na = 1\nfor i in range(len(x)):\n if x[i] == '0':\n break\n else:\n a += 1\n if i == (len(x)-1):\n a -= 1 \n \nprint(a)", "def to_dec(bina):\r\n res = 0\r\n b = 2**len(bina)\r\n for i in range(len(bina)):\r\n b = b//2\r\n if bina[i] == 1:\r\n res = res + b\r\n return res\r\n\r\ndef to_bin(d):\r\n res = []\r\n while d > 0:\r\n res.insert(0, d%2)\r\n d = d //2 \r\n return \"\".join(map(str, res))[::-1]\r\n \r\n \r\n \r\n \r\nn = int(input())\r\nb = input()\r\nd = to_dec(list(map(int, b[::-1]))) + 1\r\nb1 = to_bin(d)\r\nif len(b1) < n:\r\n b1 = b1 + \"0\"*(n-len(b1))\r\nres = 0\r\nfor i in range(n-1, -1, -1):\r\n if b[i] != b1[i]:\r\n res +=1\r\nprint(res)", "# itne me hi thakk gaye?\r\nn = int(input())\r\nx = input()\r\nfor i in range(n):\r\n if (x[i] == '0'):\r\n break\r\nprint(i+1)", "n = int(input())\nstring = input()\n\nx = 1\n\nfor i in range(n):\n if string[i] == '1':\n x += 1\n else:\n print(x)\n exit()\nprint(x - 1)\n", "n = int(input())\ne = input()\ne = e[::-1]\nq = len(e)-1\na = 0\np = ''\nfor i in range(0,n):\n s = 2**q\n if int(e[i])>0:\n a += s\n q -= 1\na += 1\nwhile a>0:\n p += str(a % 2)\n a //= 2\np = p[::-1]\np = '0'*(len(e)-len(p)) + p\na = 0\nif (len(e) < len(p)):\n e = '1' + e\n\nfor y in range(0,len(e)):\n if e[y]!=p[y]:\n a += 1\nprint(a) ", "input()\r\nr=0\r\nfor x in input():\r\n if x=='1':r+=1\r\n else:r+=1;break\r\nprint(r)", "n=int(input())\r\ns=input()+\"0\"\r\nt=0\r\nwhile s[t]=='1' and t!=n:\r\n\tt+=1\r\nif t<n: t+=1\r\nprint(t)", "n =int(input())\n\nbinString = input()\n\nres = 0\n\ncurr = 0\n\nwhile curr < n and binString[curr] != '0':\n res+=1\n curr+=1\n\n\nif res != n: res+=1\n\nprint(res)", "n=int(input())\r\ns=input()\r\nif(s[0]==\"0\"):\r\n print(1)\r\nelse:\r\n if \"0\" in s:\r\n a=s.index(\"0\")\r\n print(len(s[0:a+1]))\r\n else:\r\n print(n)", "n=int(input())\r\nst=input()\r\nnum=0\r\nfor i in range(n):\r\n if(st[i]=='1'):\r\n num+=(2**i)\r\n\r\nnum=num+1\r\nb=bin(num).replace(\"0b\",\"\")\r\nb=b[::-1]\r\n\r\nans=0\r\nl=min(n,len(b))\r\nfor i in range(l):\r\n if(st[i]!=b[i]):\r\n ans+=1\r\n\r\nfor i in range(l,n):\r\n if(st[i]!='0'):\r\n ans=ans+1\r\n \r\nprint(ans)\r\n", "x = int(input())\r\ns = input()\r\nnum = 0\r\nfor i in range(len(s)):\r\n num += (2 ** i) * int(s[i])\r\nnum += 1\r\n\r\nans = ''\r\nwhile(num > 0):\r\n ans += str(num % 2)\r\n num //= 2\r\nwhile len(ans) < x:\r\n ans += '0'\r\nct = 0\r\nfor i, j in zip(s, ans[:x]):\r\n if i != j:\r\n ct += 1\r\n\r\nprint(ct)\r\n", "n = int(input())\r\ns = input()\r\nk = list(map(int, s))\r\nk.append(0)\r\nflag = 1\r\nk[0] += 1\r\nfor i in range(n):\r\n if k[i] > 1:\r\n k[i + 1] += 1\r\n k[i] = 0\r\nk = k[:-1]\r\nw = list(map(int, s))\r\nkol = 0\r\nfor i in range(len(k)):\r\n if k[i] != w[i]:\r\n kol += 1\r\nprint(kol)\r\n", "n= int(input())\r\nc= str(input())\r\nif c[0]==0:\r\n print(1)\r\nelif '0' not in c:\r\n print(n)\r\nelse:\r\n x= c.split('0')[0]\r\n\r\n print(len(x)+1)", "import re\nfrom sys import stderr\nfrom typing import Union, Generator, List, Tuple\nimport string\n\n\ndef main():\n n = int(input())\n bits = input() # type: str\n\n if \"0\" not in bits:\n res = len(bits)\n else:\n res = bits.index(\"0\") + 1\n\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "\r\nn = int(input())\r\nl = list(input())\r\nli = [int(i) for i in l]\r\n\r\nif 0 in li:\r\n\tprint(li.index(0) + 1)\r\nelse:\r\n\tprint(n)", "n = int(input())\r\ns = input()\r\ni = 0\r\nwhile i < n and s[i] == '1':\r\n i += 1\r\nif i < n:\r\n print(i+1)\r\nelse:\r\n print(i)", "n = int(input())\r\ntry:\r\n print(input().index(\"0\") + 1)\r\nexcept ValueError:\r\n print(n)", "n=int(input())\r\ns=input()\r\ns=list(s)\r\ns.reverse()\r\ng=\"\"\r\nfor i in s:\r\n g+=i\r\nnumber=int(g,2)\r\nhold=number+1\r\nif (hold>=2**n):\r\n hold=hold%(2**n)\r\nb=hold^number\r\ncount=bin(b).count(\"1\")\r\nprint(count)\r\n", "n=int(input())\r\na=input()\r\nb=a[::-1]\r\nc=int(b,2)+1\r\nz=bin(c)\r\nz=z[2:]\r\nstr(z)\r\nif len(z)<n:\r\n\tz=\"0\"*(n-len(z))+z\r\nelif len(z)>n:\r\n\tz=z[len(z)-n:]\r\ncount=0\r\nfor i in range(n):\r\n\tif z[i]!=b[i]:\r\n\t\tcount+=1\r\nprint(count)\t\t\t\t", "n = input();s=0\r\nfor i in input():\r\n if i==\"1\": s+=1\r\n else: break\r\nprint(s if s==int(n) else s+1)", "l = int(input())\r\nx = int(input()[::-1], base=2)\r\ny = x + int(\"1\", base=2)\r\nprint(min(bin(x ^ y).count(\"1\"),l))\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nconsecutive groups of 0's => go home\r\n\r\n0 1 0 1 1\r\n\r\n-remove all leading and trailing zeros\r\n-ignore all groups of 0's \r\n\r\n'''\r\n\r\ndef solve():\r\n n = II()\r\n s = I().strip()\r\n\r\n ans = 0\r\n for c in s:\r\n if c == '1':\r\n ans += 1\r\n else:\r\n break\r\n print(min(ans+1, n))\r\n \r\nsolve()", "n = int(input())\r\ndaf = list(input())\r\n\r\nc = 1\r\nfor i in daf:\r\n if i == '1':\r\n c += 1\r\n else:\r\n break\r\n\r\nprint(min(n, c))\r\n", "n= input()\r\ns=input()\r\nx=0\r\nfor i in range(int(n)):\r\n x+=int(s[i])*2**i\r\n\r\nx+=1\r\nx=list(bin(x))\r\nfor i in range(len(s)-(len(x)-2)):\r\n x.insert(2,\"0\")\r\n\r\ncount=0\r\nfor i in range(int(n)):\r\n if x[len(x)-1-i]!=s[i]:\r\n count+=1\r\nprint(count)", "n = int(input())\ns = input()\nans = 0\nfor i in range(n):\n ans += 1\n if s[i] == '0':\n break\nprint (ans)\n", "input()\r\nn = input()\r\nif '0' in n:\r\n print(n.index('0') + 1)\r\nelse:\r\n print(len(n))\r\n\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# دوستت دارم", "n = int(input())\r\ninp = input()\r\nres = 0\r\n \r\nfor i in inp:\r\n if (i != '1'):\r\n break\r\n res += 1\r\n \r\nprint(min(n, res+1))", "n = int(input())\r\nb = input()\r\nd = int(b[::-1], 2)+1\r\nb1 = bin(d)[2:][::-1]\r\n\r\n\r\nif len(b1) < n:\r\n b1 = b1 + \"0\"*(n-len(b1))\r\n \r\nres = 0\r\nfor i in range(n-1, -1, -1):\r\n if b[i] != b1[i]:\r\n res +=1\r\nprint(res)\r\n", "n, t = input(), input()\r\ni = t.find('0') + 1\r\nprint(i if i else n)", "n = int(input())\r\ns = input()\r\ncnt = 0\r\nfor x in s:\r\n if x == '1':\r\n cnt += 1\r\n else:\r\n break\r\n\r\nprint(min(n, cnt + 1))\r\n", "n = int(input())\r\nstring = input()\r\ncount = 0\r\nfor i in range(len(string)):\r\n\tif string[i] == '1':\r\n\t\tcount += 1\r\n\telse:\r\n\t\tcount += 1 \r\n\t\tbreak\r\nprint (count)", "a=int(input())\r\nb=int('0b'+input()[::-1],2)\r\nc=(b+1)%(2**a)\r\nprint(bin(b^c).count('1'))\r\n", "n=input()\r\ns=input()\r\ni=1\r\nif n=='1':\r\n\tprint(1)\r\nelse:\r\n\twhile s[i-1]=='1':\r\n\t\ti+=1\r\n\t\tif i>=len(s):\r\n\t\t\tbreak\r\n\tprint(i)", "n = int(input())\r\na = list(input())\r\nsum = 0\r\nfor i in range(n):\r\n if a[i] == '1':\r\n sum += 1\r\n else:\r\n sum += 1\r\n break\r\nprint(sum)\r\n", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor i in s:\r\n ans += 1\r\n if i == '0':\r\n break\r\nprint(ans)", "n=int(input())\r\na=input()\r\nfor i in range(n):\r\n if a[i]=='1':\r\n continue\r\n else:\r\n print(i+1);exit()\r\nprint(n)\r\n", "n = int(input())\r\ncell = input()\r\n\r\ncount1 = 0\r\n\r\nfor bit in cell:\r\n if bit == '1':\r\n count1 += 1\r\n else:\r\n break\r\n\r\nif count1 < n:\r\n count1 += 1\r\n\r\nprint(count1)", "input()\ns = input()\nk = 0\nfor c in s:\n if c == '0':\n break\n k+=1\nif k<len(s):k+=1\nprint(k)", "n = int(input())\r\na = input()\r\nres = 0\r\nlast = '1'\r\nfor i in range(n):\r\n if last == '1':\r\n res += 1\r\n last = a[i]\r\n if (last == '0'):\r\n break\r\nprint(res)", "n=int(input())\r\na=list(input())\r\nb=a[:]\r\nx=0\r\nfor i in range(n):\r\n if(a[i]=='1' and x==0):\r\n a[i]='0'\r\n x=1\r\n elif(a[i]=='0'):\r\n a[i]='1'\r\n break\r\n elif(a[i]=='1' and x==1):\r\n a[i]='0'\r\nx=0\r\nfor i in range(n):\r\n if(a[i]!=b[i]):\r\n x+=1\r\nprint(x)", "n = int(input())\na = input()\n\nfor i in range(n):\n if a[i] == '0':\n print(i + 1)\n break\nelse:\n print(n)\n\n", "n = int(input())\r\n\r\ninp = input()[::-1]\r\nnum = int(inp, 2)\r\n\r\nnum1 = num + 1\r\n\r\nb2 = bin(num1).replace('0b', '')\r\n\r\n# b2 = b2[::-1]\r\n# b1 = inp[::-1]\r\n\r\ncnt = 0\r\n\r\nb21 = b2[(max(0, len(b2) - n)):].zfill(n)\r\n\r\nfor i in range(n):\r\n if b21[i] != inp[i]:\r\n cnt += 1\r\n\r\nprint(cnt)", "n = int(input())\r\ns = input()\r\ncount = 0\r\nfor i in s:\r\n\tif i=='1':\r\n\t\tcount+=1\r\n\telse:\r\n\t\tbreak\r\nif count==n:\r\n\tprint(count)\r\nelse:\r\n\tprint(count+1)", "n = int(input())\r\n\r\nx = \"\".join(list(reversed(input())))\r\nk = int(x, 2)\r\n\r\nx = str(bin(k))\r\ny = str(bin(k+1))\r\n\r\nx = \"\".join(list(reversed(x)))\r\ny = \"\".join(list(reversed(y)))\r\n\r\nans = 0\r\nfor i in range(len(x)):\r\n if x[i] != y[i]:\r\n ans += 1\r\n if x[i] == 'b':\r\n break\r\nprint(min(n,ans))", "#Exspiravit\r\n\r\nn=int(input())\r\ns=input()\r\nf=s.find('0')\r\nif f==-1:\r\n print(n)\r\nelse:\r\n print(f+1)", "cellsize = int(input())\r\ncell = input()[::-1]\r\nadded1 = bin((int(cell, 2) + 1) % (2**cellsize))[2:]\r\nadded1 = '0' * (cellsize - len(added1)) + added1\r\nadded1 = added1[::-1]\r\ncounter = 0\r\n\r\nfor i in range(cellsize):\r\n if added1[i] != cell[::-1][i]:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "'''input\n2\n10\n'''\nn = int(input())\nb = input()\nif set(list(b)) == {\"1\"}:\n\tprint(n)\nelif b[0] == \"0\":\n\tprint(1)\nelse:\n\tb = b.replace(\"0\", \" \").split()\n\tprint(len(b[0]) + 1 if b else 1)", "def main():\n n_bits = int(input())\n bits = input()\n\n try:\n print(bits.index('0') + 1)\n except ValueError:\n print(n_bits)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\n\nnum = [int(i) for i in input()]\norigin = num[:]\n\nnum[0] += 1\n\nfor i in range(n):\n if(num[i] == 2):\n num[i] = 0\n if(i != len(num)-1):\n num[i+1] += 1\n \nanswer = 0\nfor i in range(n):\n answer += (num[i] != origin[i])\n\nprint(answer)\n\t \t\t \t \t \t \t \t\t \t\t\t\t \t \t \t\t", "n = int(input())\r\na = str(input())\r\nc, i, flag = 0, 0, True\r\nwhile flag and i < n:\r\n if a[i] == '0':\r\n c += 1\r\n flag = False\r\n else:\r\n c += 1\r\n i += 1\r\nprint(c)", "n=int(input())\nk=input()\n\nif int(k[0])==0:\n print(1)\nelse:\n s=0\n for i in k:\n if int(i)==1:\n s+=1\n else:\n break\n if s==n:\n print(n)\n else:\n print(s+1)\n", "# coding: utf-8\nn = int(input())\ns = input()\nans = 0\nflag = 1 \nfor ch in s:\n if ch == '0' and flag == 1:\n ans += 1\n flag = 0\n elif flag == 1:\n ans += 1\nprint(ans)\n", "n = int(input())\r\nb1 = input()\r\na1 = int(b1[::-1], 2)\r\nb2 = bin(a1 + 1)[2:][::-1]\r\n\r\nwhile len(b2) < n:\r\n\tb2 += '0'\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n\tif b1[i] != b2[i]:\r\n\t\tcnt += 1\r\n\r\nprint(cnt)", "n=int(input())\r\nori=input()\r\ns=ori[::-1]\r\nnum=int(s,2)\r\nnum+=1\r\nbina=bin(num).replace('0b','')\r\nl=len(bina)\r\nbina=bina[::-1]\r\nif l<n:\r\n bina=bina+'0'*(n-l)\r\nelif l>n:\r\n bina=bina[0:n]\r\n \r\nc=0\r\nfor i in range(n):\r\n if ori[i]!=bina[i]:\r\n c+=1\r\nprint(c)\r\n \r\n\r\n \r\n \r\n ", "# Codeforces 265 Div. 2\r\n# A\r\n\r\nn = int(input())\r\nl = list(input())\r\nc = 0\r\n\r\nfor x in l:\r\n if int(x) == 0:\r\n c += 1\r\n break\r\n else:\r\n c += 1\r\n\r\nprint(c)\r\n", "import math\r\n\r\nn = int(input())\r\nstr = input()\r\n\r\nres = ['' for i in range(n)]\r\nb = True\r\nfor i in range(n):\r\n if str[i] == '0':\r\n res[i] = '1'\r\n for j in range(i):\r\n res[j] = '0'\r\n b = False\r\n\r\n for j in range(i+1, n):\r\n res[j] = str[j]\r\n\r\n break\r\n\r\n\r\nif b:\r\n print(n)\r\nelse:\r\n total = 0\r\n for i in range(n):\r\n if res[i]!=str[i]:\r\n total+=1\r\n print(total)\r\n\r\n", "# A. inc ARG\r\n\r\ndef reversed4(variable):\r\n res = \"\".join(reversed(variable))\r\n return res\r\n\r\ndef dec_to_bin(num):\r\n\tbuff = \"\"\r\n\twhile num > 0:\r\n\t buff = str(num % 2) + buff\r\n\t num = num // 2\r\n\treturn buff\r\n\r\ndef del_i_to_str(input_str, i_del):\r\n\tresult_str = \"\"\r\n\tfor i in range(0, len(input_str)): \r\n\t if i != i_del: \r\n\t result_str = result_str + input_str[i]\r\n\treturn result_str\r\n\r\ndef bin0(str_bin, len_inp):\r\n\tif len_inp - len(str_bin) > 0:\r\n\t\tfor i in range(len_inp-len(str_bin)):\r\n\t\t\tstr_bin = \"0\"+str_bin\r\n\t\treturn str_bin\r\n\telif len_inp - len(str_bin) < 0:\r\n\t\tfor i in range(len(str_bin)-len_inp):\r\n\t\t\tstr_bin = del_i_to_str(str_bin,i)\r\n\t\treturn str_bin\r\n\telse:\r\n\t\treturn str_bin\r\n\r\ndef skolko_raznuh(str1,str2):\r\n\tcnt = 0\r\n\tif len(str1) == len(str2):\r\n\t\tfor i in range(len(str1)):\r\n\t\t\tif (str1[i]) != (str2[i]):\r\n\t\t\t\tcnt += 1\r\n\treturn cnt\r\n\r\nnum_dec = int(input())-1\r\nstr_bin = str(input())\r\nstr_bin_r = reversed4(str_bin)\r\nnum_bin = int(str_bin_r,2)\r\n\r\ndec_res = reversed4(bin0(dec_to_bin(int(num_bin)+1),len(str_bin_r)))\r\n\r\nprint(skolko_raznuh(str_bin,dec_res))", "total = input()\r\ndata = input()\r\nl = data.find(\"0\")\r\nprint(len(data) if l == -1 else l + 1)", "x = int(input())\r\na = input()\r\nmim = 0\r\nfor i in range(x):\r\n mim = mim + 1\r\n if a[i] == \"0\":\r\n\t break\r\nprint(mim)", "n = int(input())\r\nbits = input()\r\nx = int(bits[::-1], 2)\r\nx += 1\r\nif x == 2 ** n:\r\n x = 0\r\nt = bin(x)[2:]\r\nbits2 = ('0' * (n - len(t)) + t)[::-1]\r\ncnt = 0\r\nfor i in range(n):\r\n if bits[i] != bits2[i]:\r\n cnt += 1\r\nprint(cnt)", "#link : https://codeforces.com/problemset/problem/465/A\r\n#author : Mohamed Ibrahim\r\n\r\nn = int(input())\r\ns = input().split('0')\r\nprint(min(len(s[0])+1, n))\r\n", "input();print((input()[:-1]+'0').find(\"0\")+1)\r\n", "n = int(input())\r\ns = input()\r\nc = 1\r\nt = 0\r\nfor c in s:\r\n t += 1\r\n if c == \"0\":\r\n c = 0\r\n break\r\nprint(t)", "n = int(input())\ns = input()\nans = 0\ni = 0\nwhile i < n and s[i] == '1':\n\ti += 1\n\tans += 1\nprint(max(1, min(ans + 1, n)))", "m = int(input())\r\ncount = 0\r\nx=input()\r\nfor i in range(m):\r\n if x[i] =='1':\r\n count+=1\r\n else :\r\n count+=1\r\n break\r\nprint(count)", "n = int(input())\r\na = str(input())\r\nfor i in range(n):\r\n if a[i] == '0':\r\n print(i + 1)\r\n break\r\n elif i == n - 1:\r\n print(n)", "import sys\r\n\r\ndef main():\r\n # fin = open(\"input.txt\", \"r\")\r\n fin = sys.stdin\r\n fout = sys.stdout\r\n\r\n n = int(fin.readline())\r\n s = list(fin.readline())\r\n\r\n i = 0\r\n while i < n and s[i] == '1':\r\n i += 1\r\n\r\n print(min(i + 1, n))\r\n\r\n\r\nmain()", "n = int(input())\r\nt = int(input()[:: -1], 2)\r\np = t + 1\r\nprint(n if p == 1 << n else bin(t ^ p).count('1'))", "n = int(input())\nm = int(input()[::-1], 2)\nmask = (1 << n) - 1\nm = m ^ (m + 1) & mask\nrt = 0\nwhile(m):\n\trt += m % 2\n\tm //= 2\nprint(rt)\n", "n,m = int(input()), int(input()[::-1],2)\r\nprint(bin(m^(m+1)).count('1') - (m==2**n-1))\r\n", "n=int(input())\r\nx=input()\r\ns=\"0b\"+x[::-1]\r\ns=bin(int(s,2)+1)[2:]\r\nif len(s)>n:\r\n\ts=s[1:]\r\nelif len(s)<n:\r\n\td=n-len(s)\r\n\ts=\"0\"*d+s\r\ns=s[::-1]\r\nc=0\r\nfor i in range(n):\r\n\tif s[i]!=x[i]:\r\n\t\tc+=1\r\nprint(c) ", "n = int(input())\r\ns = input()[::-1]\r\ns1 = ((bin(int(s, 2)+1)[2::]).zfill(n))[-n:]\r\ncnt = 0\r\nfor i in range(n):\r\n if s[i] != s1[i]:\r\n cnt += 1\r\nprint(cnt)\r\n", "trash = int(input());\r\ns = str(input());\r\ncount = 1;\r\nfor i in range(0, len(s)-1):\r\n if(s[i]=='1'):\r\n count+=1;\r\n else:\r\n break;\r\n \r\nprint(count);\r\n", "n = int(input())\r\ns = input()\r\nif s.count('0') == 0:\r\n print(n)\r\nelse:\r\n print(s.index('0') + 1)", "numBits = int(input())\r\nmyStuff = list(map(int, list(input())))\r\nadd1 = True\r\nnumDiff = 0\r\nfor i in range(numBits):\r\n if add1:\r\n numDiff += 1\r\n myStuff[i] = myStuff[i] + 1 % 2\r\n if myStuff[i] == 1:\r\n add1 = False\r\nprint(numDiff)\r\n ", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\n\r\ninstr = sys.stdin.readline()\r\n\r\ncarry = 1\r\nresult = 0\r\n \r\ni = 0\r\nwhile(carry == 1):\r\n if(instr[i] == '1'):\r\n carry = 1\r\n result += 1\r\n elif(instr[i] == '0' and carry == 1):\r\n carry = 0\r\n result += 1\r\n elif(instr[i] == '1' and carry == 1):\r\n result += 1\r\n if(i < n): \r\n i += 1\r\n else:\r\n break\r\nprint(result)\r\n \r\n ", "def main():\r\n n = int(input())\r\n string = input()\r\n\r\n num = int(string[::-1], 2) + 1\r\n string2 = \"{0:b}\".format(num)\r\n string2 = string2[::-1]\r\n if len(string2) > len(string):\r\n string2 = string2[:-1]\r\n else:\r\n string2 = string2 + \"0\" * (len(string) - len(string2))\r\n \r\n counter = 0\r\n for i in range(n):\r\n if string[i] != string2[i]:\r\n counter += 1\r\n print(counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ndigits = list(input())\r\naddition = 1\r\nres = 0\r\nfor i in range (n):\r\n sum_ = int(digits[i]) + addition\r\n if sum_ == 2:\r\n sum_ = 0\r\n addition = 1\r\n else:\r\n addition = 0\r\n if sum_ != int(digits[i]):\r\n res += 1\r\nprint(res)", "n=int(input())\r\ns=input()\r\nres=1\r\nfor j in s:\r\n if j==\"0\":\r\n break\r\n else:\r\n res+=1\r\nres=min(n, res)\r\nprint(res)", "n=int(input())\r\ns=input()\r\nx=0\r\nfor i in range(n):\r\n\tx+=1\r\n\tif s[i]=='0':\r\n\t\tbreak\r\nprint(x)", "input()\r\nNumber = input()\r\nRevNumber = \"\".join(reversed(Number))\r\nRevNumber = bin(int(RevNumber, 2) + 1)[2:]\r\nRevNumber = \"\".join(reversed(RevNumber))\r\nNotSame = 0\r\nfor i in range(min(len(RevNumber), len(Number))):\r\n if RevNumber[i] != Number[i]:\r\n NotSame += 1\r\nprint(NotSame)\r\n", "n=int(input())\r\nk=list(input())\r\nc=k.copy()\r\ng='1'\r\nct=0\r\nfor i in range(n):\r\n if(g=='1' and c[i]=='1'):\r\n ct=ct+1\r\n elif(g=='1' and c[i]=='0'):\r\n ct=ct+1\r\n g='0'\r\nprint(ct)", "n = int(input())\r\ns = input()\r\nprint(s.index('0')+1 if '0' in s else n)", "n=int(input())\r\ns=input()\r\nprint(min(len((s.split('0')[0]))+1,n))", "# http://codeforces.com/problemset/problem/465/A\nfrom sys import stdin\n\ndef func():\n\tn = stdin.readline()\n\ts = stdin.readline().strip()\n\tind = s.find('0')\n\tdigits_changed=0\n\tif ind==-1:\n\t\tdigits_changed=len(s)\n\telse :\n\t\tdigits_changed = ind+1\n\n\tprint ('{0}\\n'.format(digits_changed))\n\n\nif __name__ == '__main__':\n\tfunc()\n", "def get_ints():\r\n return list(map(int, input().split()))\r\n\r\nN = int(input())\r\na = input()[::-1]\r\nt = a\r\n# print(a)\r\na = int(a,2)\r\n# print(a)\r\na+=1\r\nb = bin(a)[2:]\r\nif len(b)>N:\r\n b = b[1:]\r\nelif len(b)<N:\r\n b = \"0\"*(N-len(b)) + b\r\nprint(sum([1 if t[i]!=b[i] else 0 for i in range(N)]))", "n = int(input())\r\ns = input()\r\nkek = 0\r\nrofl = 1\r\nwhile rofl < n and s[rofl] == '1':\r\n kek += 1\r\n rofl += 1\r\nif s[0] == '0':\r\n print(1)\r\nelse:\r\n print(min(rofl + 1, n))", "N = int(input())\r\nS = input().split(\"0\")\r\nprint(min(N,1+len(S[0])))", "n = input()\r\nprint((input()[:-1] + \"0\").index(\"0\") + 1)\r\n", "n = int(input())\r\ns = input()\r\n\r\nc = 0\r\nif s[0] == '0' :\r\n c = 1\r\nelse:\r\n\r\n for i in range(n):\r\n if s[i] == '0':\r\n c += 1\r\n break\r\n else:\r\n c += 1\r\nprint(c)\r\n \r\n", "n = int(input()) + 1\r\nr = int(input()[::-1], 2)\r\nb = int('{:0{}b}'.format(r + 1, n)[1:], 2)\r\nprint(bin(r ^ b).count('1'))\r\n", "n = int(input())\ns = input().strip()\na = int(s[::-1],2)\nres = str(bin(a^(a+1)))[::-1]\nres2 = res.split('b')[0]\nif len(res2) > n:\n res2 = res2[:n]\nprint(sum([int(i) for i in res2]))\n", "\r\nimport math\r\n\r\nn = int(input())\r\ndef replace(x):\r\n length = len(x)\r\n new = []\r\n for i in range(length):\r\n new.append(int(x[length-i-1]))\r\n\r\n return new\r\nd=list(input())\r\nold_num_bin = replace(d)\r\nold_num_value = 0\r\nfor i in range(n):\r\n old_num_value += (int(d[i]))*(pow(2, i))\r\nnew_num_value = old_num_value+1\r\nnew_num_bin = list(bin(new_num_value)[2:])\r\n\r\nif len(new_num_bin) < n:\r\n append_index = n-len(new_num_bin)\r\n for i in range(append_index):\r\n new_num_bin.insert(0, 0)\r\nelif len(new_num_bin) > n:\r\n append_index = len(new_num_bin)-n\r\n new_num_bin = list(new_num_bin[append_index:])\r\nk=0\r\nfor i in range(n):\r\n if int(old_num_bin[i]) != int(new_num_bin[i]):\r\n k += 1\r\n\r\nprint(k)\r\n\r\n", "n=int(input())\r\na=input()\r\nt=0\r\nfor i in a:\r\n if i==\"1\":\r\n t +=1\r\n elif i==\"0\":\r\n t +=1\r\n print(t)\r\n break\r\nelse:\r\n print(t)", "n = int(input())\r\nst = input()[::-1]\r\ns = int(st, 2)\r\ns += 1\r\nans = 0\r\nfor i in range(n):\r\n if (s % 2 == 1) ^ (st[n - i - 1] == '1'):\r\n ans += 1\r\n s //= 2\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, list(input().strip())))\r\ncnt = 0\r\nnow = 1\r\nfor i in range(n):\r\n if now:\r\n cnt += 1\r\n now = a[i] % 2\r\n a[i] += 1\r\n a[i] %= 2\r\nprint(cnt)", "n=int(input())\na=input()\nfor i in range(n):\n if a[i]=='0':break\nprint(min(n,i+1))", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\ns=input()\r\nc=0\r\nfor i in range(n):\r\n\tc+=1\r\n\tif s[i]==\"0\":\r\n\t\tbreak\r\nprint(c)", "n, c = int(input()), input()\r\naux = int(c[::-1],2)\r\nt = \"{0:b}\".format(aux+1)[::-1]\r\nt = t[:n] + \"0\"*(n-len(t[:n]))\r\ndiff = 0\r\nfor i in range(n):\r\n if t[i] != c[i]: diff += 1\r\nprint(diff)", "n=int(input())\r\nl=list(input())\r\nc=0\r\nio=\"1\"\r\nfor i in range(n):\r\n\tif l[i]==\"1\" and io==\"1\":\r\n\t\tl[i]=\"0\"\r\n\t\tc+=1\r\n\t\tio=\"1\"\r\n\telif l[i]==\"0\" and io==\"1\":\r\n\t\tl[i]=\"1\"\r\n\t\tc+=1\r\n\t\tio=\"0\"\r\n\t# elif l[i]==\"1\" and io==\"0\":\r\n\t\t# l[i]=\"1\"\r\n\t\t# io=\"0\"\r\nprint(c)", "def solve():\r\n n=int(input())\r\n ans=0\r\n k=input()\r\n p=1\r\n if k[0]=='0':\r\n ans+=1\r\n print(ans)\r\n else:\r\n for i in range(n):\r\n if p==0:\r\n break\r\n else:\r\n if k[i]=='0':\r\n k=k[:i]+'1'+k[i+1:]\r\n ans+=1\r\n p=0\r\n else:\r\n k=k[:i]+'0'+k[i+1:]\r\n ans+=1\r\n print(ans)\r\nsolve()", "n = int(input())\na = input()\nr = 1\nfor i in range(n):\n if a[i] == '1':\n r += 1\n else:\n break\nif i == n - 1 and a[i] == '1':\n r -= 1\nprint(r)\n", "import fileinput as f\n\nfor line in f.input():\n if f.lineno() == 1:\n [n] = list(map(int, line.split()))\n else:\n s = line.strip()\n\ncount = 1\nfor i in range(n):\n if s[i] == '0':\n break\n else:\n count += 1\n\nprint(min(count, n))\n\n", "n = int(input())\r\ns = input()\r\ni = 0\r\ncnt = 0\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n cnt += 1\r\n break\r\n else:\r\n cnt += 1\r\nprint(cnt)", "n = int(input())\r\ns = list(input())\r\nc = 0\r\nprev = \"1\"\r\nfor x in s:\r\n if x == '1':\r\n if prev == \"1\":\r\n c += 1\r\n prev = '1'\r\n else:\r\n prev = '0'\r\n else:\r\n if prev == '1':\r\n c += 1\r\n prev = '0'\r\n else:\r\n prev = '0'\r\nprint(c)\r\n", "n = int(input())\r\na = list(input())\r\ni = 0\r\nwhile a[i] == \"1\" and i+1 < n:\r\n i += 1\r\nprint(i+1)\r\n", "n=int(input())\r\nS=input()\r\nk=0\r\nfor i in range(n) :\r\n if S[i]=='1' :\r\n k=k+1\r\n else :\r\n k=k+1\r\n break\r\nprint(k)\r\n\r\n \r\n \r\n", "n = int(input())\r\nbit = input()\r\nprint(n if bit.find('0')==-1 else bit.find('0')+1 )", "x=int(input());a=list(map(int,input()));p=1;j=0\r\nfor i in range(x):\r\n\tif a[i]==1 and p==1:\r\n\t\ta[i]=0\r\n\t\tj+=1\r\n\telif a[i]==0 and p==1:\r\n\t\ta[i]=1\r\n\t\tp=0\r\n\t\tj+=1\r\nprint(j)", "n = int(input())\r\ns = input()\r\nprint(s.find('0')+1 if s.find('0') != -1 else n)\r\n", "n, cell, i = int(input()), list(map(int, input().strip())), 0\r\nwhile i < n - 1 and cell[i]:\r\n i += 1\r\nprint(i + 1)\r\n", "#!/usr/bin/python3\n\nimport itertools as ittls\nfrom collections import Counter\n\nimport re\nimport math\n\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\n\nN = int(input())\nA = list(input())\n\ni = 0\nwhile i < len(A) and A[i] == '1':\n i = i + 1\n\nprint(min(i + 1, len(A)))\n", "_1_=int(input())\n_2_=input()\n_3_=0\nfor _ in range(_1_):\n _3_+=1\n if _2_[_]=='0':\n break\nprint(_3_)", "n = int(input())\r\na = input()\r\nprint(min(n, len(a) - len(a.lstrip('1')) + 1))", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nlength = int(input())\r\nbinary = input().strip()[::-1]\r\nx = int(binary,2)\r\ny = x + 1 \r\n\r\nxor = x^y\r\nans = 0 \r\nindicator = 1\r\nfor i in range(length):\r\n if xor&indicator:\r\n ans += 1\r\n indicator<<=1\r\nprint(ans)", "n=int(input())\r\na=input()\r\nif '0' not in a:\r\n print(n)\r\nelse:\r\n print(a.index('0')+1)\r\n", "n=int(input())\r\ns=input()\r\na=0\r\nfor i in range(n):\r\n if(s[i]==\"1\"):\r\n a=a+1\r\n else:\r\n a=a+1\r\n break\r\nprint(a)", "n = int(input())\ns = str(input())\n\nr = 0\nc = 1\nfor i in range(n):\n r += c\n c = (c + int(s[i])) // 2\nprint(r)\n", "\r\nn = int(input())\r\ns = input()[::-1]\r\nns = int(s,2)\r\ns1 = bin(ns+1)[2:]\r\nwhile len(s1)>len(s):\r\n s1 = s1[1:]\r\nwhile len(s1)<len(s):\r\n s1 = \"0\"+s1\r\nprint(len([x for x in range(n) if s[x]!=s1[x]]))", "from collections import deque\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n s = str(input())\r\n # print(s, type(s))\r\n ans = 0\r\n for i in s:\r\n if int(i) == 1:\r\n ans += 1\r\n else:\r\n ans += 1\r\n break\r\n print(min(ans, n))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=input()\r\nv=input()\r\ncount=0\r\nfor c in v:\r\n count+=1;\r\n if c!='1':\r\n break;\r\nprint(count)\r\n", "n=int(input())\r\nlis=list(input())\r\nif lis[0]=='0':\r\n print(1)\r\nelse:\r\n if '0' not in lis:\r\n print(n)\r\n else:\r\n print(lis.index('0')+1)\r\n \r\n", "n = int(input())\r\ns = input().split('0')\r\nprint(min(len(s[0])+1, n))", "n = int(input())\r\nls = [int(u) for u in input()]\r\n\r\nif 0 in ls:\r\n print(ls.index(0)+1)\r\nelse:\r\n print(len(ls))", "k = int(input())\ntext = input()\nrez = 0\nfor i in text:\n if i != '0':\n rez += 1\n else:\n rez += 1\n break\nprint(rez)", "cells = int(input())\r\ncell = input()\r\n\r\ncont=0\r\nfor x in cell:\r\n if x == '1':\r\n cont+=1\r\n else:\r\n cont+=1\r\n break\r\n\r\nprint(cont)", "n = int(input())\r\ns = input()\r\n\r\nif s[0] == '0': print(1)\r\nelse:\r\n i = 0\r\n while i < n:\r\n if s[i] == '0':\r\n break\r\n i += 1\r\n if i == n:print(n)\r\n else: print(i+1)\r\n", "import sys\r\n\r\ncells = int(input())\r\ncont=0\r\nfor i in range(cells):\r\n x = sys.stdin.read(1)\r\n if x == '1':\r\n cont+=1\r\n else:\r\n cont+=1\r\n break\r\n\r\nprint(cont)", "# import sys\n# sys.stdin=open('input.txt', 'r')\n# sys.stdout=open('output.txt', 'w')\n\n_=int(input())\nn=list(input())\nans=0\nfor i in n:\n if int(i): ans+=1\n else: break\nif ans!=len(n):\n print(ans+1)\nelse: print(ans)\n", "n = int(input())\r\nst = input()\r\nl = 0\r\nfor i in range(n):\r\n if st[i] == '1': l = l + 1\r\n else: break\r\nprint(min(l + 1, n))\r\n", "n=int(input())\r\nl=list(map(int,input()))\r\n\r\ns=0\r\nfor i in range(len(l)):\r\n\ts+=(2**i)*l[i]\r\n\r\nx=bin(s+1)[2:]\r\ny=[0]*(n-len(x))\r\n\r\nz=list(map(int,x))\r\nf=y+z\r\nf.reverse()\r\nt=0\r\nfor i in range(n):\r\n\tt+=abs(l[i]-f[i])\r\nprint(t)", "n = int(input())\r\ns = list(input())\r\ntotal=0\r\nfor x in range(n):\r\n if s[x]==\"1\": total+=2**(x)\r\ntotal+=1\r\nk=list(str(bin(total))[2:])\r\nk.reverse()\r\nk = k[:n]\r\nwhile len(k)<n:\r\n k.append(0)\r\n#print(k,s)\r\nans = 0\r\nfor x in range(n):\r\n ans+=int(k[x])^int(s[x])\r\nprint(ans)\r\n\r\n", "length = int(input())\r\nnum = input()\r\nreversNum = list(reversed(list(num)))\r\nlast = \"1\"\r\n\r\nfor index in range(length - 1 , -1 , -1) :\r\n if last == reversNum[index] == \"0\" :\r\n reversNum[index] = \"0\"\r\n last = \"0\"\r\n elif last == reversNum[index] == \"1\" :\r\n reversNum[index] = \"0\"\r\n last = \"1\"\r\n else :\r\n reversNum[index] = \"1\"\r\n last = \"0\"\r\ncount = 0\r\n\r\nnum = list(reversed(list(num)))\r\n\r\nfor index in range(length) :\r\n if reversNum[index] != num[index] : count +=1\r\n \r\nprint(count)\r\n ", "n=int(input())\r\ns=input()\r\ncount=0\r\nif(s[0]=='0'):\r\n ans=1 \r\nelse:\r\n for i in s:\r\n #print(count)\r\n if(i=='1'):\r\n count+=1 \r\n else:\r\n break\r\n ans=count+1 \r\nprint(min(ans,n)) ", "n = input()\r\ncells = input()\r\nif cells[0] == 0:\r\n print(1)\r\nelse:\r\n if cells.find('0') == -1:\r\n print(len(cells))\r\n else:\r\n print(cells.find('0')+1)", "def solve():\r\n size = int(input())\r\n s = input()\r\n \r\n if s.count('1') == size:\r\n print(size)\r\n else:\r\n result = 0\r\n i = 0\r\n \r\n while s[i] == '1':\r\n result += 1\r\n i += 1\r\n \r\n print(result + 1)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "import re\n\n\ndef main():\n n = int(input())\n\n num = input()\n\n l = len(re.match(r'^1*', num).group(0))\n\n print(l + 1 if l < n else n)\n\n\nif __name__ == '__main__':\n main()\n\n", "n = int(input())\r\nq = input()\r\ns = [int(q[i]) for i in range(len(q))]\r\ns1 = s[:]\r\nrest = 1\r\nfor i in range(n):\r\n rest = s[i] + rest\r\n s[i] = rest % 2\r\n rest = rest // 2\r\nq = [s[i] ^ s1[i] for i in range(n)]\r\nprint(sum(q))", "n = int(input())\r\ns = input()\r\nx=0\r\nfor i in s:\r\n if i == \"1\":\r\n x += 1\r\n elif i == \"0\":\r\n x += 1\r\n print(x)\r\n exit()\r\nprint(x)", "import sys\r\n\r\nsize = int(input())\r\nstring = str(input())\r\n\r\nmax=0\r\ncounter =0\r\nfor i in range(0,size):\r\n if string[i] == '1':\r\n counter += 1\r\n else:\r\n break\r\n\r\n\r\nprint(min(size,counter+1))", "n = int(input())\nbits = input()\n\ncounter = 1\ni = 0\nwhile i < n-1 and bits[i] == '1':\n counter += 1\n i += 1\n\nprint(counter)", "n = int(input())\r\nm = str(input())\r\nj = 0\r\nwhile j < n and m[j] == '1':\r\n j += 1\r\nif j < n:\r\n print(j + 1)\r\nelse:\r\n print(n)\r\n\r\n", "a=input()\r\ns = input()\r\ni = 0\r\nwhile i < len(s) and s[i] == '1':\r\n i += 1\r\nprint(min(i + 1, len(s)))", "n = int(input())\r\ns=input()\r\nm=int(0)\r\nfor i in range(n):\r\n if s[i]==\"1\":\r\n m+=1\r\n else:\r\n m+=1\r\n break\r\nprint(m)", "n=int(input())\r\ns=input()\r\nc=\"\"\r\nfor i in range(n):\r\n if s[i]!=\"1\":\r\n c+=\"1\"\r\n i+=1\r\n break\r\n else:\r\n c+=\"0\"\r\nwhile i<n:\r\n c+=s[i]\r\n i+=1\r\ncnt=0\r\nfor i in range(n):\r\n if s[i]!=c[i]:\r\n cnt+=1\r\nprint(cnt)\r\n \r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\t\r\nn=int(input())\r\ns=list(input())\r\nx=0\r\nfor i in range(n):\r\n\tx+=1\r\n\tif s[i]==\"0\":\r\n\t\tbreak\r\n\r\nprint(x)\t\t\r\n\r\n\t\t\t\r\n", "n=int(input())\r\ns=input()\r\nv=list(int(x) for x in s)\r\nc=0\r\nfor i in range(len(v)):\r\n c+=1\r\n if not v[i]:\r\n break\r\nprint(c)\r\n ", "n=input()\r\ns=input()\r\ncount=0\r\nfor i in s:\r\n count+=1\r\n if i=='0':\r\n break\r\nprint(count)", "n = int(input())\r\ns = input()\r\nans = 1\r\nfor i in range(n - 1):\r\n if s[i] == '1':\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)\r\n", "N = int(input())\nS = input()\nflg = True\nans = 0\nfor s in S:\n if flg:\n if s == \"0\":\n ans += 1\n flg = False\n elif s == \"1\":\n ans += 1\n flg = True\nprint(ans)\n", "def binary_to_decimal(s):\r\n n = 0\r\n for i in range(len(s)):\r\n n += int(s[i]) * 2 ** i\r\n return n\r\n\r\n\r\ndef decimal_to_binary(n):\r\n output_str = \"\"\r\n i = 0\r\n while 2 ** i <= n:\r\n i += 1\r\n i -= 1\r\n while i >= 0:\r\n if 2 ** i <= n:\r\n n -= 2 ** i\r\n output_str = \"1\" + output_str\r\n else:\r\n output_str = \"0\" + output_str\r\n i -= 1\r\n return output_str\r\n\r\n#print(decimal_to_binary(5))\r\n\r\n\r\ndef main_function():\r\n input()\r\n s = input()\r\n n = binary_to_decimal(s)\r\n new_n = n + 1\r\n new_binary_n = decimal_to_binary(new_n)\r\n count = 0\r\n for i in range(min(len(s), len(new_binary_n))):\r\n if s[i] != new_binary_n[i]:\r\n count += 1\r\n return count\r\n\r\n\r\n\r\n\r\nprint(main_function())", "n = int(input())\r\ns = input()\r\nc = 0\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n c += 1\r\n else:\r\n break\r\nprint(min(n, c + 1))", "n,m = int(input()), int(input()[::-1],2)\r\nprint(bin(m^((m+1)%2**n)).count('1'))\r\n", "input()\na = input()\nprint(a.index('0')+1 if '0' in a else len(a))", "import re\nn = int(input())\nprint(min(len(re.match(r\"^1*\", input()).group(0)) + 1, n))\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\nn = int(input())\r\nqb = [int(x) for x in input()]\r\nqa = qb[:]\r\nans = 0\r\nqa[0] += 1\r\nfor i in range(n):\r\n\tif qa[i] != qb[i]:\r\n\t\tans += 1\r\n\t\tif qa[i] == 2:\r\n\t\t\tqa[i] = 0\r\n\t\t\tif i < n-1:\r\n\t\t\t\tqa[i+1] += 1\r\n# print(qa, qb)\r\nprint(ans)\r\n", "#!/usr/bin/python3.4\n\nSIZE = 10\n\nmatrix = [[0] * SIZE for i in range(SIZE)]\narray = [0] * SIZE\n\nn = input()\ns = input()\nans = 0\nfor val in s:\n if val == \"0\":\n ans += 1\n break\n else:\n ans += 1\nprint(ans)\n", "n=int(input())\r\ns=input()\r\nka=0\r\nfor i in range(n):\r\n if(s[i]=='1'):\r\n ka=ka+1\r\n else:\r\n ka=ka+1\r\n break\r\nprint(ka)\r\n", "n=int(input())\r\nk1=input()\r\ns=\"0b\"+k1[::-1]\r\ns1=\"0b\"+\"0\"*(n-1)+\"1\"\r\nk=bin(int(s,2)+int(s1,2))\r\nk=k.lstrip(\"0b\")\r\nk=(\"0\"*abs(n-len(k))+k)[::-1]\r\nans=0\r\nfor i in range(n):\r\n if k1[i]!=k[i]:\r\n ans+=1\r\nprint(ans)\r\n\r\n", "n = int(input())\r\ns = input()\r\ni = 0\r\nwhile i<n and s[i]=='1':\r\n i+=1\r\nprint(min(i+1,n))", "\r\nn = int(input())\r\ns = input()\r\nres = s.find('0')\r\nprint(n if res == -1 else res+1)", "__author__ = '$'\r\nimport sys\r\n\r\ntry:\r\n while True:\r\n n = int(input())\r\n val = list(input())\r\n ans = 0\r\n r = 1\r\n for i in range(n):\r\n val[i] = ord(val[i]) - ord('0')\r\n ans += 1\r\n r = (val[i] + r)//2\r\n if r == 0 :\r\n break\r\n print(ans)\r\n\r\nexcept EOFError:\r\n pass", "x,n=int(input()),1\r\ny=list(input())\r\nfor i in y:\r\n if i=='1':n+=1\r\n else:break\r\nprint(min(n,x))", "import fileinput as f\n\nfor line in f.input():\n if f.lineno() == 1:\n [n] = list(map(int, line.split()))\n else:\n s = line.strip()\n\nsp = s[-1::-1]\nsint = int(sp, 2)\nsintp1 = sint + 1\nr = sint ^ sintp1\n\nprint(bin(r)[-1:-1-n:-1].count('1'))\n", "n=int(input())\r\ns=input()\r\nx=1\r\nfor i in range(n):\r\n if (s[i]!='1'):\r\n break\r\n x+=1\r\nif x>n:x=n\r\nprint(x)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\n\r\nchanges = 1\r\nfor c in s[:-1]:\r\n if c == '1':\r\n changes += 1\r\n else:\r\n break\r\n\r\nprint(changes)", "n=int(input())\r\nt=n\r\nr=[i+1 for i,x in enumerate(input()) if x=='0']\r\nprint(r[0] if len(r) else t)", "n = int(input())\ns = input()\nt = 1\nfor i in s:\n\tif i == \"0\":\n\t\tbreak\n\tt+=1\nelse: t-=1\nprint(t)\n", "n = int(input())\r\nnum = input()[::-1]\r\nres = bin(int(num, 2) + int(\"1\", 2))[2:]\r\nres = (\"0\" * (n - (len(res))) + res)[::-1][:n]\r\ncount = 0\r\nfor i in range(n):\r\n if res[i] == num[::-1][i]:\r\n count += 1\r\nprint(n - count)", "def solve(n, s):\n x = 0\n for i in s:\n if i == '1':\n x += 1\n else:\n x += 1\n break\n return x\n\n\ndef main():\n n = int(input())\n s = input()\n print(solve(n, s))\n\n\nmain()\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\ns = input().strip()\nans = 0 \nfor x in s:\n\tif x == '1':\n\t\tans += 1\n\telse:\n\t\tbreak\nprint(min(ans + 1, n))\n", "n=int(input())\r\ns=list(input())\r\nif \"0\" in s:print(s.index(\"0\")+1)\r\nelse:print(n)", "def input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n = int(input())\r\n s = input()\r\n x = int(s[::-1], 2)\r\n y = (x + 1) % (1 << n)\r\n print(bin(x ^ y).count('1'))\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "# Contest: 20 - 2100 <= Codeforces Rating <= 2199 (https://a2oj.com/ladder?ID=20)\n# Problem: (8) inc ARG (Difficulty: 2) (http://codeforces.com/problemset/problem/465/A)\n\ndef rint():\n return int(input())\n\n\ndef rints():\n return list(map(int, input().split()))\n\n\nn = rint()\nbits = input()\nbits = bits[::-1]\nbefore = int(bits, 2)\nafter = (before + 1) % 2**n\nprint(bin(before ^ after).count('1', 2))\n", "n=int(input())\ns=input()\nt=1\nf=False\nfor i in s:\n if i=='0':\n f=True\n break\n else:\n t+=1\nprint(t-1 if f==False else t)\n", "n = int(input())\r\n\r\nprint(min(n, n + 1 - len(input().lstrip('1'))))", "n=(int)(input())\r\nx=input()\r\nc=0\r\ni=0\r\nwhile(True):\r\n if(x[i]=='0' or i==n-1):\r\n c+=1\r\n break\r\n else :\r\n c+=1\r\n i+=1\r\nprint(c)", "n=int(input())\r\ns=input()\r\nc=1\r\nchanges=0\r\nif( n>=1 and n<=100):\r\n for i in range(n):\r\n if(s[i]=='1' and c==1):\r\n c=1\r\n changes+=1\r\n elif(s[i]=='0' and c==1):\r\n c=0\r\n changes+=1\r\n elif(s[i]=='1' and c==0):\r\n c=0\r\n else:\r\n c=0\r\nprint(changes)", "n=int(input())\r\nl=list(input())\r\nm=[]\r\nd=[]\r\nfor i in range(n):\r\n\tif i==0 or d[-1]==2:\r\n\t\tr=int(l[i])+1\r\n\t\td.append(r)\r\n\t\tif r==2:\r\n\t\t\tm.append(\"0\")\r\n\t\telse:\r\n\t\t\tm.append(str(r))\r\n\telse:\r\n\t\tm.append(l[i])\r\n\t\td.append(int(l[i]))\r\nc=0\r\nfor i in range(n):\r\n\tif l[i]!=m[i]:\r\n\t\tc+=1\r\nprint(c)", "def solve(n: int, s: str) -> int:\r\n ans = 0\r\n for i in s:\r\n if int(i) == 1:\r\n ans += 1\r\n else:\r\n ans += 1\r\n break\r\n return(min(ans, n))\r\n\r\nn = int(input())\r\ns = str(input())\r\nprint(solve(n, s))\r\n \r\n", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN=int(input())\r\nL=list(input())\r\nCarry=1\r\ncount=0\r\nfor i in range(N):\r\n\tif L[i]=='1' and Carry==1:\r\n\t\tL[i]='0'\r\n\t\tcount+=1\r\n\telif L[i]=='0' and Carry==1:\r\n\t\tL[i]='1'\r\n\t\tCarry=0\r\n\t\tcount+=1\r\nprint(count)", "n = int(input())\na = input()\n\nc = 1\nans = 0\n\nfor i in range(n):\n cur = int(a[i]) + c\n ans += (cur % 2) != int(a[i])\n c = cur // 2\n\nprint(ans)\n", "w=int(input())\nx = int(input()[::-1], 2)\ny=(x+1)%2**w\nprint(bin(y^x).count(\"1\"))\n", "n = int(input())\r\nsource = str(input())\r\nref = n * [0]\r\ncarry = 1\r\nfor j in range(n):\r\n ref[j] = ord(source[j]) - 48\r\n if carry == 1:\r\n if ref[j] == 1:\r\n ref[j] = 0\r\n else:\r\n ref[j] = 1\r\n carry = 0\r\ncount = 0\r\nfor j in range(n):\r\n if ref[j] != ord(source[j]) - 48:\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\ns = input()+\"0\"\nt = 0\nwhile s[t] == '1' and t != n:\n\tt+=1\nif t < n:\n\tt+=1\nprint(t)\n", "a = int(input())\nb = input()\nn = []\nl = []\nfor i in b:\n n.append(int(i))\n l.append(int(i))\nfor i in range(len(n)):\n if n[i] == 0:\n n[i] = 1\n break\n else:\n n[i] = 0\nk = 0\nfor i in range(len(l)):\n if l[i] != n[i]:\n k += 1\nprint(k)\n", "x = int(input())\na = input()\nmim = 0\nfor i in range(x):\n mim = mim + 1\n if a[i] == \"0\":\n\t break\nprint(mim)\n\t\t\t\t\t \t \t \t\t \t\t \t", "input()\r\nnumber = input()\r\n\r\ni = 0\r\nwhile i < len(number) and number[i] == '1':\r\n i += 1\r\n\r\nif i + 1 > len(number):\r\n i = len(number) - 1\r\n\r\nprint(i + 1)\r\n", "a=input()\r\n\r\nb=(list(input()))\r\nb.append(\"0\")\r\nc=b.index(\"0\")\r\nif(c+1==len(b)):\r\n print(c)\r\n\r\nelse:\r\n print(c+1)\r\n", "n=int(input())\r\ns=input()\r\np=0\r\nfor i in range(n):\r\n if(s[i]=='0'):\r\n p+=1\r\n break\r\n else:\r\n p+=1\r\nprint(p)\r\n", "#!/usr/bin/env python\n#coding: UTF-8\n'''\nCopyright (c) 2014 Samuel Groß\n'''\nimport fileinput\n\ndef solve(l):\n count = 0\n\n for e in l:\n if e == 1:\n count += 1\n if e == 0:\n count += 1\n return count\n\n return count\n\n\nif __name__ == '__main__':\n c = 0\n for line in fileinput.input():\n if c % 2 == 1:\n l = list(map(int, (c for c in line if c != '\\n')))\n\n sol = solve(l)\n print(sol)\n c += 1\n\n", "n = int(input())\r\ns = input()\r\nif '0' not in s:\r\n ans = n\r\nelse:\r\n ans = s.index('0') + 1\r\nprint(ans)", "i = int(input())\r\nstr = str(input())\r\n\r\nfor x in range(0 , i) :\r\n if(str[x] == '0') :\r\n print(x + 1)\r\n exit() ;\r\n\r\nprint(i) ;\r\n", "n = int(input())\r\nbit = input()\r\ndigits = []\r\ndigits2 = []\r\ncount = 1\r\nfor letter in bit:\r\n digits.append(int(letter))\r\n digits2.append(int(letter))\r\ndigits.append(0)\r\ndigits[0] += 1\r\nwhile 2 in digits:\r\n x = digits.index(2)\r\n digits[x] = 0\r\n digits[x+1] += 1\r\ndiff = 0\r\nfor i in range(n):\r\n if digits[i] == digits2[i]:\r\n pass\r\n else:\r\n diff += 1\r\nprint(diff)\r\n", "n = int(input())\nbx = input()\n\nbxr = bx[::-1]\ndx = int(bxr, 2)\ndy = dx + 1\nbyr = bin(dy)[2:]\nby = '{0:0<{1}}'.format(byr[::-1], n)\n\nr = 0\nfor i in range(n):\n if bx[i] != by[i]:\n r += 1\n\nprint(r)\n", "n=int(input())\na=input()\ncount=1\nflag=0\nfor i in a:\n if i==\"1\":\n count += 1\n else:\n flag=1\n break\nif flag==0:\n count -= 1\nprint(count)", "n=int(input())\r\ns=input()\r\ny=0\r\nfor i in range(0,len(s)):\r\n if s[i]==\"1\":\r\n y+=1\r\n else:\r\n y+=1\r\n break\r\nprint(y)\r\n", "input()\ns = input()\ni = 0\nwhile i < len(s) and s[i] == '1':\n\ti += 1\nprint(min(i + 1, len(s)))\n", "n = input()\ns = input()\nresult = 0\nfor c in s:\n if c == \"1\":\n result += 1\n else:\n result += 1\n break\nprint(result)", "n = int(input())\r\ns = input()\r\nans = 1\r\nfor i in s:\r\n if i == '1':\r\n ans += 1\r\n else:\r\n break\r\nprint(min(n, ans))", "n, v = int(input()), input()\nfor i in range(n):\n if v[i] == \"0\":\n break\nres = i + 1\nprint(res)\n", "n=int(input())\r\nl=input()\r\ncount=0\r\nfor i in l:\r\n count+=1\r\n if i=='0':\r\n print(count)\r\n break\r\nelse:\r\n print(count)", "n = int(input())\r\na0 = input()\r\na = bin(int(a0[::-1], 2) + 1)[2:][::-1]\r\nif len(a) < n: a += '0' * (n - len(a))\r\nans = 0\r\nfor i in range(n): ans += abs(int(a0[i]) - int(a[i]))\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\nswaps = 0\r\nk = 0\r\nfor i in range(len(s)):\r\n if int(s[i]) == 0:\r\n k += 1\r\n break\r\n k += 1\r\nprint(k)\r\n", "\r\n\r\nn=int(input())\r\ns=input()\r\n\r\ncnt=0\r\nfor i in range(n):\r\n if s[i]=='0':\r\n cnt+=1\r\n break\r\n\r\n cnt+=1\r\n\r\nprint(cnt)", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------02.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\ns=str(input())\r\nE=0;d=[]\r\nfor i in range(n):d.append(int(s[i]))\r\nd.append(0);d[0]+=1\r\nfor i in range(n):\r\n if d[i]>1:\r\n d[i]=0;d[i+1]+=1\r\n E+=1\r\n else:\r\n E+=1\r\n break\r\nprint(E)\r\n ", "bits = int(input())\n\nnum = input()\ntotal = 0\nfor i in num:\n\tif i == \"0\":\n\t\ttotal += 1\n\t\tbreak\n\telse:\n\t\ttotal += 1\n\nprint(total)", "def inc_arg(s):\r\n count = 0\r\n s = list(s)\r\n for i in range(len(s)):\r\n if s[i] == '1':\r\n s[i] = '0'\r\n count += 1\r\n else:\r\n s[i] = '1'\r\n count += 1\r\n break\r\n return count\r\n\r\n\r\nn = int(input())\r\nprint(inc_arg(input()))\r\n", "n = int(input())\r\ns = input()\r\nv = int(s[::-1], 2) + 1\r\nres = bin(v)[2:].zfill(n)[::-1][:n]\r\nans = 0\r\nfor i in range(n):\r\n if s[i] != res[i]:\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\nlinha = input()\r\nans = 0\r\nfor e in linha:\r\n ans += 1\r\n if(e == '0'): break\r\nprint(ans)", "input()\r\ns=input()\r\nprint(s.index('0')+1 if '0' in s else len(s))", "t=int(input())\r\n\r\n\r\ns=input()\r\n\r\n\r\nl=int(s[::-1],2)+1\r\nh=bin(l)[::-1]\r\n\r\n\r\nw=h[:-2]\r\np=0\r\n\r\nq=len(w)\r\nfor k in range(t):\r\n if k<= q-1:\r\n if w[k]!= s[k]:\r\n p+=1\r\n else:\r\n pass\r\n\r\nif k< t-1:\r\n print(p+ t-q)\r\nelse:\r\n print(p)\r\n", "n = int(input())\r\ns = input()\r\n\r\nchange = 0\r\nin_hand = 1\r\n\r\nfor i in range(n):\r\n if (int(s[i]) + in_hand) == 0:\r\n pass\r\n elif (int(s[i]) + in_hand) == 1 and s[i] == \"1\":\r\n pass\r\n elif (int(s[i]) + in_hand) == 1 and in_hand == 1:\r\n in_hand = 0\r\n change += 1\r\n else:\r\n change += 1\r\nprint(change)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = input().rstrip()[::-1]\r\ntmp = bin(int(data, 2) + 1)[2:]\r\ntmp = (n - len(tmp)) * '0' + tmp\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n if data[-(i + 1)] != tmp[-(i + 1)]:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "import re\r\ncv=0\r\ns2=''\r\nn=int(input())\r\ns1=input()\r\nfor x in range(n):\r\n if int(s1[x])==1:\r\n s2=s2+'0'\r\n else:\r\n s2=s2+'1'\r\n s2=s2+s1[x+1:n]\r\n break;\r\nfor x in range(n):\r\n if re.match(s1[x],s2[x]):\r\n cv=cv+1\r\nprint(n-cv)\r\n", "n=int(input())\r\ncell=input()\r\nb=0\r\nplace=cell.find(\"0\")\r\nif place==(-1):\r\n print(n)\r\nelse:\r\n print(place+1)\r\n", "n=input()\r\nf=input()\r\nm=1\r\nd=[int(x) for x in f]\r\nd[0]+=1\r\nfor x in range(1,len(d)):\r\n if d[x-1]>1:\r\n d[x]+=1\r\n d[x-1]=0\r\n m+=1\r\nprint(m)\r\n", "n=int(input())\r\ns=input()\r\na=\"1\"\r\nb=s[::-1]\r\nans=bin(int(a,2)+int(b,2))\r\nans=ans[2:]\r\nans=\"0\"*(len(s)-len(ans))+ans\r\nans=ans[::-1]\r\nc=0\r\nfor i in range(n):\r\n if s[i]!=ans[i]:\r\n c=c+1\r\nprint(c)", "n = int(input())\r\ns = input()\r\nif len(set(s)) == 1 and '1' in s:\r\n print(n)\r\nelse:\r\n l = 0\r\n while s[l] == '1':\r\n l += 1\r\n print(l + 1)\r\n", "n = int(input())\r\ns = input()[::-1]\r\nns = int(s,2)\r\nb = (ns+1)^ns\r\nprint(min(bin(b).count(\"1\"),n))", "import sys\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\ndef input(): return sys.stdin.readline().strip('\\n')\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nc = 0\r\ni = 0\r\nwhile i < n and s[i] == '1':\r\n c += 1\r\n i += 1\r\n\r\nif i == n:\r\n print(c)\r\nelse:\r\n print(c+1)\r\n", "def solve(s,n):\n s = \"\".join(reversed(s))\n res = bin(int(s,2) + int('1',2))[2:]\n count = 0\n if len(res) < n:\n res = '0'*(n-len(res)) + res\n elif len(res) > n:\n res = res[len(res)-n:]\n for i in range(len(s)):\n if s[i] != res[i]:\n count += 1\n return count\n \n\ndef main():\n n = int(input())\n s = input()\n print(solve(s, n))\n\nmain()\n", "n=int(input())\r\nli=list(input())\r\nfor i in range(n):\r\n if li[i]==\"0\":\r\n print(i+1)\r\n exit(0)\r\nelse:\r\n print(n)", "n = int(input())\nnum = input()\nidx = num.find('0')\nif idx == -1:\n print(str(n))\nelse:\n print(str(idx+1))\n", "#!/usr/bin/python3\n\nn = int(input())\n\nbits = input()\n\nbits = [int(i) for i in bits]\n\nstate = 0\nadd_bit = 1 # Addend bit. We start by adding 1\n\nfor x in bits:\n\tx += add_bit\n\tif x == 2:\n\t\tstate += 1\n\t\tadd_bit = 1\n\t\tcontinue\n\tif x == 1:\n\t\tstate += 1\n\t\tadd_bit = 0\n\t\tbreak\n\nprint(state) ", "#!/usr/bin/env python3\n\ndef main():\n n = input()\n s = input()\n\n c = 0\n\n for x in s:\n c += 1\n\n if x == '0':\n break\n\n print(c)\n\nif __name__ == '__main__':\n main()", "n=int(input())\r\nl=list(input())\r\nif \"0\" not in l:\r\n print(n)\r\nelse:\r\n print(l.index(\"0\")+1)", "n=int(input())\r\n\r\nS = input()\r\nr = 1\r\na = 0\r\nfor s in S:\r\n if s == '0' and r == 1:\r\n a += 1\r\n r = 0\r\n if s == '1' and r == 1:\r\n a += 1\r\n r = 1\r\nprint(a) \r\n ", "# ---rgkbitw---\r\n# 7.10.2017\r\nn=input()\r\ns=[ int(i) for i in input() ]\r\ncount=0\r\nadd=1\r\nfor i in s:\r\n if i==1 and add==1:\r\n count+=1\r\n elif i==1 and add==0:\r\n count+=0\r\n elif i==0 and add==0:\r\n count+=0\r\n elif i==0 and add==1:\r\n count+=1\r\n add=0\r\nprint(count) \r\n \r\n", "n = input()\r\ns = input()\r\n\r\nadd = 1\r\nchange = 0\r\n\r\nfor x in s:\r\n if x == '0' and add == 1:\r\n change = change +1\r\n add = 0\r\n elif x == '1' and add == 1:\r\n change = change +1\r\n \r\nprint(change)", "n = int(input())\r\nk = input().lstrip('1')\r\nprint([n-len(k)+1,n][not len(k)])", "__author__ = 'hamed1soleimani'\n\nn = int(input())\ndata = input()\n\ni = data.find('0')\n\nif i >= 0:\n print(i + 1)\nelse:\n print(n)\n\n\n\n\n", "def solution():\r\n n = int(input())\r\n bits = list(input())\r\n if \"0\" not in bits:\r\n return n\r\n return bits.index(\"0\") + 1\r\n\r\n\r\nprint(solution())\r\n", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tline = str(input())\r\n\ttar = 0\r\n\tfor i in range(n):\r\n\t\ttar += 1\r\n\t\tif line[i] == '0':\r\n\t\t\tbreak\r\n\tprint(tar)\r\n", "n = int(input())\r\nm = int(input()[::-1], 2)\r\nl = ((m + 1) & ((1 << n) - 1))\r\nres = 0\r\nfor i in range(n):\r\n\tif ((m&1) != (l&1)): res += 1\r\n\tl >>= 1\r\n\tm >>= 1\r\nprint(res)", "def dec_to_bin(x):\r\n return int(bin(x)[2:])\r\ndef count_s(r,i):\r\n index = 0\r\n c=0\r\n for j in r:\r\n if(j != i[index]):\r\n c=c+1\r\n index=index+1\r\n return c\r\nnstr=input()\r\nn=int(nstr)\r\nistr=input()\r\nl=len(istr)\r\niistr=istr[::-1]\r\n\r\nno=int(iistr,2)\r\nno = no+1\r\nrstr=str(dec_to_bin(no))\r\n\r\nrstr=rstr[::-1]\r\nfor j in range(n-len(str(dec_to_bin(no)))):\r\n rstr=rstr+'0'\r\nrstr=rstr[:l]\r\nprint(count_s(rstr,istr))\r\n \r\n", "n=int(input())\r\ns=list(input())\r\nif \"0\" in s:\r\n print(s.index(\"0\")+1)\r\nelse:\r\n print(n)", "n, box = int(input()), input()\r\nans = 1\r\nif box[0] == '0':\r\n pass\r\nelse:\r\n for bit in box:\r\n if bit == '1':\r\n ans += 1\r\n else:\r\n break\r\nprint(min(ans, n))", "n=int(input())\r\ns=input()\r\nc=0\r\nfor i in range(n):\r\n\tc+=1\r\n\tif s[i]=='0':\r\n\t\tbreak\r\nprint(c)", "# Q.B\nn = int(input())\nstrnum = input()\ncount=0\nflag=0\nfor x in strnum:\n if x=='1':\n count+=1\n continue\n else:\n flag=1\n break\nif flag:\n print(str(count+1))\nelse:\n print(str(n))", "import math\r\n\r\nn=int(input())\r\nd=list(input())\r\nold_num_bin=[]\r\nfor i in range(n):\r\n old_num_bin.append(int(d[n-i-1]))\r\nold_num_value=0\r\nfor i in range(n):\r\n old_num_value+=(int(d[i]))*(pow(2,i))\r\nnew_num_value=old_num_value+1\r\nnew_num_bin=list(bin(new_num_value)[2:])\r\n\r\nif len(new_num_bin)<n:\r\n append_index=n-len(new_num_bin)\r\n for i in range(append_index):\r\n new_num_bin.insert(0,0)\r\nelif len(new_num_bin)>n:\r\n append_index=len(new_num_bin)-n\r\n new_num_bin=list(new_num_bin[append_index:])\r\nk=0\r\nfor i in range(n):\r\n if int(old_num_bin[i])!= int(new_num_bin[i]):\r\n k+=1\r\n\r\nprint(k)", "counter = 0\r\nnum = int(input())\r\nbinary = input()\r\nfor i in range(num):\r\n if(binary[i] == '1'):\r\n counter += 1\r\n else:\r\n break\r\nif(num > counter + 1):\r\n print(counter+1)\r\nelse:\r\n print(num)" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v):\r\n return u * n + v\r\n\r\nn = int(input())\r\ns = []\r\nfor _ in range(n):\r\n s0 = list(input().rstrip())\r\n for i in s0:\r\n s.append(i)\r\nans = 0\r\nx1, y1 = [0] * n, [0] * n\r\nfor i in range(n - 1):\r\n u, v = 0, n - i - 1\r\n for _ in range(i + 1):\r\n if (s[f(u, v)] + x1[u] + y1[v]) % 2:\r\n ans += 1\r\n x1[u] += 1\r\n y1[v] += 1\r\n u, v = u + 1, v + 1\r\nx2, y2 = [0] * n, [0] * n\r\nfor i in range(n - 1):\r\n u, v = n - i - 1, 0\r\n for _ in range(i + 1):\r\n if (s[f(u, v)] + x2[u] + y2[v]) % 2:\r\n ans += 1\r\n x2[u] += 1\r\n y2[v] += 1\r\n u, v = u + 1, v + 1\r\nc = [i + j + k + l for i, j, k, l in zip(x1, x2, y1, y2)]\r\nfor i in range(n):\r\n if (s[f(i, i)] + c[i]) % 2:\r\n ans += 1\r\nprint(ans)", "n=int(input())\nT=[]\nfor i in range(n):\n T.append(input()[::-1])\n\nVal=['0','1']\nS=0\n\nL1=[0]*n\nC1=[0]*n\nfor diag in range(n-1):\n for i in range(diag+1):\n l,c=L1[i],C1[diag-i]\n if T[i][diag-i]!=Val[(l+c)%2]:\n S+=1\n L1[i]=1-l\n C1[diag-i]=1-c\n\n \nL2=[0]*n\nC2=[0]*n\nfor diag in range(n-1):\n for i in range(diag+1):\n l,c=L2[i],C2[diag-i]\n if T[n-diag+i-1][n-i-1]!=Val[(l+c)%2]:\n S+=1\n L2[i]=1-l\n C2[diag-i]=1-c\n \nfor i in range(n):\n if Val[(L1[i]+L2[i]+C1[n-i-1]+C2[n-i-1])%2]!=T[i][n-i-1]:\n S+=1\n \nprint(S)\n\n" ]

[ "#Problem Set F: Collaborated with no one\n\nn = int(input())\n\nresult = 0\ntemp = 0\n\nb_red = 0\nb_blue = 0\n\nfinal_red = -1\nfinal_blue = -1\nfinal_green = -(1<<60)\n\n\nfor i in range(n):\n cost_colorList = input().split()\n cost = int(cost_colorList[0])\n color = cost_colorList[1]\n \n\n if color == 'R' or color == 'G':\n if final_red != -1:\n b_red = max(b_red, cost - final_red)\n temp += cost - final_red\n final_red = cost\n\n if color == 'B' or color == 'G':\n if final_blue != -1:\n b_blue = max(b_blue, cost - final_blue)\n temp += cost - final_blue\n final_blue = cost\n\n if color == 'G':\n result += temp + min(0, - b_red - b_blue + cost - final_green)\n final_red = final_blue = final_green = cost\n b_red = b_blue = temp = 0\n\nresult += temp\nprint(result)\n\n \t \t \t\t\t \t \t \t\t\t\t \t", "k=int(input())\r\nt,a,b,m,n,o,d,e,s,x,y,z,l=13*[0]\r\nfor i in range(k):\r\n c=input().split(\" \")\r\n f=int(c[0])\r\n if c[1]==\"G\":\r\n if o<1:\r\n z=f\r\n if t:\r\n if m>0:\r\n d=max(d,f-m)\r\n if n>0:\r\n e=max(e,f-n)\r\n s+=min(2*(f-o),3*(f-o)-d-e)\r\n d,e,a,b=4*[0]\r\n m=f\r\n n=f\r\n o=f\r\n t=1\r\n l+=1\r\n if c[1]==\"R\":\r\n a+=1\r\n if m<1:\r\n x=f\r\n if m>0 and t:\r\n d=max(d,f-m)\r\n m=f\r\n if c[1]==\"B\":\r\n b+=1\r\n if n<1:\r\n y=f\r\n if n>0 and t:\r\n e=max(e,f-n)\r\n n=f\r\nif l>0:\r\n if a>0:\r\n s+=m-o\r\n if b>0:\r\n s+=n-o\r\n if x>0:\r\n s+=z-x\r\n if y>0:\r\n s+=z-y\r\nelse:\r\n s=m-x+n-y\r\nprint(s)", "#collaborated with Prasoon Shakya\nn = int(input())\nR,G,B=0,0,0\nmaxR,maxG,maxB=0,0,0\nCost = 0\nfor i in range(n):\n \n temp_input = input().split(\" \")\n value = int(temp_input[0])\n choice=temp_input[1]\n\n if choice == \"R\" or choice == \"G\":\n if R:\n \n Cost += value - R\n maxR = max(maxR, value - R)\n R = value\n if choice == \"B\" or choice == \"G\":\n if B:\n Cost += value - B\n maxB = max(maxB, value - B)\n B = value\n if choice == \"G\":\n if G:\n Cost += min(0, value - G - maxR - maxB)\n G = value\n maxR = 0\n maxB = 0\nprint(Cost)\n\n\t\t \t \t \t \t\t \t\t \t\t \t\t \t", "def calculate_minimum_cost(n, points):\n total_cost = 0\n max_distance_r, max_distance_b, last_position_r, last_position_b, last_position_g = 0, 0, -1, -1, float('-inf')\n partial_cost = 0\n\n for i in range(n):\n position, color = points[i]\n\n if color in ('R', 'G'):\n if last_position_r != -1:\n distance = position - last_position_r\n max_distance_r = max(max_distance_r, distance)\n partial_cost += distance\n last_position_r = position\n\n if color in ('B', 'G'):\n if last_position_b != -1:\n distance = position - last_position_b\n max_distance_b = max(max_distance_b, distance)\n partial_cost += distance\n last_position_b = position\n\n if color == 'G':\n total_cost += partial_cost + min(0, -max_distance_r - max_distance_b + position - last_position_g)\n last_position_r = last_position_b = last_position_g = position\n max_distance_r = max_distance_b = partial_cost = 0\n\n total_cost += partial_cost\n\n return total_cost\n\nn = int(input())\npoints = []\nfor _ in range(n):\n p, c = input().split()\n points.append((int(p), c))\n\nminimum_cost = calculate_minimum_cost(n, points)\n\nprint(minimum_cost)", "def calculate_minimum_cost(n, points):\n total_cost = 0\n partial_cost = 0\n max_distance_r = 0\n max_distance_b = 0\n last_position_r = -1\n last_position_b = -1\n last_position_g = float('-inf')\n\n for i in range(n):\n position, color = points[i]\n\n if color in ('R', 'G'):\n if last_position_r != -1:\n max_distance_r = max(max_distance_r, position - last_position_r)\n partial_cost += position - last_position_r\n last_position_r = position\n\n if color in ('B', 'G'):\n if last_position_b != -1:\n max_distance_b = max(max_distance_b, position - last_position_b)\n partial_cost += position - last_position_b\n last_position_b = position\n\n if color == 'G':\n total_cost += partial_cost + min(0, -max_distance_r - max_distance_b + position - last_position_g)\n last_position_r = last_position_b = last_position_g = position\n max_distance_r = max_distance_b = partial_cost = 0\n\n total_cost += partial_cost\n\n return total_cost\n\nif __name__ == '__main__':\n n = int(input())\n points = [input().split() for _ in range(n)]\n points = [(int(p), c) for p, c in points]\n\n minimum_cost = calculate_minimum_cost(n, points)\n\n print(minimum_cost)\n", "#! /usr/bin/env python3\n#------------------------------------------------\n# Author: krishna\n# Created: Fri Dec 29 23:04:38 IST 2017\n# File Name: f.py\n# USAGE:\n# f.py\n# Description:\n# \n#------------------------------------------------\nimport sys\n\n\nn = int(sys.stdin.readline().rstrip())\n\nlocations = {\n 'R' : [],\n 'G' : [],\n 'B' : []\n}\n\nfor i in range(n):\n (x, c) = sys.stdin.readline().rstrip().split()\n locations[c].append(int(x))\n\n# for c in locations.keys():\n# locations[c].sort()\n\ndef solve(locations):\n count = 0\n rPtr = 0\n bPtr = 0\n gPtr = 0\n\n if (len(locations['G']) == 0):\n if (len(locations['R'])):\n count += locations['R'][-1] - locations['R'][0]\n if (len(locations['B'])):\n count += locations['B'][-1] - locations['B'][0]\n\n return count\n\n while (len(locations['G']) > gPtr):\n # Eat predecessors\n if (\n (len(locations['R']) > rPtr)\n and (locations['G'][gPtr] > locations['R'][rPtr])\n ):\n count += locations['G'][gPtr] - locations['R'][rPtr]\n while (\n (len(locations['R']) > rPtr)\n and (locations['G'][gPtr] > locations['R'][rPtr])\n ):\n rPtr += 1\n\n # Eat predecessors\n if (\n (len(locations['B']) > bPtr)\n and (locations['G'][gPtr] > locations['B'][bPtr])\n ):\n count += locations['G'][gPtr] - locations['B'][bPtr]\n while (\n (len(locations['B']) > bPtr)\n and (locations['G'][gPtr] > locations['B'][bPtr])\n ):\n bPtr += 1\n\n # Eat last successors\n if (len(locations['G']) == (gPtr + 1)):\n if (len(locations['R']) > rPtr):\n count += locations['R'][-1] - locations['G'][gPtr]\n\n if (len(locations['B']) > bPtr):\n count += locations['B'][-1] - locations['G'][gPtr]\n\n return count\n\n # Calc intervels\n if (len(locations['G']) > (gPtr + 1)):\n prevR = locations['G'][gPtr]\n maxRd = 0\n while (len(locations['R']) > rPtr):\n if (locations['R'][rPtr] < locations['G'][gPtr + 1]):\n maxRd = max(maxRd, locations['R'][rPtr] - prevR)\n prevR = locations['R'][rPtr]\n rPtr += 1\n else:\n break\n maxRd = max(maxRd, locations['G'][gPtr + 1] - prevR)\n\n prevB = locations['G'][gPtr]\n maxBd = 0\n while (len(locations['B']) > bPtr):\n if (locations['B'][bPtr] < locations['G'][gPtr + 1]):\n maxBd = max(maxBd, locations['B'][bPtr] - prevB)\n prevB = locations['B'][bPtr]\n bPtr += 1\n else:\n break\n maxBd = max(maxBd, locations['G'][gPtr + 1] - prevB)\n\n count += min(\n 2 * (locations['G'][gPtr + 1] - locations['G'][gPtr]),\n (3 * (locations['G'][gPtr + 1] - locations['G'][gPtr])) - maxRd - maxBd\n )\n\n gPtr += 1\n\n return count\n\nprint(solve(locations))\n", "n = int(input())\nred_edges = []\nblue_edges = []\ngreen_positions = []\nans = 0\nlast_red = last_blue = last_green = -1\n\nfor i in range(n):\n p, c = input().split()\n p = int(p)\n\n if c == 'R' or c == 'G':\n if last_red != -1:\n red_edges.append(p - last_red)\n last_red = p\n\n if c == 'B' or c == 'G':\n if last_blue != -1:\n blue_edges.append(p - last_blue)\n last_blue = p\n\n if c == 'G':\n ans += sum(red_edges) + sum(blue_edges)\n\n if len(red_edges) > 0:\n max_red = max(red_edges)\n else:\n max_red = -1\n\n if len(blue_edges) > 0:\n max_blue = max(blue_edges)\n else:\n max_blue = -1\n\n if last_green != -1:\n dist = p - last_green\n if dist < max_red + max_blue:\n ans += dist\n ans -= max_red + max_blue\n\n red_edges.clear()\n blue_edges.clear()\n last_green = p\n green_positions.append(p)\n\nans += sum(red_edges) + sum(blue_edges)\n\nprint(ans)\n", "import sys\n\nn = int(input())\npos = []\n\nind = 0\ninp = [s for line in sys.stdin.readlines() for s in line.split()]\n\ncolor = []\ncosts = 0\nreds = []\ngreens = []\nblues = []\nfor i in range(n):\n a,b = inp[ind],inp[ind+1]\n ind+=2\n pos.append(int(a))\n color.append(b)\n if b=='R':\n reds.append(i)\n elif b=='G':\n greens.append(i)\n else:\n blues.append(i)\n\nif len(greens)==0:\n if len(reds)>0:\n a = reds[0]\n b = reds[-1]\n costs += pos[b] - pos[a]\n \n if len(blues)>0:\n a = blues[0]\n b = blues[-1]\n costs += pos[b] - pos[a]\n print(costs)\n sys.exit()\n\n\n\nfirst_g = greens[0]\nlast_g = greens[-1]\nif len(blues)>0 and blues[0]<=first_g:\n costs += pos[first_g] - pos[blues[0]]\nif len(reds)>0 and reds[0]<=first_g:\n costs += pos[first_g] - pos[reds[0]]\n\nif len(blues)>0 and blues[-1]>= last_g:\n costs += pos[blues[-1]] - pos[last_g]\nif len(reds)>0 and reds[-1] >= last_g:\n costs += pos[reds[-1]] - pos[last_g]\n\ni = first_g\nwhile True: \n j = i+1\n REDS = [i]\n BLUES = [i]\n while j<n and color[j]!='G':\n if color[j]=='R':\n REDS.append(j)\n else:\n BLUES.append(j)\n j+=1\n if j>=n:\n break\n REDS.append(j)\n BLUES.append(j)\n best_r = 0\n for ind in range(len(REDS)-1):\n a = REDS[ind]\n b = REDS[ind+1]\n best_r = max(best_r,pos[b]-pos[a])\n best_b = 0\n for ind in range(len(BLUES)-1):\n a = BLUES[ind]\n b = BLUES[ind+1]\n best_b = max(best_b,pos[b]-pos[a])\n costs += min(2*(pos[j]-pos[i]), 3*(pos[j]-pos[i])-best_r-best_b)\n\n\n i = j\nprint(costs)\n", "\"\"\"\nF. New Year and Rainbow Roads (https://codeforces.com/problemset/problem/908/F)\n\n1. n points, each point has one color: RED, GREEN or BLUE.\n2. Roy and Biv wanna connect all points with some edges.\n3. The cost of an edge is its distance between another point.\n4. All points needs to be connected. (directly or indirectly)\n5. Roy cannot see RED and Biv cannot see BLUE.\n\"\"\"\n\ndef calcular_custo_minimo(n, pontos):\n # Inicializar variáveis\n custo_total = 0\n custo_parcial = 0\n maior_distancia_r = 0\n maior_distancia_b = 0\n ultima_posicao_r = -1\n ultima_posicao_b = -1\n ultima_posicao_g = float('-inf')\n \n # Iterar sobre todos os pontos\n for i in range(n):\n posicao, cor = pontos[i]\n \n if cor == 'R' or cor == 'G':\n if ultima_posicao_r != -1:\n maior_distancia_r = max(maior_distancia_r, posicao - ultima_posicao_r)\n custo_parcial += posicao - ultima_posicao_r\n ultima_posicao_r = posicao\n \n if cor == 'B' or cor == 'G':\n if ultima_posicao_b != -1:\n maior_distancia_b = max(maior_distancia_b, posicao - ultima_posicao_b)\n custo_parcial += posicao - ultima_posicao_b\n ultima_posicao_b = posicao\n \n if cor == 'G':\n custo_total += custo_parcial + min(0, -maior_distancia_r - maior_distancia_b + posicao - ultima_posicao_g)\n ultima_posicao_r = ultima_posicao_b = ultima_posicao_g = posicao\n maior_distancia_r = maior_distancia_b = custo_parcial = 0\n \n custo_total += custo_parcial\n \n return custo_total\n\nif __name__ == '__main__':\n n = int(input())\n pontos = [input().split() for _ in range(n)]\n pontos = [(int(p), c) for p, c in pontos]\n \n custo_minimo = calcular_custo_minimo(n, pontos)\n \n print(custo_minimo)\n\n", "n = int(input())\r\nout = 0\r\nlastG = -1\r\nlastR = -1\r\nlastB = -1\r\nmaxR = 0\r\nmaxB = 0\r\naccumR = 0\r\naccumB = 0\r\nfor _ in range(n):\r\n #print(out)\r\n x, c = input().strip().split()\r\n x = int(x)\r\n if c == 'G':\r\n if lastG != -1:\r\n length = x-lastG\r\n maxR = max(maxR, x-lastR)\r\n maxB = max(maxB, x-lastB)\r\n out += min(2*length, 3*length-maxR-maxB)\r\n #print(length, maxR, maxB)\r\n else:\r\n if lastR != -1:\r\n out += accumR + x - lastR\r\n if lastB != -1:\r\n out += accumB + x - lastB\r\n lastG = x\r\n lastR = x\r\n lastB = x\r\n maxR = 0\r\n maxB = 0\r\n accumR = 0\r\n accumB = 0\r\n elif c == \"R\":\r\n if lastR != -1:\r\n maxR = max(maxR, x-lastR)\r\n accumR += x-lastR\r\n lastR = x\r\n else:\r\n if lastB != -1:\r\n maxB = max(maxB, x-lastB)\r\n accumB += x-lastB\r\n lastB = x\r\nout += accumR + accumB\r\n#print(\"ans\")\r\nprint(out)" ]

[ "import dataclasses\r\n\r\nclass node:\r\n count : int = 0\r\n l : \"node\" = None\r\n r : \"node\" = None\r\n\r\nclass bit_bor:\r\n def __init__(self, k):\r\n self.k = k\r\n self.l = None\r\n self.r = None\r\n def add(self, x):\r\n bitmask = 1 << self.k\r\n current_node = self\r\n while bitmask > 0:\r\n if bitmask & x:\r\n if current_node.r is None:\r\n current_node.r = node()\r\n current_node = current_node.r\r\n else:\r\n if current_node.l is None:\r\n current_node.l = node()\r\n current_node = current_node.l\r\n current_node.count += 1\r\n bitmask >>= 1\r\n def remove(self, x):\r\n bitmask = 1 << self.k\r\n current_node = self\r\n while bitmask > 0:\r\n if bitmask & x:\r\n if current_node.r.count == 1:\r\n current_node.r = None\r\n return\r\n current_node = current_node.r\r\n else:\r\n if current_node.l.count == 1:\r\n current_node.l = None\r\n return\r\n current_node = current_node.l\r\n current_node.count -= 1\r\n bitmask >>= 1\r\n def query(self, x):\r\n x ^= (1 << (self.k+1)) - 1\r\n result = 0\r\n bitmask = 1 << self.k\r\n current_node = self\r\n priority_node = None\r\n while bitmask > 0:\r\n priority_node = current_node.r if bitmask & x else current_node.l\r\n nonpriority_node = current_node.l if bitmask & x else current_node.r\r\n if priority_node is not None:\r\n result |= bitmask\r\n current_node = priority_node\r\n else:\r\n current_node = nonpriority_node\r\n bitmask >>= 1\r\n return result\r\n\r\nq = int(input())\r\ntree = bit_bor(31)\r\ntree.add(0)\r\nfor _ in range(q):\r\n op, x = input().split()\r\n x = int(x)\r\n if op == '+':\r\n tree.add(x)\r\n elif op == '-':\r\n tree.remove(x)\r\n else:\r\n print(tree.query(x))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import deque\r\n\r\nclass Node():\r\n def __init__(self):\r\n self.data=0\r\n self.left=None\r\n self.right=None\r\n self.count=0\r\nclass Trie:\r\n def __init__(self):\r\n self.root=Node()\r\n def add(self,val):\r\n self.temp=self.root\r\n for i in range(31,-1,-1):\r\n v=(val)&(1<<i)\r\n if v:\r\n if not self.temp.right:\r\n self.temp.right=Node()\r\n self.temp=self.temp.right\r\n self.temp.count+=1\r\n else:\r\n if not self.temp.left:\r\n self.temp.left=Node()\r\n self.temp=self.temp.left\r\n self.temp.count+=1\r\n self.temp.data=val\r\n def delete(self,val):\r\n self.temp=self.root\r\n for i in range(31,-1,-1):\r\n v=(val)&(1<<i)\r\n if v:\r\n self.temp=self.temp.right\r\n self.temp.count-=1\r\n else:\r\n self.temp=self.temp.left\r\n self.temp.count-=1\r\n def query(self,val):\r\n self.temp=self.root\r\n for i in range(31,-1,-1):\r\n v=val&(1<<i)\r\n if v:\r\n if self.temp.left and self.temp.left.count>0:\r\n self.temp=self.temp.left\r\n elif self.temp.right and self.temp.right.count>0:\r\n self.temp=self.temp.right\r\n else:\r\n if self.temp.right and self.temp.right.count>0:\r\n self.temp=self.temp.right\r\n elif self.temp.left and self.temp.left.count>0:\r\n self.temp=self.temp.left\r\n return max(val^self.temp.data,val)\r\n \r\ntrie = Trie()\r\nfor _ in range(int(input())):\r\n arr = input().split()\r\n arr[1] = int(arr[1])\r\n if arr[0]=='+':\r\n trie.add(arr[1])\r\n elif arr[0]=='-':\r\n trie.delete(arr[1])\r\n else:\r\n print(trie.query(arr[1]))\r\n\r\n \r\n", "class TrieNode:\r\n def __init__(self):\r\n self.left = None\r\n self.right = None\r\n self.count = 0\r\n\r\nclass Trie:\r\n def __init__(self):\r\n self.root = TrieNode()\r\n \r\n def insert(self, binNum):\r\n cur = self.root\r\n cur.count += 1\r\n for b in binNum:\r\n if b == \"0\":\r\n if not cur.left:\r\n cur.left = TrieNode()\r\n cur = cur.left\r\n else:\r\n if not cur.right:\r\n cur.right = TrieNode()\r\n cur = cur.right\r\n cur.count += 1\r\n\r\n def remove(self, binNum):\r\n cur = self.root\r\n cur.count -= 1\r\n for b in binNum:\r\n \r\n if cur.count == 0:\r\n cur.left = None\r\n cur.right = None\r\n break\r\n if b == \"0\":\r\n if cur.left.count == 1:\r\n cur.left = None\r\n break\r\n cur = cur.left\r\n else:\r\n if cur.right.count == 1:\r\n cur.right = None\r\n break\r\n cur = cur.right\r\n cur.count -= 1\r\n \r\n def search(self, binNum):\r\n cur = self.root\r\n ans = \"\"\r\n for b in binNum:\r\n if b == \"0\":\r\n if cur.right:\r\n cur = cur.right\r\n ans += \"1\"\r\n else:\r\n cur = cur.left\r\n ans += \"0\"\r\n else:\r\n if cur.left:\r\n cur = cur.left\r\n ans += \"0\"\r\n else:\r\n cur = cur.right\r\n ans += \"1\"\r\n return int(ans, 2)\r\n \r\nn = int(input())\r\nmax_leng = len(bin(10 ** 9)) - 2\r\ntr = Trie()\r\ntr.insert(\"0\" * max_leng)\r\nfor _ in range(n):\r\n si, num = input().split()\r\n num = int(num) \r\n bin_rep = bin(num)[2:]\r\n bin_rep = \"0\" * (max_leng - len(bin_rep)) + bin_rep\r\n if si == \"+\":\r\n tr.insert(bin_rep)\r\n elif si == \"-\":\r\n tr.remove(bin_rep)\r\n else:\r\n b = tr.search(bin_rep)\r\n print(b ^ num)" ]

[ "number_of_ones = int(input())\r\nstring = input()\r\nlist_of_index = []\r\nfor i in range(len(string)):\r\n if string[i] == '1':\r\n list_of_index.append(i)\r\nlist_of_index.append(len(string))\r\ncount = 0\r\nlast_value = 0\r\nadd = 1\r\nif number_of_ones != 0:\r\n for i in range(len(list_of_index) - number_of_ones):\r\n if i == 1:\r\n add = 0\r\n count += (list_of_index[i+number_of_ones] - list_of_index[i+number_of_ones-1]) * (list_of_index[i] - last_value + add)\r\n last_value = list_of_index[i]\r\nelse:\r\n if list_of_index[0] != 0:\r\n list_of_index = [x + 1 for x in list_of_index]\r\n list_of_index.insert(0, 0)\r\n for i in range(len(list_of_index) - 1):\r\n n = list_of_index[i+1] - list_of_index[i] - 1\r\n count += n * (n + 1) / 2\r\nprint(int(count))\r\n", "def solve(k, s):\r\n c = 0\r\n zeros = map(len, s.split('1'))\r\n if k > 0:\r\n zeros = list(zeros)\r\n l = len(zeros)\r\n # print(zeros)\r\n for i in range(l - k + 1):\r\n if i + k >= l:\r\n continue\r\n head, tail = zeros[i], zeros[i + k]\r\n c += (head + 1) * (tail + 1)\r\n return c\r\n else: # k == 0\r\n return sum(e * (e + 1) // 2 for e in zeros)\r\n\r\n\r\nk = int(input())\r\ns = input()\r\nprint(solve(k, s))\r\n", "fact = [0]\r\nfor i in range(1,1000001):\r\n fact.append(fact[-1]+i)\r\n \r\n \r\n\r\n \r\ndef question3():\r\n exact_1 = int(input())\r\n string = input()\r\n one_pos = []\r\n possible_substrings = 0\r\n \r\n for i in range(len(string)):\r\n if string[i] == \"1\":\r\n one_pos.append(i)\r\n \r\n if len(one_pos) < exact_1:\r\n return 0 \r\n if exact_1 == 0:\r\n count = 0\r\n for i in range(len(string)):\r\n if string[i] == \"1\":\r\n if count > 0:\r\n possible_substrings += fact[count]\r\n count = 0 \r\n else:\r\n count += 1 \r\n if count > 0:\r\n possible_substrings += fact[count]\r\n return possible_substrings \r\n \r\n \r\n start = 0 \r\n start_end = exact_1 - 1\r\n for j in range(start_end,len(one_pos)):\r\n if start == 0:\r\n if start_end == len(one_pos) - 1:\r\n possible_substrings += (one_pos[start] + 1)*(len(string) - one_pos[start_end] )\r\n \r\n else: \r\n \r\n possible_substrings += (one_pos[start_end+1] - one_pos[start_end])*(one_pos[start] + 1)\r\n \r\n else:\r\n if start_end == len(one_pos)-1:\r\n possible_substrings += (one_pos[start] - one_pos[start-1])*(len(string) - one_pos[start_end] )\r\n \r\n else:\r\n possible_substrings += (one_pos[start] - one_pos[start-1] )*(one_pos[start_end+1] - one_pos[start_end])\r\n \r\n start += 1 \r\n start_end += 1\r\n \r\n\r\n \r\n\r\n return possible_substrings \r\n \r\nremained_test_cases = 1 \r\n# remained_test_cases = int(input())\r\nwhile remained_test_cases > 0:\r\n print(question3())\r\n remained_test_cases -= 1 ", "k = int(input())\r\ns = input()\r\nc1 = ans = 0\r\ndp = [1] + [0] * (len(s))\r\nfor i in range(len(s)):\r\n c1 += s[i] == \"1\"\r\n dp[c1] += 1\r\n\r\n# classic targ ya comb sum question ho gaya jaise hee 1 ka count rakh diya\r\nfor i in range(k,len(s)+1):\r\n # k ==0 ka edge case dekh lo bass\r\n if not k:ans+=dp[i]*(dp[i]-1)//2\r\n else:ans += dp[i]*dp[max(0, i-k)]\r\n\r\nprint(ans)", "k=int(input())\r\ns=[*map(len,input().split('1'))]\r\nres=0\r\nif k==0:\r\n for i,x in enumerate(s):\r\n res+=(x*(x+1)//2)\r\nelse:\r\n for i,x in enumerate(s[k:]):\r\n res+=((s[i]+1)*(x+1))\r\nprint(res)", "k = int(input())\r\ns = input()\r\nj = 0\r\nans = 0\r\nnext_j = 0\r\ncnt_ones = 0\r\nfor i in range(len(s)):\r\n if j <= i:\r\n j = i + 1\r\n cnt_ones += (1 if s[i] == '1' else 0)\r\n\r\n if cnt_ones < k or j <= i:\r\n\r\n while j < len(s) and cnt_ones < k:\r\n if s[j] == '1':\r\n cnt_ones += 1\r\n j += 1\r\n\r\n if next_j < j:\r\n next_j = j\r\n while next_j < len(s) and s[next_j] != '1':\r\n next_j += 1\r\n\r\n if cnt_ones == k:\r\n ans += next_j - j + 1\r\n\r\n if s[i] == '1':\r\n cnt_ones -= 1\r\n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nk = int(input())\r\ns = input()[:-1]\r\n\r\nif k==0:\r\n ans = 0\r\n cnt = 1\r\n \r\n for i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n cnt += 1\r\n else:\r\n if s[i]=='0':\r\n ans += cnt*(cnt+1)//2\r\n \r\n cnt = 1\r\n \r\n if s[-1]=='0':\r\n ans += cnt*(cnt+1)//2\r\n \r\n print(ans)\r\n exit()\r\n \r\nidx = []\r\n\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n idx.append(i+1)\r\n\r\nidx = [0]+idx+[len(s)+1]\r\nans = 0\r\n\r\nfor i in range(1, len(idx)-1):\r\n if i+k-1<=len(idx)-2:\r\n ans += (idx[i]-idx[i-1])*(idx[i+k]-idx[i+k-1])\r\n\r\nprint(ans)", "from sys import stdin\n\ndef lmap(function, iterable): return list(map(function, iterable))\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return lmap(converter, line().split(delimeter))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMULTIPLE_CASES = 0\n\ndef main():\n K = rd(int)\n S = rd(str)\n\n if K == 0:\n ans = 0\n streak = 0\n\n for c in S:\n if c == \"0\": streak += 1\n else: streak = 0\n ans += streak\n\n print(ans)\n return\n\n inds = [i for i in range(len(S)) if S[i] == \"1\"]\n print(sum((inds[i] - (inds[i-1] if i-1 >= 0 else -1)) * ((inds[i+K] if i+K < len(inds) else len(S)) - inds[i+K-1]) for i in range(len(inds)-K+1)))\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "k = int(input())\r\ns = input()\r\na = [len(x)+1 for x in s.split('1')]\r\nif k == 0:\r\n print(sum(x *(x-1) // 2 for x in a))\r\n exit()\r\ndef find2(s,k):\r\n n = len(s)\r\n l,r = 0,0\r\n count = 0\r\n res = 0\r\n while r < n:\r\n if s[r] == '1':\r\n count += 1\r\n while count > k:\r\n if s[l] == '1':\r\n count -= 1\r\n l += 1\r\n res += r - l + 1\r\n r += 1\r\n return res\r\nprint(find2(s,k) - find2(s,k-1))", "from sys import *\r\nfrom math import *\r\nk=int(stdin.readline())\r\na=list(map(int,input()))\r\npre=[a[0]]\r\nfor i in range(1,len(a)):\r\n pre.append(pre[i-1]+a[i])\r\nd={0:1}\r\nans=0\r\nfor i in pre:\r\n x=i-k\r\n if x in d:\r\n ans+=d[x]\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nprint(ans)", "k=int(input())\r\na=[int(i) for i in input()]\r\nn=len(a)\r\nif k:\r\n b=[0]*n\r\n c=0\r\n for i in range(1,n):\r\n if a[i-1]==0:\r\n b[i]=i-c\r\n elif a[i]==0:\r\n c=i\r\n i,j,d,e=0,-1,0,0\r\n while i<n and j<n:\r\n if d<=k:\r\n if d==k:\r\n while i<n and a[i]==0:\r\n i+=1\r\n e+=b[i]+1\r\n j+=1\r\n if j==n:\r\n break\r\n d+=a[j]\r\n else:\r\n d-=a[i]\r\n i+=1\r\n print(e)\r\nelse:\r\n b=c=0\r\n for i in range(1,n):\r\n if a[i]!=a[i-1]:\r\n if a[i]:\r\n b+=(i-c)*(i-c+1)//2\r\n c=i\r\n if a[n-1]==0:\r\n b+=(n-c)*(n-c+1)//2\r\n print(b)", "# k = int(input())\r\n# s = list(map(str,input()))\r\n# p = []\r\n# l = 1; n = len(s)\r\n# while l <= n:\r\n# for i in range(n):\r\n# if i + l <= n:\r\n# if s[i:i+l].count('1') == k:\r\n# tmp = ''.join(s[i:i+l])\r\n# # print(f\"tmp = {tmp} \")\r\n# p.append(tmp)\r\n# l+=1\r\n# # print(p)\r\n# print(len(p))\r\n \r\n# Licia\r\nk, a, n, s = int(input()), 0, 0, {0: 1}\r\nfor c in input():\r\n n += int(c)\r\n a += s.get(n-k, 0)\r\n s[n] = 1+s.get(n, 0)\r\nprint(a)\r\n", "d=dict()\r\nsumi=0\r\nans=0\r\nk=int(input())\r\ns=input()\r\nfor i in range(len(s)):\r\n sumi+=int(s[i])\r\n if sumi-k in d:\r\n ans+=d[sumi-k]\r\n if sumi in d:\r\n d[sumi]+=1\r\n else:\r\n d[sumi]=1\r\n \r\nif k in d:\r\n d[k]+=0\r\nelse:\r\n d[k]=0\r\nprint(ans+d[k])", "k, a, n, s = int(input()), 0, 0, {0: 1}\r\nfor c in input():\r\n n += int(c)\r\n a += s.get(n-k, 0)\r\n s[n] = 1+s.get(n, 0)\r\nprint(a)", "k=int(input())\r\ns=input()\r\nans,z=0,0\r\ndp=[1]+[0]*10**6\r\nfor c in s:\r\n if c=='1':z+=1\r\n if z>=k:ans+=dp[z-k]\r\n dp[z]+=1\r\nprint(ans)\r\n", "k=int(input())\r\ns=input()\r\nc=[0 for i in range(10**6+7)]\r\nc[0]=1\r\nx=0\r\nans=0\r\nfor i in s:\r\n if i=='1':\r\n x+=1\r\n if x>=k:\r\n ans+=c[x-k]\r\n c[x]+=1\r\nprint(ans)", "def atmost(s:str, k :int) -> int:\r\n if k < 0:\r\n return 0\r\n \r\n cnt = ans = j = 0\r\n \r\n for i in range(len(s)):\r\n \r\n cnt += (s[i] == '1')\r\n \r\n while cnt > k:\r\n \r\n cnt -= (s[j] == '1')\r\n \r\n j += 1\r\n \r\n ans += (i - j + 1)\r\n \r\n return ans\r\n\r\nk = int(input())\r\ns = input()\r\nn = len(s)\r\n\r\nprint(atmost(s,k) - atmost(s,k-1))", "k = int(input())\r\n\r\ns = input()\r\n\r\nn = len(s)\r\n\r\nif k == 0:\r\n res = 0\r\n i = 0\r\n while i < n:\r\n ctr = 1\r\n while i < n - 1 and s[i] == s[i + 1]:\r\n ctr += 1\r\n i += 1\r\n if s[i] == \"0\":\r\n res += ctr * (ctr + 1) // 2\r\n i += 1\r\n print(res)\r\n exit(0)\r\n\r\nones = []\r\nlz = {}\r\nrz = {}\r\n\r\nl = r = 0\r\n\r\nfor i in range(n):\r\n if i > 0 and s[i - 1] == \"0\":\r\n l += 1\r\n else:\r\n l = 0\r\n if i > 0 and s[n - i] == \"0\":\r\n r += 1\r\n else:\r\n r = 0\r\n if s[i] == \"1\":\r\n ones.append(i)\r\n lz[i] = l\r\n if s[n - i - 1] == \"1\":\r\n rz[n - i - 1] = r\r\n \r\nm = len(ones)\r\n\r\nres = 0\r\n\r\nfor i in range(m - k + 1):\r\n res += (lz[ones[i]] + 1) * (rz[ones[i + k - 1]] + 1)\r\n \r\nprint(res)", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\n#print=sys.stdout.write\n#import random\nfrom collections import defaultdict\nfrom heapq import heappush,heapify,heappop\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nd=defaultdict(int)\nk=I()\ns=input().strip()\ns=[int(i) for i in s]\ns=s\n\nl=[s[0]]\n\nans=0\nd[0]=1\nfor i in range(1,len(s)):\n\n l.append(l[-1]+s[i])\n\nfor i in range(len(l)):\n \n ans+=d[l[i]-k]\n d[l[i]]+=1\nprint(ans)\n", "K=int(input())\r\ns=input()\r\nN = len(s) \r\nres = 0\r\ncountOfOne = 0\r\nfreq = [0 for i in range(N + 1)] \r\nfreq[0] = 1\r\n \r\nfor i in range(0, N, 1): \r\n countOfOne += ord(s[i]) - ord('0') \r\n if (countOfOne >= K): \r\n res += freq[countOfOne - K] \r\n freq[countOfOne] += 1\r\nprint(res) \r\n \r\n ", "import os\r\nline_number = 1\r\ncurrent_working_dir = os.getcwd()\r\nmy_local_machine = current_working_dir.find('rachel')\r\n# print(my_local_machine)\r\n\r\ndef myinput():\r\n global line_number, lines, my_local_machine\r\n if line_number == 1:\r\n lines = lines.split('\\n')\r\n\r\n # print(len(lines))\r\n if my_local_machine > 0:\r\n line = lines[line_number]\r\n else:\r\n line = input()\r\n \r\n line_number += 1\r\n return(line)\r\n\r\nlines = '''\r\n1\r\n1010\r\n'''\r\n\r\nk = int(myinput()) \r\ns = myinput() \r\n\r\ncount = [0] * 10000000\r\ncount[0] = 1\r\none = 0 \r\nans = 0 \r\n\r\nfor i in s: \r\n if i == '1': \r\n one += 1\r\n if one >= k: \r\n ans += count[one-k] \r\n\r\n count[one] +=1 \r\nprint(ans)", "import math\nimport string\nimport sys\n\n# sys.setrecursionlimit(2**30)\n# sys.stdin = open(\".in\", \"r\")\n# sys.stdout = open(\".out\", \"w\")\ninput = sys.stdin.readline\n\n\ndef print(*args, end='\\n', sep=' ') -> None:\n sys.stdout.write(sep.join(map(str, args)) + end)\n\n\ndef map_int():\n return map(int, input().split())\n\n\ndef list_int():\n return list(map(int, input().split()))\n\n\ndef matrixPrint(matrix):\n for x in matrix:\n print(*x)\n\n\nfrom collections import defaultdict, deque, Counter\nfrom math import sqrt, gcd, comb, perm, factorial, log, floor\nfrom itertools import permutations\n\nfrom math import ceil\n# from random import shuffle\nfrom heapq import heappop, heappush, heapify\n\n\ndef solve():\n k = int(input())\n s = input().strip()\n cs = [0 for i in range(len(s)+1)]\n for i in range(1, len(cs)):\n cs[i] = cs[i-1] + (s[i-1]=='1')\n\n mpcnt = defaultdict(int)\n mpcnt[0] = 1\n answer = 0\n\n for r in range(1, len(cs)):\n answer += mpcnt[cs[r] - k]\n mpcnt[cs[r]] += 1\n\n print(answer)\n\n\n\n\n\n\n\n\n\n\nif __name__ == '__main__':\n # NumberOfTestcases = int(input())\n # for _ in range(NumberOfTestcases):\n solve()", "k = int(input())\r\ns = input()\r\nd = {0 : 1} \r\nn, ans = 0, 0 \r\nfor i in s:\r\n n += int(i)\r\n ans += d.get(n - k, 0)\r\n d[n] = 1 + d.get(n, 0)\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nl,q,w=[],0,0\r\nfor i in s:\r\n if i==\"0\":w+=1\r\n else:l.append(w);w=0\r\nl+=[w]\r\nif n>0:\r\n for i in range(n,len(l)):q+=(l[i]+1)*(l[i-n]+1)\r\nelse:\r\n for i in l:q+=i*(i+1)//2\r\nprint(q)", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nfrom collections import deque\r\nfrom bisect import bisect_right\r\nk=int(input())\r\ns=input()\r\nn=len(s)\r\ncount=0\r\nif k==0:\r\n\tl=s.split('1')\r\n\tfor i in l:\r\n\t\tcount+=(len(i)*(len(i)+1))//2\r\nelse:\r\n\ta=0\r\n\tb=0\r\n\tt=0\r\n\tx=0\r\n\ty=0\r\n\tcount=0\r\n\twhile a<n and b<n:\r\n\t\tif s[a]=='0':\r\n\t\t\tx+=1\r\n\t\telse:\r\n\t\t\tb=max(a,b)\r\n\t\t\twhile b<n and t<=k:\r\n\t\t\t\tif s[b]=='1':\r\n\t\t\t\t\t# print(b)\r\n\t\t\t\t\tt+=1\r\n\t\t\t\telse:\r\n\t\t\t\t\tif t==k:\r\n\t\t\t\t\t\ty+=1\r\n\t\t\t\tif t>k:\r\n\t\t\t\t\tt-=1\r\n\t\t\t\t\tbreak\r\n\t\t\t\tb+=1\r\n\t\t\t# b-=1\r\n\t\t\tif t==k:\r\n\t\t\t\tcount+=(x+1)*(y+1)\r\n\t\t\t\t# print(x,y,a,b,count)\r\n\t\t\t\tt-=1\r\n\t\t\t\tx=0\r\n\t\t\t\ty=0\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\ta+=1\r\nprint(count)\r\n\r\n\r\n\r\n", "m= int(input())\r\ns=input()\r\nn=len(s)\r\ntem=1\r\ny=[]\r\nfor i in range (0,n):\r\n if s[i]=='1':\r\n y.append(tem)\r\n tem=1\r\n else:\r\n tem+=1\r\ny.append(tem)\r\nans=0\r\nif m>0:\r\n if len(y)<m+1:\r\n print(0)\r\n else:\r\n for i in range (0,len(y)-m):\r\n ans+=y[i]*y[i+m]\r\n print(ans)\r\nelse:\r\n for i in range (0,len(y)):\r\n ans+=y[i]*(y[i]-1)//2\r\n print(ans)\r\n\r\n\r\n\r\n", "from sys import stdin,stdout\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\t\r\n# from bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\nk = it()\r\nl = list(input())\r\nn = len(l)\r\nsu = [0]*(n+1)\r\nfor i in range(1,n+1):\r\n\tsu[i] = int(su[i-1]) + int(l[i-1])\r\n\r\nd = dd(lambda:0)\r\nans =0 \r\nfor i in range(n+1):\r\n\tcurr = su[i]\r\n\r\n\tans += d[curr-k]\r\n\td[curr] += 1\r\n\r\nprint(ans)\r\n\r\n", "K = int(input())\r\nS = input()\r\nL = [0] * (len(S) + 1)\r\nL[0] = 1\r\nX = Y = 0\r\nfor i in S:\r\n\tif i == '1':\r\n\t Y += 1\r\n\tif Y >= K:\r\n\t X += L[Y-K]\r\n\tL[Y] += 1\r\nprint (X)", "# another problem strings\r\nimport bisect\r\nK = int(input())\r\ns = input()\r\nN = len(s)\r\n\r\ndp = [0 for i in range(N+1)]\r\nfor i in range(N):\r\n dp[i+1] = dp[i]+int(s[i])\r\nans = 0\r\n\r\nif K > 0:\r\n for i in range(N+1):\r\n now = dp[i]\r\n ans += bisect.bisect_right(dp, now+K)-bisect.bisect_left(dp, now+K)\r\n print(ans)\r\nelse:\r\n L=list(s.split(\"1\"))\r\n ans=0\r\n for some in L:\r\n ans+=len(some)*(len(some)+1)//2\r\n print(ans)", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\nk, = Neo()\r\ns = input()\r\npref = [0]\r\nfor i in s:\r\n pref.append(pref[-1] + int(i))\r\nd = {}\r\nans = 0\r\nfor i in pref:\r\n ans += d.get(i - k, 0)\r\n d[i] = d.get(i, 0) + 1\r\nprint(ans)", "k = int(input())\r\ns = list(input())\r\n\r\ncount, summ, val = 0, 0, {0: 1}\r\nfor c in s:\r\n summ += int(c)\r\n if summ - k in val:\r\n count += val[summ-k]\r\n\r\n if summ not in val:\r\n val[summ] = 1\r\n else:\r\n val[summ] += 1\r\n\r\nprint(count)\r\n", "k = int(input())\r\ns = input().strip()\r\ns = list(s)\r\ndp = [0 for i in range(len(s))]\r\ncnt = 0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n cnt += 1\r\n dp[i] = cnt\r\n \r\nans = 0\r\nm = {}\r\nlb = 0\r\nfor i in range(len(s)):\r\n if dp[i]>=k:\r\n lb = i\r\n break\r\n m[dp[i]] = m.get(dp[i],0) + 1\r\n\r\nfor i in range(lb,len(s)):\r\n p = dp[i]-k\r\n if p==0:\r\n ans += 1\r\n ans += m.get(p,0)\r\n m[dp[i]] = m.get(dp[i],0) + 1\r\n \r\nprint(ans)\r\n \r\n", "R = lambda: map(int, input().split())\r\nk = int(input())\r\ns = input()\r\nslow, fast = 0, 0\r\nslowCnt, fastCnt = 0, 0\r\nres = 0\r\nfor i in range(len(s)):\r\n slowCnt += s[i] == '1'\r\n fastCnt += s[i] == '1'\r\n while slowCnt > k:\r\n slowCnt -= s[slow] == '1'\r\n slow += 1\r\n while fastCnt > k or fastCnt == k and fast < i and s[fast] != '1':\r\n fastCnt -= s[fast] == '1'\r\n fast += 1\r\n if slow <= i and fast <= i and fastCnt == slowCnt == k:\r\n res += fast - slow + 1\r\nprint(res)", "n = int(input())\r\ns = input().strip()\r\nl = [0]\r\nfor i in s:\r\n l.append(l[-1]+int(i))\r\nres = 0\r\ncn = dict()\r\nfor i in l:\r\n res += cn.get(i-n, 0)\r\n cn[i] = cn.get(i, 0) + 1\r\nprint(res)", "k=int(input())\r\ns=input()\r\nones=og=0\r\nvect=[0]\r\nfor i in range(len(s)):\r\n if s[i]==\"1\":\r\n ones+=1\r\n vect.append(ones)\r\nans=[0]*(ones+1)\r\nfor i in vect:\r\n ans[i]+=1\r\nif k==0:\r\n for i in ans:\r\n og+=i*(i-1)//2\r\nelif k<len(ans):\r\n for i in range(len(ans)-k):\r\n og+=ans[i]*ans[i+k]\r\nprint(og)\r\n ", "k = int(input())\r\ns = input()\r\nprefix = [0 for i in range(len(s)+1)]\r\nfor i in range(0,len(s)): prefix[i+1] = int(int(s[i]) - int('0')) + prefix[i]\r\nans = 0\r\nmp = {}\r\nmp[k] = 1\r\nfor i in range(0,len(s)):\r\n if prefix[i+1] in mp.keys() : ans += mp[prefix[i+1]]\r\n if k + prefix[i+1] in mp.keys() : mp[k+prefix[i+1]] += 1\r\n else : mp[prefix[i+1] + k] = 1\r\nprint(ans)", "import sys\nfrom collections import defaultdict\n\ninput = sys.stdin.readline\n\nk = int(input())\ns = \"\".join(input().rstrip('\\n'))\n\ncnt = defaultdict(int)\ncur, total = 0, 0\n\nfor c in s :\n\n cur += ord(c) - 48\n\n total += (cur == k)\n total += (cnt[cur - k])\n\n cnt[cur] += 1\n\nprint(total)\n", "k=int(input())\r\ns=input()\r\nd={}\r\nres=0\r\nd[0]=1\r\nx=0\r\nfor i in s:\r\n if i=='1':\r\n x+=1\r\n res+=d.get(x-k,0)\r\n d[x]=d.get(x,0)+1\r\nprint(res)", "from collections import deque\n\n\nk = int(input())\ns = input()\nn = len(s)\nif k == 0:\n zeros = []\n cur = 0\n for i in range(n):\n if s[i] == '0':\n cur += 1\n if i == n - 1:\n zeros.append(cur)\n else:\n if cur != 0:\n zeros.append(cur)\n cur = 0\n res = 0\n for item in zeros:\n res += (item + 1) * item // 2\n print(res)\n exit()\nbase, ans, lp, rp = 0, 0, 0, 0\nstack = deque()\n\nwhile rp != n:\n while len(stack) != k:\n if s[rp] == '1':\n stack.append(rp)\n rp += 1\n if len(stack) == k:\n base = stack[0] - lp + 1\n ans += base\n if rp == n:\n break\n if rp == n:\n break\n if s[rp] == '0':\n ans += base\n rp += 1\n else:\n lp = stack[0] + 1\n stack.popleft()\nprint(ans)\n", "import sys\r\ndef sumofn(n):\r\n if n % 2 == 0:\r\n return (n+1) * (n//2)\r\n else:\r\n return n * (n//2) + n\r\n\r\ndef answer(k, s):\r\n n1 = s.count('1')\r\n if k > n1:\r\n return 0\r\n addr = [-1]\r\n for i, char in enumerate(s):\r\n if char == '1':\r\n addr.append(i)\r\n addr.append(len(s))\r\n cnt = 0\r\n #print(addr)\r\n if k == 0:\r\n for i in range(1, n1+1+1, 1):\r\n cnt += sumofn(addr[i]-addr[i-1] - 1)\r\n return cnt\r\n for i in range(1, n1-k+1+1, 1):\r\n cnt += (addr[i] - addr[i-1]) * (addr[i+k] - addr[i+k-1])\r\n\r\n return cnt\r\n\r\ndef main():\r\n k = int(sys.stdin.readline())\r\n s = sys.stdin.readline().rstrip()\r\n print(answer(k, s))\r\n return\r\nmain()", "import math,sys,bisect,heapq,os\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\nfrom functools import lru_cache\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ndef input(): return sys.stdin.readline().rstrip('\\r\\n')\r\n#input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\naj = lambda: list(map(int, input().split()))\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\ndef solve():\r\n\tk, = aj()\r\n\ts = input()\r\n\tif k > 0:\r\n\t\tA = []\r\n\t\tB = []\r\n\t\tfor i in range(len(s)):\r\n\t\t\tif s[i] == '1':\r\n\t\t\t\tA.append(i)\r\n\t\t\telse:\r\n\t\t\t\tB.append(i)\r\n\t\t# print(A)\r\n\t\t# print(B)\r\n\t\ti = j = ans = 0;extra = 0\r\n\t\twhile i < len(A) and j < len(B):\r\n\t\t\tif A[i] < B[j]:\r\n\t\t\t\tv =0\r\n\t\t\t\tpos1 = i + k - 1\r\n\t\t\t\tpos2 = pos1 + 1\r\n\t\t\t\tif pos1 < len(A):\r\n\t\t\t\t\tif pos2 == len(A):\r\n\t\t\t\t\t\tv= len(s) - A[pos1]\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tv= A[pos2] - A[pos1]\r\n\t\t\t\ti+=1\r\n\t\t\t\tans +=v\r\n\t\t\t\tans += extra*v\r\n\t\t\t\textra = 0\r\n\t\t\telse:\r\n\t\t\t\textra += 1\r\n\t\t\t\tj+=1\r\n\t\tif i < len(A):\r\n\t\t\trem = len(A) - i\r\n\t\t\tv = max(0,rem - k + 1)\r\n\t\t\tans += v\r\n\t\t\tif v:\r\n\t\t\t\tans += extra\r\n\t\tprint(ans)\r\n\telse:\r\n\t\tans = 0\r\n\t\tfor i,j in groupby(s):\r\n\t\t\tif i == '0':\r\n\t\t\t\tl = len(list(j))\r\n\t\t\t\tans += (l*(l+1))//2\r\n\t\tprint(ans)\r\n\r\n\r\n\r\n\r\n\r\ntry:\r\n\t#os.system(\"online_judge.py\")\r\n\tsys.stdin = open('input.txt', 'r') \r\n\tsys.stdout = open('output.txt', 'w')\r\nexcept:\r\n\tpass\r\n\r\nsolve()", "from collections import defaultdict\r\n \r\n\r\ndef findSubarraySum(arr, n, Sum):\r\n \r\n \r\n prevSum = defaultdict(lambda : 0)\r\n \r\n res = 0\r\n \r\n # Sum of elements so far.\r\n currsum = 0\r\n \r\n for i in range(0, n): \r\n \r\n # Add current element to sum so far.\r\n currsum += arr[i]\r\n \r\n \r\n if currsum == Sum: \r\n res += 1 \r\n \r\n \r\n if (currsum - Sum) in prevSum:\r\n res += prevSum[currsum - Sum]\r\n \r\n \r\n \r\n prevSum[currsum] += 1\r\n \r\n return res\r\n\r\n\r\nk = int(input()) \r\ns = input() \r\nn = len(s) \r\na = [ ] \r\nfor i in s:\r\n a.append(int(i)) \r\nprint(findSubarraySum(a,n,k)) ", "k = int(input())\r\ns = input()\r\n\r\nc1 = 0\r\nans = 0\r\ndp = [1] + [0] * (len(s))\r\nfor i in range(len(s)):\r\n c1 += s[i]=='1'\r\n dp[c1] += 1\r\n\r\nfor i in range(k, len(s)+1):\r\n # k 0 toh simple hai\r\n if not k: ans += (dp[i]-1)*dp[i]//2\r\n # else targ sum type dp ho gaya seedhe kr lo i*i-k\r\n else: ans += dp[i]*dp[i-k]\r\n\r\nprint(ans)", "import math\r\nli=[]\r\nzi=[]\r\ndef func(s,k):\r\n if k!=0:\r\n\r\n preceedin=0\r\n proceedin=0\r\n count=0\r\n allcnt=0\r\n ans=0\r\n for i in s:\r\n if i==\"0\":\r\n preceedin+=1\r\n if i==\"1\":\r\n allcnt+=1\r\n count+=1\r\n li.append(preceedin)\r\n preceedin=0\r\n if count==k+1:\r\n zi.append(proceedin)\r\n proceedin=0\r\n count-=1\r\n if count ==k and i==\"0\":\r\n proceedin+=1\r\n zi.append(proceedin)\r\n for i in range(0,len(zi)):\r\n if allcnt>=k:\r\n ans+=(zi[i]+1)*(li[i]+1)\r\n else:\r\n ans=0\r\n return ans\r\n\r\n if k==0:\r\n ans=0\r\n sd=0\r\n for i in s:\r\n if i==\"0\":\r\n sd+=1\r\n if i==\"1\":\r\n ans+=(sd*(sd+1)/2)\r\n sd=0\r\n ans+= (sd*(sd+1)/2)\r\n return int(ans)\r\n\r\n\r\nk=int(input())\r\ns=list(str(input()))\r\nprint(func(s,k) )\r\n\r\n\r\n", "from bisect import bisect, bisect_left, bisect_right\r\nimport math\r\nfrom collections import defaultdict, deque, Counter\r\nfrom sys import stdin\r\nfrom unittest import case\r\n \r\ninf = int(1e18)\r\ninput = stdin.readline\r\n \r\n#D V ARAVIND\r\n\r\n \r\nfor _ in range (1):\r\n k = int(input())\r\n a = [len(i) for i in (input().strip()).split(\"1\")]\r\n if k > 0:\r\n ans = 0\r\n for i in range (len(a)-k):\r\n ans += (a[i]+1)*(a[i+k]+1)\r\n else:\r\n ans = 0\r\n for i in a:\r\n ans += (i*(i+1)//2)\r\n print(ans)\r\n", "import sys\r\nimport math\r\nfrom collections import Counter \r\nfrom decimal import * \r\n \r\n \r\n \r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\nalfabet_2={'1':\"a\", '2':\"b\", '3':\"c\", '4':\"d\", '5':\"e\", '6':\"f\", '7':\"g\", '8':\"h\", '9':\"i\", '10':\"j\", '11':\"k\", '12':\"l\", '13':\"m\", '14':\"n\", '15':\"o\", '16':\"p\", '17':\"q\", '18':\"r\", '19':\"s\", '20':\"t\", '21':\"u\", '22':\"v\", '23':\"w\", '24':\"x\", '25':\"y\", '26':\"z\"}\r\n \r\n \r\n \r\n \r\n \r\n#z=int(input()) \r\nfor contorr in range(1):\r\n # empty_line=input()\r\n \r\n k=int(input())\r\n #n,m=list(map(int, input().split()))\r\n stringul=input()\r\n #bloc=list(map(int, input().split()))\r\n n=len(stringul)\r\n \r\n cate={}\r\n nr=0\r\n vector=[0]*n\r\n\r\n \r\n total=0\r\n \r\n for i in range(0,n):\r\n if stringul[i]=='1':\r\n nr+=1\r\n \r\n cate[nr]=i\r\n \r\n #print(cate,nr)\r\n \r\n #print(cate[1])\r\n if k==0:\r\n if nr==0:\r\n total=n*(n+1)//2\r\n else: \r\n for i in range(1,nr+1):\r\n if i==1:\r\n left=cate[i]\r\n # print(\"aici\",i,\"left=\",left)\r\n else:\r\n left=cate[i]-1-cate[i-1]\r\n \r\n total+=left*(left+1)//2\r\n right=n-1-cate[nr]\r\n total+=right*(right+1)//2\r\n \r\n elif nr>=k:\r\n \r\n for i in range(1,nr+1):\r\n if i==1:\r\n left=cate[i]\r\n # print(\"aici\",i,\"left=\",left)\r\n else:\r\n left=cate[i]-1-cate[i-1]\r\n \r\n #print(\"i=\",i,\"left=\",left) \r\n if i+k-1<nr:\r\n right=cate[i+k]-1-cate[i+k-1]\r\n total+=1+left+right+left*right\r\n \r\n elif i+k-1==nr:\r\n right=n-1-cate[i+k-1]\r\n total+=1+left+right+left*right\r\n \r\n #print(i,left,right,total) \r\n print(total)\r\n ", "import collections\r\nk=int(input())\r\ns=input()\r\nres=tot=0\r\ncnt=collections.Counter({0:1})\r\n\r\nfor i in s:\r\n tot+=1 if i=='1' else 0 \r\n res+=cnt[tot-k]\r\n cnt[tot]+=1\r\nprint(res)", "k = int(input())\r\na = [0] + list(map(int, input()))\r\nn = len(a)\r\n\r\ncurr = sol = 0\r\nc = {0:1}\r\nfor i in range(1, n):\r\n curr += a[i]\r\n sol += c.get(curr - k, 0)\r\n \r\n c[curr] = c.get(curr, 0) + 1\r\nprint(sol)\r\n", "k = int(input())\r\ns = input()\r\n\r\nc1 = 0\r\nans = 0\r\ndp = [0] * (len(s)+1)\r\ndp[0] = 1\r\n\r\nfor i in range(len(s)):\r\n c1 += s[i] == '1'\r\n dp[c1] += 1\r\n\r\nfor i in range(k, c1+1):\r\n if k == 0: ans += (dp[i]-1)*dp[i]//2\r\n else: ans += (dp[i]*dp[i-k])\r\n\r\nprint(ans)", "import sys, os.path\r\nfrom collections import*\r\nfrom copy import*\r\nimport math\r\nmod=10**9+7\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nk = int(input())\r\ns = input()\r\npref = [0]\r\nfor i in s:\r\n pref.append(pref[-1] + int(i))\r\nd = {}\r\nans = 0\r\nfor i in pref:\r\n ans += d.get(i - k, 0)\r\n d[i] = d.get(i, 0) + 1\r\nprint(ans)\r\n\r\n ", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\n #int(input())\n #arr = list(map(int, input().split()))\n #n,m = map(int, input().split())\n #graph = defaultdict(list)\n \n #a,b = map(int, input().split())\n #graph[a].append(b)\n #graph[b].append(a)\nMOD = 10**9 + 7\ndef solution():\n k = int(input())\n arr = input()\n prefix = [0]\n for val in arr:\n prefix.append(int(val) + prefix[-1])\n \n hs = defaultdict(int)\n res = 0\n for val in prefix:\n res += hs[val-k]\n hs[val] += 1\n print(res)\n\n\n\n\n\n \n\n\n\n\n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=solution)\n#thread.start(); thread.join()\nsolution()\n", "#!/usr/bin/python3\nimport collections\nimport re\n\ndef find_bin_ksubs (k: int, bin_num: str) -> int:\n tmp_z = tmp_count = count = count_1 = 0\n zeros = collections.deque()\n count_0 = bin_num.find('1')\n if count_0 == -1:\n return 0\n\n for b in bin_num[count_0:]:\n if b == '1':\n zeros.append(count_0)\n count_0 = 0\n count_1 += 1\n if count_1 >= k:\n count = count + (tmp_z * tmp_count) + tmp_z\n tmp_count = 0\n tmp_z = zeros.popleft() + 1\n else:\n count_0 += 1\n tmp_count += 1\n\n return count + (tmp_z * tmp_count) + tmp_z\n\n\ndef find_empties (bin_num: str) -> int:\n reg = re.compile(r'0+')\n return sum((count ** 2 + count) >> 1 \\\n for zeros in reg.findall(bin_num) if (count := len(zeros)))\n\n\nif __name__ == '__main__':\n if (k := int (input ())) == 0:\n print (find_empties (input ()))\n else:\n print (find_bin_ksubs (k, input ()))\n", "k = int(input())\r\ns = input()\r\nc = 0\r\nd = {}\r\nres = 0\r\nd[0] = 1\r\nfor i in s:\r\n if i == '1':\r\n c += 1\r\n res += d.get(c - k, 0)\r\n d[c] = d.get(c, 0) + 1\r\nprint(res)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nK = int(input())\r\nS = input()\r\nN = len(S)\r\n\r\nans = 0\r\nif K==0:\r\n A = [0]\r\n for i in range(N):\r\n c = S[i]\r\n if c=='0':\r\n A[-1]+=1\r\n ans += A[-1]\r\n else:\r\n A.append(0)\r\nelse:\r\n \r\n A = [-1]\r\n for i in range(N):\r\n c = S[i]\r\n if c=='1':\r\n A.append(i)\r\n\r\n if len(A)>=K+1:\r\n ans+=max(0,A[-K]-A[-K-1])\r\nprint(ans)\r\n \r\n\r\n" ]

[ "N = int(input())\r\nlist = []\r\nrec = 1\r\npoints = 0\r\nfor i in range(N):\r\n a,b = map(int, input().split())\r\n c = [a,b]\r\n list.append(c)\r\nlist.sort(key = lambda x: x[1], reverse = True)\r\nwhile rec > 0 and len(list) > 0:\r\n if list[0][1] >= 1:\r\n points+=list[0][0]\r\n rec+=list[0][1]\r\n list.pop(0)\r\n rec-=1\r\n else:\r\n list.sort(key = lambda x: x[0], reverse = True)\r\n points+=list[0][0]\r\n list.pop(0)\r\n rec-=1\r\nprint(points)", "n=int(input())\r\npoints=[]\r\nchances=[]\r\ncount=1\r\nsum=0\r\n\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n points.append(x)\r\n chances.append(y)\r\n\r\n\r\nfor i in range(n):\r\n \r\n count -= 1\r\n if(count>=0):\r\n a=max(chances)\r\n maximum=-1\r\n index=chances.index(a)\r\n if(chances.count(a)>1):\r\n for j in range(n):\r\n if(chances[j]==a):\r\n if(max(points[j],maximum)==points[j]):\r\n maximum=points[j]\r\n index=j\r\n\r\n count += chances[index]\r\n chances[index]=-1\r\n\r\n sum += points[index]\r\n points[index]=-1\r\n\r\nprint(sum)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nnon_free_cards = []\nextra = 1\ntotal = 0\nfor i in range(n):\n\tx1, x2 = tuple([int(x) for x in input().split()])\n\tif(x2 == 0):\n\t\tnon_free_cards.append(x1)\n\telse:\n\t\textra += (x2 - 1)\n\t\ttotal += x1\nnon_free_cards = sorted(non_free_cards)[::-1]\ntotal += sum(non_free_cards[:extra])\nprint(total)", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n\tl.append(list(map(int, input().split())))\r\nl.sort(key=lambda x: (-x[1], -x[0]))\r\nc = 1\r\nind = 0\r\nans = 0\r\nwhile c > 0 and ind < n:\r\n\tans += l[ind][0]\r\n\tc += l[ind][1]\r\n\tind += 1\r\n\tc -= 1\r\nprint(ans)", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n arr.append((b, a))\r\narr.sort(reverse=True)\r\nans = 0\r\nc = 1\r\ni = 0\r\nwhile c != 0 and i < n:\r\n ans += arr[i][1]\r\n c += arr[i][0] - 1\r\n i += 1\r\nprint(ans)\r\n", "lis=[];n=int(input())\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n lis.append((q,p))\r\nlis.sort(reverse=True)\r\nind=0;counter=1;points=0\r\nwhile counter>0 and ind<n:\r\n counter-=1;counter+=lis[ind][0];points+=lis[ind][1];ind+=1\r\nprint(points)", "n = int(input())\r\narr = []\r\nmovesT = 1\r\npointsM = 0\r\nmoves = []\r\npoints = []\r\nfor i in range(n):\r\n val = list(map(int, input().split(\" \")))\r\n arr.append(val)\r\n\r\nfor i in arr:\r\n moves.append(i[1])\r\n points.append(i[0])\r\n\r\n\r\ni=0\r\n\r\nwhile movesT >0 and i < len(moves):\r\n # print(\"Moves: {} I: {}\".format(movesT,i))\r\n max_move = max(moves)\r\n # print(\"Max move: {}\".format(max_move))\r\n if max_move!= 0:\r\n movesT += max_move - 1\r\n indexM = moves.index(max_move)\r\n # print(\"Indexadd: {}\".format(indexM))\r\n # print(\"Before Points: {} points add: {} \".format(pointsM,points[indexM]))\r\n pointsM += points[indexM]\r\n del points[indexM]\r\n del moves[indexM]\r\n # print(\"Total moves: {} Total Points: {} moves: {} points: {}\".format(movesT,pointsM,moves,points))\r\n else:\r\n max_points = max(points)\r\n # print(\"max Points : {}\".format(max_points))\r\n indexP = points.index(max_points)\r\n movesT-=1\r\n pointsM += max_points\r\n del points[indexP]\r\n del moves[indexP]\r\n # print(\"Total moves: {} Total Points:{} points: {}\".format(movesT,pointsM,points))\r\n\r\n # i+=1\r\n\r\n# print(max_move)\r\nprint(pointsM)", "n = int(input())\r\ni, cnt, ans = 0, 1, 0\r\nall = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n all.append((b, a))\r\nall.sort(reverse=True)\r\nwhile i < n and cnt:\r\n cnt += all[i][0] - 1\r\n ans += all[i][1]\r\n i += 1\r\nprint(ans)\r\n", "n,l,s= int(input()),[],[1,0]\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n l.append([b,a])\r\nl.sort(),l.reverse()\r\nfor e in l:\r\n if s[0]==0: break\r\n s=[s[0]+e[0]-1,s[1]+e[1]]\r\nprint(s[1])\r\n" ]

[ "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/5 15:00\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\nS = ['']\r\nfor i in range(N):\r\n S.append(input())\r\nM = int(input())\r\n\r\n# t0 = time.time()\r\n# N = 3\r\n# S = [\"\", \"00010110000\", \"110101110101101010101101101110100010000001101101011000010001011000010101\", \"11100101100111010\"]\r\n# M = 1000\r\n\r\nA = [[set() for _ in range(10)] for _ in range(M+N+1)]\r\nD = collections.defaultdict(int)\r\n\r\nfor i in range(1, N+1):\r\n for j in range(1, 10):\r\n s = S[i]\r\n if j > len(s):\r\n break\r\n for k in range(len(s)-j+1):\r\n A[i][j].add(int(s[k:k+j], 2))\r\n\r\n if all(v in A[i][j] for v in range(2**j)):\r\n D[i] = j\r\n\r\nfor i in range(M):\r\n # a, b = random.randint(1, i+N), random.randint(1, i+N)\r\n a, b = map(int, input().split())\r\n s, sa, sb = S[a] + S[b], S[a], S[b]\r\n if len(s) > 30:\r\n S.append(s[:10] + s[-10:])\r\n else:\r\n S.append(s)\r\n\r\n ai = i+N+1\r\n\r\n d = max(D[a], D[b]) + 1\r\n for dv in range(d, 10):\r\n if len(sa) + len(sb) < dv:\r\n break\r\n A[ai][dv] = A[a][dv] | A[b][dv] | {int(v, 2) for v in {sa[-i:] + sb[:dv-i] for i in range(1, dv+1)} if len(v) == dv}\r\n\r\n ans = d-1\r\n for dv in range(d, 10):\r\n if any(v not in A[ai][dv] for v in range(2**dv)):\r\n break\r\n ans = dv\r\n print(ans)\r\n D[ai] = ans\r\n\r\n\r\n\r\n\r\n\r\n# print(time.time() - t0)\r\n\r\n\r\n\r\n\r\n", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN=int(readline())\r\nse=[]\r\nSL,SR=[],[]\r\nfor n in range(N):\r\n se.append([set() for k in range(11)])\r\n S=readline().rstrip()\r\n le=len(S)\r\n for k in range(1,11):\r\n for i in range(le-k+1):\r\n se[n][k].add(S[i:i+k])\r\n SL.append(S[:10])\r\n SR.append(S[-10:])\r\nQ=int(readline())\r\nfor q in range(Q):\r\n a,b=map(int,readline().split())\r\n a-=1;b-=1\r\n se.append([set() for k in range(11)])\r\n SL.append((SL[a]+SL[b])[:10])\r\n SR.append((SR[a]+SR[b])[-10:])\r\n for k in range(11):\r\n se[q+N][k]=se[a][k]|se[b][k]\r\n for i in range(1,len(SR[a])+1):\r\n for j in range(1,len(SL[b])+1):\r\n if i+j<=10:\r\n se[q+N][i+j].add(SR[a][-i:]+SL[b][:j])\r\n for ans in range(10,-1,-1):\r\n if len(se[q+N][ans])==1<<ans:\r\n break\r\n print(ans)", "from math import log\r\nn = int(input())\r\np = [bin(p)[2:] for p in range(0,512)]\r\ndef mset(s):\r\n ss = set()\r\n for k in range(0,10):\r\n for pi in range(0,2 ** k):\r\n cs = p[pi]\r\n cs = (k - len(cs)) * \"0\" + cs\r\n if cs in s:\r\n ss.add(cs)\r\n return ss\r\ndef q(s):\r\n for k in range(0,10):\r\n for pi in range(0,2 ** k):\r\n cs = p[pi]\r\n cs = (k - len(cs)) * \"0\" + cs\r\n if not cs in s:\r\n return k - 1\r\ns = [[v[:9], v[-9:], mset(v)] for v in [input() for i in range(n)]]\r\nfor qa, qb in [[int(v) - 1 for v in input().split()] for i in range(int(input()))]:\r\n v = [s[qa][0], s[qb][1], mset(s[qa][1] + s[qb][0]) | s[qa][2] | s[qb][2]]\r\n if len(v[0]) < 9:\r\n v[0] = (v[0] + s[qb][0])[:9]\r\n if len(v[1]) < 9:\r\n v[1] = (s[qa][1] + s[qb][1])[-9:]\r\n s += [v]\r\n print(max(q(v[2]),0))", "from sys import stdin, stdout\r\nk = 20\r\ndef findAllStrings(s):\r\n n = len(s)\r\n sdict = {}\r\n for i in range(1,k+1):\r\n sdict[i]=set()\r\n for x in range(n-i+1):\r\n sdict[i].add(s[x:x+i])\r\n return sdict\r\nn = int(stdin.readline().rstrip())\r\nstrdict = []\r\nstringend = []\r\nstringbegin = []\r\nfor i in range(n):\r\n s = stdin.readline().rstrip()\r\n strdict.append(findAllStrings(s))\r\n if len(s)<k:\r\n stringend.append(s)\r\n stringbegin.append(s)\r\n else:\r\n stringend.append(s[-20:])\r\n stringbegin.append(s[:20])\r\nm = int(stdin.readline().rstrip())\r\nfor _ in range(m):\r\n a,b = map(int,stdin.readline().rstrip().split())\r\n a-=1\r\n b-=1\r\n sdict1 = findAllStrings(stringend[a]+stringbegin[b])\r\n sdict2 = strdict[a]\r\n sdict3 = strdict[b]\r\n sdict={}\r\n for i in range(1,k+1):\r\n sdict[i] = sdict1[i]|sdict2[i]|sdict3[i]\r\n strdict.append(sdict)\r\n for i in range(1,k+1):\r\n if len(sdict[i])!=2**i:\r\n print(i-1)\r\n break\r\n if len(stringbegin[a])<k and len(stringbegin[a])+len(stringbegin[b])<k:\r\n stringbegin.append(stringbegin[a]+stringbegin[b])\r\n elif len(stringbegin[a])<k:\r\n s = stringbegin[a]+stringbegin[b]\r\n stringbegin.append(s[:k])\r\n else:\r\n stringbegin.append(stringbegin[a])\r\n \r\n if len(stringend[b])<k and len(stringend[a])+len(stringend[b])<k:\r\n stringend.append(stringend[a]+stringend[b])\r\n elif len(stringend[b])<k:\r\n s = stringend[a]+stringend[b]\r\n stringend.append(s[-k:])\r\n else:\r\n stringend.append(stringend[b])\r\n" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_trie(n):\r\n G0 = [[-1] for _ in range(n)]\r\n G1 = [[-1] for _ in range(n)]\r\n cnt = [[0] for _ in range(n)]\r\n return G0, G1, cnt\r\n\r\ndef insert(G0, G1, cnt, x, l):\r\n j = 0\r\n for i in range(l, -1, -1):\r\n cnt[j] += 1\r\n if x & pow2[i]:\r\n if G1[j] == -1:\r\n G0.append(-1)\r\n G1.append(-1)\r\n cnt.append(0)\r\n G1[j] = len(cnt) - 1\r\n j = G1[j]\r\n else:\r\n if G0[j] == -1:\r\n G0.append(-1)\r\n G1.append(-1)\r\n cnt.append(0)\r\n G0[j] = len(cnt) - 1\r\n j = G0[j]\r\n cnt[j] += 1\r\n return\r\n\r\ndef erase(G0, G1, cnt, x, l):\r\n j = 0\r\n for i in range(l, -1, -1):\r\n cnt[j] -= 1\r\n if x & pow2[i]:\r\n j = G1[j]\r\n else:\r\n j = G0[j]\r\n cnt[j] -= 1\r\n return\r\n\r\ndef count_min(G0, G1, cnt, k, l):\r\n j = 0\r\n ans = 0\r\n for i in range(l, -1, -1):\r\n if k & pow2[i]:\r\n if G0[j] ^ -1:\r\n ans += cnt[G0[j]]\r\n j = G1[j]\r\n else:\r\n j = G0[j]\r\n return ans\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n + 1)]\r\nE = [(0, 0)]\r\nd = dict()\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split())\r\n G[u].append(v)\r\n G[v].append(u)\r\n E.append((u, v))\r\n d[(u, v)], d[(v, u)] = i + 1, i + 1\r\ns, ma = 0, 0\r\nfor i in range(1, n + 1):\r\n if ma < len(G[i]):\r\n s, ma = i, len(G[i])\r\nx = [-1] * (n + 1)\r\ny = [0] * (n + 1)\r\nc = 0\r\nfor i in G[s]:\r\n z = [s]\r\n u = i\r\n while u:\r\n z.append(u)\r\n x[u] = c\r\n g = G[u]\r\n if len(g) == 1:\r\n break\r\n u = g[0] ^ g[1] ^ z[-2]\r\n for j in range(1, len(z)):\r\n y[z[j]] = j\r\n c += 1\r\nG00, G10, cnt0 = binary_trie(c)\r\npow2 = [1]\r\nl = 20\r\nfor _ in range(l):\r\n pow2.append(2 * pow2[-1])\r\nm = int(input())\r\nans = []\r\nfor _ in range(m):\r\n t = list(map(int, input().split()))\r\n if t[0] <= 2:\r\n i = t[1]\r\n u, v = E[i]\r\n p = x[u] if x[u] ^ -1 else x[v]\r\n h = min(y[u], y[v])\r\n if t[0] == 2:\r\n insert(G00[p], G10[p], cnt0[p], h, l)\r\n else:\r\n erase(G00[p], G10[p], cnt0[p], h, l)\r\n else:\r\n a, b = t[1], t[2]\r\n if a == s or b == s:\r\n if a ^ s:\r\n a, b = b, a\r\n p, h = x[b], y[b]\r\n ans0 = h if not count_min(G00[p], G10[p], cnt0[p], h, l) else -1\r\n elif x[a] == x[b]:\r\n pa, ha = x[a], y[a]\r\n pb, hb = x[b], y[b]\r\n ca = count_min(G00[pa], G10[pa], cnt0[pa], ha, l)\r\n cb = count_min(G00[pb], G10[pb], cnt0[pb], hb, l)\r\n ans0 = abs(ha - hb) if ca == cb else -1\r\n else:\r\n pa, ha = x[a], y[a]\r\n pb, hb = x[b], y[b]\r\n ca = count_min(G00[pa], G10[pa], cnt0[pa], ha, l)\r\n cb = count_min(G00[pb], G10[pb], cnt0[pb], hb, l)\r\n ans0 = ha + hb if not ca + cb else -1\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "# https://codeforces.com/problemset/problem/909/D\r\ndef process(a):\r\n assert len(a) >= 2\r\n \r\n n = len(a)\r\n min_ = float('inf')\r\n\r\n for i, [cnt, c] in enumerate(a):\r\n if i == 0 or i == n-1:\r\n min_ = min(min_, cnt)\r\n else:\r\n min_ = min(min_, (cnt+1) //2) \r\n \r\n b = []\r\n for i, [cnt, c] in enumerate(a):\r\n if i == 0 or i == n-1:\r\n remain = cnt - min_\r\n else:\r\n remain = cnt - min_ * 2\r\n \r\n if remain <= 0:\r\n continue\r\n \r\n if len(b) == 0 or c != b[-1][1]:\r\n b.append([remain, c])\r\n else:\r\n pre_cnt, pre_c = b.pop()\r\n b.append([pre_cnt+remain, c])\r\n \r\n return b, min_ \r\n\r\nS = input() + ' '\r\ncur = []\r\n\r\ncnt = 0\r\npre = ''\r\nfor x in S:\r\n if cnt == 0:\r\n cnt+= 1\r\n pre = x\r\n elif x!=pre:\r\n cur.append([cnt, pre])\r\n cnt = 1\r\n pre = x\r\n else:\r\n cnt+=1\r\n\r\ncnt = 0\r\nwhile len(cur) not in [0, 1]: \r\n cur, min_ = process(cur)\r\n cnt+=min_\r\n \r\nprint(cnt) ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\nu, v = [], []\r\nc, l = 0, s[0]\r\nfor i in s:\r\n if l ^ i:\r\n u.append(c)\r\n v.append(l)\r\n c, l = 0, i\r\n c += 1\r\nu.append(c)\r\nv.append(l)\r\nans = 0\r\nwhile len(u) > 1:\r\n ans += 1\r\n u[0] += 1\r\n u[-1] += 1\r\n u0, v0 = [], []\r\n for i, j in zip(u, v):\r\n c = i - 2\r\n if c <= 0:\r\n continue\r\n if not v0 or v0[-1] ^ j:\r\n u0.append(c)\r\n v0.append(j)\r\n else:\r\n u0[-1] += c\r\n u, v = u0, v0\r\nprint(ans)", "s = input()\r\n\r\ncur_len = 1\r\na = []\r\nchar = []\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i-1]: cur_len += 1\r\n else:\r\n a.append(cur_len)\r\n char.append(s[i-1])\r\n cur_len = 1\r\n \r\na.append(cur_len)\r\nchar.append(s[len(s)-1])\r\n\r\nans = 0\r\nwhile len(a) > 1:\r\n n = len(a)\r\n inner_min = 100000000\r\n for i in range(1,n-1):\r\n if a[i] < inner_min: inner_min = a[i]\r\n \r\n k = min(a[0], a[n-1],(inner_min + 1)//2)\r\n #print(\"a: \", a, \"; k = \", k)\r\n b = []\r\n new_char = []\r\n for i in range(n):\r\n if i == 0 or i == n-1:\r\n if a[i] > k:\r\n b.append(a[i]-k)\r\n new_char.append(char[i])\r\n else:\r\n if a[i] > 2*k:\r\n b.append(a[i] - 2*k)\r\n new_char.append(char[i])\r\n## print(b)\r\n ans += k\r\n if len(b) > 1:\r\n c = [0]*n\r\n newnew_char = [new_char[0]]\r\n count = 0\r\n \r\n for i in range(0,len(b)-1):\r\n c[count] += b[i]\r\n if new_char[i] == new_char[i+1]: continue\r\n else:\r\n count += 1\r\n newnew_char.append(new_char[i+1])\r\n if new_char[len(b)-2] == new_char[len(b) - 1]: c[count] += b[len(b)-1]\r\n else:\r\n #count += 1\r\n newnew_char.append(new_char[i+1])\r\n c[count] = b[len(b)-1]\r\n a = c[:count+1]\r\n char = newnew_char[:]\r\n else:\r\n a = b[:]\r\n\r\nprint(ans)\r\n \r\n" ]

[ "n, H = map(int, input().split())\r\n\r\ndef is_ok(maxh):\r\n k = min(H, maxh)\r\n cnt = maxh*maxh-k*(k-1)//2\r\n return cnt <= n\r\n\r\ndef get(maxh):\r\n global n\r\n k = min(H, maxh)\r\n cnt = maxh*maxh-k*(k-1)//2\r\n x = (2*maxh-1)-(k-1)\r\n n = n-cnt\r\n return x+(n+maxh-1)//maxh\r\n\r\nl = 1\r\nr = 10**18\r\n\r\nwhile l+1 <r:\r\n mid = (l+r)//2\r\n if is_ok(mid):\r\n l = mid\r\n else:\r\n r = mid\r\n\r\nif is_ok(r):\r\n print(get(r))\r\nelse:\r\n print(get(l))\r\n", "N,H = map(int,input().split())\r\nans = N\r\nok = 1\r\nng = H+1\r\nwhile ng - ok > 1:\r\n md = (ok+ng)//2\r\n K = (md*(md+1))//2\r\n if K <= N:\r\n L = N - K\r\n X = L//md\r\n if L % md != 0:\r\n X += 1\r\n if ans > md+X:\r\n ans = md + X\r\n ok = md\r\n else:\r\n ng = md\r\nif H*(H+1)//2 > N:\r\n print(ans)\r\n exit(0)\r\n\r\nok = H\r\nng = N\r\nwhile ng - ok > 1:\r\n md = (ok+ng)//2\r\n K = (md*(md+1))//2 + (md*(md-1))//2 - (H*(H-1))//2\r\n if K <= N:\r\n L = N - K\r\n X = md + md - H + L//md \r\n if L % md != 0:\r\n X += 1\r\n if ans > X:\r\n ans = X\r\n ok = md\r\n else:\r\n ng = md\r\n\r\nprint(ans)", "def f():\n if x <= m:\n return x * (x + 1) // 2\n t = x + m\n return t // 2 * (t - t // 2) - m * (m - 1) // 2\n\nn, m = map(int, input().split())\nlo, hi = 0, n\nwhile lo + 1 < hi:\n x = (lo + hi) // 2\n if f() < n:\n lo = x\n else:\n hi = x\nprint(hi)", "def UpperDiv (a, b):\r\n if a < 0:\r\n return 0\r\n if a % b == 0:\r\n return a // b\r\n return a // b + 1\r\n\r\ndef GetAnswer (n, h, k):\r\n h1 = min (h, k)\r\n x = 2 * k - 1 - (h1 - 1)\r\n y = k * k - h1 * (h1 - 1) // 2\r\n return (x + UpperDiv (n - y, k))\r\n\r\ndef Check (n, h, k):\r\n h1 = min (h, k)\r\n a = k * k\r\n b = h1 * (h1 - 1) // 2\r\n value = a - b\r\n return (value <= n)\r\n\r\ndef BinarySearch (n, h):\r\n left = 1\r\n right = n\r\n while (right - left > 1):\r\n middle = (left + right) // 2\r\n if Check (n, h, middle):\r\n left = middle\r\n else:\r\n right = middle\r\n return left\r\n\r\nn, h = map (int, input ().split ())\r\nk = BinarySearch (n, h)\r\nprint (GetAnswer (n, h, k))", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n| created: 29.05.2018 16:20 |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n# inp = open(\"input.txt\", \"r\"); input = inp.readline; out = open(\"output.txt\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef can(x):\r\n global H, n\r\n if x <= H:\r\n return n <= (1 + x) * x // 2\r\n L = x + H - 1\r\n h = L // 2\r\n s = (1 + h) * h\r\n if L % 2 == 1:\r\n s += h + 1\r\n s -= H * (H - 1) // 2\r\n return n <= s\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef solution():\r\n global H, n\r\n n, H = map(int, input().split())\r\n m, M = 0, int(1e18) + 5\r\n while M - m > 1:\r\n mid = m + (M - m) // 2\r\n if can(mid):\r\n M = mid\r\n else:\r\n m = mid\r\n print(M)\r\n\r\n\r\n# ===========================================\r\nwhile TN != 0:\r\n solution()\r\n TN -= 1\r\n# ===========================================\r\n# inp.close()\r\n# out.close()\r\n", "n, h = map(int, input().split())\r\n\r\nif(n > h*(h + 1)/2):\r\n\tl = 1\r\n\tr = 2000000000000000000\r\n\th0 = 2000000000000000000\r\n\r\n\twhile(l <= r):\r\n\t\tmid = (l + r)//2\r\n\t\tif(mid*mid - h*(h - 1)//2 <= n) :\r\n\t\t\th0 = mid\r\n\t\t\tl = mid + 1\r\n\t\telse:\r\n\t\t\tr = mid - 1\r\n\r\n\tans = 2*h0 - h\r\n\tn = n - h0*h0 + h*(h - 1)//2\r\n\tans = ans + (n + h0 - 1)//h0\r\n\tprint(ans)\r\n\r\nelse:\r\n\tl = 1\r\n\tr = h\r\n\tans = h\r\n\twhile(l <= r):\r\n\t\tmid = (l + r)//2\r\n\t\tif(mid*(mid + 1)//2 <= n):\r\n\t\t\tans = mid\r\n\t\t\tl = mid + 1\r\n\t\telse:\r\n\t\t\tr = mid - 1\r\n\tn = n - ans*(ans + 1)//2\r\n\tans = ans + (n + ans - 1)//ans\r\n\tprint(ans)", "def solve(n, H) :\n def ligma(s) :\n return (s*s+s)//2\n if ligma(H) >= n :\n lo, hi = 1, H\n while lo < hi :\n mid = (lo+hi)//2\n if ligma(mid) >= n : hi = mid\n else : lo = mid+1\n return lo\n def blocks(R) :\n k = 1 + (R-H) // 2\n S = (R-H) * k - 2 * ligma(k-1)\n return ligma(R) - S\n lo, hi = H, n\n while lo < hi :\n mid = (lo+hi)//2\n if blocks(mid) >= n : hi = mid\n else : lo = mid+1\n return lo\n \n \nn, H = map(int, input().split())\n\n# print(n, H)\nprint(solve(n, H))\n", "def get(a):\r\n if (a <= h):\r\n return a * (a + 1) // 2;\r\n tmp = a - h + 1;\r\n re = h * (h - 1) // 2;\r\n l = (tmp + 1) // 2;\r\n r = tmp // 2;\r\n re += l * (h - 1 + l + h) // 2;\r\n re += r * (h - 1 + r + h) // 2;\r\n return re;\r\n\r\nlo = 1\r\nhi = 1000000000000000001\r\nn, h = map(int, input().split())\r\nwhile (lo < hi):\r\n mi = (lo + hi) // 2;\r\n if (get(mi) < n):\r\n lo = mi + 1;\r\n else:\r\n hi = mi;\r\nprint(lo)\r\n", "n, h = map(int, input().split())\n\n\ndef f(k, n, h):\n r = 0\n if k<=h:\n r = k*(k+1)//2\n else:\n bb = k-h+1\n zz = bb//2\n r = h*(h+1)//2 - h + bb*h + zz*bb - zz*(zz+1)\n return r\n\nl = 0\nr = n\nwhile (l+1<r):\n k = l + (r-l)//2;\n\n cnt = f(k, n, h);\n if cnt < n:\n l = k\n else:\n r = k\n\nif f(l, n, h) < n:\n l += 1\nprint (l)", "def f(mid, h, x):\r\n\trv = (mid * mid) + (2 * x * x) + (2 * x * (h - mid - 1)) + mid\r\n\treturn rv\r\n\r\n\r\nn, h = map(int, input().rstrip().split())\r\n\r\nl = 1\r\nr = n\r\nans = n\r\n\r\nwhile l <= r:\r\n\tmid = ((r - l) // 2) + l\r\n\tx = (mid - h + 2) // 2\r\n\tx = max(x, 0)\r\n\r\n\tv = f(mid, h, x)\r\n\r\n\tif v >= 2 * n:\r\n\t\tans = mid\r\n\t\tr = mid - 1\r\n\telse:\r\n\t\tl = mid + 1\r\n\r\nprint(ans)", "n, h = input().split()\r\nn = int(n)\r\nh = int(h)\r\nif n > (1 + h) * h // 2:\r\n l = h\r\n r = n + 1\r\n\r\n\r\n def check(v):\r\n if (h + v) * (v - h + 1) // 2 + (1 + v) * v // 2 - v > n:\r\n return False\r\n return True\r\n\r\n\r\n while l < r:\r\n mid = (l + r) // 2 + 1\r\n if check(mid):\r\n l = mid\r\n else:\r\n r = mid-1\r\n n-=(h+l)*(l-h+1)//2\r\n ans = l-h+1\r\n n-=(1+l)*(l)//2-l\r\n ans += l-1\r\n ans += (n+l-1)//l;\r\n print(ans)\r\n\r\n\r\nelse:\r\n l = 1\r\n r = h\r\n\r\n\r\n def check(mid):\r\n return (1 + mid) * mid // 2 >= n\r\n\r\n\r\n while l < r:\r\n mid = (l + r) // 2\r\n if check(mid):\r\n r = mid;\r\n else:\r\n l = mid + 1\r\n print(l)\r\n", "from math import sqrt, ceil\n\ndef get_range(piles, limit):\n min = piles\n max = piles * (piles+1) // 2\n if piles > limit:\n overflow = piles - limit\n if overflow % 2 == 1:\n max -= (overflow//2+1)**2\n else:\n max -= (overflow//2)*(overflow//2+1)\n return min, max\n\n\ndef main():\n n, h = map(int, input().strip().split())\n\n if n == 1:\n print(1)\n return\n\n l, r = 0, n\n while l != r:\n mid = int((l+r)//2)\n min, max = get_range(mid, h)\n # print(mid, \":\", min, max)\n\n if min <= n <= max:\n r = mid\n else:\n l = mid+1\n print(r)\n\nif __name__ == '__main__':\n main()\n", "import math\r\n\r\nn, H = map(int, input().split())\r\n\r\nx = (1 + H) * H // 2\r\nif n == x:\r\n print(H)\r\nelse:\r\n if n < x:\r\n H = int(math.sqrt(n * 2))\r\n if (H + 1) * H // 2 > n:\r\n H = H - 1\r\n ans = H\r\n x = (H + 1) * H // 2\r\n ans += (n - x + H - 1) // H\r\n print(ans)\r\n else:\r\n x = (1 + H) * H // 2 + H\r\n ma = int(math.sqrt(n - x + H + H * H))\r\n tol = x + (ma + H + 1) * (ma - H) - ma\r\n if tol > n:\r\n ma = ma - 1\r\n tol = x + (ma + H + 1) * (ma - H) - ma\r\n ans = ma * 2 - H\r\n if n > tol:\r\n ans += (n - tol + ma - 1) // ma\r\n print(ans)\r\n", "n,H=map(int,input().split())\r\n\r\ndef calc(mid):\r\n if mid<=H:\r\n return mid*(mid+1)//2\r\n res=H*(H+1)//2\r\n x=mid-H\r\n y=x//2\r\n if(x%2==1):\r\n res+=(y*H+y*(y+1)//2)*2+H\r\n else:\r\n res+=(y*H+y*(y+1)//2)*2-y\r\n return res\r\n \r\n\r\nng,ok=-1,10**18+10\r\nwhile ok-ng>1:\r\n mid=(ok+ng)//2\r\n if calc(mid)>=n:\r\n ok=mid\r\n else:\r\n ng=mid\r\n\r\nprint(ok)", "import math\nn,h=map(int,input().split())\ndef isok(m):\n\treturn (m*(m+1))//2<=n\n\nl=1\nr=h\nm=l\nwhile l<r-1:\n\tm=(l+r)//2\n\tif isok(m):\n\t\tl=m\n\telse:\n\t\tr=m\nh1=0\nif isok(r):\n\th1=r\nelif isok(m):\n\th1=m\nelse:\n\th1=l\nh2=math.floor((n+(h1*(h1-1))//2)**0.5)\nX=h2**2-(h1*(h1-1))//2\ni=0\nif (n-X)%h2!=0:\n\ti=1\nprint(2*h2-h1+(n-X)//h2+i)", "import sys\ninput = sys.stdin.readline\n\nn, H = map(int, input().split())\nlb, ub = 0, 10**20\nwhile ub - lb > 1:\n m = (lb + ub) // 2\n if m <= H:\n x = m*(m+1)//2\n else:\n w = m - H + 1\n if w % 2 == 0:\n x = (2*H+w//2-1)*(w//2) + H*(H-1)//2\n else:\n x = (2*H+w//2-1)*(w//2)+ H+w//2 + H*(H-1)//2\n if n <= x:\n ub = m\n else:\n lb = m\nprint(ub)", "def sumab(a, b):\r\n return (a+b)*(b-a+1)//2\r\ndef calc(spot, H):\r\n if spot <= H:\treturn spot * (spot + 1) // 2\r\n if (H - spot) % 2 == 0: return sumab(1,H+(spot-H)//2)+sumab(H,H+(spot-H)//2-1)\r\n return sumab(1,H+(spot-H)//2)+sumab(H,H+(spot-H)//2-1)+H+(spot-H)//2\r\n\r\n\r\n\r\ndef solve():\r\n n,H = map(int,input().split())\r\n if n == 1:\r\n print(1)\r\n return 0\r\n st = 1\r\n en = 10**20\r\n while st < en:\r\n mid = (st+en)//2\r\n if calc(mid,H) >= n:\r\n en = mid\r\n else:\r\n st = mid+1\r\n print(st)\r\nsolve()", "n, H = map(int, input().split())\r\nl = 0\r\nr = n + 1\r\nwhile r - l > 1:\r\n mid = (l + r) // 2\r\n t = min(mid, H) * (min(mid, H) + 1) // 2\r\n if mid > H:\r\n tmid = mid - H\r\n t += tmid * H\r\n s = tmid // 2\r\n t += s * (s + 1)\r\n if (tmid) % 2 == 0:\r\n t -= s\r\n if t >= n:\r\n r = mid\r\n else:\r\n l = mid\r\nprint(r)\r\n", "import math\n\nN, H = input().split(' ')\nN = int(N)\nH = int(H)\nH -= 1\n\nif H*(H+1)//2 > N:\n res = int(math.floor(0.5*(math.sqrt(8*N+1) - 1)))\n if res*(res+1)//2 == N:\n print(res)\n else:\n print(res+1)\nelse:\n res = int(math.floor(0.5*(math.sqrt(2*H**2 + 2*H+4*N+1)-2*H-1)))\n sm = (H+res)*(H+res+1) - H*(H+1)//2\n if N == sm:\n print(2*res + H)\n elif N - sm > H+res+1:\n print(2*res+H+2)\n else:\n print(2*res+H+1)\n", "def cal(x):\r\n return (1+x)*x // 2\r\n\r\ndef g(x):\r\n if x % 2 == 0 :\r\n return 2*cal(x//2)\r\n else:\r\n return cal(x // 2 + 1) + cal(x // 2)\r\n\r\n\r\ndef check2(x , num):\r\n if g(x) >= num:\r\n return 1\r\n return 0\r\n\r\nn , h = ( int(x) for x in input().split(\" \") )\r\n\r\nif cal(h) >= n:\r\n lo , hi = 1 , n\r\n ans = -1\r\n while lo <= hi:\r\n mid = ( lo + hi ) // 2\r\n if cal(mid) >= n :\r\n ans = mid\r\n hi = mid - 1\r\n else:\r\n lo = mid + 1\r\n print(ans)\r\nelse:\r\n h = h - 1\r\n n += cal(h)\r\n lo , hi = 1 , n\r\n ans = -1\r\n while lo <= hi :\r\n mid = ( lo + hi ) // 2\r\n if( g(mid) >= n ):\r\n ans = mid\r\n hi = mid - 1\r\n else:\r\n lo = mid + 1\r\n print(ans - h)\r\n", "def solve(H, h):\n if h <= H:\n return (h + 1) * h // 2\n return (H + (h - 1)) * (h - H) // 2 + (h + 1) * h // 2\n\nn, H = map(int, input().split())\n# print(n, H)\nlow = 1\nhigh = n\nwhile low < high:\n middle = (low + high + 1) // 2\n if solve(H, middle) <= n:\n low = middle\n else:\n high = middle - 1\nh = low\nprint(max(h - H, 0) + h + (n - solve(H, h) + (h - 1)) // h)\n", "#!/usr/bin/python3\n\nn = 0\nH = 0\n\ndef test(k):\n\tif k <= H:\n\t\treturn ((k + 1) * k)//2 >= n\n\telse:\n\t\ta = H * (2*k + 1 - H)//2\n\t\tcnt = (k - H - 1 + 1)//2\n\t\tif (k - H - 1)%2 == 0:\n\t\t\tstart = 2\n\t\telse:\n\t\t\tstart = 1\n\t\tb = ((start + (k - H - 1)) * cnt)//2\n\t\treturn a + b >= n\n\n\nn, H = (int(x) for x in input().split())\nlo = 1\nhi = n\nwhile lo < hi:\n\tmid = (lo + hi)//2\n\tif test(mid):\n\t\thi = mid\n\telse:\n\t\tlo = mid+1\nprint(lo)\n", "def gs(x):\r\n return x * (x + 1) // 2\r\n\r\ndef gs2(x):\r\n if x % 2 == 0:\r\n cr = 0\r\n else:\r\n cr = x // 2 + 1\r\n cr += h * x\r\n cr += (x // 2 + 1) * (x // 2)\r\n return cr\r\n\r\nr = 10**18 + 7\r\nn, h = [int(i) for i in input().strip().split()]\r\nl = 0\r\nr = min(h + 1, r)\r\nwhile (r - l > 1):\r\n m = (l + r) // 2\r\n if (gs(m) <= n):\r\n l = m\r\n else:\r\n r = m\r\ntr = l\r\nn -= gs(l)\r\nif (n >= h):\r\n n -= h\r\n tr += 1\r\n #print(tr, n)\r\n l = 0\r\n r = 10 ** 18 + 7\r\n while (r - l > 1):\r\n m = (l + r) // 2\r\n if (gs2(m) <= n):\r\n l = m\r\n else:\r\n r = m\r\n #print(l, gs2(l))\r\n tr += l\r\n n -= gs2(l)\r\nif (n > 0):\r\n tr +=1\r\nprint(tr)", "ceil1 = lambda a, b: (a + b - 1) // b\r\nsum_n = lambda n: (n * (n + 1)) // 2\r\n\r\nn, h = map(int, input().split())\r\nbe, en, ans = 1, 2 * 10 ** 9, n\r\n\r\nwhile be <= en:\r\n md = (be + en) >> 1\r\n h1 = min(h, md)\r\n val = pow(md, 2) - sum_n(h1 - 1)\r\n if val <= n:\r\n be = md + 1\r\n num = 2 * md - h1\r\n ans = num + ceil1(n - val, md)\r\n else:\r\n en = md - 1\r\n\r\nprint(ans)\r\n", "INF = 1000000000000000000\r\ndef f(k,n,h):\r\n h1 = min(k,h)\r\n a = k*k\r\n b = h1 * (h1-1) // 2\r\n c = a-b\r\n return c>n \r\n \r\n\r\n\r\nn,h = map(int,input().split())\r\n\r\n\r\nlow = 1\r\nhigh =INF\r\nwhile low < high:\r\n mid = low + (high - low) // 2\r\n if f(mid,n,h) == True :\r\n high = mid\r\n else:\r\n low = mid + 1\r\nk = low-1\r\nh1 = min(k,h)\r\nspot = 2*k-h1\r\nrequires = (k*k) - (h1 * (h1-1) // 2)\r\nleftOver = n-requires\r\nspot += ((leftOver + k -1)//k)\r\n\r\n\r\nprint (spot)\r\n\r\n\r\n", "n, h = map(int, input().split())\r\ndef f(x): return x * (x + 1) // 2\r\ndef g(x, th) :\r\n if x == 0: return 0\r\n if x == 1: return th\r\n if x == 2: return th + th\r\n ret = x * th\r\n mx = (x - 1) / 2\r\n if x & 1 : ret += f(mx) + f(mx - 1)\r\n else : ret += f(mx) + f(mx)\r\n return ret\r\n\r\nlb, ub = 0, 2000000000\r\nwhile lb < ub :\r\n mid = (lb + ub) >> 1\r\n\r\n if f(mid) > n: ub = mid\r\n elif f(mid) == n: ub = lb = mid\r\n else : lb = mid + 1 \r\nif lb <= h: print(lb)\r\nelse :\r\n pt1, ans1 = h * (h - 1) // 2, h - 1\r\n pt2 = n - pt1\r\n l, r = 0, (pt2//h) + (pt2%h!=0)\r\n while l < r :\r\n mid = (l + r) >> 1\r\n \r\n if g(mid, h) > pt2: r = mid\r\n elif g(mid, h) == pt2: r = l = mid\r\n else: l = mid + 1\r\n print(ans1 + l)", "n, h=map(int, input().split())\r\n\r\ndef GET(x):\r\n\tif(x<=0):\r\n\t\treturn 0\r\n\tif x&1:\r\n\t\tn = (x+1)//2\r\n\t\treturn n*n\r\n\telse:\r\n\t\tn = x//2\r\n\t\treturn n*n+n\r\n\r\nlo, hi=0, n\r\nwhile lo+1<hi:\r\n\tm = (lo+hi)>>1\r\n\tif m<=h:\r\n\t\tif (m*m+m)//2>=n:\r\n\t\t\thi=m\r\n\t\telse:\r\n\t\t\tlo=m\r\n\t\tcontinue\r\n\ttot = (h*h+h)/2 + h*(m-h)+GET(m-h-1)\r\n\tif tot>=n:\r\n\t\thi=m\r\n\telse:\r\n\t\tlo=m\r\nprint(hi)\r\n\r\n", "def ok(val):\r\n x = val - h\r\n res = get(val) + (h + val-1) * x //2\r\n return res\r\n\r\ndef ok2(val):\r\n res = get(val) + (h + val) * (val-h+1) //2\r\n return res\r\n \r\ndef get(val):\r\n return (1+val) * val //2\r\n\r\nline = input().split(' ')\r\nn = line[0]\r\nh = line[1]\r\nn = int(n)\r\nh = int(h)\r\nans = -1\r\nif get(h) >=n:\r\n l = 1\r\n r = n\r\n while l<=r:\r\n mid = (l+r)//2\r\n if get(mid)>=n:\r\n ans = mid\r\n r = mid-1\r\n else:\r\n l = mid+1\r\n print(ans)\r\n \r\nelse:\r\n l = h \r\n r = 10**12\r\n while l<=r:\r\n mid = (l+r)//2\r\n if ok(mid)>=n: \r\n ans1 = mid\r\n r = mid-1\r\n else:\r\n l = mid+1\r\n ans1 = ans1 + ans1 - h\r\n \r\n l = h \r\n r = 10**12\r\n ans2 = -1\r\n while l<=r:\r\n mid = (l+r)//2\r\n if ok2(mid)>=n: \r\n ans2 = mid\r\n r = mid-1\r\n else:\r\n l = mid+1\r\n ans2 = ans2 + ans2 - h+1\r\n \r\n \r\n if ans1>ans2:\r\n print(ans2)\r\n else:\r\n print(ans1)\r\n ", "def main():\r\n import sys\r\n input = sys.stdin.readline\r\n\r\n N, H = map(int, input().split())\r\n\r\n if (H * (H+1)) // 2 >= N:\r\n ok = H\r\n ng = 0\r\n mid = (ok+ng) // 2\r\n while ok - ng > 1:\r\n if ((mid+1) * mid) // 2 >= N:\r\n ok = mid\r\n else:\r\n ng = mid\r\n mid = (ok+ng)//2\r\n print(ok)\r\n exit()\r\n\r\n ok = 10**12\r\n ng = 0\r\n mid = (ok+ng)//2\r\n while ok - ng > 1:\r\n if (mid + H) & 1:\r\n x = (H+mid-1) // 2\r\n M = (x * (x+1)) // 2 + ((x + H) * (x-H+1))//2\r\n else:\r\n x = (H + mid) // 2\r\n M = (x * (x + 1)) // 2 + ((x-1 + H) * (x - H)) // 2\r\n if M >= N:\r\n ok = mid\r\n else:\r\n ng = mid\r\n mid = (ok+ng)//2\r\n #print(ok, ng, mid, M)\r\n print(ok)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, H = map(int, input().split())\r\n\r\nleft, right = 0, n\r\nlimit = n + (H - 1) * H // 2\r\n\r\ndef check(t):\r\n if t <= H:\r\n return t * (t + 1) // 2 >= n\r\n \r\n if (t + H - 1) % 2:\r\n return (t + H) ** 2 // 4 >= limit\r\n else:\r\n return ((t + H) ** 2 - 1) // 4 >= limit\r\n\r\n\r\nwhile True:\r\n if right - left <= 1:\r\n break\r\n tmp = (left + right) // 2\r\n # print(tmp, left, right)\r\n if check(tmp):\r\n right = tmp\r\n else:\r\n left = tmp\r\n\r\n\r\nprint(right)", "\r\ndef max_number_of_packs(number_of_spots, fence_height):\r\n if number_of_spots > fence_height:\r\n k = (number_of_spots - fence_height) // 2 + fence_height\r\n l = number_of_spots - k\r\n return (k * (k+1) // 2) + (l * (l+1) // 2) + (l * (fence_height-1))\r\n else:\r\n return number_of_spots * (number_of_spots+1) // 2\r\n\r\ndef binary_search(left, right, number_of_packs, fence_height):\r\n if left >= right - 1:\r\n return right\r\n middle = (left + right) // 2\r\n max_packs = max_number_of_packs(middle, fence_height)\r\n if max_packs < number_of_packs:\r\n return binary_search(middle, right, number_of_packs, fence_height)\r\n else:\r\n return binary_search(left, middle, number_of_packs, fence_height)\r\n\r\nn, h = map(int, input().split())\r\nprint(binary_search(0, 10**18, n, h))", "import sys\r\ninput = lambda :sys.stdin.readline()[:-1]\r\nni = lambda :int(input())\r\nna = lambda :list(map(int,input().split()))\r\nyes = lambda :print(\"yes\");Yes = lambda :print(\"Yes\");YES = lambda : print(\"YES\")\r\nno = lambda :print(\"no\");No = lambda :print(\"No\");NO = lambda : print(\"NO\")\r\n#######################################################################\r\ndef f(x):\r\n y = (n-x * (x+1)//2)\r\n if y < 0:\r\n return -1\r\n return x + y//x + (y % x > 0)\r\nn,h = na()\r\nif h * (h+1) //2 > n:\r\n ok = 0\r\n ng = 10**18\r\n while ng-ok>1:\r\n d = ng+ok>>1\r\n if d <= h and d * (d+1)//2 <= n:\r\n ok = d\r\n else:\r\n ng = d\r\n print(f(ok))\r\nelse:\r\n ok = 0\r\n ng = 10**18\r\n while ng-ok>1:\r\n d = ng+ok>>1\r\n if (h+d)*(h+d+1)//2 + (h+d)*(h+d-1)//2 - h * (h-1)//2 <= n:\r\n ok = d\r\n else:\r\n ng = d\r\n x = ok\r\n y = n - ((h+x)*(h+x+1)//2 + (h+x)*(h+x-1)//2 - h * (h-1)//2)\r\n print(h + 2 * x + y // (h + x) + (y % (h + x) > 0))\r\n", "n,h=list(map(int,input().split()))\n\ndef p(k):\n\treturn (k*(k+1))//2 \n\ndef pp(k):\n\tx=0\n\tif(k>=2):\n\t\tx=k*(k-1)//2\n\treturn int(x + h*k + (h+k)*(h+k+1)//2)\n\ntemp= (h*(h+1))//2\nc=0\n\nif(n-temp>=0):\n\tlb=0\n\tub=100000000000000000000\n\twhile(lb<ub):\n\t\tmid=(lb+ub+1)//2\n\t\tif(n<pp(mid)):\n\t\t\tub=mid-1\n\t\telse:\n\t\t\tlb=mid\n\tsk=pp(lb)\n\tk=lb\n\tif(sk==n):\n\t\tprint(h+2*k)\n\telif(n<=sk+k+h):\n\t\tprint(h+2*k+1)\n\telse:\n\t\tprint(h+2*k+2)\n\nelse:\n\tlb=1\n\tub=h\n\twhile(lb<ub):\n\t\tmid= (lb+ub+1)//2\n\t\tif(p(mid)<=n):\n\t\t\tlb=mid\n\t\telse:\n\t\t\tub=mid-1\n\tif(p(lb)==n):\n\t\tprint(lb)\n\telse:\n\t\tprint(lb+1)", "n, H = map(int, input().split())\r\n\r\ndef f(x):\r\n\tif x <= H:\r\n\t\treturn x * (x + 1) // 2\r\n\tif (x + H) % 2 == 0:\r\n\t\tM = (x + H) // 2\r\n\t\treturn M * M - (H * (H - 1) // 2)\r\n\telse:\r\n\t\tM = (x + H - 1) // 2\r\n\t\treturn M * (M + 1) - H * (H - 1) // 2\r\n\r\nlo, hi = -1, n + 1\r\nwhile hi - lo > 1:\r\n\tmid = (lo + hi) // 2\r\n\tif f(mid) >= n:\r\n\t\thi = mid\r\n\telse:\r\n\t\tlo = mid\r\nprint(hi)", "def getSum1(x):\r\n return (x + 1) * x // 2;\r\n\r\n\r\ndef getSum(l, r):\r\n return getSum1(r) - getSum1(l - 1)\r\n\r\n\r\nn, h = map(int, input().split())\r\nl = 1\r\nr = n\r\nwhile l != r:\r\n m = (l + r + 1) >> 1\r\n cnt = 0\r\n if m > h:\r\n cnt += getSum(h, m - 1)\r\n cnt += getSum1(m)\r\n\r\n if cnt > n:\r\n r = m - 1\r\n else: l = m\r\n\r\n\r\ncnt = 0\r\nans = 0\r\nif l > h:\r\n cnt += getSum(h, l - 1)\r\n ans += l - h\r\n\r\ncnt += getSum1(l)\r\nans += l\r\n\r\nn -= cnt\r\nans += n // l\r\n\r\nif n % l != 0:\r\n ans += 1\r\n\r\nprint(ans)", "def bst(n):\r\n\tl = 0\r\n\tr = 10**44\r\n\to = 0\r\n\r\n\tif n <= 0:\r\n\t\treturn 0\r\n\r\n\twhile l <= r:\r\n\t\tm = (l+r) // 2\r\n\t\tif m*(m+1) // 2 >= n:\r\n\t\t\to = m\r\n\t\t\tr = m-1\r\n\t\telse:\r\n\t\t\tl = m+1\r\n\treturn o\r\n\r\ndef asc(x0, m):\r\n\treturn x0*m + m*(m-1) // 2\r\n\r\ndef fitt(m, h):\r\n\tif m <= h:\r\n\t\treturn m*(m+1) // 2\r\n\r\n\ty = (m+h) // 2\r\n\tx = (m-h) // 2 + 1\r\n\r\n\treturn asc(h, x) + asc(1, m-x)\r\n\r\ndef resi():\r\n\tn, h = map(int, input().split())\r\n\tt = bst(n)\r\n\r\n\tif t <= h:\r\n\t\treturn t\r\n\r\n\tl = 0\r\n\tr = 10**44\r\n\tsol = r\r\n\r\n\twhile l <= r:\r\n\t\tm = (l+r) // 2\r\n\r\n\t\tif fitt(m, h) >= n:\r\n\t\t\tsol = m\r\n\t\t\tr = m-1\r\n\t\telse:\r\n\t\t\tl = m+1\r\n\r\n\treturn sol\r\n\r\nprint(resi())\r\n", "n, h = map(int, input().split())\r\n\r\ndef check(mid):\r\n if mid <= h:\r\n return mid * (mid + 1) >= n * 2\r\n mh = int((mid - h) / 2 + h)\r\n if (mid - h) % 2 == 1:\r\n return ((mh + h) * (mh - h + 1) + mh * (mh + 1)) >= n * 2\r\n return ((mh + h - 1) * (mh - h) + mh * (mh + 1)) >= n * 2\r\n\r\nl, r = 1, n\r\nwhile l <= r:\r\n mid = int((l + r + 1) / 2)\r\n if check(mid):\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\nprint(int(r + 1))\r\n", "def judge(mid, n, H):\r\n if mid <= H:\r\n return mid * (mid + 1) // 2\r\n right = mid * (mid + 1) // 2\r\n left = (mid - H + 1) * H + (mid - H + 1) * ((mid - H + 1) - 1) // 2\r\n return left + right - mid\r\n\r\n\r\ndef solve(n, H):\r\n low = 1\r\n high = 1000000000000000000\r\n while True:\r\n mid = (low + high) >> 1\r\n now = judge(mid, n, H)\r\n if low == mid:\r\n # print(low, now, high, judge(high, n, H), n)\r\n if now >= n:\r\n return low + max(0, low - H)\r\n elif now + low >= n:\r\n return low + max(0, low - H) + 1\r\n return high + max(0, high - H)\r\n if now == n:\r\n return mid + max(0, mid - H)\r\n elif now < n:\r\n low = mid\r\n elif now > n:\r\n high = mid\r\n pass\r\n\r\n\r\ntry:\r\n while True:\r\n n, H = input().split()\r\n n = int(n)\r\n H = int(H)\r\n print(solve(n, H))\r\nexcept EOFError:\r\n pass\r\n", "import sys\r\n\r\nn, H = map(int, input().split())\r\n\r\nok, ng = 0, n+1\r\nwhile abs(ok - ng) > 1:\r\n mid = (ok + ng) >> 1\r\n if ((mid * (mid+1)) >> 1) <= n:\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\nif ok <= H:\r\n n -= (ok * (ok+1)) >> 1\r\n print(ok + (1 if n else 0))\r\n exit()\r\n\r\n\r\nok, ng = H, 10**18\r\nwhile abs(ok - ng) > 1:\r\n mid = (ok + ng) >> 1\r\n m = (mid * (mid+1)) - (((H-1)*H) >> 1) - mid\r\n if m <= n:\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\nn -= (ok * (ok+1)) - (((H-1)*H) >> 1) - ok\r\nprint(ok + (ok - H) + (n + ok - 1) // ok)\r\n", "import sys\r\nreadline = sys.stdin.readline\r\n\r\ndef check(x):\r\n if x <= H:\r\n if x*(x+1)//2 >= N:\r\n return True\r\n else:\r\n return False\r\n res = x-H-1\r\n r1 = res//2\r\n r2 = res-r1\r\n if (r1*(r1+1)+r2*(r2+1))//2 + (x-H)*H + H*(H+1)//2 >= N:\r\n return True\r\n else:\r\n return False\r\n \r\n\r\nN, H = map(int, readline().split())\r\nok = N\r\nng = 0\r\nwhile abs(ok-ng) > 1:\r\n med = (ok+ng)//2\r\n if check(med):\r\n ok = med\r\n else:\r\n ng = med\r\nprint(ok)", "def f(n):\r\n return (n*n+n)//2\r\n\r\ndef g(n):\r\n if(n%2==0):return 2*f(n//2)\r\n else: return f(n//2+1)+f(n//2)\r\n\r\nn,h = (int(x) for x in input().split(\" \"))\r\nif f(h) >= n:\r\n lo,hi = 1, n\r\n while lo<hi:\r\n mid = (lo+hi)//2\r\n if f(mid) >= n: hi = mid\r\n else: lo = mid+1\r\n print (hi) \r\nelse:\r\n h = h-1\r\n n+=f(h)\r\n lo, hi = h, n\r\n while lo<hi:\r\n mid = (lo+hi)//2\r\n if g(mid)>=n: hi = mid\r\n else: lo = mid+1\r\n print(hi-h)", "#!/usr/bin/python3\r\n\r\nfrom sys import stdin\r\n\r\n\r\ndef f(n):\r\n return ((n - 1) // 2) * (n - 1 - (n - 1) // 2)\r\n\r\n\r\ndef g(n):\r\n lo, hi = 1, n\r\n while lo < hi:\r\n mid = (lo + hi) // 2\r\n if f(mid) < n:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n return lo\r\n\r\n\r\ndef ar(a, b, n):\r\n return (a + b) * n // 2\r\n\r\n\r\ndef total(n, H):\r\n if n < H:\r\n return ar(n, 1, n)\r\n return ar(n, n - H + 1, H) + f(n - H + 1)\r\n\r\n\r\ndef main():\r\n for line in stdin.readlines():\r\n n, H = [int(x) for x in line.split()]\r\n lo, hi = 1, n\r\n while lo < hi:\r\n mid = (lo + hi) // 2\r\n if total(mid, H) < n:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n print(lo)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, h = map(int, input().split())\r\n\r\ndef calc(mid):\r\n if mid <= h:\r\n return (1 + mid) * mid // 2\r\n peak = h - 1 + (mid - (h - 1) + 1) // 2\r\n if (mid - (h - 1)) % 2 == 0:\r\n return (h + peak) * (peak - h + 1) // 2 + (1 + peak) * peak // 2\r\n return (h + peak) * (peak - h + 1) // 2 + peak * (peak - 1) // 2\r\n\r\nl, r = 0, n + 1\r\nwhile r - l > 1:\r\n mid = (l + r) // 2\r\n if calc(mid) < n:\r\n l = mid\r\n else:\r\n r = mid\r\nprint(r)\r\n", "n, H = map(int, input().split())\r\ndef can(x):\r\n if x <= H:\r\n return n <= (1 + x) * x // 2\r\n L = x + H - 1\r\n h = L // 2\r\n s = (1 + h) * h\r\n if L % 2 == 1:\r\n s += h + 1\r\n s -= H * (H - 1) // 2\r\n return n <= s\r\n\r\nm, M = 0, int(1e18) + 5\r\nwhile M - m > 1:\r\n mid = m + (M - m) // 2\r\n if can(mid):\r\n M = mid\r\n else:\r\n m = mid\r\nprint(M)\r\n", "n,h=list(map(int,input().split()))\nleft=1\nright=n\nmid=0\nwhile(right>left):\n mid=(left+right)//2\n maxnum=0\n if(mid<=h):\n maxnum=(1+mid)*mid//2\n else:\n maxnum=(mid+mid-h+2)*(h-1)//2\n tmplen=mid-h+1\n if(tmplen%2==0):\n high=tmplen//2\n maxnum+=(tmplen+2)*high//2\n else:\n high=(tmplen+1)//2\n maxnum+=(tmplen+1)*high//2\n if(maxnum>=n):\n right=mid\n else:\n left=mid+1\nprint(right)\n\t\t\t \t\t \t\t \t\t\t\t\t\t\t\t \t\t\t\t\t\t\t \t \t", "import sys\n\nn,H = map(int,sys.stdin.readline().split())\n\ndef maximum_quantity(k):\n\tif k >= H:\n\t\tc = (k-H) // 2\n\t\treturn H*(c+1) + (c*(c+1))//2 + ((k-c)*(k-c-1))//2\n\telse:\n\t\treturn (k*(k+1)) // 2\n\t\n\nk_inf = 0\nk_sup = n\nwhile (k_sup - k_inf > 1):\n\tk = (k_inf+k_sup) // 2\n\tif (maximum_quantity(k) >= n):\n\t\tk_sup = k\n\telse:\n\t\tk_inf = k\n\t\t\nprint(k_sup)\n", "n, h = map(int, input().split())\r\nl = 1\r\nr = h\r\nwhile l < r:\r\n m = (l + r + 1) // 2\r\n if m * (m + 1) // 2 <= n:\r\n l = m\r\n else:\r\n r = m - 1\r\nans = l\r\nn -= l * (l + 1) // 2\r\nif n > 0:\r\n ans += 1\r\n n -= l\r\nif n > 0:\r\n l += 1\r\n lb = 0\r\n rb = n // l\r\n while lb < rb:\r\n m = (lb + 1 + rb) // 2\r\n if (2 * l + m - 1) * m < n:\r\n lb = m\r\n else:\r\n rb = m - 1\r\n ans += lb * 2\r\n n -= (2 * l + lb - 1) * lb\r\n if n > l + lb:\r\n ans += 2\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "# a simple parser for python. use get_number() and get_word() to read\r\ndef parser():\r\n while 1:\r\n data = list(input().split(' '))\r\n for number in data:\r\n if len(number) > 0:\r\n yield(number) \r\n\r\ninput_parser = parser()\r\n\r\ndef get_word():\r\n global input_parser\r\n return next(input_parser)\r\n\r\ndef get_number():\r\n data = get_word()\r\n try:\r\n return int(data)\r\n except ValueError:\r\n return float(data)\r\n\r\n\r\nif __name__==\"__main__\":\r\n N=get_number()\r\n H=get_number()\r\n if (1+H)*H//2<N:\r\n L=H-1\r\n R=100000000000000000000000000\r\n while L+1<R:\r\n mid=(L+R)//2\r\n if (1+mid)*mid//2+(H+mid-1)*(mid-1-H+1)//2>=N:\r\n R=mid\r\n else:\r\n L=mid\r\n #print(R)\r\n ans=R+R-H\r\n L=H-1\r\n R=100000000000000000000000000\r\n while L+1<R:\r\n mid=(L+R)//2\r\n if (1+mid)*mid//2+(H+mid)*(mid-H+1)//2>=N:\r\n R=mid\r\n else:\r\n L=mid\r\n #print(R)\r\n if R+R-H+1<ans:\r\n ans=R+R-H+1\r\n else:\r\n L=0\r\n R=H\r\n while L+1<R:\r\n mid=(L+R)//2\r\n if (1+mid)*mid//2>=N:\r\n R=mid\r\n else:\r\n L=mid\r\n ans=R;\r\n print(ans)\r\n \r\n\r\n\r\n \r\n", "n,h=list(map(int,input().split()))\ndef f(m):return ((h+m-1)*max(m-h,0)+m*(m+1))//2\na,b=1,n\nwhile 1:\n m=(a+b)//2\n t=f(m)\n if t>n:b=m\n elif f(m+1)<=n:a=m\n else:break\nl=max(m-h,0)+m\nl,t=l+(n-t)//m,t+((n-t)//m)*m\nif t<n:l += 1\nprint(l)", "n, h = map(int, input().split())\r\n\r\ndef check(x):\r\n k = min(x, h)\r\n return x * x - (k * (k - 1) >> 1) >= n\r\n\r\ndef get(x):\r\n global n\r\n k = min(x, h)\r\n q = x * x - (k * (k - 1) >> 1)\r\n rest = 2 * x - k\r\n n -= q\r\n return rest + (n + x - 1) // x\r\n\r\nl, r = 0, int(1e18)\r\nwhile r - l > 1:\r\n m = (l + r) >> 1\r\n if check(m):\r\n r = m\r\n else:\r\n l = m\r\n\r\nprint(get(r))", "# a simple parser for python. use get_number() and get_word() to read\r\ndef parser():\r\n while 1:\r\n data = list(input().split(' '))\r\n for number in data:\r\n if len(number) > 0:\r\n yield(number) \r\n\r\ninput_parser = parser()\r\n\r\ndef get_word():\r\n global input_parser\r\n return next(input_parser)\r\n\r\ndef get_number():\r\n data = get_word()\r\n try:\r\n return int(data)\r\n except ValueError:\r\n return float(data)\r\n\r\nfrom math import *\r\n\r\ndef check(k, n, H, maxx):\r\n h = min(k, H)\r\n h = min(h, maxx)\r\n summa = 0\r\n if h%2==k%2:\r\n c = int((h+k)//2)\r\n summa += int((c*(c+1))//2)\r\n summa+=int((c-h)*h+(c-h)*(c-h-1)//2)\r\n else:\r\n c = int((h+k-1)//2)\r\n summa+=int(c*(c+1)//2)\r\n summa+=int((c+1-h)*h+(c-h)*(c-h+1)//2)\r\n if summa>=n:\r\n return True\r\n else:\r\n return False\r\n\r\ndef find(n, H, maxx):\r\n l = 0\r\n r = 1000000000000000\r\n while r-l>1:\r\n current = int((l+r)//2)\r\n if check(current, n, H, maxx):\r\n r = current\r\n else:\r\n l = current\r\n return r\r\n\r\n\r\nn = int(get_number())\r\nH = int(get_number())\r\nmaxx = int((int(sqrt(8*n+1))+1)//2)\r\nprint(find(n, H, maxx))" ]

[ "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\ndef rbinsearch(a, n,x):\r\n l = -1\r\n r = n - 1\r\n while r - l > 1:\r\n d = (l + r) // 2\r\n if x <= a[d]:\r\n r = d\r\n else:\r\n l = d\r\n return r\r\nfor i in b:\r\n ans=rbinsearch(a,n,i)\r\n if ans==0:\r\n t=0\r\n else:\r\n t=a[ans-1]\r\n print(ans+1,i-t)", "class Solution:\n def findExactAddress(self, houseNumsList: list, roomNumsList: list) -> list:\n houseNums = len(houseNumsList)\n roomTotalIndex = [0] * houseNums\n exactAddress = [[0 for i in range(2)] for j in range(len(roomNumsList))]\n for i in range(houseNums):\n if i == 0:\n roomTotalIndex[i] = houseNumsList[i]\n else:\n roomTotalIndex[i] = roomTotalIndex[i-1] + houseNumsList[i]\n for j in range(len(roomNumsList)):\n exactAddress[j][0] = self.binaryFind(roomNumsList[j], roomTotalIndex)\n if exactAddress[j][0]-1 == 0:\n exactAddress[j][1] = roomNumsList[j] - 0\n else:\n exactAddress[j][1] = roomNumsList[j] - roomTotalIndex[exactAddress[j][0]-2]\n return exactAddress\n \n def binaryFind(self, roomNum: int, roomTotalIndex: list) -> int:\n res = 0\n right_index = len(roomTotalIndex)-1\n left_index = 0\n while right_index > left_index:\n middle_index = int((right_index + left_index)/2)\n if roomTotalIndex[middle_index] == roomNum:\n return (middle_index+1)\n break\n elif roomTotalIndex[middle_index] < roomNum:\n left_index = middle_index + 1\n else:\n right_index = middle_index\n res = left_index\n return (res+1)\n\n\ns = Solution()\nline1_input = input()\nline2_input = input()\nline3_input = input()\nhouseNumsList = [int(i) for i in line2_input.split(\" \")]\nroomNumsList = [int(i) for i in line3_input.split(\" \")]\nres = s.findExactAddress(houseNumsList, roomNumsList)\nfor i in range(len(res)):\n print(\" \".join(str(j) for j in res[i]))\n\t \t\t\t\t\t \t\t \t\t \t \t \t \t \t", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nlb=0\r\nub=a[0]\r\ndorm=1\r\nfor z in b:\r\n while z>ub:\r\n lb=ub\r\n ub+=a[dorm]\r\n dorm+=1\r\n print(dorm,z-lb)", "n,m=map(int,input().split())\r\no=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nf=[0]*(n+1)\r\nfor i in range(1,len(f)):\r\n f[i]=f[i-1]+o[i-1]\r\nfor i in p:\r\n v = i\r\n r=n\r\n l=0\r\n while r-l>1:\r\n m=(r+l)//2\r\n if v>f[m]: l=m\r\n else: r=m\r\n ans=l+1\r\n print(ans,i-f[ans-1])", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nfor i in range(1, n):\r\n a[i] += a[i-1]\r\n\r\nj = 0\r\nfor i in range(m):\r\n while b[i] > a[j]:\r\n j += 1\r\n if j == 0:\r\n print(1, b[i])\r\n else:\r\n print(j+1, b[i] - a[j-1])", "\n\n\n\ndef solve(n,m,a,b):\n cum =[]*len(a)\n j=0\n dor=0\n room=0\n for i in range(len(a)):\n cum.append(a[i])\n for i in range(1,len(a)):\n cum[i]= cum[i]+cum[i-1]\n\n for i in range(len(b)):\n while b[i]>cum[j]:\n j=j+1\n dor = j+1\n if j==0:\n room=b[i]\n else:\n room = b[i] -cum[j-1] \n print(dor,room)\n \n \n\n\nn, m =input().split()\na =[int(_) for _ in input().split()]\nb =[int(_) for _ in input().split()]\n\"\"\"print(n,m)\nprint(a)\nprint(b)\"\"\"\nsolve(n,m,a,b)\n\n\n ", "from itertools import accumulate\r\nfrom bisect import bisect_left\r\n\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na = list(accumulate(a))\r\n\r\nfor i in b:\r\n num = bisect_left(a,i)+1\r\n if num == 1:\r\n print(num,i)\r\n else:\r\n print(num,i-a[num-2])", "from itertools import accumulate as ass\r\n\r\n\r\ndef bina(a,b,n):\r\n l,r=0,n-1\r\n p=l\r\n while l<=r:\r\n m=l+(r-l)//2\r\n if b<=a[m]:\r\n p=m\r\n r=m-1\r\n else:\r\n l=m+1\r\n return p \r\n\r\n\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\na2=list(ass(a))\r\nfor i in b:\r\n x=bina(a2,i,n)\r\n if x==0:\r\n print(x+1,i)\r\n else:\r\n print(x+1,i-a2[x-1])\r\n", "from bisect import bisect_left\nfrom itertools import accumulate\n\ninput()\na = list(map(int, input().split()))\nacc = list(accumulate(a, initial=0))\nfor n in map(int, input().split()):\n room = bisect_left(acc, n)\n print(room, n - acc[room - 1])\n", "n,m=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nr=list(map(int,input().split()))\r\ns=0\r\nj=0\r\nfor i in r:\r\n\twhile i>s:\r\n\t\ts=s+d[j]\r\n\t\tj+=1\r\n\tprint(\"%d %d\"%(j,i-(s-d[j-1])))\r\n", "import bisect\nt = 1\n\nfor _ in range(t):\n n,m = map(int,input().split())\n arr = list(map(int,input().split()))\n res = list(map(int,input().split()))\n \n for i in range(n):\n if i == 0:\n continue\n arr[i] += arr[i-1]\n \n \n r= []\n for ele in res:\n z = bisect.bisect_left(arr,ele)\n if z == 0:\n r.append([z+1,ele])\n else:\n r.append([z+1,ele-arr[z-1]])\n \n for a,b in r:\n print(f'{a} {b}')", "n, m = map(int, input().split())\r\nrooms = list(map(int, input().split()))\r\nletters = list(map(int, input().split()))\r\n\r\ncumulative_rooms = [0] * (n+1)\r\n\r\nfor i in range(1, n+1):\r\n cumulative_rooms[i] = cumulative_rooms[i-1] + rooms[i-1]\r\nfor letter in letters:\r\n left, right = 0, n\r\n while left < right:\r\n mid = (left + right + 1) // 2\r\n if cumulative_rooms[mid] >= letter:\r\n right = mid - 1\r\n else:\r\n left = mid\r\n\r\n dormitory = left + 1\r\n room = letter - cumulative_rooms[dormitory-1]\r\n print(dormitory, room)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = a.copy()\r\nfor i in range(1, n):\r\n c[i] += c[i-1]\r\nfor i in range(m):\r\n lo = 0\r\n hi = n-1\r\n mid = (lo + hi) // 2\r\n md = 0\r\n while lo <= hi:\r\n mid = (lo + hi) // 2\r\n if c[mid] < b[i]:\r\n lo = mid + 1\r\n else:\r\n md = mid\r\n hi = mid - 1\r\n if md > 0:\r\n print(md+1, b[i] - c[md-1])\r\n else:\r\n print(1, b[i])", "from bisect import bisect_left\r\ndef BinarySearch(a, x):\r\n i = bisect_left(a, x)\r\n if i:\r\n return (i - 1)\r\n else:\r\n return -1\r\nn, m = [int(x) for x in input().split()]\r\ndorms = [int(x) for x in input().split()]\r\nmails = [int(x) for x in input().split()]\r\npsum = [0]\r\nsum = 0\r\nfor x in range(n):\r\n sum += dorms[x]\r\n psum.append(sum)\r\nfor x in range(m):\r\n res = BinarySearch(psum, mails[x])\r\n print(str(res+1) + \" \" + str(mails[x] - psum[res]))", "n, m = map(int, input().split())\r\nrooms_per_dorm = list(map(int, input().split()))\r\nletters = list(map(int, input().split()))\r\n\r\ndormitory_number = 1\r\nroom_number = 0\r\n\r\nfor letter in letters:\r\n while letter > rooms_per_dorm[dormitory_number - 1] + room_number:\r\n room_number += rooms_per_dorm[dormitory_number - 1]\r\n dormitory_number += 1\r\n\r\n print(dormitory_number, letter - room_number)\r\n", "n,m=map(int,input().split())\na=*map(int,input().split()),\ni=c=d=0\nfor x in map(int,input().split()):\n while c+a[i]<x:c+=a[i];d+=1;i+=1\n print(d+1,x-c)\n \t \t \t\t\t\t\t\t \t \t\t \t\t \t", "# dem so tang, moi tang in so phong\r\nn, m=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\ns=j=0\r\nfor i in b:\r\n # Viet if la sai\r\n while i>s:\r\n s+=a[j]\r\n j+=1\r\n print(j, i-(s-a[j-1]))", "n,m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nnums = list(map(int, input().split()))\r\nb4 = 0\r\npt = 0\r\n\r\nfor i in nums:\r\n while(b4 + arr[pt] < i):\r\n b4 += arr[pt]\r\n pt += 1\r\n print(pt+1,i - b4)", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef solve():\r\n n, l = get_ints()\r\n rooms = get_list()\r\n letters = get_list()\r\n \r\n rooms = [0] + rooms\r\n \r\n for i in range(1, n + 1):\r\n rooms[i] += rooms[i - 1]\r\n \r\n for room in letters:\r\n index = bisect_left(rooms, room)\r\n print(index, room - rooms[index - 1])\r\n \r\n \r\n#main code\r\nif __name__ == \"__main__\":\r\n \r\n solve()", "n, m = map(int, input().split())\r\ndormitories = list(map(int, input().split()))\r\n\r\nfor i in range(1, len(dormitories)):\r\n dormitories[i] += dormitories[i-1]\r\n\r\nletters = list(map(int, input().split()))\r\n\r\n\r\nfor target in letters:\r\n l, r = -1, len(dormitories)\r\n\r\n while r > l + 1:\r\n m = l + (r-l)//2\r\n\r\n if dormitories[m] < target:\r\n l = m\r\n\r\n else:\r\n r = m\r\n\r\n\r\n room = target - dormitories[r-1] if r > 0 else target\r\n\r\n print(r + 1, room)\r\n\r\n\r\n", "\r\ndef getint():\r\n return [int(i) for i in input().split()]\r\ndef get():\r\n return int(input())\r\ndef getstr():\r\n return [i for i in input().split()]\r\ndef S():\r\n for test in range(int(input())):\r\n solve()\r\nimport math\r\nimport itertools as it\r\nimport bisect\r\nimport time\r\nimport collections as ct\r\n\r\ndef lower_bound(a,x):\r\n l=-1\r\n r=len(a)\r\n while l+1!=r:\r\n mid=l+r>>1\r\n if a[mid]<x:\r\n l=mid\r\n else:\r\n r=mid\r\n return r\r\ndef upper_bound(a,x):\r\n l=-1\r\n r=len(a)\r\n while l+1!=r:\r\n mid=l+r>>1\r\n if a[mid]<=x:\r\n l=mid\r\n else:\r\n r=mid\r\n return r\r\ndef solve():\r\n n=get()\r\n\r\n\r\n\r\nn,m=getint()\r\na=[0]+getint()\r\nb=getint()\r\nc=a.copy()\r\nfor i in range(1,n+1):\r\n c[i]=c[i-1]+a[i]\r\n# print(c)\r\nfor i in range(m):\r\n x=b[i]\r\n l=1\r\n r=n\r\n while l<r:\r\n mid=l+r>>1\r\n if c[mid]<x:\r\n l=mid+1\r\n else:\r\n r=mid\r\n print(l,x-c[l-1])", "import math \n\ndef main(): \n n, m = map(int, input().split()) \n lst = list(map(int, input().split())) \n rooms = list(map(int, input().split())) \n for i in range(1, n): \n lst[i] += lst[i-1] \n for room in rooms: \n if room <= lst[0]: \n print(f'1 {room}') \n continue \n x, y = 0, n \n while y-x>1: \n mid = (x+y)//2 \n if lst[mid] < room: \n x = mid \n else: \n y = mid \n dorm_num, room_num = x+2, room-lst[x] \n print(dorm_num, room_num) \nif __name__ == '__main__': \n t = 1\n for _ in range(t): \n main() \n\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nj = 0\r\nc = 0\r\nd = 0\r\nfor i in range(n):\r\n c += a[i]\r\n while j < m and c >= b[j]: # prvo j < m da ne uzme indeks izvan range-a b[j]\r\n print(i + 1, (b[j]-d))\r\n j += 1\r\n d += a[i]\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nf=[0]*(len(a)+1)\r\nfor i in range(1,len(a)+1): f[i]=f[i-1]+a[i-1]\r\nfor x in b:\r\n l=-1\r\n r=len(f)\r\n while r-l>1:\r\n m=(l+r)//2\r\n if f[m]<x: l=m\r\n else: r=m\r\n print(r, x-f[l])", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ns=[0]*(n+1)\r\nfor i in range(1,n+1):s[i]=s[i-1]+a[i-1]\r\nfor x in b:\r\n l=0;r=n\r\n while r-l>1:\r\n mid=(r+l)//2\r\n if x>s[mid]:l=mid\r\n else:r=mid\r\n print(l+1,x-s[l])\r\n", "n,m=map(int,input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int,input().split()))\r\ns=0\r\ni=1\r\nfor x in b:\r\n\twhile s+a[i-1]<x:\r\n\t\ts+=a[i-1]\r\n\t\ti+=1\r\n\tprint(i,x-s)\r\n \t\t\t\t \t\t\t\t\t\t\t \t \t\t\t\t\t \t", "import os\r\nline_number = 1\r\ncurrent_working_dir = os.getcwd()\r\nmy_local_machine = current_working_dir.find('rachel')\r\n# print(my_local_machine)\r\n\r\ndef myinput():\r\n global line_number, lines, my_local_machine\r\n if line_number == 1:\r\n lines = lines.split('\\n')\r\n\r\n # print(len(lines))\r\n if my_local_machine > 0:\r\n line = lines[line_number]\r\n else:\r\n line = input()\r\n \r\n line_number += 1\r\n return(line)\r\n\r\nlines = '''\r\n3 6\r\n10 15 12\r\n1 9 12 23 26 37\r\n\r\n'''\r\n\r\nn, m = map(int, myinput().split()) \r\na = list(map(int, myinput().split())) \r\nb = list(map(int, myinput().split())) \r\n\r\nnum = 0 \r\ndorm = 1 \r\n\r\nfor i in b: \r\n while num + a[dorm-1] < i: \r\n num += a[dorm-1] \r\n dorm += 1 \r\n \r\n print(dorm, i - num)", "import bisect\r\ndef solve(n, m, a, b):\r\n s = [0]\r\n\r\n for i in range(n):\r\n s.append(s[i] + a[i])\r\n\r\n for bi in b:\r\n idx = bisect.bisect_left(s, bi)\r\n if idx > 0 and idx <= n:\r\n f = idx\r\n k = bi - s[idx - 1]\r\n print(f,k)\r\n\r\n\r\n\r\n\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nsolve(n, m, a, b)\r\n\r\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nans=[]\r\n\r\na.insert(0,0)\r\nfor i in range(1,n+1):\r\n a[i]=a[i-1]+a[i]\r\n\r\n\r\nj=1\r\nfor i in b:\r\n while j<=n:\r\n if i<=a[j]:\r\n print(j,i-a[j-1])\r\n break\r\n j+=1\r\n", "n,m = map(int,input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\ndecreaseBy = 0\r\ndormitory=0\r\ni=0\r\nwhile i < m:\r\n current = b[i]-decreaseBy\r\n dorm = a[dormitory]\r\n if current <= dorm:\r\n print(dormitory+1,current)\r\n i+=1\r\n else:\r\n decreaseBy += dorm\r\n dormitory+=1", "num_dorms, num_letters = map(int, input().split())\ndorms = list(map(int, input().split()))\nind = counter1 = counter2 = 0\nfor val in list(map(int, input().split())):\n while counter1 + dorms[ind] < val:\n counter1 += dorms[ind]\n counter2 += 1\n ind += 1\n print(counter2 + 1, val - counter1)\n\n\t\t\t \t\t\t\t\t\t\t \t\t \t\t \t \t\t\t\t\t\t\t \t", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nc = [0]*n\r\nfor i in range(1, n):\r\n c[i] = c[i-1] + a[i-1]\r\n\r\nfor i in range(m):\r\n j1 = 0\r\n j2 = n - 1\r\n while j2 > j1:\r\n j = (j2 + j1 + 1) // 2\r\n if c[j] < b[i]:\r\n j1 = j\r\n else:\r\n j2 = j - 1\r\n print(j1 + 1, b[i] - c[j1])\r\n", "def solve(n):\n a = tuple(int(i) for i in input().split())\n b = tuple(int(i) for i in input().split())\n compte = 0\n total = 0\n for i in b:\n nb = i\n lst = a[compte]\n while (nb-total > lst):\n total += lst\n compte += 1\n lst = a[compte]\n print(compte+1, nb-total)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nn,m = (int(i) for i in input().split())\nsolve(n)\n", "############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\nn, m = invr()\r\n\r\ndormitories = [0] + inlt()\r\nfor i in range(1, n+1):\r\n dormitories[i] = dormitories[i-1] + dormitories[i]\r\n\r\nenvelopes = inlt()\r\n\r\nfor envelope in envelopes:\r\n left, right = -1, n + 1\r\n\r\n while right > left + 1:\r\n mid = left + (right-left)//2\r\n if dormitories[mid] < envelope:\r\n left = mid\r\n else:\r\n right = mid\r\n\r\n print(right, envelope - dormitories[right - 1])\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\npf=[0]\r\nfor i in range(n):\r\n pf.append(a[i]+pf[-1])\r\nfor k in b:\r\n l=0\r\n r=n\r\n while r-l>1:\r\n d=(l+r)//2\r\n if pf[d]>=k:\r\n r=d\r\n else:\r\n l=d\r\n print(r,k-pf[l])", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nassert len(a) == n\r\nb = [int(x) for x in input().split()]\r\nassert len(b) == m\r\n \r\ncur_building_room_start = 1\r\ncur_building = 1\r\nbuilding_iter = iter(a)\r\ncur_building_room_num = next(building_iter)\r\nfor bj in b:\r\n while bj >= cur_building_room_start + cur_building_room_num:\r\n cur_building += 1\r\n cur_building_room_start += cur_building_room_num\r\n cur_building_room_num = next(building_iter)\r\n print(cur_building, bj - cur_building_room_start + 1)\r\n \r\n \r\n\r\n ", "def binary(a,n,x):\r\n lo,hi = 0,n-1\r\n\r\n while lo<=hi:\r\n mid = lo+(hi-lo)//2\r\n if a[mid]>=x:\r\n hi = mid-1\r\n else:\r\n lo = mid+1\r\n return lo+1\r\n\r\n\r\nn,m = map(int,input().split())\r\na = input().split()\r\ns = 0\r\nfor i in range(len(a)):\r\n s+=int(a[i])\r\n a[i]=s\r\na = tuple(a)\r\nb = tuple(map(int,input().split()))\r\n\r\nfor i in b:\r\n d = binary(a,n,i)\r\n idx = 0 if d-2<0 else a[d-2]\r\n print(f'{d} {i-idx}')", "n,m = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nbrr = list(map(int,input().split()))\r\n\r\ncnt = 0\r\ni = 1\r\nfor j in brr:\r\n\twhile(cnt+arr[i-1] <j):\r\n\t\tcnt+=arr[i-1]\r\n\t\ti+=1\r\n\tprint(i,j-cnt)", "import itertools, math, functools, operator, collections, heapq\r\nfrom sys import stdin; inp = stdin.readline\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QIA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return list(input())\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ''.join(map(str, l))\r\n\r\ndef main():\r\n n, m = IA()\r\n a = IA()\r\n b = IA()\r\n acc = list(itertools.accumulate(a))\r\n i = 0 \r\n curr_lvl = prev_lvl = acc[i]\r\n\r\n for d in b:\r\n while curr_lvl < d:\r\n prev_lvl = curr_lvl\r\n i += 1\r\n curr_lvl = acc[i]\r\n if i == 0:\r\n num = d \r\n else:\r\n num = d-prev_lvl\r\n print(i+1, num, sep=' ')\r\n\r\nif __name__ == '__main__':\r\n main()", "# run this source code idiot\ninp = input().split(\" \")\ndorms = int(inp[0])\nnletters = int(inp[1])\n\nroomRanges = []\n\ninp = input().split(\" \")\npos = 1\nfor dormId in range(dorms):\n nRooms = int(inp[dormId])\n roomRanges.append((pos,pos+nRooms-1,dormId+1))\n pos += nRooms\n\nletters = []\ninp = input().split(\" \")\nfor i in range(nletters):\n letters.append(int(inp[i]))\nletters.sort()\n\nrangeId = 0\nfor room in letters:\n while True:\n range = roomRanges[rangeId]\n if room >= range[0] and room <= range[1]:\n print(range[2],room-range[0]+1)\n break\n else:\n rangeId+=1\n\t\t \t\t \t\t \t \t \t \t \t\t \t \t", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nci, cl, cs = 0, 0, a[0]\r\ni = 0\r\nwhile i < m:\r\n if b[i] <= cs: \r\n print(ci+1, b[i]-cl)\r\n i += 1\r\n else:\r\n ci += 1\r\n cl = cs\r\n cs += a[ci]", "from bisect import bisect_left\r\nfrom itertools import accumulate\r\n# n = int(input())\r\n# nq=list(map(int,input().split()))\r\n# arr=list(map(int,input().split()))\r\nnm = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\ndorm_no = list(map(int,input().split()))\r\nprefix = list(accumulate([0]+arr+[0]))\r\nfor dorm in dorm_no:\r\n ans = bisect_left(prefix , dorm)\r\n print(ans , dorm - prefix[ans-1])\r\n", "\nfrom bisect import bisect_left\n# bisect(L,x) retourne i minimal tel que L[i]>x (len(L) si un tel i n'existe pas)\n# bisect_left(L,x) retourne i maximal tel que L[i-1]<x (0 si un tel i n'existe pas)\n\ndef solve(n, m, a, b):\n # cumul de a dans A\n A = [0]+a\n for i in range(n):\n A[i+1] += A[i]\n for x in b:\n f = bisect_left(A,x)\n print(f, x-A[f-1])\n\nn, m = [int(_) for _ in input().split()]\na = [int(_) for _ in input().split()]\nb = [int(_) for _ in input().split()]\nsolve(n, m, a, b)\n \n \n", "def get_dorm(x):\r\n l = 0\r\n h = len(room)\r\n\r\n while (h - l > 1):\r\n m = (l + h) // 2\r\n\r\n if room[m] >= x:\r\n h = m\r\n else:\r\n l = m\r\n # print(f\"h={h}, for x={x}\")\r\n return h\r\n\r\n\r\nn, q = map(int, input().split())\r\n\r\nroom = input().split()\r\nquery = input().split()\r\n\r\nfor i in range(n):\r\n room[i] = int(room[i])\r\n if i:\r\n room[i] = room[i] + room[i - 1]\r\nroom.insert(0, 0)\r\nfor i in range(q):\r\n query[i] = int(query[i])\r\n\r\nfor x in query:\r\n dorm = get_dorm(x)\r\n print(dorm, x - room[dorm - 1])\r\n", "n,m=map(int,input().split())\nrooms=list(map(int,input().split()))\nnums=list(map(int,input().split()))\n\nls=[0]*(n+1)\nfor i in range(n):\n ls[i+1]=ls[i]+rooms[i]\n\ndef serch(ls,num):\n l=0\n r=len(ls)-1\n while l<=r:\n mid=(l+r)//2\n if ls[mid]<num:\n l=mid+1\n elif ls[mid]>num:\n r=mid-1\n else:\n return mid\n return l\n \nfor num in nums:\n f=serch(ls,num)\n if ls[f]>=num:\n print(f,num-ls[f-1])\n else:\n print(f+1,num-ls[f])\n\t \t \t\t\t \t \t \t \t\t\t\t \t", "# https://codeforces.com/contest/978\n\nimport sys\nimport bisect\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nps = [0] * (n + 1)\nfor i in range(n):\n ps[i + 1] = ps[i] + a[i]\n\nfor x in b:\n f = bisect.bisect_left(ps, x)\n k = x - ps[f - 1]\n print(f, k)\n", "def solve():\r\n n, m = map(int, input().split())\r\n l = list(map(int, input().split()))\r\n l.insert(0, 0)\r\n s = 0\r\n j = 1\r\n for i in map(int, input().split()):\r\n while i > s + l[j]:\r\n s += l[j]\r\n j += 1\r\n print(j, i - s)\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "from bisect import bisect_left\nfrom itertools import accumulate\ndef get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn, m = gets(int)\na = [0] + [*accumulate(gets(int))]\nfor b in gets(int):\n i = bisect_left(a, b)\n print(i, b - a[i - 1])\n", "def check(n, k):\r\n l, r = 0, n\r\n while l < r:\r\n x = l + (r - l) // 2\r\n if k >= a1[x][0] and k <= a1[x][1]:\r\n return x \r\n elif k > a1[x][1]:\r\n l = x + 1 \r\n else:\r\n r = x \r\n \r\n\r\nn, k = map(int, input().split())\r\nd = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na1 = [[1, d[0]]]\r\nfor i in range(1, n):\r\n x = a1[i - 1][-1]\r\n a1.append([x + 1, d[i] + x])\r\n\r\nfor i in a:\r\n x = check(n, i)\r\n print(x + 1, i - a1[x][0] + 1)", "n , m = map (int , input().split(' ')) \r\narr = list (map (int, input().split(' ')) )\r\nletters = list (map (int, input().split(' ')) )\r\npref = [0 for i in range (n+1)]\r\nfor i in range (1, n+1 ):\r\n pref[i] = pref[i-1] + arr[i-1] \r\nind = 1 \r\nfor i in range (m):\r\n letter = letters[i] \r\n while (ind <n and pref[ind] < letter ) :\r\n ind +=1 \r\n ans = str(ind) + ' ' + str( letter-pref[ind-1])\r\n print (ans)\r\n \r\n", "def bisect(pref,num,st,en):\r\n le = st\r\n ri = en\r\n while le <= ri:\r\n mid = (le + ri) // 2\r\n if pref[mid] == num:\r\n return mid\r\n elif pref[mid] < num:\r\n le = mid + 1\r\n else:\r\n ri = mid - 1\r\n return le\r\n\r\nn,m=map(int,input().split())\r\ndorm = list(map(int, input().split()))\r\nlet = list(map(int, input().split()))\r\nans = []\r\npref = [-1]*n\r\npref[0] = dorm[0]\r\nfor i in range(1, n):\r\n pref[i]=pref[i-1]+dorm[i]\r\n\r\nfor i in let:\r\n re = bisect(pref, i, 0, n - 1)\r\n if re!=0:\r\n ans.append([re+1, i - pref[re - 1]])\r\n else:\r\n ans.append([re+1,i])\r\n \r\n\r\nfor k in ans:\r\n print(*k)\r\n ", "def binarySearch(arr, x):\r\n\tl, r = 0, len(arr)-1\r\n\r\n\twhile(l<=r):\r\n\t\tmid = (r-l)//2 + l\r\n\t\tif(arr[mid]==x):\r\n\t\t\treturn mid\r\n\t\telif( arr[mid] > x ):\r\n\t\t\tr = mid - 1\r\n\t\telse:\r\n\t\t\tl = mid + 1\r\n\r\n\treturn l\r\n\r\nn,m = list(map(int, input().split()))\r\n\r\na = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\n\r\nll = list(a)\r\n\r\ncurrent = ll[0]\r\nfor i in range(1, n):\r\n\tcurrent += ll[i]\r\n\tll[i] = current\r\n\r\nfor i in range(m):\r\n\td = binarySearch(ll, l[i])\r\n\tr = l[i] - (ll[d]-a[d])\t\r\n\tprint(d+1, r)\r\n", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ni = 0\r\nj = 0\r\ntmp = a[0]\r\nwhile(i != m):\r\n if b[i] > tmp:\r\n j += 1\r\n tmp += a[j]\r\n else:\r\n print(j + 1, a[j] - (tmp - b[i]))\r\n i += 1", "n,m=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nj,s=0,a[0]\r\nfor i in range(len(b)):\r\n while b[i]>s:\r\n j+=1\r\n s+=a[j]\r\n if j>0:\r\n print(j+1,b[i]-(s-a[j]))\r\n else:\r\n print(j+1,b[i])", "a,b=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nf=0\r\nj=0\r\nfor i in range(b):\r\n while j<d[i]:\r\n j+=c[f]\r\n f+=1\r\n print(f,d[i]-j+c[f-1])# ответ", "n, m = map(int, input().split())\r\nrooms = list(map(int, input().split()))\r\nletters = list(map(int, input().split()))\r\n\r\nlist = [0] * (n+1)\r\n\r\nfor i in range(1, n+1):\r\n list[i] = list[i-1] + rooms[i-1]\r\nfor letter in letters:\r\n left, right = 0, n\r\n while left < right:\r\n mid = (left + right + 1) // 2\r\n if list[mid] >= letter:\r\n right = mid - 1\r\n else:\r\n left = mid\r\n residance = left + 1\r\n room = letter - list[left]\r\n print(residance, room)\r\n ", "import sys\r\ninput = sys.stdin.readline\r\ndef ilist():\r\n return list(map(int,input().split()))\r\ndef iint():\r\n return map(int,input().split()) \r\nimport bisect\r\nn,m = iint() \r\na = ilist()\r\nb = ilist() \r\ni = 0\r\nj = 0\r\nsubtracted = 0\r\nwhile j<m:\r\n # print(i,j)\r\n if a[i]>=b[j]-subtracted:\r\n print(i+1,b[j]-subtracted)\r\n j+=1\r\n else:\r\n subtracted+=a[i] \r\n i+=1 \r\n\r\n\r\n", "n, m = (int(x) for x in input().split(\" \"))\r\na = [int(x) for x in input().split(\" \")]\r\nb = [int(x) for x in input().split(\" \")]\r\naa = [1]\r\ncur = 1\r\nfor i in range(n):\r\n cur += a[i]\r\n aa.append(cur)\r\nfor elem in b:\r\n l = -1\r\n r = n\r\n mid = (l + r) // 2\r\n while r > l + 1:\r\n mid = (l+r) // 2\r\n if elem > aa[mid]:\r\n l = mid\r\n elif elem < aa[mid]:\r\n r = mid\r\n else:\r\n print(f\"{mid+1} {elem - aa[mid] + 1}\")\r\n break\r\n else:\r\n print(f\"{l + 1} {elem - aa[l]+ 1}\")\r\n", "n, m = map(int, input().split())\r\ndorm = list(map(int, input().split()))\r\nletters = list(map(int, input().split()))\r\nrooms = [dorm[0]]\r\nfor i in range(1, len(dorm)):\r\n rooms.append(rooms[-1] + dorm[i])\r\n \r\nj, prev = 0, 0\r\nfor letter in letters:\r\n while rooms[j] < letter:\r\n j += 1\r\n if j == 0: prev = 0\r\n else: prev = rooms[j-1] \r\n \r\n print(j+1, abs(letter - prev))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ncount = 0\r\nk = 0\r\n\r\nnums = []\r\n\r\nfor i in b:\r\n while (i > count + a[k]):\r\n count += a[k]\r\n k += 1\r\n \r\n nums += [\"%d %d\" % (k + 1, i - count)]\r\n\r\nprint(\"\\n\".join(nums))", "n, m = map(int, input().split())\r\na = input().split()\r\nb = input().split()\r\na = list(map(int, a))\r\nb = list(map(int, b))\r\nps = [0]\r\nfor i in a:\r\n ps.append(i + ps[-1])\r\nl = 0\r\nfor i in b:\r\n l, r = 0, len(ps)\r\n while l + 1 < r:\r\n mid = (l + r) // 2\r\n if ps[mid] >= i: r = mid\r\n else: l = mid\r\n if r == len(ps): ps.append(sum(ps))\r\n print(r, i - ps[l])\r\n", "n,m = list(map(int,input().split()))\r\narr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\ni = j = 0\r\nsumm = 0\r\ntumm = 0\r\nwhile i < n and j < m:\r\n summ += arr1[i]\r\n while j < m and summ >= arr2[j]:\r\n print(i + 1,arr2[j] - tumm)\r\n j += 1\r\n tumm += arr1[i]\r\n i += 1", "n,m = map(int,input().split())\r\ndorm = list(map(int,input().split()))\r\nletters = list(map(int,input().split()))\r\nptr = 0\r\ndif = 0\r\nfor curr in letters:\r\n\twhile(curr>dif+dorm[ptr]):\r\n\t\tdif+=dorm[ptr]\r\n\t\tptr +=1\r\n\tprint(ptr + 1, curr - dif)", "n,m = map(int, input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\np,c,i = 0,a[0],1\r\nfor e in b:\r\n while c<e and i<n:\r\n p = c\r\n c+=a[i]\r\n i+=1\r\n print(i,e-p)", "import bisect\r\ndef solve(n,m,a,b):\r\n d=[0]\r\n for i in range(n):\r\n d.append(d[-1]+a[i])\r\n for i in b:\r\n inf=0\r\n sup=n\r\n while sup-inf>1:\r\n med=(inf+sup)//2\r\n if i>d[med]:\r\n inf=med\r\n else:\r\n sup=med\r\n dorm=sup\r\n\r\n print(dorm,i-d[dorm-1])\r\n\r\nn,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nsolve(n,m,a,b)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import bisect\r\n\r\ndef lower_bound(arr, target):\r\n return bisect.bisect_left(arr, target)\r\n\r\ndef upper_bound(arr, target):\r\n return bisect.bisect_right(arr, target)\r\n\r\n# Example usage:\r\nstringa=input().split()\r\nsorted_list = []\r\nsorted_list.append(0)\r\nstringa = input().split()\r\nlista = [int(x) for x in stringa]\r\nfor i in lista:\r\n sorted_list.append(i)\r\nfor i in range(1, len(sorted_list)):\r\n sorted_list[i] = sorted_list[i - 1] + sorted_list[i]\r\n\r\n# print(sorted_list)\r\nstringa = input().split()\r\nlista = [int(x) for x in stringa]\r\n# print(lista)\r\nfor i in lista:\r\n lower_index = lower_bound(sorted_list, i)\r\n upper_index = upper_bound(sorted_list, i)\r\n\r\n # print(f\"Lower Bound Index of {i}: {lower_index}\")\r\n # print(f\"Upper Bound Index of {i}: {upper_index}\")\r\n if lower_index==upper_index:\r\n print(lower_index,i-sorted_list[lower_index-1])\r\n else:\r\n print(lower_index,sorted_list[lower_index]-sorted_list[lower_index-1])\r\n\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx,s=0,0\r\nfor i in range(m):\r\n\twhile s+a[x]<b[i]:\r\n\t\ts+=a[x]\r\n\t\tx+=1\t\r\n\tprint(x+1,b[i]-s)\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nprefix_sum = [0] * (n+1)\nfor i in range(n):\n prefix_sum[i+1] = prefix_sum[i] + a[i]\n\nfor j in range(m):\n # find smallest i such that prefix_sum[i] >= b[j]\n lo, hi = 1, n\n while lo < hi:\n mid = (lo + hi) // 2\n if prefix_sum[mid] >= b[j]:\n hi = mid\n else:\n lo = mid + 1\n i = lo\n f = i # dormitory number\n k = b[j] - prefix_sum[i-1] # room number in dormitory\n print(f, k)\n", "def letters(n,m,a,b):\r\n l=[0]\r\n for j in range (n):\r\n l.append(l[-1]+a[j])\r\n for t in b:\r\n dmin,dmax=0,n #dmin<dorm<=dmax\r\n while dmax-dmin>1:\r\n d=(dmin+dmax)//2\r\n if t<= l[d]:\r\n dmax=d\r\n else:\r\n dmin=d\r\n dorm=dmax\r\n print(dorm,t-l[dorm-1])\r\n\r\nn, m = [int(_) for _ in input().split()]\r\na= [int(_) for _ in input().split()]\r\nb=[int(_) for _ in input().split()]\r\nletters(n,m,a,b)\r\n\r\n", "def lower_bound(value, list):\r\n l, r = 0, len(list) - 1\r\n ret = 0\r\n while l <= r:\r\n mid = (l + r) >> 1\r\n if list[mid] >= value:\r\n ret = mid\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return ret\r\n\r\nn, m = input().split()\r\n\r\nn = int(n)\r\nm = int(m)\r\n\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\nfor i in range(1, n):\r\n a[i] += a[i - 1]\r\n\r\nfor i in range(m):\r\n index = lower_bound(b[i], a)\r\n if index == 0:\r\n print(f'{1} {b[i]}')\r\n else:\r\n print(f'{index + 1} {b[i] - a[index - 1]}')", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nrooms = [0]\r\nfor x in a:\r\n rooms.append(rooms[-1] + x)\r\n\r\ndormNumber = 1\r\nfor letter in b:\r\n while rooms[dormNumber] < letter:\r\n dormNumber += 1\r\n room_num = letter - rooms[dormNumber - 1]\r\n print(dormNumber, room_num)\r\n", "n = input()\n\nrooms = list(map(int, input().split()))\nletters = list(map(int, input().split()))\n\npref_sum = [0]\nfor i in range(len(rooms)):\n pref_sum.append(rooms[i] + pref_sum[i])\n\nidx = 0\nfor letter in letters:\n while idx < len(rooms) - 1 and letter > pref_sum[idx+1]:\n idx += 1\n print(idx + 1, letter - pref_sum[idx])\n \t \t \t\t \t \t\t \t \t\t\t\t \t\t\t", "dl = list(map(int , input().split()))\nd = list(map(int, input().split()))\nl = list(map(int , input().split()))\nfor i in range(1,len(d)):\n\td[i] = d[i]+d[i-1]\nfor i in range(len(l)):\n\tlow = 0\n\thigh = len(d)-1\n\tflag = False\n\twhile low<=high:\n\t\tmid = (low+high)//2\n\t\tif d[mid]<l[i]:\n\t\t\tlow = mid+1\n\t\telif d[mid]>l[i]:\n\t\t\thigh = mid-1\n\t\telse:\n\t\t\tif mid!=0:\n\t\t\t\tprint(mid+1 , l[i]-d[mid-1])\n\t\t\telse:\n\t\t\t\tprint(mid+1,l[i])\n\t\t\tflag = True\n\t\t\tbreak\n\tif not flag and low!=0:\n\t\tprint(low+1 , l[i]-d[low-1])\n\telif not flag and low==0:\n\t\tprint(low+1,l[i])\n", "n,m = map(int,input().split())\r\nflats = list(map(int,input().split()))\r\nletters = list(map(int,input().split()))\r\ns = [0] * n\r\ns[0] = flats[0]\r\nfor i in range(1,n):\r\n s[i] = s[i-1] + flats[i]\r\nfor i in range(m):\r\n l= -1\r\n r = n - 1\r\n while l < r - 1:\r\n mid = (l + r) // 2\r\n if letters[i] > s[mid]:\r\n l = mid\r\n else:\r\n r = mid\r\n print(r + 1, letters[i] - s[r] + flats[r])", "from bisect import bisect_left\r\n\r\nn, m = map(int, input().split())\r\n\r\na = tuple(map(int, input().split()))\r\na_prefix = [0]\r\nfor i in range(n):\r\n a_prefix.append(a_prefix[i] + a[i])\r\n\r\nb = tuple(map(int, input().split()))\r\nfor el in b:\r\n apartment = bisect_left(a_prefix, el)\r\n number = el - a_prefix[apartment-1]\r\n print(apartment, number)\r\n", "# cook your dish here\r\nn, m = map(int, input().split())\r\nrooms = list(map(int, input().split()))\r\nletters = list(map(int, input().split()))\r\n\r\nsum_rooms = 0\r\ndormitory_index = 1\r\n\r\nfor letter in letters:\r\n while sum_rooms + rooms[dormitory_index - 1] < letter:\r\n sum_rooms += rooms[dormitory_index - 1]\r\n dormitory_index += 1\r\n room_number = letter - sum_rooms\r\n print(dormitory_index, room_number)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ns = 0\r\nind = 0\r\nfor el in b:\r\n while s + a[ind] < el:\r\n s += a[ind]\r\n ind += 1\r\n print(ind + 1, el - s)\r\n", "d = []\r\nn, m = map(int, input().split())\r\nli = list(map(int, input().split()))\r\ntmp = 0\r\nfor i in range(n):\r\n tmp += li[i]\r\n d.append(tmp)\r\nli1 = list(map(int, input().split()))\r\nj = 0\r\nfor i in range(m):\r\n while j < n:\r\n if li1[i] <= d[j]:\r\n if j == 0:\r\n print(j+1,li1[i])\r\n break\r\n else:\r\n print(j+1,abs(li1[i]-d[j-1]))\r\n break\r\n else:\r\n j += 1", "def search(num,n,prefix):\r\n left = 1\r\n right = n\r\n while left<= right:\r\n mid = left+(right-left)//2\r\n\r\n if prefix[mid]>=num:\r\n ans = mid\r\n right = mid-1\r\n else:\r\n left = mid+1\r\n return ans\r\n\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nprefix = [0]*(n+1)\r\n\r\nfor i in range(n):\r\n prefix[i+1] = prefix[i]+a[i]\r\n\r\n\r\nfor i in range(m):\r\n f = search(b[i],n,prefix)\r\n k = b[i]-prefix[f-1]\r\n print(f,k)\r\n\r\n", "input()\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ni=1\r\ndif=0\r\nfor bi in b:\r\n\twhile(bi>dif+a[0]):\r\n\t\tdif+=a.pop(0)\r\n\t\ti+=1\r\n\tprint(i,bi-dif)", "\"\"\"\n978C | Letters: binary search, implementation, two pointers\n\"\"\"\n\ndef letters():\n n, m = map(int, input().split(' '))\n a = list(map(int, input().split(' ')))\n b = list(map(int, input().split(' ')))\n s = 0\n i = 0\n for bi in b:\n while s + a[i] < bi:\n s += a[i]\n i += 1\n print(i + 1, bi - s)\n\n\nif __name__ == '__main__':\n letters()", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ns = 0\r\nj = 0\r\nfor i in b:\r\n\twhile i > s:\r\n\t\ts += a[j]\r\n\t\tj += 1\r\n\tprint(\"%d %d\"%(j ,i-(s-a[j-1])))\r\n", "n, m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nrooms = [0]\r\nfor i in range(len(a)):\r\n rooms.append(a[i] + rooms[i])\r\n\r\n\r\nroom_index = 1\r\nfor message_index in range(len(b)):\r\n for i in range(room_index, len(rooms)):\r\n if b[message_index] in range(rooms[i - 1], rooms[i] + 1):\r\n print(i, b[message_index] - rooms[i - 1])\r\n room_index = i\r\n break \r\n", "n,m=map(int, input().split())\r\nkorp=[int(i) for i in input().split()]\r\npis=[int(i) for i in input().split()]\r\n\r\nkv=0\r\ni=0\r\nfor j in pis:\r\n while korp[i]+kv<j:\r\n kv+=korp[i]\r\n i+=1\r\n print(i+1,j-kv)", "from bisect import bisect_left\r\n\r\n\r\ndormitories , Noletters = map(int,input().split())\r\nrooms = list(map(int,input().split()))\r\nletters = list(map(int,input().split()))\r\nrooms = [0] + rooms\r\nfor i in range(1,len(rooms)):\r\n rooms[i] += rooms[i - 1]\r\noutPut = 0\r\nfor letter in letters:\r\n dorm = bisect_left(rooms,letter)\r\n print(dorm,letter - rooms[dorm - 1])\r\n", "n,m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nc = 0\r\nkv = []\r\nkv.append(0)\r\n\r\nfor i in range(n):\r\n kv.append(a[i] + kv[i]);\r\n\r\n\r\nb = list(map(int, input().split()))\r\n\r\nfor j in range(m):\r\n l = c\r\n r = n + 1\r\n while(l <= r):\r\n c = (l + r)//2\r\n if(kv[c] == b[j]):\r\n print(c, a[c - 1])\r\n break\r\n elif(kv[c] > b[j]):\r\n r = c - 1;\r\n elif(kv[c] < b[j] and kv[c + 1] < b[j]):\r\n l = c + 1;\r\n elif(kv[c] < b[j] and kv[c + 1] >= b[j]):\r\n print(c + 1, b[j] - kv[c])\r\n break\r\n \r\n\r\n", "arr = []\r\ncurr = 0\r\n\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nfor i in a:\r\n arr.append([curr+1,i+curr])\r\n curr = curr+i\r\nans = []\r\nj = 0 \r\nk = 0\r\nwhile k < len(arr) and j < len(b):\r\n if b[j] >= arr[k][0] and b[j] <= arr[k][1]:\r\n ans.append([k+1,b[j]-arr[k][0]+1])\r\n j+=1\r\n else:\r\n k+=1\r\nfor i in ans:\r\n print(*i)", "import bisect\nimport itertools\n\nn, m = map(int, input().split())\na = list(itertools.accumulate(map(int, input().split()), initial=0))\ndorm = 1\nfor room in map(int, input().split()):\n dorm = bisect.bisect_left(a, room, lo=dorm)\n print(dorm, room - a[dorm - 1])\n", "def rech(liste,i):\r\n d=0\r\n f=len(liste)\r\n while d<f:\r\n mid=(d+f+1)//2\r\n if liste[mid]>=i:\r\n f=mid-1\r\n else:\r\n d=mid\r\n return d\r\nn,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nliste=[0]\r\nfor i in range(1,n+1):\r\n liste.append(liste[i-1]+l1[i-1])\r\nfor ele in l2:\r\n index=rech(liste,ele)+1\r\n print(index,\" \",ele-liste[index-1])", "def BinarySearch(arr, element):\r\n first = 0\r\n last = len(arr)\r\n while first < last:\r\n middle = (first + last)//2\r\n if arr[middle] < element:\r\n first = middle + 1\r\n else:\r\n last = middle\r\n return first\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nA = []\r\nA.append(a[0])\r\nfor i in range(1, n):\r\n A.append(A[i-1] + a[i])\r\nfor i in range(m):\r\n home = BinarySearch(A, b[i])\r\n if home!= 0:\r\n flat = b[i] - A[home-1]\r\n else:\r\n flat = b[i]\r\n print(home + 1, \" \", flat)\r\n\r\n \r\n", "def main():\r\n n, m = map(int, fin().split())\r\n *a, = map(int, fin().split())\r\n *b, = map(int, fin().split())\r\n\r\n f = [0]*(n+1); p = [0]*(n+1)\r\n for i in range(1, n+1): f[i] = a[i-1] + f[i-1]\r\n for i in range(1, n+1): p[i] = f[i] - a[i-1] + 1\r\n\r\n for i in b:\r\n fa = 0; k = 0\r\n low = 1; high = n\r\n while low<=high:\r\n mid = (low+high)//2\r\n if i>f[mid]: low = mid+1\r\n elif i<p[mid]: high = mid-1\r\n else: fa = mid; break\r\n k = i - f[fa-1]\r\n fout(f\"{fa} {k}\")\r\n \r\n# FastIO\r\nfrom sys import stdin, stdout\r\ndef fin(): return stdin.readline().strip(\"\\r\\n\")\r\ndef fout(s): return stdout.write(str(s)+\"\\n\")\r\nif __name__ == \"__main__\":\r\n t = 1 or int(fin())\r\n for i in range(t): main()", "import bisect\r\nn, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\na = [0] + a\r\nfor i in range(1, len(a)):\r\n a[i] += a[i - 1]\r\n\r\nfor bi in b:\r\n d = bisect.bisect_left(a, bi)\r\n r = bi - a[d - 1]\r\n print(d, r) \r\n\r\n", "input();l=[0,]+list(map(int,input().split()))\r\ns=0;j=1\r\nfor i in map(int,input().split()):\r\n\twhile i>s+l[j]:\r\n\t\ts+=l[j];j+=1\r\n\tprint(j,i-s)", "n,nn=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nj=0\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\nfor i in range(nn):\r\n l=0\r\n r=n-1\r\n while r-l>1:\r\n m=(r+l-1)//2+1\r\n if b[i]>a[m]:\r\n l=m\r\n else:\r\n r=m\r\n if a[l]<b[i]:\r\n if r+1==1:\r\n print(r+1,b[i])\r\n else:\r\n print(r+1,b[i]-a[r-1])\r\n else:\r\n if l+1==1:\r\n print(l+1,b[i])\r\n else:\r\n print(l+1,b[i]-a[l-1])\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn,m=map(int,input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int,input().split()))\r\ns=0\r\ni=1\r\nfor x in b:\r\n\twhile s+a[i-1]<x:\r\n\t\ts+=a[i-1]\r\n\t\ti+=1\r\n\tprint(i,x-s)", "inf=10**18\r\ndxy=[(0,1), (1,0), (-1, 0), (0, -1)]\r\nmod=10**9+7\r\nMOD=998244353\r\n\r\nfrom bisect import bisect_left as bl\r\n\r\ndef main():\r\n N, M = map(int, input().split())\r\n A = [int(i) for i in input().split()]\r\n B = [int(i) for i in input().split()]\r\n\r\n\r\n AA = [0]\r\n for a in A:\r\n AA.append(AA[-1]+a)\r\n for b in B:\r\n i = bl(AA, b)\r\n print(i, b-AA[i-1])\r\nmain()", "n, m = map(int, input().split())\r\nai = list(map(int, input().split()))\r\nbi = list(map(int, input().split()))\r\n\r\ncur=0\r\ndi = [0]*n\r\nfor i in range(n):\r\n di[i] = cur+ai[i]\r\n cur += ai[i]\r\ntot_rooms = 0\r\ndorm = 1\r\ndorm_ptr = 0\r\n\r\npr = 0\r\n\r\nfor i in range(m):\r\n if bi[i]<di[dorm_ptr]:\r\n print(dorm, bi[i]-pr)\r\n else:\r\n while bi[i]>(di[dorm_ptr]):\r\n pr = di[dorm_ptr]\r\n dorm_ptr+=1\r\n dorm+=1\r\n print(dorm, bi[i]-pr)", "n,m = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = 0\r\nd = a[c]\r\nfor i in b:\r\n while i > d:\r\n c += 1\r\n d += a[c]\r\n print(c+1,i + a[c] - d)", "'''\r\n3 6\r\n10 15 12\r\n1 9 12 23 26 37\r\n\r\n'''\r\nfrom bisect import bisect_left\r\n\r\nn,k = map(int,input().split())\r\nns = list(map(int,input().split()))\r\nks = list(map(int,input().split()))\r\npre_sum = [0]\r\nfor i in range(n):\r\n pre_sum.append(pre_sum[-1]+ns[i])\r\nfor i in ks:\r\n idx = bisect_left(pre_sum,i)\r\n print(idx,i-pre_sum[idx-1])\r\n", "n, m = map(int, input().split())\r\n*a, = map(int, input().split())\r\n*b, = map(int, input().split())\r\nq = 0\r\ns = 1\r\nfor i in b:\r\n while q + a[s - 1] < i:\r\n q += a[s - 1]\r\n s += 1\r\n print(s, i - q)\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\nfrom functools import lru_cache\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n \r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n \r\n'''\r\n'''\r\ndef solve():\r\n n, m = MII()\r\n a = LII()\r\n b = LII()\r\n\r\n for i in range(1, len(a)):\r\n a[i] += a[i-1]\r\n \r\n ans = []\r\n cur = 0\r\n for num in b:\r\n i = bisect.bisect(a, num-1)\r\n ans.append((i+1, num if i==0 else num-a[i-1]))\r\n\r\n for x in ans:\r\n WS(x)\r\n\r\nsolve()", "from sys import stdin, stdout\r\nfrom bisect import bisect_left\r\nfrom itertools import accumulate\r\n\r\n\r\nn, m = map(int, stdin.buffer.readline().decode().split())\r\ndorms = list(map(int, stdin.buffer.readline().decode().split()))\r\nmails = list(map(int, stdin.buffer.readline().decode().split()))\r\n\r\naccumulated = [0] + list(accumulate(dorms))\r\n\r\nfor mail in mails:\r\n dorm = bisect_left(accumulated, mail)\r\n stdout.write(f'{dorm} {mail - accumulated[dorm - 1]}\\n')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import defaultdict, deque, Counter\r\nfrom heapq import heapify, heappop, heappush\r\n\r\ndef main():\r\n t = 1\r\n\r\n for _ in range(t):\r\n run_test_case()\r\n\r\ndef run_test_case():\r\n n, m = map(int, input().split())\r\n dorm = list(map(int, input().split()))\r\n letters = list(map(int, input().split()))\r\n past = 0\r\n dormitory = []\r\n for i in range(len(dorm)):\r\n dormitory.append([past + 1, dorm[i] + past])\r\n past += dorm[i]\r\n \r\n # print(dormitory)\r\n prev = -1\r\n letters.sort()\r\n i = 0\r\n for letter in letters:\r\n while dormitory[i][1] < letter:\r\n i += 1\r\n print(i + 1,letter - dormitory[i][0] + 1)\r\nif __name__ == \"__main__\":\r\n main()\r\n\"\"\"\r\n/* stuff you should look for\r\n * int overflow, array bounds\r\n * special cases (n=1?)\r\n * do smth instead of nothing and stay organized\r\n * WRITE STUFF DOWN\r\n * DON'T GET STUCK ON ONE APPROACH\r\n */\r\n\"\"\"\r\n", "from bisect import bisect_left\r\na,b=list(map(int,input().split()))\r\nnew=list(map(int,input().split()))\r\nls=list(map(int,input().split()))\r\nfor i in range(1,a):\r\n new[i]=new[i]+new[i-1]\r\nfor i in range(b):\r\n a=bisect_left(new,ls[i])\r\n if a==0:\r\n print(a+1,ls[i])\r\n else:\r\n print(a+1,ls[i]-new[a-1])", "num, poster = map(int, input().split())\nparadgm = [0] + list(map(int, input().split()))\nsize = list(map(int, input().split()))\ncont = 0 \nfor i in range(1, len(paradgm)):\n paradgm[i] += paradgm[i - 1]\nfor j in size:\n while j > paradgm[cont + 1]:\n cont += 1\n \n print(cont + 1, j - paradgm[cont])\n \t\t\t\t\t \t\t\t \t\t\t\t \t\t \t \t\t", "n,m=map(int,input().split())\r\ndd=list(map(int,input().split()))\r\nll=list(map(int,input().split()))\r\ni,j=0,0\r\ng=1\r\nc=0\r\nwhile i<n:\r\n x=dd[i]\r\n c+=x\r\n while j<m:\r\n if ll[j]<=c:\r\n print(g,ll[j]-(c-x))\r\n else:\r\n break\r\n j+=1\r\n i+=1\r\n g+=1", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nsm = 0\nj = 0\np = 1\nfor i in range(len(b)):\n while j < n and sm + a[j] < b[i]:\n sm += a[j]\n j += 1\n print(j + 1, b[i] - sm)\n", "z,a,d=input,0,0;z()\nl=list(map(int,z().split()))\nfor i in list(map(int,z().split())):\n while(i>d+l[a]):d+=l[a];a+=1\n print(a+1,i-d)\n\t \t\t\t\t\t \t \t \t\t \t \t\t\t \t \t\t\t \t", "\"\"\"\r\n Author : Afsan Habib\r\n Mail : [email protected]\r\n GitHub : https://github.com/afsanhabib\r\n\"\"\"\r\n\r\nimport sys,os,collections,math,cmath\r\nfrom random import randint, shuffle\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import bisect_left,bisect_right\r\nfrom heapq import heappush,heappop\r\nfrom itertools import accumulate, permutations\r\n\r\n#_______________________________________________\r\nMOD=10**9+7\r\nMAX_INT=9223372036854775807\r\nMIN_INT=-9223372036854775807\r\nyes=\"YES\"\r\nno=\"NO\"\r\n#_____________Some Necessary Functions___________\r\n\r\ndef seive_of_eratosthenes(n):\r\n is_prime = [True for _ in range(n+1)]\r\n is_prime[0], is_prime[1] = False, False\r\n\r\n for i in range(2, int(n**0.5)+1):\r\n for j in range(2*i, n+1, i):\r\n is_prime[j] = False\r\n\r\n return is_prime\r\n\r\ndef bubbleSort(arr):\r\n n=len(arr)\r\n for i in range(n-1):\r\n for j in range(n-1-i):\r\n if arr[j]>arr[j+1]:\r\n temp=arr[j]\r\n arr[j]=arr[j+1]\r\n arr[j+1]=temp\r\n return arr\r\n\r\ndef binary_search(arr, x):\r\n low = 0\r\n high = len(arr) - 1\r\n mid = 0\r\n while low <= high:\r\n mid = (high + low) // 2\r\n if arr[mid] < x:\r\n low = mid + 1\r\n elif arr[mid] > x:\r\n high = mid - 1\r\n else:\r\n return mid\r\n return -1\r\n\r\ndef counter(a):\r\n q = [0] * max(a)\r\n for i in range(len(a)):\r\n q[a[i] - 1] = q[a[i] - 1] + 1\r\n return(q)\r\n\r\n\r\ndef prefix_sums(a):\r\n p = [0]\r\n for x in a:\r\n p.append(p[-1] + x)\r\n return p\r\n \r\ndef counter_elements(a):\r\n q = dict()\r\n for i in range(len(a)):\r\n if a[i] not in q:\r\n q[a[i]] = 0\r\n q[a[i]] = q[a[i]] + 1\r\n return(q)\r\n \r\ndef string_counter(a):\r\n q = [0] * 26\r\n for i in range(len(a)):\r\n q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1\r\n return(q)\r\n\r\ndef factorial(n,m = 1000000007):\r\n q = 1\r\n for i in range(n):\r\n q = (q * (i + 1)) % m\r\n return(q)\r\n \r\ndef factors(n):\r\n q = []\r\n for i in range(1,int(n ** 0.5) + 1):\r\n if n % i == 0: q.append(i); q.append(n // i)\r\n return(list(sorted(list(set(q)))))\r\n \r\ndef prime_factors(n):\r\n q = []\r\n while n % 2 == 0: q.append(2); n = n // 2\r\n for i in range(3,int(n ** 0.5) + 1,2):\r\n while n % i == 0: q.append(i); n = n // i\r\n if n > 2: q.append(n)\r\n return(list(sorted(q)))\r\n \r\ndef transpose(a):\r\n n,m = len(a),len(a[0])\r\n b = [[0] * n for i in range(m)]\r\n for i in range(m): \r\n for j in range(n): \r\n b[i][j] = a[j][i]\r\n return(b)\r\n\r\ndef Sub_Array_Max_Sum(arr, k):\r\n n = len(arr)\r\n if n < k:\r\n print(\"Invalid\")\r\n return -1\r\n window_sum = sum(arr[:k])\r\n max_sum = window_sum\r\n for i in range(n - k):\r\n window_sum = window_sum - arr[i] + arr[i + k]\r\n max_sum = max(window_sum, max_sum)\r\n return max_sum\r\n\r\ndef inversePermutation(arr, size):\r\n for i in range(0, size):\r\n for j in range(0, size):\r\n if (arr[j] == i + 1):\r\n print(j + 1, end = \" \")\r\n break\r\n\r\n#_____________End Necessary Functions________________________\r\n\r\n\r\n#_____________Start Fast Input Output Functions________________\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef input_int_num():\r\n return (int(input()))\r\n\r\ndef input_int_list():\r\n return list(map(int, input().split()))\r\n \r\ndef input_string_list():\r\n return list(map(str, input().split()))\r\n \r\ndef input_int_map():\r\n return(map(int,input().split()))\r\n\r\ndef input_strip_string():\r\n return (input().strip())\r\n\r\n#______________End Fast Input Output Functions_________________\r\n\r\n\r\n#______________________Start Solve Functions_______________________\r\n \r\n\r\n\r\n\r\n\r\ndef solve():\r\n fun=lambda: map(int, input().split())\r\n n, m = input_int_list()\r\n \r\n a =fun()\r\n b =fun()\r\n s = 0\r\n f = 0\r\n l = 0\r\n\r\n for x in b:\r\n while s < x:\r\n l = s\r\n s += next(a)\r\n f += 1\r\n print(f, x - l)\r\n\r\n\r\n''' input\r\n\r\n'''\r\n\r\n#___________End Solve Functions___________#\r\n \r\n\r\n\r\n#___________Start Main Functions___________#\r\n\r\ndef main():\r\n solve()\r\n return\r\n\r\n # Test_Case=int(input())\r\n # while Test_Case:\r\n # solve()\r\n # Test_Case -= 1\r\n # return\r\n\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n#___________End Main Functions___________#", "# import os\n# os.chdir(\"C:/Users/gerchik/Dropbox/courses/algorithms/codeforces\")\n# os.chdir(\"/Users/daniilgerchik/Library/CloudStorage/Dropbox/courses/algorithms/codeforces\")\n# from collections import Counter, defaultdict # deque\nfrom sys import stdin\n\n# int(stdin.readline().rstrip())\n# list(map(int, stdin.readline().rstrip().split()))\n# stdin = open(\"input.txt\")\ndef get_solution():\n # stdin = open(\"input.txt\")\n n, m = map(int, stdin.readline().rstrip().split())\n arr = list(map(int, stdin.readline().rstrip().split()))\n brr = list(map(int, stdin.readline().rstrip().split()))\n \n arr_cum = [0] * (n + 1)\n for i in range(1, len(arr) + 1):\n arr_cum[i] = arr[i - 1] + arr_cum[i - 1]\n \n L = 1\n for b in brr:\n while L < n + 1:\n q, r = divmod(b, arr_cum[L])\n \n if q == 0:\n print(L, (b - arr_cum[L - 1]) % (arr_cum[L] - arr_cum[L - 1]))\n break\n elif q == 1 and r == 0:\n print(L, arr_cum[L] - arr_cum[L - 1])\n L += 1\n break\n else:\n L += 1\n \n \nt = 1#int(stdin.readline().rstrip())\nfor _ in range(t):\n get_solution()\n\n\n\n\n\n\n\n\n\n", "def selectPosition(A,t):\r\n start = 0\r\n end = len(A)-1\r\n while(start<=end):\r\n mid = start + (end - start)//2\r\n if A[mid]<t:\r\n start = mid + 1 \r\n else:\r\n end = mid - 1\r\n return start\r\ndno, n_letters = map (int, input ().split ())\r\nn_rooms = list (map (int, input ().split ()))\r\nroomno = list(map(int, input().split()))\r\nr_cum = [n_rooms[0]]\r\nfor i in n_rooms[1:]:\r\n r_cum.append(i + r_cum[-1])\r\n#print(r_cum)\r\nfor i in roomno:\r\n d = selectPosition(r_cum, i)\r\n if d == 0:\r\n k = i \r\n else:\r\n k = i - r_cum[d-1]\r\n \r\n print(d+1,k)", "import sys\r\nimport re\r\nfrom math import gcd,lcm, factorial as fact, comb, hypot, atan2, pi,ceil,sqrt\r\nfrom heapq import *\r\nfrom random import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom collections import *\r\nimport threading\r\n\r\nthreading.stack_size(2**23)\r\n\r\nsys.setrecursionlimit(5*10**4+10)\r\n\r\n# input = sys.stdin.readline\r\ndef read(fn=int):\r\n\treturn map(fn,input().split())\r\n\r\n# toks = (tok for tok in sys.stdin.read().split())\r\n# def rd(fn=int): return fn(next(toks))\r\n# def rdn(n,fn=int): return (rd(fn) for _ in range(n))\r\n\r\ndef mul(a,b):\r\n\tc = [[0 for j in range(len(b[0]))] for i in range(len(a))]\r\n\tfor i in range(len(a)):\r\n\t\tfor j in range(len(b[0])):\r\n\t\t\tfor k in range(len(b)):\r\n\t\t\t\tc[i][j] += a[i][k]*b[k][j]\r\n\treturn c\r\n\r\ndef power(x,y):\r\n\tn = len(x)\r\n\tres = [[1 if i==j else 0 for j in range(n)] for i in range(n)]\r\n\twhile y:\r\n\t\tif y % 2: res = mul(res,x)\r\n\t\tx = mul(x,x)\r\n\t\ty //= 2\r\n\treturn res\t\r\n\r\nmod=998244353\r\n\r\ndef sieve(n,primes):\r\n\tn = int(n)\r\n\tisp = [True] * (n+1)\r\n\tfor i in range(2,n+1):\r\n\t\tif isp[i]:\r\n\t\t\tprimes += [i]\r\n\t\t\tfor j in range(i*i,n+1,i):\r\n\t\t\t\tisp[j] = False\r\n\treturn isp\r\n\r\n# for _ in range(int(input())):\r\nn,m=map(int,input().split())\r\nl=[*map(int,input().split())]\r\nq=[*map(int,input().split())]\r\npf=[0]\r\nfor v in l:pf+=[pf[-1]+v]\r\nfor x in q:\r\n\ti=bisect_left(pf,x)\r\n\tprint(i,x-pf[i-1])", "n,m=map(int,input().split())\r\na=[int(i)for i in input().split()]\r\nb=[int(i)for i in input().split()]\r\ns=k=0\r\nfor i in b:\r\n while i-s>a[k]:\r\n s+=a[k]\r\n k+=1\r\n print(k+1,i-s)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nf=[0]*(n+1)\r\nfor i in range(1,n+1): f[i]=f[i-1]+a[i-1]\r\nfor j in b:\r\n l=-1\r\n r=len(f)\r\n while r-l>1:\r\n m=(l+r)//2\r\n if f[m]<j: l=m\r\n else: r=m\r\n print(r, j-f[l])", "from typing import List\r\nfrom collections import namedtuple\r\nimport sys\r\nimport traceback\r\n\r\n\r\nclass Solution:\r\n def deliver_letters(self, n, m, rooms: List, letters: List):\r\n result = []\r\n # n: number of dormitories\r\n # m: number of letters\r\n room_index, letter_index = 0, 0\r\n room_num = 0\r\n dorm_num = 1\r\n while letter_index < len(letters):\r\n if letters[letter_index] - room_num <= rooms[room_index]:\r\n print(dorm_num, letters[letter_index] - room_num)\r\n result.append((dorm_num, letters[letter_index] - room_num))\r\n letter_index += 1\r\n else:\r\n room_num += rooms[room_index]\r\n room_index += 1\r\n dorm_num += 1\r\n return result\r\n\r\n\r\nTestCase = namedtuple('TestCase', 'n m rooms letters correct')\r\n\r\n\r\ndef read_test_cases(input_file, output_file):\r\n test_cases = []\r\n try:\r\n with open(input_file) as in_f:\r\n with open(output_file) as out_f:\r\n test_num = int(in_f.readline())\r\n for _ in range(test_num):\r\n values = in_f.readline().strip().split(' ')\r\n # n: number of dormitories\r\n n = int(values[0])\r\n # m: number of letters\r\n m = int(values[1])\r\n # Number of rooms in each dormitory\r\n rooms = in_f.readline().strip().split(' ')\r\n rooms = [int(r) for r in rooms]\r\n # Letters numbers\r\n letters = in_f.readline().strip().split(' ')\r\n letters = [int(l) for l in letters]\r\n correct = []\r\n for _ in range(m):\r\n values = out_f.readline().strip().split(' ')\r\n correct.append((int(values[0]), int(values[1])))\r\n t = TestCase(n, m, rooms, letters, correct)\r\n test_cases.append(t)\r\n return test_cases\r\n # raise Exception('My Test Exception')\r\n except Exception as exc:\r\n exc_name = exc.__class__.__name__\r\n exc_msg = str(exc)\r\n exc_info = sys.exc_info()\r\n print('EXCEPTION {exc_name} {exc_msg}'.format(exc_name=exc_name, exc_msg=exc_msg))\r\n traceback.print_exception(*exc_info)\r\n\r\n\r\nif __name__ == '__main__':\r\n if len(sys.argv) > 1 and '--debug' in sys.argv:\r\n test_cases = read_test_cases('data/input.txt', 'data/output.txt')\r\n for t in test_cases:\r\n result = Solution().deliver_letters(t.n, t.m, t.rooms, t.letters)\r\n print('N:', t.n, 'M:', t.m, 'ROOMS:', t.rooms, 'LETTERS:', t.letters,\r\n 'CORRECT:', t.correct, 'RESULT:', result, 'CHECK:', result == t.correct)\r\n else:\r\n values = input().strip().split(' ')\r\n m, n = int(values[0]), int(values[1])\r\n rooms = input().strip().split(' ')\r\n rooms = [int(r) for r in rooms]\r\n letters = input().strip().split(' ')\r\n letters = [int(l) for l in letters]\r\n Solution().deliver_letters(n, m, rooms, letters)", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nsum = 0\r\nidx = 0\r\nfor i in range(m):\r\n while b[i] > sum+a[idx]:\r\n sum += a[idx]\r\n idx += 1\r\n print(idx+1, b[i]-sum) ", "from bisect import bisect\r\n\r\nn, m = map(int, input().split())\r\n\r\ndorm_number= list(map(int, input().split()))\r\nletter=list(map(int, input().split()))\r\n\r\nans = []\r\ns = []\r\narr=[0]\r\n\r\nfor i in range(len(dorm_number)):\r\n arr.append(arr[-1]+dorm_number[i])\r\narr=arr[1:]\r\n\r\nfor i in range(m):\r\n idx=bisect(arr,letter[i])\r\n #print(idx)\r\n if arr[idx-1]>letter[i]:\r\n ans.append([idx+1,letter[i]])\r\n elif arr[idx-1]<letter[i]:\r\n ans.append([idx+1,letter[i]-arr[idx-1]])\r\n else: \r\n ans.append([idx,dorm_number[idx-1]])\r\n\r\nfor i in range(m):\r\n print(*ans[i])\r\n", "import sys\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nque = list(map(int, input().split()))\r\nlst = [arr[0]]\r\n\r\nfor i in range(1, n):\r\n lst.append(lst[-1] + arr[i])\r\n\r\nfor q in que:\r\n l, r = 0, n\r\n\r\n while l < r:\r\n mid = (l+r) // 2\r\n\r\n if lst[mid] < q:\r\n l = mid + 1\r\n else:\r\n r = mid\r\n print(l+1, q if l == 0 else q - lst[l-1])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nsum = 0\r\nidx = 0\r\nfor i in range(m):\r\n while sum + a[idx] < b[i]:\r\n sum += a[idx]\r\n idx += 1\r\n print(idx + 1, end=\" \")\r\n print(b[i] - sum)", "def get_capacity(dormitory):\r\n capacity = []\r\n capacity.append(dormitory[0])\r\n for i in range(len(dormitory)-1):\r\n capacity.append(dormitory[i+1] + capacity[i])\r\n #dormitory[i+1] = dormitory[i+1] + capacity[i]\r\n return capacity\r\n\r\n\r\ndef get_dormitory(capacity, lettter):\r\n left = 0\r\n right = len(capacity) - 1\r\n while left < right:\r\n mid = (left + right) // 2\r\n if capacity[mid] < lettter:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n return left + 1\r\n\r\ndef get_room(capacity, letter, dormitory):\r\n return capacity[dormitory - 1] - letter\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n dormitories = list(map(int, input().split()))\r\n letters = list(map(int, input().split()))\r\n capacity = get_capacity(dormitories)\r\n for letter in letters:\r\n dormitory = get_dormitory(capacity, letter)\r\n room = dormitories[dormitory - 1] - get_room(capacity, letter, dormitory)\r\n print(dormitory, room)", "from bisect import bisect_left\r\n\r\nn, m = map(int, input().split())\r\n\r\na = tuple(map(int, input().split()))\r\nb = tuple(map(int, input().split()))\r\n\r\npref_sums = [0]\r\nfor i in range(n):\r\n pref_sums.append(pref_sums[i] + a[i])\r\n\r\nfor letter in b:\r\n number = bisect_left(pref_sums, letter)\r\n room = letter - pref_sums[number - 1]\r\n print(number, room)\r\n", "from sys import stdin \r\nn,m = list(map(int,stdin.readline().split(' ')))\r\na = list(map(int,stdin.readline().split(' ')))\r\nb = list(map(int,stdin.readline().split(' ')))\r\ndormitory = 1\r\nroom = 0\r\nsum_a = 0\r\ni = 0\r\nj = 0\r\nwhile j<m:\r\n if b[j] <= sum_a+a[i]:\r\n room = b[j] - sum_a\r\n print(dormitory,room)\r\n j += 1\r\n else:\r\n dormitory += 1\r\n sum_a += a[i]\r\n i += 1\r\n\r\n\r\n\r\n", "I = lambda: map(int,input().split())\r\n \r\nI()\r\na=list(I())\r\ni = d = 0\r\n \r\nfor b in I():\r\n while b > a[i] + d:\r\n d += a[i]\r\n i += 1\r\n print(i+1,b-d)", "def solve(A: list, a: list, b: int, index: int):\r\n index = index - 1 if index else 0\r\n while b:\r\n minimum = min(b, a[index])\r\n b -= minimum\r\n a[index] -= minimum\r\n index += 1\r\n return index, A[index - 1] - a[index - 1]\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n A = list(a)\r\n b = list(map(int, input().split()))\r\n for i in range(1, len(b))[::-1]:\r\n b[i] -= b[i - 1]\r\n \r\n index = None\r\n for B in b:\r\n index, value = solve(A, a, B, index)\r\n print(f'{index} {value}')\r\n\r\nif __name__ == '__main__':\r\n main()", "a,b=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nf=0#skjdhfbcejshads\r\nj=0#dsuhfbcsejh,df\r\nfor i in range(b):#sjdfhbsdjhfbeajhs\r\n while j<d[i]:#dsfkjhfbsjherdfbf\r\n j+=c[f]#dsjfhsndkjfbhewd\r\n f+=1#digfjhskdufhed\r\n print(f,d[i]-j+c[f-1])# ответ", "import itertools\nimport bisect\n\nN, M = map(int, input().split())\ndorm = list(map(int, input().split()))\n\nP = list(itertools.accumulate(dorm))\n\ndef query(room):\n loc = bisect.bisect_left(P, room)\n room_num = room - (P[loc - 1] if loc > 0 else 0)\n return loc + 1, room_num\n\nfor room in map(int, input().split()):\n print(*query(room))", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nfrom bisect import bisect_left as bs\r\n\r\ndef test_case():\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n pref = [0 for _ in range(n+1)]\r\n for i in range(1, n+1):\r\n pref[i] = pref[i-1] + a[i-1]\r\n\r\n i, j = 0, 0\r\n while i < n or j < m:\r\n if i == n or (j < m and b[j] <= pref[i+1]):\r\n print(i+1, b[j]-pref[i])\r\n j += 1\r\n else:\r\n i += 1\r\n\r\n\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ns = [0]\r\nfor i in range(n):\r\n\ts.append(s[i] + a[i])\r\n\r\ndef bin_(n,m,b,s):\r\n\tfor x in b:\r\n\t\tl, r = -1, n\r\n\r\n\t\twhile l < r:\r\n\t\t\tm = l + (r - l) // 2\r\n\r\n\t\t\tif s[m] >= x:\r\n\t\t\t\tr = m\r\n\t\t\telse:\r\n\t\t\t\tl = m + 1\r\n\t\tprint(l, x - s[l-1])\r\n\r\nbin_(n,m,b,s)", "n,m=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nl = [0] + l\r\nfor i in range(1 , n+1) : l[i] += l[i-1] \r\nk=0\r\ni=0\r\nj=1\r\nwhile( i<len(a)):\r\n if(a[i]<=l[j]):\r\n print(j,a[i] - l[j-1])\r\n i=i+1 \r\n # j=0\r\n else:\r\n # a[i]=a[i]-l[j]\r\n j=j+1\r\n \r\n ", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n# ----------------------- #\r\n\r\nn, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nans = []\r\ns = 0\r\nt = 0\r\ndom = 0\r\nroom = 0\r\nall_room = 0\r\nfor i, dom in enumerate(A, 1):\r\n pre = all_room\r\n all_room += dom\r\n while t < m:\r\n if B[t] <= all_room:\r\n ans.append((i, (B[t]-pre)))\r\n t += 1\r\n else:\r\n break\r\nfor k, v in ans:\r\n print(k, v)\r\n", "input()\r\nA = list( map( int, input() .split()))\r\nB = list( map( int, input().split() ))\r\nl = [0]\r\n\r\nfor i in range( len(A)):\r\n l.append (l[-1]+ A[i])\r\n\r\na = 1\r\nfor i in range( len(B) ):\r\n while B[i] > l[a]:\r\n a += 1\r\n print( a, B[i] - l[a-1])\r\n", "n, m = (int(i) for i in input().split())\na = (int(i) for i in input().split())\nb = (int(i) for i in input().split())\nma = sz = next(a)\nres, j = [], 1\nfor i in b:\n while i > ma:\n sz = next(a)\n ma += sz\n j += 1\n res.append((j, i - (ma - sz)))\nfor r in res:\n print(*r)\n", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nl = []\r\nsum = 0\r\nidx = 0\r\nfor i in range (m):\r\n while (sum + a[idx])<b[i]:\r\n sum+=a[idx]\r\n idx+=1\r\n l.append(idx+1)\r\n l.append(b[i]-sum)\r\ni = 0\r\nwhile i<len(l):\r\n print(l[i], l[i+1])\r\n i+=2", "n, m = map(int, input().split())\r\nk = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nj, c, f, i = 0, k[0], 0, 0\r\nwhile i < m:\r\n if l[i] <= c:\r\n print(j + 1, l[i] - f)\r\n i += 1\r\n else:\r\n j += 1\r\n c += k[j]\r\n f += k[j - 1]\r\n", "'''\r\nAuthor : InHng\r\nLastEditTime : 2023-08-30 09:19:08\r\n:(\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom bisect import *\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i:\r\n a[i] += a[i - 1]\r\nfor bi in b:\r\n ans = bisect_left(a, bi)\r\n print(ans + 1, bi - (a[ans - 1] if ans else 0))\r\n", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = 0\r\nk = a[c]\r\nfor i in b:\r\n while i > k:\r\n c += 1\r\n k += a[c]\r\n print(c + 1,i + a[c] - k)", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nqueries=list(map(int,input().split()))\r\npref=[a[0]]\r\nfor i in range(1,n):\r\n pref.append(pref[-1]+a[i])\r\nptr=0\r\nans=[]\r\nfor q in queries:\r\n if q<=pref[ptr]:\r\n if ptr==0:\r\n ans.append([ptr+1,q])\r\n else:\r\n ans.append([ptr+1,q-pref[ptr-1]])\r\n else:\r\n while q>pref[ptr]:\r\n ptr+=1\r\n if ptr==0:\r\n ans.append([ptr+1,q])\r\n else:\r\n ans.append([ptr+1,q-pref[ptr-1]])\r\n \r\nfor ert in ans:\r\n print(ert[0],\" \",ert[1])\r\n", "def binsearch(build, k, s, e):\r\n if s == 0 and e == 1:\r\n return e, k\r\n if s == e-1:\r\n return e, k - build[s - 1]\r\n m = (s + e) // 2\r\n if build[m - 1] < k <= build[m]:\r\n return m+1, k - build[m - 1]\r\n elif k <= build[m]:\r\n return binsearch(build, k, s, m)\r\n else:\r\n return binsearch(build, k, m, e)\r\n\r\n\r\nn, m = list(map(int, input().split()))\r\nbuild = list(map(int, input().split()))\r\n# create prefix sum\r\nfor i in range(1, len(build)):\r\n build[i] += build[i - 1]\r\nfor k in list(map(int, input().split())):\r\n print(*binsearch(build, k, 0, n))\r\n", "n,m=map(int,input().split())\r\n*a,=map(int,input().split())\r\n*b,=map(int,input().split())\r\nc=[0]\r\nfor i in range(n):c+=c[-1]+a[i],\r\nfor letter in b:\r\n start,end=0,n\r\n while start<=end:\r\n mid=(start+end)//2\r\n if letter<c[mid]:\r\n if mid>0 and letter>c[mid-1]:print(mid,letter-c[mid-1]);break\r\n end=mid-1;continue\r\n if letter>c[mid]:\r\n if mid<n and letter<=c[mid+1]:print(mid+1,letter-c[mid]);break\r\n start=mid+1;continue\r\n if letter==c[mid]:print(mid,c[mid]-c[mid-1]);break\r\n ", "m , n = map(int, input().split())\r\ndorms = list(map(int, input().split()))\r\nletters = list(map(int, input().split()))\r\nleft, right, prev = 0, 0, 0\r\nwhile right < n:\r\n if letters[right] <= dorms[left] + prev:\r\n print(left + 1, letters[right] - prev)\r\n right += 1\r\n else:\r\n prev += dorms[left]\r\n left += 1", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ndp=[0]\r\ny=0\r\nfor i in a:\r\n y+=i\r\n dp.append(y)\r\nj=1\r\nfor i in range(len(b)):\r\n while dp[j]<b[i] and len(dp)>j:\r\n j+=1\r\n if dp[j]>=b[i]:\r\n print(j,b[i]-dp[j-1])\r\n \r\n ", "n,m=map(int,input().split())\r\na=[0]+list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nfor i in range(1, n+1):\r\n a[i]+=a[i-1]\r\nfor i in b:\r\n r=n\r\n l=0\r\n while r-l>1:\r\n m=(r+l)//2\r\n if i>a[m]: l=m\r\n else: r=m\r\n print(r, i-a[l])", "from bisect import bisect_left, bisect_right\r\ndorms, letters = map(int, input().split())\r\n\r\nrooms = [int(x) for x in input().split()]\r\nqueries = [int(x) for x in input().split()]\r\n\r\npre = [0]*dorms\r\npre[0] = rooms[0]\r\n\r\nfor i in range(dorms):\r\n pre[i] = rooms[i] + pre[i-1]\r\n\r\nout = []\r\nfor q in queries:\r\n idx = bisect_right(pre, q) -1\r\n if idx == -1:\r\n out.append([1,q])\r\n elif pre[idx] == q and idx > 0:\r\n out.append([idx+1, q - pre[idx-1]])\r\n elif pre[idx] == q:\r\n out.append([idx+1, q])\r\n else:\r\n out.append([idx+2, q - pre[idx]])\r\n\r\n\r\nfor ll in out:\r\n print(*ll)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nk = 0\r\np = a[0]\r\no = 1\r\nfor i in range(m):\r\n if s[i] <= p:\r\n print(o, s[i] - k)\r\n else:\r\n while s[i] > p:\r\n k = k + a[o - 1]\r\n p = p + a[o]\r\n o = o + 1\r\n print(o, s[i] - k)", "import math,sys,collections,bisect\n\n\ndef natural(n):\n\treturn n*(n+1)//2\n\ndef binarysearch(l,r,n,k):\n\tif l<=r:\n\t\tmid = (l+r)//2\n\t\tif mid*n<=k:\n\t\t\treturn binarysearch(mid+1,r,n,k)\n\t\treturn binarysearch(l,mid-1,n,k)\n\treturn r\n\ndef solve():\n\n\tn,m = list(map(int,input().split()))\n\tarr1 = list(map(int,input().split()))\n\tarr2 = list(map(int,input().split()))\n\ts = 0\n\ti = 0\n\tj = 0\n\twhile i<n and j<m:\n\t\twhile i<n and s+arr1[i]<arr2[j]:\n\t\t\ts+=arr1[i]\n\t\t\ti+=1\n\t\tprint(i+1,arr2[j]-s)\n\t\tj+=1\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n# number of test cases\n\n\n#t = int(input())\nt = 1\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "from itertools import accumulate\r\nfrom bisect import bisect_left, bisect_right\r\n\r\nn,m=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nla=list(accumulate(A))\r\nB=list(map(int,input().split()))\r\nfor i in range(m):\r\n x=bisect_left(la,B[i])\r\n if x+1==1:\r\n print(x+1,B[i])\r\n else:\r\n print(x+1,B[i]-la[x-1])\r\n ", "import itertools\r\n\r\nn, m = map(int, input().split())\r\nrooms = list(map(int, input().split()))\r\nletters = list(map(int, input().split()))\r\npre = list(itertools.accumulate(rooms))\r\n\r\ni=0\r\nfor room in letters:\r\n if room <= pre[i]:\r\n if i==0:\r\n print(i+1, room)\r\n else:\r\n print(i+1, room-pre[i-1])\r\n \r\n else:\r\n \r\n while True:\r\n i += 1\r\n if room <= pre[i]:\r\n if i==0:\r\n print(i+1, room)\r\n else:\r\n print(i+1, room-pre[i-1])\r\n break\r\n \r\n \r\n ", "o=str(input())\r\nO,P=o.split()\r\nO=int(O)\r\nP=int(P)\r\nOB=str(input())\r\nPI=str(input())\r\nN=[]\r\na=[]\r\nfor r in OB.split():\r\n N.append(int(r))\r\nfor q in PI.split():\r\n a.append(int(q))\r\nk=0\r\nn=0\r\nA=0\r\nS=0\r\nwhile k!=P:\r\n if N[n]+S>=a[A]:\r\n k=k+1\r\n print(n+1,a[A]-S)\r\n A=A+1\r\n else:\r\n S=S+N[n]\r\n n=n+1\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nsp = [0]\r\ns = list(map(int, input().split()))\r\nfor i in range(n):\r\n sp.append(sp[-1] + s[i])\r\nsp = sp[1:]\r\nlet = list(map(int, input().split()))\r\nfor el in let:\r\n l = -1\r\n r = n\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n if el > sp[m]:\r\n l = m \r\n else:\r\n r = m\r\n print(r + 1, el - (sp[r] - s[r]))\r\n ", "from bisect import *\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\npre = [a[0]]\r\nfor i in range(1, n):\r\n pre.append(pre[i-1] + a[i])\r\nfor i in b:\r\n p = bisect_left(pre, i)+1\r\n if (p == 1):\r\n print(p, i)\r\n else:\r\n print(p, i - pre[p-2])", "n, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nfor i in range(1, len(a)):\r\n a[i] = a[i] + a[i-1]\r\nb = [int(i) for i in input().split()]\r\nk = 0\r\nfor i in range(len(b)):\r\n for j in range(k, len(a)):\r\n if b[i] <= a[j]:\r\n if j != 0:\r\n print(j + 1, b[i] - a[j-1])\r\n else:\r\n if b[i] != a[j]:\r\n print(j + 1, b[i] % a[j])\r\n else:\r\n print(j + 1, b[i])\r\n break\r\n else:\r\n k += 1", "'''\r\nAuthor : InHng\r\nLastEditTime : 2023-08-29 20:14:29\r\n:(\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom bisect import *\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nsum = a\r\nfor i in range(n):\r\n if i:\r\n sum[i] += sum[i - 1]\r\nfor bi in b:\r\n ans1 = bisect_left(sum, bi)\r\n ans2 = bi - (sum[ans1 - 1] if ans1 else 0)\r\n print(ans1 + 1, ans2)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nnumery = [0]*n\r\nnumery[0]=a[0]\r\nfor i in range(1, len(a)):\r\n numery[i]=numery[i-1]+a[i]\r\n#print(*numery) \r\nfor i in range(len(b)):\r\n l = -1\r\n r = len(a)\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n if numery[m] < b[i]:\r\n l = m\r\n else:\r\n r = m\r\n if r!= 0:\r\n print(r + 1, b[i] - numery[max(0, r - 1)])\r\n else:\r\n print(r + 1, b[i])\r\n ", "import sys\r\n\r\ninput = sys.stdin.readline\r\nn, m = list(map(int, input().split()))\r\nbdgs = list(map(int, input().split()))\r\nrooms = list(map(int, input().split()))\r\n\r\npre = []\r\ntotal = 0\r\nfor dorms in bdgs:\r\n total += dorms\r\n pre.append(total)\r\n# print(pre)\r\nfor i, room in enumerate(rooms):\r\n left, right = -1, n\r\n while right > left + 1:\r\n mid = left + (right - left) // 2\r\n if pre[mid] < room: left = mid\r\n else: right = mid\r\n \r\n print(right + 1, (room - pre[right - 1] if right else room))\r\n", "import sys\r\n\r\n\r\ndef find(a: list[int], q: int) -> bool:\r\n i = find_lower(a, q)\r\n return i >= 0 and a[i] == q\r\n\r\n\r\ndef find_lower(a: list[int], x: int) -> int:\r\n \"\"\"max i: a[i] <= x\"\"\"\r\n l = -1 # a[l] <= x\r\n r = len(a) # a[r] > x\r\n while r > l + 1:\r\n m = (l + r) // 2\r\n if a[m] <= x:\r\n l = m\r\n else:\r\n r = m\r\n\r\n return l\r\n\r\n\r\ndef find_upper(a: list[int], x: int) -> int:\r\n \"\"\"min i: a[i] >= x\"\"\"\r\n l = -1\r\n r = len(a)\r\n while l + 1 < r:\r\n m = (l + r) // 2\r\n if a[m] >= x:\r\n r = m\r\n else:\r\n l = m\r\n\r\n return r\r\n\r\n\r\ndef print_matrix(graph: dict[list[int]]) -> None:\r\n for row in graph.values():\r\n sys.stdout.write(\" \".join(str(x) for x in row))\r\n sys.stdout.write(\"\\n\")\r\n\r\n\r\ndef print_answer(flag: bool) -> None:\r\n sys.stdout.write(\"YES\\n\") if flag else sys.stdout.write(\"NO\\n\")\r\n\r\n\r\ndef solve() -> bool:\r\n input = sys.stdin.readline\r\n n, m = map(int, input().split())\r\n graph = {}\r\n for i in range(1, n + 1):\r\n graph[i] = [0] * (n + 1)\r\n flag = True\r\n while m > 0 and flag:\r\n m -= 1\r\n u, v = map(int, input().split())\r\n if u == v or graph[u][v] > 0:\r\n flag = False\r\n graph[u][v] += 1\r\n graph[v][u] += 1\r\n\r\n return flag\r\n\r\n\r\nMOD = 10 ** 9 + 7\r\n\r\n\r\ndef find_kill_count(n: int) -> int:\r\n kill_count = 0\r\n kill_count += n * (n + 1) * (n + n + 1) // 6\r\n kill_count += n * (n - 1) * (n + 1) // 3\r\n return (kill_count * 2022) % MOD\r\n\r\n\r\ndef find_instability(array: list[int], n: int) -> int:\r\n array.sort()\r\n return min(array[n - 1] - array[1], array[n - 2] - array[0])\r\n\r\n\r\ndef find_cost(array: list[int], n: int) -> (int, int):\r\n min_cost, t_answ = float('inf'), 100\r\n for t in range(1, 101):\r\n cost = 0\r\n for stick in array:\r\n cost += min(abs(stick - t), min(abs(stick - t - 1), abs(stick - t + 1)))\r\n if cost <= min_cost:\r\n min_cost = cost\r\n t_answ = t\r\n return t_answ, min_cost\r\n\r\n\r\ndef find_max_diff(array: list[int], n: int, k: int) -> int:\r\n e = array.count(1)\r\n s = array.count(-1)\r\n max_diff = 0\r\n for i in range(n):\r\n index = i\r\n e_count = e\r\n s_count = s\r\n while index < n:\r\n if array[index] == 1:\r\n e_count -= 1\r\n else:\r\n s_count -= 1\r\n index += k\r\n index = i - k\r\n while index > -1:\r\n if array[index] == 1:\r\n e_count -= 1\r\n else:\r\n s_count -= 1\r\n index -= k\r\n max_diff = max(max_diff, abs(e_count - s_count))\r\n\r\n return max_diff\r\n\r\n\r\ndef find_house_and_flat(n: int, array: list[int], mails: list[int]) -> None:\r\n sum_ = 0\r\n idx = 0\r\n for mail in mails:\r\n while sum_ + array[idx] < mail:\r\n sum_ += array[idx]\r\n idx += 1\r\n sys.stdout.write(f\"{idx + 1} {mail - sum_}\\n\")\r\n\r\n\r\ndef main():\r\n input = sys.stdin.readline\r\n n, m = map(int, input().split())\r\n houses = list(map(int, input().split()))\r\n mails = list(map(int, input().split()))\r\n find_house_and_flat(n, houses, mails)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n \r\n def which(room):\r\n loc = bisect_left(P, room)\r\n room_id = room - P[loc - 1]\r\n return loc, room_id\r\n\r\n n, q = map(int, input().split())\r\n dorm = list(map(int, input().split()))\r\n queries = list(map(int, input().split()))\r\n\r\n P = list(accumulate(dorm, initial=0))\r\n for room_num in queries:\r\n print(*which(room_num))\r\n\r\ndef main():\r\n solve()\r\n\r\nif __name__ == \"__main__\":\r\n main()" ]

[ "def read_data():\r\n n, m = map(int, list(input().strip().split()))\r\n a = list(map(int, list(input().strip().split())))\r\n return n, m, a\r\n \r\ndef get_modinv(m):\r\n modinv = [-1 for _ in range(m+1)]\r\n modinv[1] = 1\r\n for i in range(2,m+1):\r\n modinv[i] = (-(div//i) * modinv[div%i]) % div\r\n return modinv\r\n \r\ndef partitions(n,k):\r\n if k >n :\r\n return 0\r\n val = 0\r\n sign = 1\r\n if k%2 == 1:\r\n sign = -1\r\n for i in range(k+1):\r\n v = (fact[k] * factinv[i] * factinv[k-i] * pow(i,n,div)) % div\r\n val += v * sign\r\n val %= div\r\n sign *= -1\r\n val *= factinv[k]\r\n return val % div\r\n \r\ndef solve():\r\n modinv = get_modinv(n+1)\r\n for i in range(1,n+2):\r\n fact.append(fact[-1]*i%div)\r\n factinv.append(factinv[-1] * modinv[i] % div)\r\n return ((partitions(n,k) + (n-1)*partitions(n-1,k))*sum(a)) % div\r\n \r\ndiv = 10**9 + 7\r\nn, k, a = read_data()\r\nfact, factinv = [1], [1]\r\nprint(solve())" ]

[ "import sys \r\ninput = sys.stdin.readline \r\nfrom collections import Counter , defaultdict\r\ndef instr():\r\n return input()[:-1]\r\nimport math \r\n############################\r\nw = instr()\r\nc = Counter(w)\r\nf = sum(x%2 != 0 for x in c.values())\r\nif f == 0 :\r\n print(\"First\")\r\nelse :\r\n print(\"First\" if f%2 != 0 else \"Second\")", "from sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef main():\r\n s = str_input()\r\n cnt = [0 for _ in range(26)]\r\n for ch in s:\r\n cnt[ord(ch)-ord('a')] += 1\r\n odd = 0\r\n for i in range(26):\r\n odd += cnt[i] & 1\r\n if odd == 0:\r\n print(\"First\\n\")\r\n elif len(s) & 1:\r\n print(\"First\\n\")\r\n else:\r\n print(\"Second\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "d = {chr(ord('a') + i) : 0 for i in range(26)}\r\ns = input()\r\nfor i in s:\r\n d[i] += 1 \r\no = 0\r\nfor i in d.keys():\r\n if(d[i] % 2):\r\n o += 1\r\n \r\nif(o % 2 or o == 0):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s=input()\r\nmydict={}\r\nfor i in s:\r\n if i not in mydict.keys():\r\n mydict[i]=1\r\n else:\r\n mydict[i]+=1\r\nmoves=0\r\nmylist=[]\r\nfor i in (mydict.keys()):\r\n mylist.append(mydict[i])\r\nodd=0\r\nfor i in range(len(mylist)):\r\n if mylist[i]%2!=0 and odd==0:\r\n odd+=1\r\n elif mylist[i]%2!=0:\r\n mylist[i]-=1\r\n moves+=1\r\nif moves%2==0:\r\n print('First')\r\nelse:\r\n print('Second')\r\n ", "\r\ndef is_p(s):\r\n res = True\r\n for i in range(int(len(s)//2) + 1):\r\n if s[i]!=s[len(s)-i-1]:\r\n res = False\r\n return res\r\n\r\ns = input()\r\n\r\nfrom collections import Counter\r\n\r\nd = Counter(s)\r\nc = 0\r\n\r\nfor i in d.values():\r\n if i%2!=0:\r\n c+=1\r\nc = max(c-1, 0)\r\nif c%2!=0:\r\n print('Second')\r\nelse:\r\n print('First')\r\n\r\n", "from collections import Counter\n# 1. figure out if current string is a palindrome\n# 1.1 palindrome, can have at most 1 odd letter and all other letters must be even\n# 2. remove letter in such a way as to not amke a plaindrome\n# 2.1 removing any even is the best strategy?\n# 3. If it is imporssible to do so, the opposite player wins\ns = input()\nc = Counter(s)\nodd = {}\nfor key, value in c.items():\n if value % 2 != 0:\n odd[key] = value\nn = len(odd)\nprint('Second' if (n > 1 and n % 2 == 0) else 'First')\n\n \n\n", "s=input()\r\nc=0\r\nflag=0\r\nfor i in set(s):\r\n if(s.count(i)%2!=0):\r\n c+=1\r\nc-=1\r\nif(c%2==0 or c<0):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s=input();x=sum(s.count(i)%2for i in s)\r\nprint(\"SFeicrosntd\"[x%2+(x<1)::2])", "x=input()\r\nans=dict()\r\nfor k in x:\r\n if k in ans:\r\n ans[k]+=1\r\n else:\r\n ans[k]=1\r\nodd=0\r\nfor key in ans:\r\n if ans[key]&1!=0:\r\n odd+=1\r\nif odd==1 or odd==0 or odd&1!=0:\r\n print('First')\r\nelse:\r\n print('Second')\r\n\r\n", "s = input()\r\nodd = 0\r\nc = []\r\nt = []\r\nfor elem in s:\r\n if not elem in c:\r\n c.append(elem)\r\n t.append(1)\r\n else:\r\n for j in range(len(c)):\r\n if c[j] == elem:\r\n t[j] += 1\r\n\r\nfor elem in t:\r\n if elem % 2 == 1:\r\n odd += 1\r\n\r\nif odd <= 1:\r\n print('First')\r\nelif odd % 2 == 0:\r\n print('Second')\r\nelse:\r\n print('First')\r\n", "s=input()\r\nlst= []\r\nfor i in s:\r\n if s.count(i)!=0:\r\n lst.append(s.count(i))\r\n s=s.replace(i,\"\")\r\nres = 0\r\nfor i in lst:\r\n if i%2==1:\r\n res+=1\r\nif res!=0:\r\n res-=1\r\nif res%2==0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "from collections import Counter\n\ncounter = Counter(input())\nodds = sum(v & 1 for v in counter.values())\nprint(\"First\" if odds == 0 or odds & 1 else \"Second\")\n", "import math\r\n\r\nletters = list(input())\r\n\r\ni = 0\r\nwhile i < len(letters):\r\n if letters.count(letters[i]) % 2 == 0:\r\n char = letters[i]\r\n del letters[letters.index(char)], letters[letters.index(char)]\r\n else:\r\n i+=1\r\n\r\nif len(letters) == 0 or len(letters) == 1:\r\n print(\"First\")\r\nelif len(letters) % 2 == 0:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "s = input()\r\na = set(s)\r\nl = list()\r\nfor i in a:\r\n q = s.count(i)\r\n if q % 2:\r\n l.append(i)\r\nif len(l) <= 1: print(\"First\")\r\nelif len(l) % 2: print(\"First\")\r\nelse: print(\"Second\")", "z1 = input()\r\n \r\nfreq_up = [0] * 26\r\nl=[]\r\nfor i in range(len(z1)):\r\n ch = ord(z1[i])\r\n \r\n freq_up[ch - 97] += 1\r\n \r\no=0\r\n \r\nfor i in z1:\r\n ch = ord(i)\r\n if i in l:\r\n continue\r\n l.append(i)\r\n if freq_up[ch - 97] % 2 !=0 :\r\n o+=1\r\n \r\nif o <= 1 or o % 2 != 0:\r\n print(\"First\") \r\nelse:\r\n print(\"Second\")", "\nfrom collections import Counter\n\ncnt = Counter(input())\n\nodd = 0\nfor x in cnt:\n odd += cnt[x] & 1\n\nprint(\"First\" if odd <= 1 or odd & 1 else \"Second\")\n", "a=list(input())\r\nprint((len(a))%2*'First',(1-(len(a))%2)*'Second',sep='') if len([i for i in list(set(a)) if a.count(i)%2==1])>1 else print('First')", "# ctjxzuimsxnarlciuynqeoqmmbqtagszuo\r\n#276B\r\ns = input()\r\nl = len(s)\r\ncheck = {}\r\nk = 1\r\nfor i in s:\r\n if i not in check.keys():\r\n check[i] = 1\r\n else: \r\n check[i]+= 1\r\nsorted(check.items(), key=lambda x:x[1]) \r\nc = flag = 0\r\nfor i,j in check.items():\r\n if (j%2 != 0):\r\n check[i] = j - 1\r\n flag = 1\r\n c+=1\r\n# print(check) \r\n# print(l,c)\r\nif (flag == 1):\r\n c-=1\r\nif (c%2 == 0):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\") \r\n", "s = list(input())\r\ncounter = 0\r\nwhile True:\r\n flag = True\r\n l = 0\r\n for i in set(s):\r\n if s.count(i) % 2 != 0:\r\n l += 1\r\n if l <= 1:\r\n break\r\n for i in set(s):\r\n if s.count(i) % 2 == 0:\r\n s.remove(i)\r\n flag = False\r\n break\r\n if flag:\r\n s.remove(s[0])\r\n counter += 1\r\nif counter % 2 == 0:\r\n print('First')\r\nelse:\r\n print('Second')", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\n\r\ns=input()\r\n\r\nd={}\r\n\r\nfor i in s:\r\n if i not in d:\r\n d[i]=0\r\n d[i]+=1\r\n\r\nodd=0\r\n\r\nfor i in d:\r\n if d[i]%2!=0:\r\n odd+=1\r\n\r\nif odd==0:\r\n print('First')\r\nelif odd%2==0:\r\n print('Second')\r\nelse:\r\n print('First')\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n#carpe diem \r\n#carpe diem", "l=input()\r\nk={}\r\nfor i in range(len(l)):\r\n if l[i] not in k.keys():\r\n k[l[i]]=1\r\n else:\r\n k[l[i]]=(k[l[i]]+1)%2\r\nres=sum(k.values())\r\nif res==0 or res%2==1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s = input()\r\nb = []\r\nfor i in s:\r\n if i not in b:\r\n if s.count(i)%2 != 0:\r\n b.append(i)\r\n\r\nm = len(b)-1\r\nif m>0:\r\n if(m%2 == 0):\r\n print(\"First\")\r\n else:\r\n print(\"Second\") \r\n \r\nelse:\r\n print(\"First\")\r\n\r\n\r\n", "s = input()\r\n#if odd length there can be one odd number\r\n#if even length there can be only even number\r\nseen = {}\r\ntot = 0\r\nfor l in s:\r\n if l not in seen:\r\n seen[l] = 1\r\n else:\r\n seen[l] += 1\r\n tot += 1\r\n\r\no, e = 0,0\r\nfor v in seen.values():\r\n if v % 2 == 0:\r\n e += 1\r\n else:\r\n o += 1\r\n\r\n#can be arranged into palindrom if one or less than one amount of chars with odd occurences\r\n#if there are two characters with odd occurences\r\n#abcc\r\nif o <= 1:\r\n print(\"First\")\r\nelif o%2 == 0:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "from collections import Counter\r\n# for _ in range(int(input())):\r\n # n=int(input())\r\n # n,m=map(int,input().split())\r\n # a=list(map(int,input().split()))\r\ns=input().strip()\r\nc=Counter(s)\r\nl=0\r\nfor i in c:\r\n if(c[i]&1):\r\n l+=1\r\nif(l&1 or l==0):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s = input()\r\n\r\nstore = {}\r\n\r\nfor i in s:\r\n if i in store:\r\n store[i] +=1\r\n else:\r\n store[i] = 1\r\n\r\nones = 0\r\ntwos = 0\r\n\r\nnumOdds = 0\r\n\r\nfor k, v in store.items():\r\n if v%2 != 0:\r\n numOdds +=1\r\n\r\nif numOdds == 1 or numOdds == 0:\r\n print(\"First\")\r\nelif numOdds%2 == 0:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "# https://codeforces.com/problemset/problem/276/B\nfrom collections import Counter\nword = input()\n\ndef is_palindrome(counts) -> bool:\n keys = len(counts.keys())\n length = sum(counts.values())\n odd_count = len([c for c in counts.values() if c % 2 == 1])\n\n if keys == 1:\n return True\n if length % 2 == 1 and odd_count == 1:\n return True\n if length % 2 == 0 and odd_count == 0:\n return True\n return False\n\ndef handle() -> str:\n counts = Counter(word)\n result = {\n 1: \"First\",\n 0: \"Second\"\n }\n result_bit = 1\n\n while not is_palindrome(counts):\n result_bit ^= 1\n move_made = False\n\n for key in list(counts.keys()):\n if move_made:\n break\n counts[key] -= 1\n if is_palindrome(counts):\n counts[key] += 1\n else:\n if counts[key] == 0:\n del counts[key]\n move_made = True\n\n if not move_made:\n return result[result_bit]\n return result[result_bit]\nprint(handle())", "from collections import Counter\r\nstring = input()\r\nstr_cnt = Counter(string)\r\nodds = [v for v in str_cnt.values() if v % 2 != 0]\r\noddCount = len(odds)\r\nif oddCount == 0:\r\n print(\"First\")\r\nelif (oddCount - 1) % 2 == 0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "s=str(input());arr=[0]*26;o=0\r\nfor e in s :arr[ord(e)-ord('a')]+=1\r\nfor e in arr:\r\n if e%2!=0:o+=1\r\nif o==0 or o%2!=0:print(\"First\")\r\nelse :print(\"Second\")", "import sys\r\nfrom collections import Counter\r\n\r\ndef main() -> None:\r\n read = sys.stdin.readline\r\n values = read().strip()\r\n turn = 'First'\r\n count: dict[str, int] = Counter(values)\r\n odd_keys = []\r\n for k, cnt in count.items():\r\n if cnt % 2 != 0:\r\n odd_keys.append(k)\r\n\r\n if not odd_keys:\r\n print(turn)\r\n else:\r\n turns_needed = len(odd_keys) - 1\r\n if turns_needed % 2 == 0:\r\n print(turn)\r\n else:\r\n print('Second')\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\na = input()\r\ndict_count,ans = {},0\r\nfor i in range(len(a)):\r\n if a[i] in dict_count:\r\n dict_count[a[i]] += 1\r\n else:\r\n dict_count[a[i]] = 1\r\n\r\nfor i in dict_count:\r\n if dict_count[i] % 2 == 1:\r\n ans += 1\r\n\r\nif ans == 0 or ans == 1:\r\n print(\"First\")\r\nelif ans%2 == 0:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "info = dict()\r\nstring = input()\r\nfor i in string:\r\n info[i] = info.get(i, 0) + 1\r\ncounter = 0\r\nfor key,value in info.items():\r\n if value%2 == 1:\r\n counter += 1\r\nif counter == 0 or counter == 1:\r\n print('First')\r\nelif counter%2 == 0:\r\n print('Second')\r\nelse:\r\n print('First')", "a = input()\r\nlist_ = []\r\nk = 0\r\nfor i in a:\r\n if i not in list_:\r\n list_.append(i)\r\n if a.count(i) % 2 == 1:\r\n k += 1\r\nif k == 0:\r\n print(\"First\")\r\nelif k % 2 == 0:\r\n print(\"Second\")\r\nelif k % 2 == 1:\r\n print(\"First\")\r\n", "from collections import Counter\ns = list(map(str, input()))\nc = Counter(s)\ncnt = 0\nfor i in c.values():\n cnt += i % 2\nprint(\"First\" if cnt % 2 or cnt == 0 else \"Second\")", "s=input()\r\nb=list(s)\r\nb=list(set(b))\r\nl=[]\r\nfor i in b:\r\n l.append(s.count(i))\r\na=0\r\nfor i in l:\r\n if i%2!=0:\r\n a=a+1\r\nif a==0:\r\n print(\"First\")\r\nelse:\r\n if (a-1)%2!=0:\r\n print(\"Second\")\r\n else:\r\n print(\"First\")\r\n", "s = input()\nd = {}\nfor i in s:\n d[i] = d.get(i, 0) + 1\nodds = list([i for i in d.values() if i % 2])\nevens = list([i for i in d.values() if i % 2 == 0])\nif len(odds) <= 1:\n print(\"First\")\nelif len(odds) % 2 == 0:\n print(\"Second\")\nelse:\n print(\"First\")\n", "import collections as cl\r\ncnt_s = cl.Counter(input())\r\n\r\nk = 0\r\nfor i in cnt_s.values():\r\n if i % 2 == 1:\r\n k += 1\r\n\r\nif k < 2:\r\n print(\"First\")\r\nelif k % 2 == 0:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n\r\n\r\n", "from collections import Counter\r\ns = input()\r\nc = Counter(s)\r\n\r\nnum_odds = sum(1 & c[k] for k in c)\r\n\r\nif num_odds == 0 or num_odds % 2 == 1:\r\n print('First')\r\nelse:\r\n print('Second')\r\n\r\n\r\n", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n s = input()\r\n s = ''.join(sorted(s))\r\n mp = {}\r\n for i in range(0, len(s)):\r\n if s[i] not in mp:\r\n mp[s[i]] = 1\r\n else:\r\n mp[s[i]] += 1\r\n\r\n First = False\r\n i = 0\r\n while True:\r\n count = 0\r\n for key, value in mp.items():\r\n if value % 2 != 0:\r\n count += 1\r\n if i % 2 == 0:\r\n First = True\r\n else:\r\n First = False\r\n mp[s[i]] -= 1\r\n i += 1\r\n if count <= 1:\r\n break\r\n \r\n if First:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n\r\n\r\n \r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "from collections import Counter\r\nmp = Counter(input())\r\n\r\nodd = 0\r\nfor c in mp:\r\n if mp[c] % 2 == 1:\r\n odd += 1\r\n\r\nif odd <= 1 or odd % 2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "from collections import Counter\r\ns=Counter(input()).values()\r\nif len([i for i in s if i%2])<2:print('First');quit()\r\nprint('SFeicrosntd'[len([i for i in s if i%2])%2::2])", "s = input()\r\n\r\nfreq = dict()\r\nfor ele in s:\r\n if(ele not in freq):\r\n freq[ele] = 1 \r\n else:\r\n freq[ele] += 1\r\nc = 0\r\nfor v in freq.values():\r\n if(v%2==1):\r\n c+=1 \r\nif(c==0):\r\n print(\"First\")\r\nelif(c%2==1):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n ", "from collections import Counter\n\n\na=(input())\nx=0\nc=Counter(list(a))\nfor i in c.values():\n if i%2!=0:\n x+=1\nif x==0:\n print(\"First\")\nelif x%2==1:\n print(\"First\")\nelse:\n print(\"Second\")", "s = input()\r\nd_s = dict()\r\nfor i in s:\r\n d_s[i] = d_s.get(i, 0)+1\r\ncnt = 0\r\nfor i in d_s:\r\n if d_s[i]%2==1:\r\n cnt+=1\r\nif cnt==0 or cnt%2==1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "#python 3.7.1\r\n#import numpy as np\r\nstring = input()\r\ncount_list = [0]*26 #np.zeros(26 , dtype=int )\r\nlenn = len(string)\r\n\r\nfor i in range(lenn):\r\n count_list[ord(string[i])-97]+= 1 \r\n \r\nodd =0 \r\nfor i in range(26):\r\n if(count_list[i]%2 != 0):\r\n odd += 1\r\n\r\nif( odd == 1 or odd == 0 or odd%2 != 0 ): \r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "# import sys\n# input = sys.stdin.readline\nar=lambda:list(map(int,input().split()))\nI=lambda:map(int,input().split())\nfrom collections import defaultdict\nimport bisect\nfrom collections import Counter\nfrom queue import PriorityQueue\n\n\ns=input()\nd=defaultdict(int)\nfor i in s:\n d[i]+=1\nc=0;ok=False\nfor i in d.values():\n if i%2!=0:\n if not ok:\n ok =True\n else:\n c+=1\nprint(\"Second\" if c%2 else \"First\")\n\n\n\n\n\n\n\n\n\n\n\n\n \t \t \t\t\t \t\t\t\t \t \t\t\t \t\t", "s=input()\r\np=set(s)\r\nd={}\r\nnoofodds=0\r\nfor i in p:\r\n d[i]=s.count(i)\r\nfor i in d:\r\n if d[i]%2==1:\r\n noofodds+=1\r\nif noofodds==0 or noofodds%2==1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "'''\r\n* author: Adham0 \r\n* created: 19.08.2023 02:53:02\r\n \r\n* █████ ██████ ██ ██ █████ ███ ███ \r\n* ██ ██ ██ ██ ██ ██ ██ ██ ████ ████ \r\n* ███████ ██ ██ ███████ ███████ ██ ████ ██ \r\n* ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n* ██ ██ ██████ ██ ██ ██ ██ ██ ██ \r\n'''\r\n\r\nfrom collections import Counter\r\n\r\ns = input()\r\n\r\ncon = Counter(s)\r\nval = con.values()\r\no = len(list(filter(lambda x: x & 1 == 1, val)))\r\n\r\nif o == 0 or o % 2 == 1:\r\n print('First')\r\nelse:\r\n print('Second')", "from collections import Counter\r\ns = Counter(list(input()))\r\nodd = 0\r\nfor i in s.values():\r\n odd += i&1\r\n\r\nif odd <= 1:\r\n print(\"First\")\r\nelif odd%2 == 0:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "'''\r\n* author: Adham0 \r\n* created: 19.08.2023 03:00:42\r\n \r\n* █████ ██████ ██ ██ █████ ███ ███ \r\n* ██ ██ ██ ██ ██ ██ ██ ██ ████ ████ \r\n* ███████ ██ ██ ███████ ███████ ██ ████ ██ \r\n* ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n* ██ ██ ██████ ██ ██ ██ ██ ██ ██ \r\n'''\r\n\r\nfrom collections import Counter ; s = input() ; print('First') if len(list(filter(lambda x: x & 1 == 1, Counter(s).values()))) == 0 or len(list(filter(lambda x: x & 1 == 1, Counter(s).values()))) % 2 == 1 else print('Second')", "s = input()\r\n\r\nl = [0]*26\r\nfor x in range(26):\r\n l[x] = s.count(chr(x+97))\r\nb = [x for x in l if x % 2 != 0]\r\nif len(b) == 0 or len(b) % 2 == 1:\r\n print('First')\r\nelse:\r\n print('Second')", "a=input()\nx=0 \no=0\nl1=[]\nfor i in range(30):\n l1.append(0)\nl=len(a)\nfor i in range(l):\n l1[ord(a[i])-ord('a')]+=1 \nfor i in range(26):\n if((l1[i]&1)!=0):\n o+=1 \nif((o==0) or ((o&1)!=0)):\n print(\"First\")\nelse:\n print(\"Second\")\n \t \t \t\t\t\t \t \t\t\t\t\t\t \t\t\t \t", "s = list(input())\n\nl = {}\n\npairs = 0\n\nfor i in range(len(s)):\n if s[i] not in l:\n l[s[i]] = 1\n else:\n l[s[i]] += 1\n if l[s[i]] % 2 == 0:\n pairs += 1\n\nle = pairs * 2\n\nif le < len(s):\n le += 1\n\nturns = len(s) - le\n\nif turns % 2 == 0:\n print('First')\nelse:\n print('Second')\n", "st = input()\r\nmp = dict()\r\nfor i in range(1,27):\r\n mp[chr(96+i)] = 0\r\n\r\nfor i in st:\r\n mp[i]+=1\r\n\r\nodd = 0\r\nfor i in mp:\r\n if(mp[i]%2 == 1 ):\r\n odd+=1\r\n\r\nif(odd%2 == 0 and odd != 0 ):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "s = input()\r\nletters = {}\r\nfor i in s:\r\n if i in letters:\r\n letters[i] += 1\r\n else:\r\n letters[i] = 1\r\ngame = True\r\nlength = len(s)\r\ntimes = 0\r\nwhile game:\r\n odds = 0\r\n for i in letters:\r\n if letters[i] % 2 == 1:\r\n odds += 1\r\n if (length % 2 == 0 and odds == 0) or (length % 2 == 1 and odds <= 1):\r\n game = False\r\n else:\r\n times += 1\r\n evenTaken = False\r\n length -= 1\r\n for i in letters:\r\n if letters[i] % 2 == 0:\r\n letters[i] -= 1\r\n evenTaken = True\r\n break\r\n if evenTaken == False:\r\n for i in letters:\r\n letters[i] -= 1\r\n if letters[i] == 0:\r\n letters.pop(i)\r\n break\r\nif times % 2 == 0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "import sys\ninput = sys.stdin.readline\n\ncc = [0]*(25+1)\nfor c in input().rstrip() :\n\tcc[ord(c)-97] += 1\n\ndef fCEO() :\n\tec, oc = 0, 0\n\tfor e in cc :\n\t\tif e&1 : oc += 1\n\t\telif e != 0 : ec += 1\n\treturn ec, oc\n\t\t\niF = True\nwhile True :\n\tec, oc = fCEO()\n\tif oc <= 1 :\n\t\tprint([\"Second\", \"First\"][iF])\n\t\texit(0)\n\t\n\tif oc&1 :\n\t\tfor i in range(26) :\n\t\t\tif cc[i]&1 : \n\t\t\t cc[i]-=1\n\t\t\t break\n\t\n\telse :\n\t\tif ec > 0 :\n\t\t\tfor i in range(26) :\n\t\t\t if cc[i]%2==0 and cc[i]>0 :\n\t\t\t \tcc[i]-=1\n\t\t\t \tbreak\n\t\t\t \n\t\telse :\n\t\t for i in range(26) :\n\t\t\t if cc[i]&1 :\n\t\t\t \tcc[i]-=1\n\t\t\t \tbreak\n\tiF = not iF", "s = input()\r\nif len(s) % 2 == 1:\r\n print(\"First\")\r\nelse:\r\n char_count = {}\r\n for char in s:\r\n if char in char_count:\r\n char_count[char] += 1\r\n else:\r\n char_count[char] = 1\r\n odd = 0\r\n for count in char_count.values():\r\n if count % 2 == 1:\r\n odd = 1\r\n break\r\n if odd == 0:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n", "s=input()\r\nlength=len(s)\r\nm=dict()\r\nfor i in range(length):\r\n if s[i] in m:\r\n m[s[i]]+=1\r\n else:\r\n m[s[i]]=1\r\nfor i in range(length):\r\n even=0\r\n odd=0\r\n l=list(m.values())\r\n odd= len(list(filter(lambda x: (x%2) , l)))\r\n even=len(list(filter(lambda x: (x%2==0) , l)))\r\n if odd==1 or odd==0:\r\n if i%2==0:\r\n print('First')\r\n break\r\n else:\r\n print('Second')\r\n break\r\n else:\r\n deleted=0\r\n for item in m.keys():\r\n if m[item]%2==0 and m[item]!=0:\r\n m[item]-=1\r\n deleted=1\r\n break\r\n if deleted==0:\r\n for item in m.keys():\r\n if m[item]!=0:\r\n m[item]-=1\r\n deleted=1\r\n break", "from collections import defaultdict\r\n\r\ndef solve(s):\r\n d=defaultdict(int)\r\n for i in s:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\n \r\n f=0\r\n for i in d:\r\n if d[i]%2:\r\n f+=1\r\n if f==0 or f%2:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n\r\n\r\nsolve(input())", "s=input();a=0\r\nfor i in s:\r\n\tif s.count(i)%2:\r\n\t\ta+=1\r\nif a==0 or a%2:print('First')\r\nelse:print('Second')", "import sys\r\ns = input()\r\n\r\nv = [0]*26\r\n\r\nfor i in s:\r\n ind = ord(i) - ord(\"a\")\r\n v[ind] += 1\r\nk = 0\r\nfor i in range(26):\r\n if v[i]%2 != 0:\r\n k += 1\r\n\r\nif k == 0 or k == 1:\r\n print(\"First\")\r\n sys.exit(0)\r\n\r\nif k > 1:\r\n if k%2 == 0:\r\n print(\"Second\")\r\n sys.exit(0)\r\n else:\r\n print(\"First\")\r\n sys.exit(0)\r\n", "s=input()\r\ndict1={}\r\na,b=0,0\r\nfor x in s:\r\n if x in dict1:\r\n dict1[x]+=1\r\n else:\r\n dict1[x]=1\r\nfor x in dict1.values():\r\n if x%2==0:\r\n a+=x\r\n else:\r\n b+=1\r\nif b<=1:\r\n print('First')\r\nelse:\r\n if (a+b)%2==0:\r\n print('Second')\r\n else:\r\n print('First')", "from collections import Counter\nfrom itertools import permutations\n\ndef main():\n s = input()\n odds = sum(1 for x in Counter(s).values() if x % 2)\n if odds <= 1:\n print('First')\n else:\n print('Second' if odds % 2 == 0 else 'First')\n\n\nmain()\n", "string = input()\r\ndict = {}\r\nfor char in string:\r\n count = 1\r\n if char not in dict.keys():\r\n\r\n dict[char] = count\r\n else:\r\n dict[char] = dict[char]+1\r\n\r\n\r\na = sum(i % 2 for i in dict.values())\r\nif a % 2 or a == 0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "from collections import Counter\n# 1. figure out if current string is a palindrome\n# 1.1 palindrome, can have at most 1 odd letter and all other letters must be even\n# 2. remove letter in such a way as to not amke a plaindrome\n# 2.1 removing any even is the best strategy?\n# 3. If it is imporssible to do so, the opposite player wins\ns = input()\nc = Counter(s)\neven = {}\nodd = {}\nfor key, value in c.items():\n if value % 2 == 0:\n even[key] = value\n else:\n odd[key] = value\ni = 0\nwhile True:\n if len(odd) <= 1: \n print('First' if i % 2 == 0 else 'Second')\n break\n if even:\n key, value = even.popitem()\n odd[key] = value - 1\n else:\n key, value = odd.popitem()\n if value > 1:\n even[key] = value - 1\n i += 1\n\n \n\n", "s=input()\r\nst=set(s)\r\ncnt=0\r\nfor i in st:\r\n if s.count(i)%2!=0:\r\n cnt+=1\r\nif cnt==0:\r\n print(\"First\")\r\nelif cnt%2==1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "li = list(input())\r\nnDict = {}\r\nfor letter in li :\r\n if letter not in nDict : nDict[letter] = 1\r\n else : nDict[letter] += 1\r\ncount = 0\r\nfor num in nDict.values() : count += (num % 2) * num\r\nprint(\"First\" if count % 2 != 0 or count == 0 else \"Second\")", "s=input()\r\na=dict()\r\nc=0\r\nfor i in s:\r\n if i in a:a[i]+=1\r\n else:a[i]=1\r\nfor i in a:\r\n if(a[i]%2!=0):c+=1\r\nprint(\"First\" if c<=1 or c%2==1 else \"Second\")", "def main() :\r\n string = input()\r\n d = {}\r\n for i in string :\r\n if i in d :\r\n d[i] += 1\r\n else :\r\n d[i] = 1\r\n odd = 0\r\n for i in d :\r\n if d[i] % 2 != 0 :\r\n odd+=1\r\n if odd == 0 or odd % 2 != 0 :\r\n print('First')\r\n else :\r\n print('Second') \r\n \r\n\r\n\r\nmain()", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom typing import Counter\nfrom bisect import bisect_right, bisect_left\nimport math\nhpop = heappop\nhpush = heappush\n\"\"\"\n num = int(input())\n arr = list(map(int, input().split()))\n a,b = map(int, input().split())\n graph = defaultdict(list)\n for i in range(#)\n graph[a].append(b)\n graph[b].append(a)\n MOD = 10**9 + 7\n\"\"\"\ndef solution():\n freq = Counter(input())\n count = 0\n for lt in freq:\n count += freq[lt] % 2\n if count == 0 or count % 2 == 1:\n print(\"First\")\n else:\n print(\"Second\")\n\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n \nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n#main()\n", "s=input()\nx=0\na=[]\nfor i in range(27):\n a.append(0)\nfor i in range(len(s)):\n a[ord(s[i])-97]+=1\nfor k in a:\n if k%2==1:\n x+=1\nif x==0 or x%2==1:\n print(\"First\")\nelse:\n print(\"Second\")\n\n \t \t\t\t \t\t\t \t \t\t \t\t\t \t\t\t \t \t", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\ns=ns()\r\nans=\"First\"\r\nans1=\"Second\"\r\nl=Counter()\r\nfor x in range(len(s)):\r\n l[s[x]]+=1\r\nnt1=[]\r\nsm=0\r\nfor x in l:\r\n if l[x]%2==1:\r\n nt1.append(l[x])\r\n else:\r\n sm+=l[x]\r\nif len(nt1)==0 or len(nt1)==1:\r\n print(ans)\r\nelse:\r\n nt1.sort()\r\n sm+=sum(nt1[2:])\r\n if sm%2==0:\r\n print(ans1)\r\n else:\r\n print(ans)\r\n\r\n", "s = input()\r\nt = sum([s.count(c)%2 for c in s])\r\nif (t==0 or t==1 or (t%2)):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\") \r\n", "'''\r\n* author: Adham0 \r\n* created: 19.08.2023 02:54:52\r\n \r\n* █████ ██████ ██ ██ █████ ███ ███ \r\n* ██ ██ ██ ██ ██ ██ ██ ██ ████ ████ \r\n* ███████ ██ ██ ███████ ███████ ██ ████ ██ \r\n* ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n* ██ ██ ██████ ██ ██ ██ ██ ██ ██ \r\n'''\r\n\r\nfrom collections import Counter\r\n\r\no = len(list(filter(lambda x: x & 1 == 1, Counter(input()).values())))\r\n\r\nif o == 0 or o % 2 == 1:\r\n print('First')\r\nelse:\r\n print('Second')", "s = input()\r\n\r\nd = {}\r\nfor i in s:\r\n if d.get(i) is None: d[i] = 1\r\n else: d[i] += 1\r\n\r\np = 1\r\n\r\nwhile True:\r\n odds = 0\r\n for i in d.values():\r\n if i % 2 == 1: odds += 1\r\n if odds < 2: break\r\n\r\n f = False\r\n \r\n for i in d.keys():\r\n if d[i] % 2 == 0:\r\n d[i] -= 1\r\n f = True\r\n break\r\n if not(f): \r\n for i in d.keys():\r\n if d[i] % 2 == 1:\r\n d[i] -= 1\r\n if d[i] == 0: del d[i]\r\n break\r\n \r\n p = 3 - p\r\n\r\nprint('First' if p == 1 else 'Second')\r\n", "from typing import Counter\r\ns = input()\r\ndata = Counter(s)\r\norg_len = len(s)\r\nnew_len = 0\r\nfor x in data:\r\n if data[x] % 2 == 0:\r\n new_len += data[x]\r\nnew_len += 1 if org_len > new_len else 0\r\nprint(\"Second\" if (org_len - new_len) % 2 else \"First\")", "def is_palidrom(s):\r\n d = set(s)\r\n c = 0\r\n for i in d:\r\n f = s.count(i)\r\n if f % 2 == 1:\r\n if c < 1:\r\n c += 1\r\n else:\r\n return False\r\n return True\r\n\r\na = input()\r\nif is_palidrom(a):\r\n print('First')\r\nelse:\r\n if len(a) % 2 == 0:\r\n print('Second')\r\n else:\r\n print('First')", "# Note: Key here is that the player can rearrange (I overlooked it for a while & was getting into optimal moves aread)\n# We know that if all the characters have even number of occurance then it can be a palindrome\n# We know that for the string to be palindrome there can be only 1 odd number of occurance of any character\n# Hence if either all even or just 1 odd then First player is winner\n# Else whoever end up bringing the number of odd to <= 1 will lose\n# Which means if number of char with odd occurance is even then 2nd wins & if odd then 1st wins\ns = input().lower()\nfreqTable = [0]*26\nfor ch in s:\n freqTable[ord(ch)-ord('a')] += 1\n\noddCount = 0\nfor num in freqTable:\n if num%2 == 1:\n oddCount += 1\n\nif oddCount <= 1:\n print(\"First\")\nelse:\n print(\"First\" if oddCount%2==1 else \"Second\")", "st=input() ; fre=[0]*(97+27)\r\nfor i in st:\r\n fre[ord(i)]+=1\r\nsm = 0\r\nfor i in fre[97:]: \r\n sm += (i%2)\r\nif sm <= 1 or sm&1: print(\"First\")\r\nelse: print(\"Second\")", "from collections import Counter\r\ncount = Counter(input())\r\nodd = 0\r\nfor c in count:\r\n odd += count[c]%2\r\nprint(\"First\" if (odd%2 or odd==0) else \"Second\")", "s=input()\r\nfreq=[0] * 26\r\nc=0\r\nc1=0\r\nfor i in range(len(s)):\r\n freq[ord(s[i]) - 97]+=1\r\n \r\nfor i in range(len(freq)):\r\n if freq[i] > 0 and freq[i]%2==0:\r\n c+=1 \r\n elif freq[i] > 0 and freq[i]%2==1:\r\n c1+=1\r\nif c1 % 2 == 0 and c1 != 0 :\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "s = list(input()); d = dict(); l = 0\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n l += 1\r\ncount = 0\r\nwhile(l > 0):\r\n odd = 0\r\n for i in d.values():\r\n if i % 2 != 0:\r\n odd += 1\r\n l -= 1\r\n if odd < 2:\r\n print(\"First\" if count % 2 == 0 else \"Second\"); break\r\n else:\r\n count += 1\r\n for i in d.items():\r\n if i[1] > 0:\r\n d[i[0]] -= 1; break", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\ns = input().strip()\r\n\r\nmp = collections.Counter(s)\r\nodd = sum(x&1 for x in mp.values())\r\nprint('First' if odd == 0 or odd & 1 else 'Second')\r\n\r\n# https://www.cnblogs.com/cszlg/archive/2013/02/26/2934279.html", "s=input()\r\nd={}\r\nfor i in s:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nflag=0\r\nfor i in d.keys():\r\n if d[i]%2==1:\r\n flag=1\r\n break\r\nif flag==0:\r\n print('First')\r\nelse:\r\n if len(s)%2==0:\r\n print('Second')\r\n else:\r\n print('First')", "s=input()\r\nd=dict()\r\nfor i in s:\r\n if i not in d:\r\n d[i]=0\r\n d[i]+=1\r\nlishn=0\r\na=True\r\nfor i in d:\r\n if d[i]%2==1:\r\n if a:\r\n a=False\r\n else:\r\n lishn+=1\r\nif lishn%2==0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "d={}\r\n\r\ns=input()\r\n\r\nfor i in range(len(s)):\r\n\r\n d[s[i]]=1+d.get(s[i],0)\r\n\r\n\r\nodd=0\r\n\r\nfor key in d:\r\n\r\n if(d[key]&1):\r\n odd+=1\r\n\r\nif(odd==0 or (odd&1)):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "from collections import Counter\r\ns = input()\r\nc = Counter(s)\r\n\r\nodds = 0\r\nfor k in c:\r\n if c[k] % 2 != 0:\r\n odds += 1\r\n\r\nif odds == 0 or odds % 2 != 0:\r\n print('First')\r\nelse:\r\n print('Second')", "from collections import Counter\r\ns=input()\r\nmp=Counter(s)\r\nodd=0\r\nfor i in mp.values():\r\n if i%2!=0:odd+=1\r\nif odd and odd%2==0:print(\"Second\")\r\nelse:print(\"First\")", "import math\r\n\r\n\r\ndef main_function():\r\n s = input()\r\n hash_counter = {}\r\n for i in s:\r\n if i in hash_counter:\r\n hash_counter[i] += 1\r\n else:\r\n hash_counter[i] = 1\r\n counter_odd = 0\r\n counter_even = 0\r\n for i in hash_counter:\r\n if hash_counter[i] % 2 == 0:\r\n counter_even += 1\r\n else:\r\n counter_odd += 1\r\n if counter_odd == 0:\r\n print(\"First\")\r\n else:\r\n if counter_odd % 2 == 1:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "from collections import Counter as cnt\r\ns=str(input())\r\nc,a=cnt(s),[]\r\nfor i in c:\r\n if c[i]%2:\r\n a.append(c[i])\r\nif len(a)<=0:\r\n print(\"First\")\r\nelse:\r\n x=len(a)-1\r\n if x%2:\r\n print(\"Second\")\r\n else:\r\n print(\"First\")", "s = input()\r\nst = set(s)\r\nl = []\r\nfor ele in st:\r\n x = s.count(ele)\r\n if x%2!=0:\r\n l.append(x)\r\n# print(l)\r\nif len(l) == 0 or len(l)%2!=0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "from collections import Counter\r\ns= input()\r\nc= 0\r\nx= Counter(s)\r\nfor i in x.items():\r\n if i[1] % 2 == 1:\r\n c += 1\r\nif c % 2 == 1 or c == 0 :\r\n print('First')\r\nelse:\r\n print('Second') ", "s = input()\r\nx = sum(s.count(i) % 2 for i in s)\r\nif x % 2 + (x < 1) == 0:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "s = input()\r\nfreq = [0]*(130)\r\nfor i in s:\r\n freq[ord(i)]+=1\r\nodd,even = 0,0\r\nfor i in freq:\r\n if i:\r\n if i%2:\r\n odd+=1\r\n else:\r\n even+=1\r\nn = odd-1+even*2\r\nif (not odd and even) or odd==1:\r\n print('First')\r\nelse:\r\n if n%2:\r\n print('Second')\r\n else:\r\n print('First')", "c = 0\ns = list(input())\nfor l in set(s):\n if s.count(l) % 2 == 0:\n c += 1\n\ns = len(set(s)) - c\n \nif s % 2 == 0:\n if s != 0:\n print(\"Second\")\n else:\n print(\"First\")\nelse:\n print(\"First\")\n\n\n\n \n\n", "import collections\r\nfrom collections import Counter\r\n\r\nl = list(input())\r\nd = Counter(l)\r\nmat = [len(l),len([i for i in list(d.values()) if i%2 == 1])]\r\nif mat[1] != 0 and mat[1]%2 == 0:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "s = input()\r\n\r\nfreq = {}\r\nfor i in s:\r\n freq[i] = freq.get(i, 0) + 1\r\n\r\n\r\nSum = 0 \r\nfor f in freq.values(): \r\n if f % 2 == 1:\r\n Sum+=f\r\n\r\nif Sum == 0 or Sum % 2 == 1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n ", "s=input()\r\nhmap={}\r\nn=len(s)\r\nfor item in s:\r\n hmap[item]=1+hmap.get(item,0)\r\n\r\nodd=0\r\nfor key,values in hmap.items():\r\n if values%2!=0:\r\n odd+=1\r\nif n%2==0 and odd>=1:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\") \r\n", "from collections import defaultdict\nstring = input()\nmap1 = defaultdict(int)\ncount = 0\nfor i in string:\n map1[i] += 1\nfor i in map1:\n if map1[i] % 2 != 0:\n count += 1\nif count < 2:\n print(\"First\")\nelif len(string) % 2 == 0:\n print(\"Second\")\nelif len(string) % 2 != 0:\n print(\"First\")\n", "from collections import Counter \r\nstring=list(input()) ; dic=Counter(string) ; odds=0\r\nfor i in dic:\r\n if dic[i]%2==1:\r\n odds+=1\r\nif odds%2==1 or odds==0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s = input()\r\na = [0 for i in range(26)]\r\n\r\nfor i in range(len(s)):\r\n\tt = ord(s[i])-ord('a')\r\n\tif(a[t] == 0):\r\n\t\ta[t] = 1\r\n\telse:\r\n\t\ta[t] = 0\r\n\r\ns = sum(a)\r\nif(s==1 or s==0):\r\n\tprint('First')\r\nelse:\r\n\tif(s%2 == 0):\r\n\t\tprint('Second')\r\n\telse:\r\n\t\tprint('First')\r\n\r\n", "n1 = input()\r\ndp = {}\r\nfor i in n1:\r\n if i not in dp:\r\n dp[i] = 1\r\n else:\r\n dp[i] += 1\r\n\r\ncount = 0\r\nfor i in dp.values():\r\n if i % 2 !=0 :\r\n count+=i\r\nif count == 0:\r\n print(\"First\")\r\nelse:\r\n if (count) % 2 == 0:\r\n print(\"Second\")\r\n else:\r\n print(\"First\")\r\n", "\r\ndef count_impair_occurence(s):\r\n nb = 0\r\n ch = s\r\n i = 0\r\n while(i < len(ch)):\r\n c = ch[i]\r\n while((ch.count(c)) % 2 == 1):\r\n nb = nb + 1\r\n ch = ch.replace(c, '', 1)\r\n if(i < len(ch)):\r\n c = ch[i]\r\n else:\r\n break\r\n i = i + 1\r\n\r\n return(nb)\r\n\r\n\r\ns = input()\r\nnb_move = 0\r\nwhile(count_impair_occurence(s) > 1):\r\n for i in range(len(s)):\r\n c = s[i]\r\n if(s.count(c) % 2 == 1):\r\n s = s.replace(c, '', 1)\r\n nb_move = nb_move + 1\r\n break\r\n\r\nif(nb_move % 2 == 0):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s = str(input())\r\nodd = 0\r\nhash = set()\r\nfor i in range(len(s)):\r\n if s.count(s[i]) % 2 != 0:\r\n odd += 1\r\n\r\nif odd % 2 != 0 or odd == 0 or odd == 1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s = sorted(input())\r\ncount = [1]\r\nn = 0\r\nfor i in range(1, len(s)):\r\n if s[i] != s[i - 1]:\r\n count.append(1)\r\n else:\r\n count[-1] += 1\r\nfor i in count:\r\n if i % 2 == 1:\r\n n += 1\r\nif n > 1:\r\n if n % 2 == 0:\r\n print(\"Second\")\r\n else:\r\n print(\"First\")\r\nelse:\r\n print('First')", "st = input()\r\nse = set(st)\r\nvalods = 0\r\nfor i in se:\r\n if st.count(i)%2 != 0:\r\n valods += 1\r\nif valods <= 1:\r\n print(\"First\")\r\nelif valods%2 == 0:\r\n print(\"Second\")\r\nelse :\r\n print(\"First\")", "s=input()\r\nhashmap={}\r\nfor i in s:\r\n if i in hashmap:\r\n hashmap[i]+=1\r\n else:\r\n hashmap[i]=1\r\nreq=0\r\nfor i in hashmap:\r\n if hashmap[i]%2==0:\r\n pass\r\n else:\r\n req+=1\r\nif req:\r\n req-=1\r\nif req%2==0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s=input()\r\nl=[(i,s.count(i)) for i in set(s) ]\r\ncount_=0\r\nfor i in l:\r\n if i[1]%2==1:\r\n count_+=1\r\nif count_%2==1 or count_==0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "s = list(input())\r\nx = True\r\n# print(len(s)//2)\r\ndt = {}\r\nfor i in s:\r\n\tif i in dt:\r\n\t\tdt[i] += 1\r\n\telse:\r\n\t\tdt[i] = 1\r\n\r\n#print(dt)\r\n# for key, val in dt.items():\r\n# \tprint(key, val, sep = \" \")\r\ncnt = 0\r\nx = True\r\nfor key, value in dt.items():\r\n\t#print(key, value, sep = \" \")\r\n\tif value%2 != 0 and cnt < 1:\r\n\t\tcnt += 1\r\n\telif value%2 != 0 and cnt >= 1:\r\n\t\tx = False\r\n\t\tbreak\r\n\t#print(x)\r\nif x:\r\n\tprint(\"First\")\r\nelif not x and len(s)%2 == 0:\r\n\tprint(\"Second\")\r\nelif not x and len(s)%2 != 0:\r\n\tprint(\"First\")\r\n\r\n", "s=input()\r\nn=len(s)\r\narr=[0]*26\r\nfor i in range(n):\r\n arr[ord(s[i])-97]+=1\r\nodds=0\r\nfor i in arr:\r\n if i&1:\r\n odds+=1\r\nif odds==1 or odds==0:\r\n print(\"First\")\r\nelif odds&1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "import math\r\nimport bisect\r\nimport collections\r\n\r\ndef is_palindrome(freq, size):\r\n num_letters_freq_odd = 0\r\n\r\n if size % 2 == 0:\r\n for key, value in freq.items():\r\n if value % 2 == 1:\r\n return False\r\n return True\r\n else:\r\n for key, value in freq.items():\r\n if value % 2 == 1:\r\n num_letters_freq_odd += 1\r\n if num_letters_freq_odd == 1:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\ndef main():\r\n s = input()\r\n size = len(s)\r\n freq = {}\r\n\r\n for ch in s:\r\n if ch not in freq:\r\n freq[ch] = 1\r\n else:\r\n freq[ch] += 1\r\n\r\n \r\n for i in range(0, 1010):\r\n if is_palindrome(freq, size):\r\n if i % 2 == 0:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n break\r\n else:\r\n letter_to_be_decreased = None\r\n largest_freq = -1\r\n for key, value in freq.items():\r\n if value > largest_freq:\r\n largest_freq = value\r\n letter_to_be_decreased = key\r\n freq[letter_to_be_decreased] -= 1\r\n if freq[letter_to_be_decreased] == 0:\r\n del freq[letter_to_be_decreased]\r\n size -= 1\r\n\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s=input()\ndic={}\nfor i in s:\n dic[i]=dic.get(i,0)+1\nok=False\ncnt=0\nfor i in dic.values():\n if i%2!=0:\n if not ok:\n ok=True\n else:\n cnt+=1\nif cnt%2:\n print(\"Second\")\nelse:\n print(\"First\")\n \t\t\t\t \t \t\t \t \t\t \t\t", "'''\r\nimport sys\r\n \r\n# Fast input\r\ninput = sys.stdin.readline\r\n \r\n# Fast output\r\ndef print(*args, **kwargs):\r\n sep = kwargs.get('sep', ' ')\r\n end = kwargs.get('end', '')\r\n file = kwargs.get('file', sys.stdout)\r\n flush = kwargs.get('flush', False)\r\n output = sep.join(map(str, args)) + end\r\n file.write(output)\r\n if flush:\r\n file.flush()\r\n'''\r\n\r\nfor _ in range(1):\r\n c=[]\r\n s=input()\r\n l=list(s)\r\n x=0\r\n for i in set(l):\r\n c.append(l.count(i))\r\n for i in c:\r\n if i%2==1:\r\n x+=1\r\n if x==0 or x==1:\r\n print(\"First\")\r\n elif len(s)%2==0:\r\n print(\"Second\")\r\n else:\r\n print(\"First\")\r\n", "def defaultDictCount(arr):\n\tdic = {}\n\tfor x in arr:\n\t\ttry:\n\t\t\tdic[x] += 1\n\t\texcept:\n\t\t\tdic[x] = 1\n\t\n\treturn [x%2 for x in dic.values()]\n\ndef state(s):\n\tx = defaultDictCount(s)\n\tif sum(x) < 2:\n\t\treturn 1\n\telse:\n\t\tif sum(x) % 2 == 0:\n\t\t\treturn 2\n\t\telse:\n\t\t\treturn 1\n\ns = input()\n# s = \"aba\"\n# s = \"abca\"\n# s = \"abcabz\"\n# s = \"abzdce\"\nif state(s) == 1:\n\tprint(\"First\")\nelse:\n\tprint(\"Second\")\n\n \t \t \t\t \t \t\t\t \t\t\t\t\t \t \t\t", "\nfrom collections import Counter\n\ndef count_odd(cnt: Counter) -> int:\n odd = 0\n for x in cnt:\n odd += cnt[x] & 1\n return odd\n\ncnt = Counter(input())\n\nmap = [\"First\", \"Second\"]\n\nturn = 0\n\nwhile cnt:\n\n odd = count_odd(cnt)\n\n if odd < 2:\n break\n \n if odd == len(cnt):\n for x in cnt.keys():\n if cnt[x] & 1:\n cnt[x] -= 1\n if cnt[x] == 0:\n cnt.pop(x)\n break\n else:\n for x in cnt:\n if cnt[x] & 1 == 0:\n cnt[x] -= 1\n break\n\n turn ^= 1\n\nprint(map[turn])", "A={}\r\nfor i in input():\r\n try:A[i]+=1\r\n except:A[i]=1\r\na=len(list(filter(lambda x:x%2==1,A.values())))\r\nprint([\"Second\",\"First\"][a%2+(a<1)])", "s = input(); o = 0 \r\nfor i in range(len(s)) : \r\n if s.count(s[i]) % 2 : o+=1\r\nif (o-1)%2 and o: print('Second')\r\nelse : print('First')", "n=input()\r\na=0\r\nfor i in set(n):\r\n if n.count(i)%2!=0:\r\n a+=1\r\nif a == 0 or a == 1:\r\n print(\"First\")\r\nelse:\r\n if (a-1)%2==0:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n ", "n = input()\r\ns = {}\r\nfor i in range(len(n)):\r\n if n[i] in s:\r\n s[n[i]] += 1\r\n else:\r\n s[n[i]] = 1\r\nkl = 0\r\nch = -1\r\nfor k in s:\r\n if s[k] % 2 != 0:\r\n ch = 1\r\n kl += 1\r\nif ch == 1:\r\n kl -= 1\r\nif kl % 2 == 0:\r\n print('First')\r\nelse:\r\n print('Second')", "s=input()\r\nk=0\r\nfor c in set(s):\r\n if s.count(c)%2==1:\r\n k+=1\r\nif k==0 or k%2==1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "def min_palindrome_cost(s):\r\n freq = {}\r\n for char in s:\r\n freq[char] = freq.get(char, 0) + 1\r\n\r\n odd_count = 0\r\n for count in freq.values():\r\n if count % 2 == 1:\r\n odd_count += 1\r\n\r\n return max(odd_count - 1, 0)\r\n\r\n\r\n# Read input\r\ns = input().strip()\r\n\r\n# Calculate and print the minimum cost\r\nresult = min_palindrome_cost(s)\r\n\r\nif result == 0 or result%2 == 0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s=input()\r\nmap=[0]*27\r\nfor i in s:\r\n map[ord(i)-ord('a')]+=1\r\nwin=0\r\nwhile(1):\r\n odd=0\r\n even=0\r\n for i in range(27):\r\n if map[i]&1:\r\n odd+=1\r\n elif map[i]!=0 and map[i]%2==0:\r\n even+=1\r\n if odd==0 or odd-1==0:\r\n winner=win\r\n break\r\n else:\r\n win^=1\r\n flag=False\r\n if odd>2:\r\n for i in range(27):\r\n if map[i]&1:\r\n map[i]-=1\r\n break\r\n else:\r\n for i in range(27):\r\n if map[i]!=0 and map[i]%2==0:\r\n map[i]-=1\r\n flag=True\r\n break\r\n if not flag:\r\n for i in range(27):\r\n if map[i]&1:\r\n map[i]-=1\r\n flag=True\r\n break\r\n\r\nh={0:'First',1:'Second'}\r\nprint(h[winner])\r\n", "from collections import Counter\r\ns=input()\r\nd=Counter(s)\r\nc=0\r\nfor i in d:\r\n if d[i]%2!=0:\r\n c+=d[i]\r\nval=\"First\" if (c<=1 or c%2!=0) else \"Second\"\r\nprint(val)\r\n", "n=input()\r\ndata=0\r\n\r\nfor i in n:\r\n data+=n.count(i)%2\r\nif data&1 or data==0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "s=str(input())\r\nst=\"abcdefghijklmnopqrstuvwxyz\"\r\nli=[]\r\nd=0\r\nfor x in st:\r\n li.append(s.count(x))\r\nfor y in li:\r\n if y%2==1:\r\n d+=1\r\nif d%2==1 or d==0:\r\n print(\"First\")\r\nelif d%2==0:\r\n print(\"Second\")\r\n", "s = input();\r\ncnt = sum(s.count(i) % 2 for i in s)\r\nif (cnt % 2 == 1 or cnt == 0):\r\n\tprint(\"First\");\r\nelse:\r\n\tprint(\"Second\")\r\n\r\n", "from collections import Counter\r\nh=Counter(input())\r\nd=[h[o]%2 for o in h]\r\nif d.count(1)<2 :\r\n print('First')\r\nelif d.count(1)%2==0:\r\n print('Second')\r\nelse:\r\n print('First')", "from collections import defaultdict\r\n\r\ndef count_letters(s):\r\n d = defaultdict(int)\r\n for i in s:\r\n d[i] += 1 \r\n return d\r\n\r\ndef mycount(d):\r\n n_odds = 0\r\n n_evens = 0\r\n for i in d.keys():\r\n if d[i] % 2:\r\n n_odds+=1\r\n else:\r\n n_evens += 1\r\n return n_evens, n_odds\r\n\r\ns = input()\r\n\r\nd = count_letters(s)\r\nn_evens, n_odds = mycount(d)\r\n\r\ndef main(n_evens, n_odds):\r\n if n_odds == 0:\r\n return True\r\n if n_odds == 1:\r\n return True\r\n return n_odds % 2 == 1\r\n# print(n_evens, n_odds)\r\nif main(n_evens, n_odds):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "word = input()\r\nk = sum(word.count(x)%2 for x in set(word))\r\n \r\nif k == 0 or k == 1 or k % 2 == 1:\r\n print('First')\r\nelse:\r\n print('Second')", "x=input()\r\nl=[0]*26\r\nfor i in x:\r\n l[97-ord(i)]=(l[97-ord(i)]+1)%2\r\nv=sum(l)\r\nif v==0:\r\n print(\"First\")\r\nelse:\r\n print([\"Second\",\"First\"][v%2])", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\ndef in_string_to_string():\r\n s = input()\r\n return s[:len(s) - 1]\r\n\r\ndef is_palindrome(counter):\r\n has_odd = False\r\n length = 0\r\n for c in counter:\r\n length += counter[c]\r\n if counter[c] & 1 != 0:\r\n if has_odd == True:\r\n return False\r\n has_odd = True\r\n if has_odd and length & 1 == 0:\r\n return False\r\n return True\r\n\r\ns = in_string_to_string()\r\ncounter = Counter()\r\n\r\nfor c in s:\r\n counter[c] += 1\r\nwinner_is_first = True\r\nnumber_of_turns = 1\r\n\r\nwhile is_palindrome(counter) == False:\r\n number_of_turns += 1\r\n broken = False\r\n for c in counter:\r\n if counter[c] & 1 == 0:\r\n counter[c] -= 1\r\n if counter[c] == 0:\r\n counter.pop(c)\r\n broken = True\r\n break\r\n if broken:\r\n continue\r\n for c in counter:\r\n counter[c] -= 1\r\n if counter[c] == 0:\r\n counter.pop(c)\r\n break\r\nif number_of_turns & 1 == 1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s = input(\"\")\r\n\r\nm = {}\r\nfor i in range(len(s)):\r\n if s[i] in m:\r\n m[s[i]] += 1\r\n else:\r\n m[s[i]] = 1\r\n\r\n\r\nodds = 0\r\nfor k, v in m.items():\r\n if v & 1:\r\n odds += 1\r\n\r\nif odds <= 1:\r\n print(\"First\")\r\nelif len(s) % 2 == 0:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "s=input()\r\nd1={\"a\":0,\"b\":0,\"c\":0,\"d\":0,\"e\":0,\"f\":0,\"g\":0,\"h\":0,\"i\":0,\"j\":0,\"k\":0,\"l\":0,\"m\":0,\"n\":0,\"o\":0,\"p\":0,\"q\":0,\"r\":0,\"s\":0,\"t\":0,\"u\":0,\"v\":0,\"w\":0,\"x\":0,\"y\":0,\"z\":0}\r\nd2={\"a\":0,\"b\":0,\"c\":0,\"d\":0,\"e\":0,\"f\":0,\"g\":0,\"h\":0,\"i\":0,\"j\":0,\"k\":0,\"l\":0,\"m\":0,\"n\":0,\"o\":0,\"p\":0,\"q\":0,\"r\":0,\"s\":0,\"t\":0,\"u\":0,\"v\":0,\"w\":0,\"x\":0,\"y\":0,\"z\":0}\r\nfor i in range(len(s)):\r\n d1[s[i]]=d1[s[i]]+1\r\nodd=0\r\nfor i in d1.values():\r\n if i!=0:\r\n if i%2!=0:\r\n odd=odd+1\r\nif len(s)%2!=0 and odd<=1:\r\n print(\"First\")\r\nelif len(s)%2==0 and odd==0:\r\n print(\"First\")\r\nelse:\r\n if len(s)%2==0:\r\n print(\"Second\")\r\n else:\r\n print(\"First\")", "word = input().strip()\r\noddCount = 0\r\nfor ch in \"abcdefghijklmnopqrstuvwxyz\":\r\n if word.count(ch) % 2 != 0:\r\n oddCount += 1\r\nif oddCount == 0 or oddCount == 1 or oddCount % 2 != 0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s=input()\r\nif s==s[::-1]: print('First'); exit(0)\r\nk=(len([x for x in set(s) if s.count(x)%2]))\r\nif k%2 or k==0: print('First'); exit(0)\r\nprint('Second')", "from typing import Counter\r\ns = input()\r\ndata = Counter(s)\r\nodd_count = 0\r\nfor x in data:\r\n if data[x] % 2 == 1:\r\n odd_count += 1\r\nif odd_count: odd_count -= 1\r\nprint(\"Second\" if (odd_count) % 2 else \"First\")", "s=input();c = 0\r\nfor i in s:c += s.count(i) % 2\r\nif c==0 or c%2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "from sys import stdin, stdout\r\ndef rd(): return stdin.readline().strip()\r\ndef wtl(x): stdout.write(str(x) + '\\n')\r\n\r\ns = rd()\r\nc = [0 for i in range(26)]\r\nfor ch in s:\r\n c[ord(ch) - ord('a')] += 1\r\nif sum((x & 1) for x in c) <= 1:\r\n wtl(\"First\")\r\nelse:\r\n wtl(\"First\" if len(s) & 1 else \"Second\")", "s=input()\r\ns1=set(s)\r\nk=[]\r\nfor i in s1:\r\n d=s.count(i)\r\n if d%2!=0:\r\n k.append(d)\r\nif len(k) == 0 or len(k)%2!=0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s = list(input())\r\n\r\ndic = {}\r\n\r\nfor i in s:\r\n dic[i] = dic.get(i,0) + 1\r\n \r\nf = True\r\nc = 0\r\nfor i,j in dic.items():\r\n if j%2==1 and f:\r\n f = False\r\n elif j%2==1:\r\n c+=1\r\n \r\nif c%2==1:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "s=input()\r\nfreq={}\r\nfor i in s:\r\n\tif i not in freq:\r\n\t\tfreq[i]=0\r\n\tfreq[i]+=1\r\nres=0\r\nflag = False\r\nfor i in freq:\r\n\tif freq[i]%2!=0:\r\n\t\tres+=freq[i]-1\r\n\t\tflag = flag or True\r\n\telse:\r\n\t\tres+=freq[i]\r\nif flag:\r\n\tres+=1\r\nif (len(s)-res)%2==0:\r\n\tprint(\"First\")\r\nelse:\r\n\tprint(\"Second\")\r\n\t\t\r\n\t\r\n\r\n", "def main():\n #elems = list(map(int, input().split(' ')))\n s = input()\n\n def cnt_odds(s):\n odds = 0\n cnt = {}\n for x in s:\n if x not in cnt:\n cnt[x] = 0\n cnt[x] += 1\n\n for x in cnt.values():\n if x % 2 > 0:\n odds += 1\n return odds\n\n\n winners = ['First', 'Second']\n i = 0\n while True:\n odds = cnt_odds(s)\n if odds <= 1:\n print(winners[i % 2])\n break\n for j in range(len(s)):\n substr = s[0:j] + s[j+1:]\n new_odds = cnt_odds(substr)\n if new_odds < odds:\n s = substr\n break\n i += 1\n\n\nif __name__ == \"__main__\":\n main()\n", "s=list(input())\r\nch=[0]*26\r\nfor i in s :\r\n ch[ord(i)-97]+=1\r\nf=0\r\nj=0\r\nfor i in ch :\r\n if i%2!=0 :\r\n if f==0:\r\n f+=1\r\n else : \r\n j+=1\r\n \r\nif j%2==0 :\r\n print(\"First\")\r\nelse :\r\n print(\"Second\")", "'''\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>> বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\r\n\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@\r\n''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@@\r\n\r\n PROBLEM :B. Little Girl and Game\r\n SOLUTATOIN:........\r\n\r\n ========================================================================\r\n ========================================================================\r\n '''\t\t\r\nm=input()\r\na=dict()\r\nr=0\r\nfor i in m:\r\n if i in a:a[i]+=1\r\n else:a[i]=1\r\nfor i in a:\r\n if(a[i]%2!=0):r+=1\r\nprint(\"First\" if r<=1 or r%2==1 else \"Second\")", "s=input();x=sum(s.count(i)%2 for i in s);print(\"SFeicrosntd\"[x%2+(x<1)::2])", "from collections import Counter\r\n\r\ni=input()\r\nc=Counter(i)\r\nodd=0\r\nfor x in c:\r\n if c[x]%2==1:\r\n odd+=1\r\nif odd==0 or odd%2==1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s = input()\r\nd = sum([s.count(i)%2 for i in set(s)])\r\nprint(['Second', 'First'][d == 0 or d%2])", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\ndef in_string_to_string():\r\n s = input()\r\n return s[:len(s) - 1]\r\n\r\n\r\ns = in_string_to_string()\r\ncounter = Counter()\r\nfor c in s:\r\n counter[c] += 1\r\nodds = 0\r\nfor c in counter:\r\n if counter[c] & 1 == 1:\r\n odds += 1\r\nif odds == 0 or odds & 1 == 1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b=list(input()),0\r\nfor i in list(set(a)):\r\n if a.count(i)%2==1:\r\n b+=1\r\nif b>1:\r\n print((len(a))%2*'First',end='')\r\n print((1-(len(a))%2)*'Second')\r\nelse:\r\n print('First')", "import math\r\nimport bisect\r\nimport itertools\r\nimport copy\r\nimport sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef intmap():\r\n return map(int,input().split())\r\n \r\ndef lintmap():\r\n return list(map(int,input().split()))\r\n \r\ndef lstrmap():\r\n return list(map(str,input().split()))\r\n \r\ndef freq(l):\r\n d = {}\r\n for i in l:\r\n d[i] = d.get(i,0) + 1\r\n return d\r\n \r\ndef subseq(b,s):\r\n c = 0\r\n n = len(s)\r\n for i in b:\r\n if s[c] == i and c != n:\r\n c += 1\r\n if c == n:\r\n return True \r\n return False\r\n\r\ndef factors(n):\r\n l = []\r\n for i in range(2,int(n**0.5) + 1):\r\n if n%i == 0:\r\n l.append(i)\r\n l.append(n//i)\r\n return l\r\n\r\ns = input()\r\nd = freq(s)\r\nc = -1\r\nfor i in d:\r\n if d[i]%2:\r\n c += 1\r\n\r\nif c == -1:\r\n print(\"First\")\r\nelif c%2:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n ", "def main():\r\n cnt = [0] * 26\r\n odd = 0\r\n\r\n s = input().strip()\r\n\r\n for char in s:\r\n cnt[ord(char) - ord('a')] += 1\r\n\r\n for i in range(26):\r\n if cnt[i] & 1:\r\n odd += 1\r\n\r\n if odd == 0 or odd & 1:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import defaultdict\r\nx=list(input().lower())\r\n\r\nhash=defaultdict(lambda:0)\r\nodd=0\r\n\r\nfor i in range(len(x)):\r\n hash[ord(x[i])-97]+=1\r\n\r\nfor i in range(len(x)):\r\n if hash[ord(x[i])-97]%2==1:\r\n odd+=1\r\n\r\n# print(hash,odd)\r\nif odd==0 or odd==1:\r\n print(\"First\")\r\nelse:\r\n if odd%2==0:\r\n print(\"Second\")\r\n else:\r\n print(\"First\")", "ch = input()\r\namt = [0] * 30\r\ncount_odd = 0\r\n\r\nfor c in ch:\r\n amt[ord(c) - ord('a')] += 1\r\n\r\nfor i in range(26):\r\n if amt[i] % 2 == 1:\r\n count_odd += 1\r\n\r\nif count_odd == 0 or count_odd == 1:\r\n print(\"First\")\r\nelif count_odd % 2 == 0:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "import sys\r\nfrom collections import Counter\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ninl = lambda: list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n s = input()\r\n odds_count = sum(s.count(c) % 2 == 1 for c in set(s))\r\n print([\"Second\", \"First\"][odds_count <= 1 or len(s) % 2 == 1])\r\n\r\n\r\nsolve()\r\n", "from collections import Counter\r\nstring=Counter(input())\r\nj=sum([ i for i in string.values() if i %2!= 0])\r\nif j == 0 or j%2 != 0:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\ns = input()[:-1]\r\nx = len(s)\r\nc = Counter(s)\r\nd = 0\r\nfor i in c:\r\n if c[i] % 2:\r\n d += 1\r\n if d == 2:\r\n break\r\nif d < 2:\r\n print('First')\r\nelse:\r\n print(['Second','First'][x%2])" ]

[ "n, k, q = map(int, input().split())\r\nni = [int(x) for x in input().split()]\r\nqi = []\r\nd = []\r\na = []\r\n\r\nfor i in range(q):\r\n qi.append([int(x) for x in input().split()])\r\n\r\nfor i in qi:\r\n if i[0] == 1:\r\n if len(d) == k:\r\n if min(d) > ni[i[1]-1]:\r\n continue\r\n else:\r\n d.remove(min(d))\r\n d.append(ni[i[1]-1])\r\n else:\r\n d.append(ni[i[1]-1])\r\n else:\r\n if ni[i[1]-1] in d:\r\n a.append(\"YES\")\r\n else:\r\n a.append(\"NO\")\r\n\r\nfor i in a:\r\n print(i)", "n, k, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nwindow = []\r\nfor i in range(q):\r\n t, id = map(int, input().split())\r\n if t == 1:\r\n window.append(a[id - 1])\r\n if len(window) > k:\r\n window = sorted(window)[1:]\r\n if t == 2:\r\n find = False\r\n for j in window:\r\n if j == a[id - 1]:\r\n find = True\r\n break\r\n if find:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n,k,q = tuple(map(int, input().split()))\r\nt = [0];t.extend([i for i in tuple(map(int, input().split()))])\r\nol = [None for i in range(k+1)]\r\n#print(t)\r\na = 0#online number\r\nli = []\r\nfor i in range(q):\r\n ty, id = tuple(map(int, input().split()))\r\n if ty==2:\r\n if id in ol:li.append('YES')\r\n else:li.append('NO')\r\n elif ty == 1:\r\n if a < k:\r\n a += 1;ol[a]=id\r\n else:\r\n smallest = t[id];to_be_replaced=None\r\n for j in range(k+1)[1:]:\r\n if t[ol[j]] < smallest:smallest = t[ol[j]];to_be_replaced = j\r\n else:pass\r\n if not(to_be_replaced is None):ol[to_be_replaced] = id\r\nprint('\\n'.join(li))", "n, k, q = map(int, input().split())\r\nfriends = list(map(int, input().split()))\r\nmain = [None] * k\r\nfor i in range(q):\r\n t, p = map(int, input().split())\r\n if t == 1:\r\n for j in range(k):\r\n if main[k - j - 1] == None:\r\n main[k - j - 1] = p - 1\r\n break\r\n elif friends[main[k - j - 1]] < friends[p - 1]:\r\n nn = p - 1\r\n for l in range(k - j):\r\n nnn = main[k - j - l - 1]\r\n main[k - j - l - 1] = nn\r\n nn = nnn\r\n break\r\n elif t == 2:\r\n if p - 1 in main:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "#https://codeforces.com/problemset/problem/639/A\r\nN = list(map(int,input().split()))\r\nN.insert(0,0)\r\nA = list(map(int,input().split()))\r\nA.insert(0,0)\r\nO = [0 for i in range(N[2])]\r\nfor i in range(N[3]):\r\n Q = list(map(int,input().split()))\r\n if Q[0]==1:\r\n for j in range(1,N[2]+1):\r\n if A[O[-j]]>A[Q[1]]:\r\n break\r\n elif j==1:\r\n O[-j]=Q[1]\r\n else:\r\n O[-j+1]=O[-j]\r\n O[-j]=Q[1]\r\n else:\r\n if Q[1] in O:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def main(): \r\n n, k, q = map(int, input().split())\r\n t = [0] + list(map(int, input().split()))\r\n s = [0] * (k + 1)\r\n\r\n for _ in range(q):\r\n typ, x = map(int, input().split())\r\n\r\n if typ == 1:\r\n for i in range(1, k + 1):\r\n if s[i] == 0:\r\n s[i] = x\r\n break\r\n elif t[x] > t[s[i]]:\r\n for j in range(k, i, -1):\r\n s[j] = s[j - 1]\r\n s[i] = x\r\n break\r\n else:\r\n jest = 0\r\n for i in range(1, k + 1):\r\n if s[i] == x:\r\n jest = 1\r\n if jest:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n\r\nif __name__ == \"__main__\":\r\n main()# 1698176109.1568134", "n,k,q=map(int,input().split())\r\nl=[0]+list(map(int,input().split()))\r\no=[]\r\nans=[]\r\nfor i in range(q):\r\n x,y=map(int,input().split())\r\n if x==1:\r\n if len(o)<k: o+=[l[y]]\r\n elif l[y]>min(o): o+=[l[y]]; o.remove(min(o))\r\n else:\r\n if l[y] in o: ans+=['YES']\r\n else: ans+=['NO']\r\nprint('\\n'.join(ans))", "from heapq import *\r\n\r\nL = [int(s) for s in input().split()]\r\nn, k, q = L[0], L[1], L[2]\r\nT = [int(s) for s in input().split()]\r\nonlinevalue = []\r\nheapify(onlinevalue)\r\nfor i in range(q):\r\n S = [int(s) for s in input().split()]\r\n if S[0] == 2:\r\n if T[S[1]-1] in onlinevalue:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n if len(onlinevalue) < k:\r\n heappush(onlinevalue,T[S[1]-1])\r\n else:\r\n if T[S[1]-1] > onlinevalue[0]:\r\n heappop(onlinevalue)\r\n heappush(onlinevalue,T[S[1]-1])", "n, wsize, q = map(int, input().split())\nfriend_list = list(map(int, input().split()))\nwindow = []\nfor i in range(q):\n operation_type, user_id = map(int, input().split())\n friend_lvl = friend_list[user_id - 1]\n if operation_type == 1:\n if len(window) < wsize:\n window.append(friend_lvl)\n else:\n window.sort()\n window.reverse()\n if friend_lvl > window[-1]:\n window[-1] = friend_lvl\n if operation_type == 2:\n if friend_lvl in window:\n print(\"YES\")\n else:\n print(\"NO\")\n\n", "n,k,q = map(int,input().split())\r\nvalue = [int(x) for x in input().split()]\r\nid = {}\r\nans = []\r\nfor i in range(q):\r\n a,b = map(int,input().split())\r\n if a == 1:\r\n if len(id) < k:\r\n id[b] = value[b-1]\r\n else:\r\n x = min(id.items(), key=lambda x: x[1])[0]\r\n if value[b-1] > id[x]:\r\n del id[x]\r\n id[b] = value[b-1]\r\n else:\r\n continue\r\n if a == 2:\r\n if b in id.keys():\r\n ans.append('YES')\r\n else:\r\n ans.append('NO')\r\nfor i in ans:\r\n print(i)\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n# = input()\n# = int(input())\n\n(n, k, q) = (int(i) for i in input().split())\nt = [int(i) for i in input().split()]\n\nshow = []\nans = []\n\nstart = time.time()\n\nfor i in range(q):\n (f, id) = [int(i) for i in input().split()]\n id -= 1\n if f == 1:\n if len(show) < k:\n show.append(t[id])\n else:\n b = min(show)\n if b < t[id]:\n del show[show.index(b)]\n show.append(t[id])\n else:\n if t[id] in show:\n ans.append('YES')\n else:\n ans.append('NO')\n\nfor i in range(len(ans)):\n print(ans[i])\nfinish = time.time()\n#print(finish - start)\n", "def type1(idi):\r\n global mnoj, n, k, q, t\r\n if len(mnoj) < k:\r\n mnoj.add(t[idi])\r\n else:\r\n mn = min(mnoj)\r\n if t[idi] > mn:\r\n mnoj.remove(mn)\r\n mnoj.add(t[idi])\r\n\r\ndef main():\r\n global mnoj, n, k, q, t\r\n n, k, q = map(int, input().split())\r\n t = list(map(int, input().split()))\r\n mnoj = set()\r\n for i in range(q):\r\n typei, idi = map(int, input().split())\r\n idi -= 1\r\n if typei == 1:\r\n type1(idi)\r\n else:\r\n if t[idi] in mnoj:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nmain()\r\n ", "n,k,q = [int(i) for i in input().split()]\r\nt = [int(i) for i in input().split()]\r\ndis = []\r\nfor _ in range(q):\r\n typ,ID = [int(j) for j in input().split()]\r\n if typ == 1:\r\n if len(dis) == 0:\r\n dis.append(ID)\r\n else:\r\n for i in range(len(dis)-1,-1,-1):\r\n if t[dis[i]-1] > t[ID-1]:\r\n dis.insert(i+1,ID)\r\n break\r\n else:\r\n dis = [ID] + dis\r\n if len(dis) > k:\r\n dis.pop()\r\n #print(dis)\r\n elif typ == 2:\r\n if ID in dis:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n \r\n", "n, k, q = [int(s) for s in input().split()]\r\nfriend_list = [int(s) for s in input().split()]\r\nactive_friends_id = dict()\r\n\r\nactive_friends = [-1 for i in range(k)]\r\nmin_value = 0\r\nmin_ind = -1\r\nmin_key = -1\r\ncount = 0\r\ntmp_ind = 0\r\nfor i in range(q):\r\n req, id = [int(s) for s in input().split()]\r\n id -= 1\r\n if req == 1:\r\n if count != k or friend_list[id] > min_value:\r\n if count == k: # вытеснять\r\n active_friends_id[min_ind] = id\r\n active_friends[min_ind] = friend_list[id]\r\n min_value = min(active_friends)\r\n min_ind = active_friends.index(min_value)\r\n else: # добавить\r\n active_friends_id[tmp_ind] = id\r\n active_friends[tmp_ind] = friend_list[id]\r\n tmp_ind += 1\r\n count += 1\r\n if count == k:\r\n min_value = min(active_friends)\r\n min_ind = active_friends.index(min_value)\r\n else:\r\n if id in active_friends_id.values():\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "i=input().split()\r\nn,k,q=int(i[0]),int(i[1]),int(i[2])\r\nl=list(map(int,input().split()))\r\nd=[0]*k\r\nfor i in range(q):\r\n j=input().split()\r\n x=l[int(j[1])-1]\r\n if j[0]=='1':\r\n d.append(x)\r\n for h in range(1,k+1):\r\n if d[-h]>d[-h-1]:\r\n d[-h],d[-h-1]=d[-h-1],d[-h]\r\n else:\r\n break\r\n del d[-1]\r\n else:\r\n if x in d:\r\n print('YES')\r\n else:\r\n print('NO')", "from heapq import *\r\nn,k,q=map(int,input().split())\r\nt=[0]+list(map(int,input().split()))\r\ns=[]\r\ntak=set()\r\nans=[]\r\nfor i in range(q):\r\n m,nom=map(int,input().split())\r\n if m==1: heappush(s,(t[nom],nom)); tak|={nom}\r\n if len(s)>k: tt,no=heappop(s); tak-={no}\r\n if m==2: ans+=[[\"NO\",\"YES\"][nom in tak]]\r\nprint(\"\\n\".join(ans)) ", "n,k,q=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ndis=[]\r\nfor i in range(q):\r\n t,id=map(int,input().split())\r\n if t==1:\r\n if len(dis)==k:\r\n if arr[id-1]>=dis[0][0]:\r\n dis[0]=(arr[id-1],id)\r\n else:\r\n dis.append((arr[id-1],id))\r\n dis.sort()\r\n else:\r\n var=[dis[i][1] for i in range(len(dis))]\r\n if id in var:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\r\nfrom heapq import *\r\n\r\nfin = sys.stdin\r\nh = []\r\n\r\nfor i, line in enumerate(fin):\r\n if i == 0:\r\n n,k,q = [int(x) for x in line.split()]\r\n continue\r\n if i == 1:\r\n friendshipLevels = [int(x) for x in line.split()]\r\n continue\r\n t,f = [int(x) for x in line.split()]\r\n f -= 1\r\n if t == 1:\r\n heappush(h, (friendshipLevels[f], f))\r\n if len(h) > k:\r\n heappop(h)\r\n if t == 2:\r\n print('YES' if (friendshipLevels[f], f) in h else 'NO')", "I = lambda: map(int, input().split())\r\n\r\nn, k, q = I()\r\nT = list(I())\r\nA = []\r\n\r\nfor _ in range(q):\r\n t, i = I()\r\n a = (T[i-1], i)\r\n if t < 2:\r\n A.append(a)\r\n A.sort(reverse=True)\r\n A = A[:k]\r\n else:\r\n print('YES' if a in A else 'NO')", "\r\n\r\nlisted = list()\r\n\r\nn, k, q= list(map(int,input().split()))\r\n\r\n\r\ndef del_minv():\r\n global listed\r\n minv = 0\r\n for _ in range(len(listed)):\r\n if friend_value[listed[_]] < friend_value[listed[minv]]:\r\n minv = _\r\n del listed[minv]\r\n\r\n\r\nfriend_value = list(map(int, input().split()))\r\nfriend_online = [False]*len(friend_value)\r\n\r\nfor _ in range(q):\r\n query = list(map(int,input().split()))\r\n query[1] -= 1\r\n\r\n if query[0] == 1:\r\n friend_online[query[1]] = True\r\n listed.append(query[1])\r\n if len(listed) > k: del_minv()\r\n #print(listed)\r\n else:\r\n print('YES') if query[1] in listed else print('NO')\r\n\r\n\r\n", "'''\nCreated on 2016-4-27\n\n@author: chronocorax\n'''\ndef line(): return [int(c) for c in input().split()]\n\nn, k, q = line()\nt = line()\nH = []\n\nfrom heapq import *\n\nN = 0\n\nH = []\n\nfor _ in range(q):\n taipe, i = line()\n if taipe == 1:\n heappush(H, (t[i - 1], i))\n if N < k:\n N += 1\n else:\n heappop(H)\n elif taipe == 2:\n if (t[i - 1], i) in H:\n print('YES')\n else:\n print('NO')", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\nfrom itertools import compress \r\n\r\ndef main():\r\n n, k, q = IA()\r\n a = IA()\r\n best = set()\r\n for _ in range(q):\r\n t, index = IA()\r\n f = a[index-1]\r\n if t == 1:\r\n if len(best) < k:\r\n best.add(f)\r\n else:\r\n mi = min(best)\r\n if f > mi:\r\n best.remove(mi)\r\n best.add(f)\r\n else:\r\n if f in best:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\nif __name__ == '__main__':\r\n main()", "from operator import itemgetter\n\n\nclass CodeforcesTask658BSolution:\n def __init__(self):\n self.result = ''\n self.n_k_q = []\n self.rels = []\n self.queries = []\n\n def read_input(self):\n self.n_k_q = [int(x) for x in input().split(\" \")]\n self.rels = [int(x) for x in input().split(\" \")]\n for x in range(self.n_k_q[2]):\n self.queries.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n online = []\n results = []\n shown = {}\n for query in self.queries:\n if query[0] == 1:\n shown[query[1]] = True\n online.append((query[1], self.rels[query[1] - 1]))\n online.sort(key=itemgetter(1), reverse=True)\n if len(online) > self.n_k_q[1]:\n out = online.pop(-1)\n shown[out[0]] = False\n else:\n if query[1] in shown:\n if shown[query[1]]:\n results.append(\"YES\")\n else:\n results.append(\"NO\")\n else:\n results.append(\"NO\")\n self.result = \"\\n\".join(results)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask658BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from heapq import *\r\n\r\nn, k, q = map(int, input().split())\r\nt = [0] + list(map(int, input().split()))\r\ns = []\r\ntak = set()\r\nans = []\r\nfor i in range(q):\r\n m, nom = map(int, input().split())\r\n if m == 1: heappush(s, (t[nom], nom)); tak |= {nom}\r\n if len(s) > k: tt, no = heappop(s); tak -= {no}\r\n if m == 2: ans += [[\"NO\", \"YES\"][nom in tak]]\r\nprint(\"\\n\".join(ans))", "n, k, q = map(int, input().split())\r\n\r\nTs = list(map(int, input().split()))\r\n\r\ndisplayed = []\r\n\r\nfor x in range(q):\r\n type, id = map(int, input().split())\r\n ti = Ts[id-1]\r\n # new friend is online\r\n if type == 1:\r\n displayed.append(ti)\r\n displayed.sort()\r\n displayed.reverse()\r\n if len(displayed) > k:\r\n displayed.pop()\r\n elif type == 2:\r\n if ti in displayed:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "import sys\nimport math\nimport itertools as it\nimport operator as op\nimport heapq\n\nn, k, q = map(int, sys.stdin.readline().split())\nT = list(map(int, sys.stdin.readline().split()))\n\nonline = []\nfor i in range(q):\n t, fid = map(int, sys.stdin.readline().split())\n fid -= 1\n if t == 1:\n heapq.heappush(online, (-T[fid], fid))\n online = heapq.nsmallest(k, online)\n else:\n if (-T[fid], fid) in online:\n print('YES')\n else:\n print('NO')\n\n\n", "n,k,q = map(int, input().split())\nT = list(map(int, input().split()))\nQ = [list(map(int, input().split())) for _ in range(q)]\n\nC = []\nB = []\n\nfor i in range(q):\n l = Q[i]\n if l[0] == 1:\n C = C + [T[l[1]-1]]\n B = B + [l[1]]\n if len(C) > k:\n min = C[0]\n ours = 0\n for j in range(1,k+1):\n if C[j] < min:\n min = C[j]\n ours = j\n del(C[ours])\n del(B[ours])\n else:\n if l[1] in B:\n print(\"YES\")\n else:\n print(\"NO\")", "(n,k,q) = map(int,input().split())\r\nlevel = list(map(int,input().split()))\r\nqt=[]\r\nqid=[]\r\nlfr = set()\r\n\r\nfor i in range(0,q):\r\n (qtemp,qidtemp) = map(int,input().split())\r\n if (qtemp == 1):\r\n if (len(lfr)<k):\r\n lfr.add(qidtemp)\r\n else:\r\n minn = qidtemp\r\n for el in lfr:\r\n if (level[el-1] < level[minn-1]):\r\n minn = el\r\n if (level[minn-1] != level[qidtemp-1]):\r\n lfr.remove(minn)\r\n lfr.add(qidtemp)\r\n if (qtemp == 2):\r\n if (qidtemp in lfr):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n,k,q=map(int,input().split())\r\na=[*map(int,input().split())]\r\nl=[0]*k\r\nfor i in range(q):\r\n w,e=map(int,input().split())\r\n e=a[e-1]\r\n if w==1:\r\n o=min(l)\r\n if e>o:\r\n l[l.index(o)]=e\r\n else:\r\n print(\"YES\"if e in l else\"NO\")", "import heapq\r\nif __name__ == '__main__':\r\n n, k, q = list(map(int,input().split()))\r\n t = [0] + list(map(int,input().split()))\r\n heap = []\r\n heapq.heapify(heap)\r\n #size = 0\r\n def addfriend(id):\r\n if len(heap) == k:\r\n if heap[0][0] < t[id]:\r\n heapq.heappop(heap)\r\n heapq.heappush(heap,[t[id], id])\r\n else:\r\n heapq.heappush(heap,[t[id], id])\r\n\r\n def showfriend(id):\r\n #print(heap)\r\n if [t[id],id] in heap:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\n for _ in range(q):\r\n op, id = list(map(int,input().split()))\r\n if op == 1:\r\n addfriend(id)\r\n if op == 2:\r\n print(showfriend(id))\r\n", "NoF,k,q=map(int,input().split())\nfriends=[int(x) for x in input().split()]\ndisplayed=[]\nfor _ in range(q):\n type,friend=map(int,input().split())\n if type==1:\n if len(displayed)<k:\n displayed.append(friend)\n displayed.sort(key=lambda i: friends[i-1])\n else:\n displayed.append(friend)\n displayed.sort(key=lambda i: friends[i-1],reverse=True)\n displayed=displayed[0:k]\n else:\n print('YES' if friend in displayed else 'NO') \n\t\t \t\t\t \t\t\t\t\t \t \t \t\t\t\t \t\t", "#!/usr/bin/python3\n\nimport operator as op\nfrom queue import PriorityQueue\nimport heapq\n\nclass StdReader:\n\tdef read_int(self):\n\t\treturn int(self.read_string())\n\n\tdef read_ints(self, sep=None):\n\t\treturn [int(i) for i in self.read_strings(sep)]\n\n\tdef read_float(self):\n\t\treturn float(self.read_string())\n\n\tdef read_floats(self, sep=None):\n\t\treturn [float(i) for i in self.read_strings(sep)]\n\n\tdef read_string(self):\n\t\treturn input()\n\n\tdef read_strings(self, sep=None):\n\t\treturn self.read_string().split(sep)\n\nreader = StdReader()\n\n\ndef main():\n\tn, k, q = reader.read_ints()\n\tt = reader.read_ints()\n\n\t# queue = PriorityQueue()\n\tqueue = []\n\tqsize = 0\n\n\t# online = [False]*n\n\t# online_n = 0\n\t# prior = sorted([(i, t[i]) for i in range(n)], key=op.itemgetter(1), inverse=True)\n\t# pos = [0]*n\n\t# for i, p in enumerate(prior):\n\t# \tpos[p[0]] = i\n\n\tfor i in range(q):\n\t\tqt, qid = reader.read_ints()\n\t\tqid -= 1\n\n\t\tif qt == 1:\n\t\t\t# qid online\n\t\t\t# online[qid] = True\n\t\t\t# online_n += 1\n\t\t\tif len(queue) == k:\n\t\t\t\t# queue.get()\n\t\t\t\t# heapq.heappop(queue)\n\t\t\t\t# qsize -= 1\n\t\t\t\theapq.heappushpop(queue, (t[qid], qid))\n\t\t\telse:\n\t\t\t\theapq.heappush(queue, (t[qid], qid))\n\n\t\t\t# queue.put((t[qid], qid))\n\t\t\t# heapq.heappush(queue, )\n\t\t\t# qsize += 1\n\t\telse:\n\t\t\t# query qid\n\t\t\tbox = [i[1] for i in queue]\n\t\t\t# print(box)\n\t\t\tif qid in box:\n\t\t\t\tprint('YES')\n\t\t\telse:\n\t\t\t\tprint('NO')\n\n\t\t\t# if not online[qid]:\n\t\t\t# \tprint('NO')\n\t\t\t# else:\n\t\t\t# \tpass\n\n\nif __name__ == '__main__':\n\tmain()\n", "n,k,q = input().split()\r\nn = int(n)\r\nk = int(k)\r\nq = int(q)\r\nlist_friend = input().split()\r\nfor i in range(n):\r\n list_friend[i] = int(list_friend[i])\r\nlist_show = [0]*k\r\nfor a in range(q):\r\n tp,num = input().split()\r\n tp = int(tp)\r\n num = int(num)\r\n if tp == 1:\r\n for i in range(k):\r\n if list_show[i] < list_friend[num-1]:\r\n list_show.insert(i,list_friend[num-1])\r\n list_show.pop()\r\n break\r\n else:\r\n if list_friend[num-1] in list_show:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "n, k, q = tuple (map(int, input().split() ))\r\nt = tuple( map( int, input().split() ) )\r\nonline = []\r\n\r\n\r\nfull = False\r\n\r\nfor i in range(q):\r\n query = tuple (map(int, input().split()))\r\n if query[0] == 1:\r\n if not full:\r\n online.append(query[1])\r\n full = len(online)>=k\r\n else:\r\n min_id = 0\r\n for j in range(len(online)):\r\n if t[online[min_id]-1]>t[online[j]-1]:\r\n min_id = j\r\n if t[online[min_id]-1]<t[query[1]-1]:\r\n online[min_id] = query[1]\r\n\r\n elif query[0]==2:\r\n if query[1] in online:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "n,maxdisp,q = map(int , input().split())\r\nrelation = list(map(int,input().split()))\r\n\r\nfriends = []\r\n\r\nfor i in range(n):\r\n friends.append( [relation[i], i+1] )\r\n\r\ndisplayed = [] #dict displayed\r\ndisplayed_friends = [] #friend number displayed\r\n\r\nfor _ in range(q):\r\n b,c = map(int , input().split()) #input\r\n if b == 1: #type\r\n if len(displayed) != maxdisp: #if displayed is not yet maxed just append\r\n displayed.append( friends[c-1] )\r\n \r\n displayed_friends.append( friends[c-1][1] )\r\n elif len(displayed) == maxdisp:\r\n displayed.sort()\r\n if displayed[0][0] > friends[c-1][0]:\r\n continue\r\n else:\r\n y = displayed[0][1]\r\n displayed.pop(0)\r\n displayed_friends.remove(y)\r\n displayed.append ( friends[c-1] )\r\n displayed_friends.append( friends[c-1][1] )\r\n elif b == 2:\r\n if c in displayed_friends:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n#sorted of indices", "II = lambda: map(int, input().split())\r\nn, k, q = II()\r\na = list(II())\r\ndisplay = set()\r\nfor _ in range(q):\r\n t, d = II()\r\n val = a[d - 1]\r\n if t == 1:\r\n if len(display) < k:\r\n display.add(val)\r\n else:\r\n m = min(display)\r\n if val > m:\r\n display.add(val)\r\n display.remove(m)\r\n else:\r\n print((\"NO\", \"YES\")[val in display])", "n, k, q = map(int, input().split())\r\n\r\nt = [0] + list(map(int, input().split()))\r\n\r\nts = list()\r\n\r\nfor i in range(q):\r\n typ, idi = map(int, input().split())\r\n if typ == 1:\r\n cnt = len(ts)\r\n tl = t[idi]\r\n if (cnt < k):\r\n ts.append(tl)\r\n else:\r\n if (ts[0] < tl):\r\n del ts[0]\r\n ts.append(tl)\r\n ts.sort()\r\n elif typ == 2:\r\n if t[idi] in ts:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n,k,q = map(int,input().split())\r\nt = list(map(int,input().split()))\r\nd = {}\r\nfor i in range(n):\r\n d[i+1] = t[i]\r\n\r\nsp = []\r\n\r\nfor i in range(q):\r\n a,b = map(int,input().split())\r\n if a == 1:\r\n if len(sp) == 0:\r\n sp.append(b)\r\n else:\r\n j = 0\r\n x = d[b]\r\n bb = True\r\n while d[sp[j]] > x:\r\n j += 1\r\n if j == len(sp):\r\n if len(sp) < k:\r\n sp.append(b)\r\n bb = False\r\n break\r\n if bb:\r\n s1 = sp[:j]\r\n s2 = sp[j:]\r\n sp = s1 + [b] + s2\r\n if len(sp) > k:\r\n sp.remove(sp[-1])\r\n else:\r\n if b in sp:\r\n print('YES')\r\n else:\r\n print('NO')", "n,k,q = [int(i) for i in input().split()]\r\nt = [int(i) for i in input().split()]\r\nonline = []\r\n\r\nfor i in range(q):\r\n query = [int(j) for j in input().split()]\r\n if query[0] == 2:\r\n if query[1] in online:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n for j in range(len(online)):\r\n if t[online[j] - 1] < t[query[1] - 1]:\r\n online.insert(j,query[1])\r\n break\r\n if j == len(online) - 1:\r\n online.append(query[1])\r\n if not len(online):\r\n online.append(query[1])\r\n if len(online) > k:\r\n online.pop()\r\n", "import heapq\r\nn,k,q=[int(i) for i in input().split()]\r\nt=[0]+[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(q):\r\n a,b=[int(i) for i in input().split()]\r\n if a==1:\r\n if len(l)<k:\r\n heapq.heappush(l,t[b])\r\n else:\r\n heapq.heappushpop(l,t[b])\r\n else:\r\n if t[b] in l:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def main():\n from sys import stdin\n from heapq import heappush, heappushpop\n n, k, q = map(int, input().split())\n l = list(map(int, input().split()))\n m, h, res = [False] * n, [], []\n for a, b in map(str.split, stdin.read().splitlines()):\n id = int(b) - 1\n if a == \"1\":\n m[id] = True\n if k:\n k -= 1\n heappush(h, (l[id], id))\n else:\n _, id = heappushpop(h, (l[id], id))\n m[id] = False\n else:\n res.append((\"NO\", \"YES\")[m[id]])\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "n,k,q=input().split()\nrank=input().split()\nfor i in range(len(rank)):\n rank[i]=int(rank[i])\nli=[]\nnames=[]\nfor i in range(int(q)):\n query=input().split()\n if(query[0]=='1'):\n if(len(li)<int(k)):\n names.append(query[1])\n li.append(rank[int(query[1])-1])\n else:\n m=min(li)\n ind=li.index(m)\n if(rank[int(query[1])-1]>m):\n del li[ind]\n del names[ind]\n names.append(query[1])\n li.append(rank[int(query[1])-1]) \n if(query[0]=='2'):\n if(query[1] in names):\n print(\"YES\")\n else:\n print(\"NO\")\n\t \t \t \t \t \t\t \t \t \t \t", "def solve():\r\n n, k, q = map(int, input().split())\r\n fr = [0] + list(map(int, input().split()))\r\n on = []\r\n ans = []\r\n for _ in range(q):\r\n t, i = map(int, input().split())\r\n if t == 1:\r\n if len(on) < k:\r\n on += [fr[i]]\r\n elif fr[i] > min(on):\r\n on += [fr[i]]\r\n on.remove(min(on))\r\n else:\r\n if fr[i] in on:\r\n ans += ['YES']\r\n else:\r\n ans += ['NO']\r\n return '\\n'.join(ans)\r\n\r\nprint(solve())", "n,k,q = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\np=[]\r\nc=0\r\nfor i in range(q):\r\n t,d = map(int, input().strip().split(' '))\r\n if t==1:\r\n \r\n if c<k:\r\n p.append(lst[d-1])\r\n c+=1\r\n else:\r\n ind=p.index(min(p))\r\n if lst[d-1]>min(p):\r\n del p[ind]\r\n p.append(lst[d-1])\r\n else:\r\n if lst[d-1] in p:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n \r\n \r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k, q = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nd = [0]*(n+1)\r\nc, x = 0, []\r\nfor i in range(q):\r\n a, b = map(int, input().split())\r\n\r\n if a == 1:\r\n d[b] = 1\r\n if c < k:\r\n c += 1\r\n x.append(w[b-1])\r\n x.sort(reverse=True)\r\n else:\r\n if w[b-1] > x[-1]:\r\n x.pop()\r\n x.append(w[b-1])\r\n x.sort(reverse=True)\r\n\r\n else:\r\n if d[b] == 0:\r\n print('NO')\r\n elif d[b] == 1:\r\n if w[b-1] >= x[-1]:\r\n print('YES')\r\n else:\r\n print('NO')", "\nn, k, q = map(int, input().split())\n\nt = list(map(int, input().split()))\n\nres = set()\ndata = []\n\nfor _ in range(q):\n req_type, req_id = map(int, input().split())\n\n if req_type == 1:\n req_t = t[req_id - 1]\n data.append((req_id, req_t))\n res.add(req_id)\n\n if len(res) > k:\n data = sorted(data, key=lambda x: x[1], reverse=True)\n last = data[-1]\n data = data[:-1]\n\n res.remove(last[0])\n\n if req_type == 2:\n if req_id in res:\n print('YES')\n else:\n print('NO')\n", "n, k, q = map(int, input().split())\r\nt = list(map(int, input().split()))\r\ncurrent_online = [0] * k\r\nfor i in range (q):\r\n type_op, id_op = map(int, input().split())\r\n if type_op == 1:\r\n if t[id_op - 1] > current_online[0]:\r\n current_online[0] = t[id_op - 1]\r\n current_online.sort()\r\n else:\r\n if t[id_op - 1] in current_online:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n \r\n\r\n \r\n", "from heapq import *\r\nL=[]\r\nheapify(L)\r\nd={}\r\nn,k,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk1=0\r\nfor i in range(m) :\r\n a,b=map(int,input().split())\r\n if a==2 :\r\n if d.get(l[b-1],0)==0 :\r\n print(\"NO\")\r\n else :\r\n if k1<=l[b-1] :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n else :\r\n heappush(L,l[b-1])\r\n d[l[b-1]]=1\r\n \r\n if len(L)>k :\r\n k1=heappop(L)\r\n k1=heappop(L)\r\n heappush(L,k1)\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n", "import heapq\n\ndef friends(n, k, q, T, Q):\n H = []\n D = set()\n for t, i in Q:\n if t == 1:\n if len(H) < k:\n D.add(i)\n heapq.heappush(H, (T[i-1], i))\n else:\n D.add(i)\n _, j = heapq.heappushpop(H, (T[i-1], i))\n D.remove(j)\n else:\n yield i in D\n\n\ndef main():\n n, k, q = readinti()\n T = readintl()\n Q = readinttl(q)\n print('\\n'.join('YES' if r else 'NO' for r in friends(n, k, q, T, Q)))\n\n##########\n\nimport sys\n\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\nif __name__ == '__main__':\n main()\n", "__author__ = 'Utena'\r\nfrom collections import deque\r\nn,k,q=map(int,input().split())\r\nscreen=[]\r\nans=[]\r\nrelation=[0]+list(map(int,input().split()))\r\ntotal=0\r\nfor i0 in range(q):\r\n type,id=map(int,input().split())\r\n if type==1:\r\n screen.append(id)\r\n total+=1\r\n for i in range(1,total):\r\n if relation[screen[-i]]>relation[screen[-i-1]]:\r\n a=screen[-i-1]\r\n screen[-i-1]=screen[-i]\r\n screen[-i]=a\r\n if total>k:\r\n screen.pop()\r\n total-=1\r\n if type==2:\r\n if id in screen:\r\n ans.append('YES')\r\n else:ans.append(\"NO\")\r\nprint('\\n'.join(ans))", "n, k, q = map(int, input().split())\nt = [int(i) for i in input().split()]\n\nf = []\nfor i in range(q):\n\ty, d = map(int, input().split())\t\n\tif y == 1:\n\t\tf += [t[d - 1]]\n\t\tfor i in range(len(f) - 1, 0, -1):\n\t\t\tif f[i] > f[i - 1]:\n\t\t\t\tf[i], f[i - 1] = f[i - 1], f[i]\n\t\t\telse:\n\t\t\t\tbreak\n\t\tif len(f) > k:\n\t\t\tf = f[0 : k]\n\telse:\n\t\tif t[d - 1] in f:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n", "import heapq\nn,k,q=[int(i) for i in input().split()];\nt=[int(i) for i in input().split()];\nh=[]\nisnew=False;\nfor i in range(q):\n type,id=[int(i) for i in input().split()];\n if(type==1):\n if(k>len(h)):\n heapq.heappush(h,t[id-1])\n else:\n heapq.heappushpop(h,t[id-1])\n else:\n if t[id-1] in h:\n print(\"YES\");\n else:\n print(\"NO\");\n", "# import sys\r\n# sys.stdin = open('inputs.txt', 'r')\r\nn, k, q = [int (a) for a in input().strip().split()]\r\nt = [int (a) for a in input().strip().split()]\r\n\r\ns = []\r\ndef check():\r\n\ts.sort()\r\n\tif len(s) > k:\r\n\t\ts.pop(0)\r\n\t\r\nfor i in range(q):\r\n\ttype, id = [int (a) for a in input().strip().split()]\r\n\tif type == 1:\r\n\t\tif len(s) == 0:\r\n\t\t\ts = [t[id-1]]\r\n\t\telse:\r\n\t\t\tif len(s) < k or t[id-1] > s[0]:\t\r\n\t\t\t\ts = [t[id-1]] + s\r\n\t\t\t\tcheck()\r\n\telse:\r\n\t\tif t[id-1] in s:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")", "n, k, q = map(int, input().split())\r\nl = [0] + list(map(int, input().split()))\r\nm = []\r\nans = []\r\nfor i in range(q):\r\n x, y = map(int, input().split())\r\n if x == 1:\r\n if len(m) < k:\r\n m.append(l[y])\r\n elif l[y] > min(m):\r\n m.append(l[y])\r\n m.remove(min(m))\r\n else:\r\n if l[y] in m:\r\n ans.append('YES')\r\n else:\r\n ans.append('NO')\r\nprint('\\n'.join(ans))\r\n", "n, k, q = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\ndata1 = set()\r\nfor i in range(q):\r\n typ, fr = map(int, input().split())\r\n fr -= 1\r\n if typ == 2:\r\n if data[fr] in data1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n if len(list(data1)) < k:\r\n data1.add(data[fr])\r\n elif data[fr] >= min(list(data1)):\r\n data1.add(data[fr])\r\n data1.remove(min(list(data1)))", "def p1():\r\n\tn,k,q = [int(i) for i in input().split()]\r\n\tl = [int(i) for i in input().split()]\r\n\ts = []\r\n\tfor i in range(q):\r\n\t\ta,b = [int(i) for i in input().split()]\r\n\t\tif a == 1:\r\n\t\t\ts.append(l[b-1])\r\n\t\t\ts.sort()\r\n\t\t\tif len(s) > k:\r\n\t\t\t\ts.remove(s[0])\r\n\t\tif a == 2:\r\n\t\t\tif l[b-1] in s:\r\n\t\t\t\tprint('YES')\r\n\t\t\telse:\r\n\t\t\t\tprint('NO')\r\np1()\r\n", "n,k,q = [int(x) for x in input().split()]\r\nfriendship = [int(x) for x in input().split()]\r\ndisp = set()\r\nfor _ in range(q):\r\n t, index = [int(x) for x in input().split()]\r\n f = friendship[index-1]\r\n if t == 1:\r\n if len(disp) < k:\r\n disp.add(f)\r\n else:\r\n mi = min(disp)\r\n if f > mi:\r\n disp.remove(mi)\r\n disp.add(f)\r\n else:\r\n print(\"YES\") if f in disp else print(\"NO\")", "n,k,q=(int(z) for z in input().split())\r\ns=[int(z) for z in input().split()]\r\nt=[]\r\nans=[]\r\nfor i in range(q):\r\n\tr=input()\r\n\tif r[0]=='2':\r\n\t\tif s[int(r[2:])-1] in t:\r\n\t\t\tans+=['YES']\r\n\t\telse:\r\n\t\t\tans+=['NO']\r\n\telse:\r\n\t\tif len(t)<k:\r\n\t\t\tt.append(s[int(r[2:])-1])\r\n\t\t\tt.sort()\r\n\t\t\tt.reverse()\r\n\t\telse:\r\n\t\t\tu=0\r\n\t\t\twhile u<=k-1 and t[u]>s[int(r[2:])-1]:\r\n\t\t\t\tu+=1\r\n\t\t\tif u<k:\r\n\t\t\t\tfor g in range(k-1,u,-1):\r\n\t\t\t\t\tt[g]=t[g-1]\r\n\t\t\t\tt[u]=s[int(r[2:])-1]\r\nfor h in ans:\r\n\tprint(h)", "import sys\r\nclass node:\r\n def __init__(self,id):\r\n self._id=id\r\n self._children=[]\r\n self._parent=[]\r\nqueue=[]\r\ntail=0\r\nn,k,q= map(int,sys.stdin.readline().split())\r\na=n*[0]\r\ns=input()\r\na=s.split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\n \r\nfor i in range(q):\r\n type,idd=map(int,sys.stdin.readline().split())\r\n idd-=1\r\n if type==1:\r\n if len(queue)==0:\r\n queue.append(node(idd))\r\n else: \r\n l=len(queue)\r\n queue.append(node(idd))\r\n for j in range(len(queue)-1):\r\n if queue[j]._parent==[]:\r\n h=queue[j]\r\n head=j\r\n while (a[h._id]>a[idd])and(h._children!=[]):\r\n h=h._children[0]\r\n for j in range(len(queue)):\r\n if queue[j]==h:\r\n head=j\r\n if a[h._id]<a[idd]:\r\n if h._parent==[]:\r\n queue[head]._parent=[queue[l]]\r\n queue[l]._children=[queue[head]]\r\n else:\r\n queue[head]._parent[0]._children=[queue[l]]\r\n queue[l]._parent=[queue[head]._parent[0]]\r\n queue[head]._parent=[queue[l]]\r\n queue[l]._children=[queue[head]]\r\n \r\n else:\r\n for j in range(l):\r\n if queue[j]._children==[]:\r\n tail=j\r\n queue[tail]._children.append(queue[l])\r\n queue[l]._parent.append(queue[tail])\r\n if len(queue)>k:\r\n for j in range(len(queue)):\r\n if queue[j]._children==[]:\r\n tail=j\r\n queue[tail]._parent[0]._children=[]\r\n queue.remove(queue[tail])\r\n\r\n if type==2:\r\n boolean=0\r\n for j in range(len(queue)):\r\n if queue[j]._id==idd:\r\n boolean=1\r\n print('YES')\r\n if boolean==0:\r\n print('NO')", "from sys import stdin as Si\r\nfrom operator import itemgetter as ig \r\nif __name__=='__main__':\r\n n,k,q = map(int,Si.readline().split())\r\n T = tuple(map(int,Si.readline().split()))\r\n stack = {}\r\n for i in range(q):\r\n a,b = map(int,Si.readline().split())\r\n #print(a,b,stack)\r\n if a==1:\r\n if len(stack)<k: stack[b]=T[b-1]\r\n else:\r\n stack[b]=T[b-1]\r\n while len(stack)>k:\r\n x,y = min(stack.items(),key=ig(1))\r\n del stack[x]\r\n #stack[b] = T[b-1]\r\n elif a==2:\r\n if b in stack: print('YES')\r\n else: print('NO')\r\n \r\n \r\n\r\n \r\n \r\n", "n,k,q=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nls=[]\r\nacti=[-1 for i in range(n)]\r\nwhile q>0:\r\n q-=1\r\n a,b=map(int,input().split())\r\n b-=1\r\n if a==1 and acti[b]==-1 :\r\n acti[b]=1\r\n ls.append([t[b],b])\r\n ls.sort(reverse=True)\r\n if len(ls)>k:\r\n ls=ls[0:k]\r\n continue\r\n\r\n if a==2 :\r\n for j in ls:\r\n if j[1]==b:\r\n print(\"YES\")\r\n break\r\n else :\r\n print(\"NO\")\r\n", "n, k, q = map(int, input().split())\r\nl = [0] + list(map(int, input().split()))\r\no = []\r\nans = []\r\nfor i in range(q):\r\n x, y = map(int, input().split())\r\n if x == 1:\r\n if len(o) < k:\r\n o += [l[y]]\r\n elif l[y] > min(o):\r\n o += [l[y]]\r\n o.remove(min(o))\r\n else:\r\n if l[y] in o:\r\n ans.append('YES')\r\n else:\r\n ans.append('NO')\r\nprint('\\n'.join(ans))\r\n", "n, k, q = map(int, input().split())\r\nt = tuple(int(friendship) for friendship in input().split())\r\nwindow = set()\r\nfor i in range(q):\r\n query, friend_id = map(int, input().split())\r\n friend_id -= 1\r\n if query == 1:\r\n if len(window) < k:\r\n window.add(friend_id)\r\n else:\r\n least_friend = min(window, key=lambda friend: t[friend])\r\n if t[least_friend] < t[friend_id]:\r\n window.discard(least_friend)\r\n window.add(friend_id)\r\n else:\r\n print(\"YES\" if friend_id in window else \"NO\")", "a=input()\r\nb=a.split()\r\nn=int(b[0])\r\nk=int(b[1])\r\nq=int(b[2])\r\na=input()\r\ndr=a.split()\r\nfor i in range(len(dr)):\r\n\tdr[i]=int(dr[i])\r\nonline=[] \r\nanswers=[]\r\nfor i in range(q):\r\n\ta=input()\r\n\tt=a.split()\r\n\ttt=int(t[0])\r\n\ttr=int(t[1])-1\r\n\tif tt==1:\r\n\t\tonline.append(dr[tr])\r\n\t\tif(len(online)>k):\r\n\t\t\tonline.remove(min(online))\r\n\telse:\r\n\t\tif dr[tr] in online:\r\n\t\t\tanswers.append(\"YES\")\r\n\t\telse:\r\n\t\t\tanswers.append(\"NO\")\r\n\r\n\r\nfor i in answers:\r\n\tprint(i)", "string = input()\r\na, b, c = map(int, string.split())\r\nstring = input()\r\nvalues = list(map(int, string.split()))\r\nfriends, results = [], []\r\nn = 0\r\nfor x in range(c):\r\n string = input()\r\n numbers = string.split()\r\n p, q = int(numbers[0]), int(numbers[1])\r\n if p == 1:\r\n friends.append(values[q - 1])\r\n for y in range(n, 0, -1):\r\n s, t = friends[y], friends[y - 1]\r\n if s > t:\r\n friends[y], friends[y - 1] = t, s\r\n else:\r\n break\r\n if n == b:\r\n del friends[-1]\r\n else:\r\n n += 1\r\n else:\r\n if values[q - 1] in friends:\r\n results.append(\"YES\")\r\n else:\r\n results.append(\"NO\")\r\nfor x in results:\r\n print(x)", "n,k,q=map(int,input().split())\r\nd={}\r\nfor i in map(int,input().split()):\r\n d[len(d)+1]=i\r\nnow={}\r\nfor i in range (q):\r\n type1,id1=map(int,input().split())\r\n if type1==1:\r\n if len(now)<k:\r\n now[id1]=d[id1]\r\n else:\r\n if min(now.values())<d[id1]:\r\n now.pop(min(now,key=lambda x:now[x]))\r\n now[id1]=d[id1]\r\n elif type1==2:\r\n if id1 in now:\r\n print('YES')\r\n else:\r\n print('NO')", "from queue import PriorityQueue\nn, k, q = [int(i) for i in input().split()]\ndisplay = [0]*(n+1)\norder = PriorityQueue(k+1)\nfriend = [int(i) for i in input().split()]\nminfri = 0\nans = []\nfor i in range(q):\n\tkind, idd = [int(j) for j in input().split()]\n\tif kind == 1:\n\t\tif friend[idd-1] <= minfri:\n\t\t\tcontinue\n\t\telse:\n\t\t\torder.put((friend[idd-1], idd))\n\t\t\tdisplay[idd] = 1\n\t\t\tif order.full():\n\t\t\t\ttem = order.get()\n\t\t\t\tde, minfri = tem[1], tem[0]\n\t\t\t\tdisplay[de] = 0\n\tif kind == 2:\n\t\tif display[idd] == 1:\n\t\t\tans.append('YES')\n\t\telse:\n\t\t\tans.append('NO')\nprint('\\n'.join(ans))", "friends, displays, queries = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nscreen = []\r\nawakes = []\r\nfor j in range(queries):\r\n t, indx = map(int, input().split())\r\n if(t == 1):\r\n indxTemp = indx - 1\r\n temp = lst[indxTemp]\r\n if(len(awakes) < displays):\r\n awakes.append(temp)\r\n else:\r\n awakes = sorted(awakes)\r\n for w in range(displays):\r\n if(temp > awakes[w]):\r\n awakes[w] = temp\r\n break \r\n else:\r\n tt = lst[indx - 1]\r\n if(awakes.count(tt) > 0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "\r\n\r\n\r\n\r\n\r\nn,k,q = map(int,input().split())\r\n\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\nf=[]\r\n\r\n\r\n\r\nfor i in range(q):\r\n a,b= map(int,input().split())\r\n\r\n\r\n\r\n if a==1:\r\n if len(f)<k:\r\n f.append(t[b-1])\r\n else:\r\n f.append(t[b-1])\r\n f.sort()\r\n f=f[::-1][:k]\r\n else:\r\n \r\n if t[b-1] in f:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n \r\n", "n, k, q = map(int, input().split())\r\nfriends = list(map(int, input().split()))\r\n\r\nquery = []\r\n\r\nfor i in range(q):\r\n r = input().split()\r\n query.append( (int(r[0]), int(r[1])) )\r\n\r\nonline = set()\r\n\r\nfor t, i in query:\r\n if t == 1:\r\n if k > 0:\r\n online.add( (friends[i-1], i) )\r\n k -= 1\r\n else:\r\n m = min(online, key=lambda x: x[0])\r\n if m[0] < friends[i-1]:\r\n online.remove(m)\r\n online.add( (friends[i-1], i) )\r\n else:\r\n if (friends[i-1], i) in online:\r\n print(\"YES\")\r\n else: \r\n print(\"NO\")\r\n", "n, size, tasks = map(int, input().split())\r\nfriends = list(map(int, input().split()))\r\nonline = list()\r\nfor i in range(tasks):\r\n type, id = map(int, input().split())\r\n id -= 1\r\n if type == 1:\r\n adds = friends[id]\r\n online = sorted(online + [adds], reverse=True)\r\n if len(online) > size:\r\n del online[-1]\r\n else:\r\n flag_oh_my_god_why = False\r\n search = friends[id]\r\n for bear in online:\r\n if bear == search:\r\n flag_oh_my_god_why = True\r\n break\r\n if flag_oh_my_god_why == False: print('NO')\r\n else: print('YES')", "import heapq \na= input().split()\nn = int(a[0])\nk = int(a[1])\nq = int(a[2])\nt = input().split()\nt = [int(i) for i in t]\n \nlist = []\nmini = 0\nfor i in range(q): \n x= input().split()\n if int(x[0])== 1:\n if len(list) < k: \n list.append([t[int(x[1])-1], int(x[1])])\n list.sort(reverse= True)\n \n else: #filled with k elements \n if t[int(x[1])-1] > mini: \n list.append([t[int(x[1])-1], int(x[1])])\n list.sort(reverse= True)\n list.pop()\n mini = list[-1][0]\n \n else: \n counter = 0\n #print(k, len(list))\n smol = min(k, len(list))\n for l in range(smol): \n if list[l][1] == int(x[1]): \n counter += 1\n print(\"YES\")\n break\n if counter == 0: \n print(\"NO\")\n #print(x, list)", "def main():\r\n\t(n, k, q) = (int(x) for x in input().split())\r\n\tbears = [int(x) for x in input().split()]\r\n\t#bearsDict = {bears[i]: i for i in range(len(bears))}\r\n\tqueries = [None] * q\r\n\tfor i in range(q):\r\n\t\t(typei, idi) = (int(x) for x in input().split())\r\n\t\tqueries[i] = (typei, idi)\r\n\tsolver(k, bears, queries)\r\n\r\ndef solver(k, bears, queries):\r\n\tkBest = set()\r\n\tfor (typei, idi) in queries:\r\n\t\tif typei == 1:\r\n\t\t\thandle1(k, kBest, bears, idi)\r\n\t\telif typei == 2:\r\n\t\t\tprint(handle2(kBest, bears, idi))\r\n\r\ndef handle1(k, kBest, bears, idi):\r\n\tfriendship = bears[idi - 1]\r\n\tif len(kBest) < k:\r\n\t\tkBest.add(friendship)\r\n\telse:\r\n\t\tminimum = min(kBest)\r\n\t\tif minimum < friendship:\r\n\t\t\tkBest.remove(minimum)\r\n\t\t\tkBest.add(friendship)\r\n\r\ndef handle2(kBest, bears, idi):\r\n\tfriendship = bears[idi - 1]\r\n\tif friendship in kBest:\r\n\t\treturn \"YES\"\r\n\telse:\r\n\t\treturn \"NO\"\r\n\r\n# k = 3\r\n# bears = [50, 20, 51, 17, 99, 24]\r\n# queries = [(1, 3), (1, 4), (1, 5), (1, 2), (2, 4), (2, 2),\r\n# (1, 1), (2, 4), (2, 3)]\r\n\r\n# solver(k, bears, queries)\r\nmain()", "nkq = list(map(int,input().split()))\r\nfriends = list(map(int,input().split()))\r\nonlineFriends = {}\r\ndef checkTop(aDict, value):\r\n return value in aDict\r\nfor i in range(nkq[2]):\r\n query = list(map(int,input().split()))\r\n if query[0] == 1:\r\n onlineFriends[query[1]] = friends[query[1]-1]\r\n if nkq[1] >= len(onlineFriends.items()):\r\n pass\r\n else:\r\n newDict = {}\r\n aList = onlineFriends.values()\r\n aList = sorted(aList)[len(aList)-nkq[1]:] \r\n for i in onlineFriends.keys():\r\n if onlineFriends[i] in aList:\r\n newDict[i] = onlineFriends[i]\r\n onlineFriends = newDict \r\n else:\r\n statement = checkTop(onlineFriends, query[1])\r\n if statement:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\n\r\ndef inside(n, m, x, y):\r\n return 0 <= x <= n and 0 <= y <= m\r\n\r\ndef corner(n, m, x, y):\r\n return x in [0, n] and y in [0, m]\r\n\r\ndef next(n, m, x, y, t, a, b):\r\n for cx in [0, n]:\r\n cy = a * cx + b\r\n if inside(n, m, cx, cy) and (cx, cy) != (x, y):\r\n nx, ny = cx, cy\r\n for cy in [0, m]:\r\n cx = (cy - b) // a\r\n if inside(n, m, cx, cy) and (cx, cy) != (x, y):\r\n nx, ny = cx, cy\r\n nt = t + abs(nx - x)\r\n na = -a\r\n nb = ny - na * nx\r\n if corner(n, m, nx, ny):\r\n return None\r\n return nx, ny, nt, na, nb\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nd = defaultdict(list)\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n for a in [-1, 1]:\r\n b = y - a * x\r\n d[(a, b)].append((x, y, i))\r\nans = [-1] * k\r\nray = (0, 0, 0, 1, 0) #x, y, t, a, b\r\nvisit = set()\r\nwhile ray:\r\n x, y, t, a, b = ray\r\n if (a, b) in visit:\r\n break\r\n visit.add((a, b))\r\n for sensor in d[(a, b)]:\r\n sx, sy, i = sensor\r\n if ans[i] == -1:\r\n ans[i] = t + abs(x - sx)\r\n ray = next(n, m, x, y, t, a, b)\r\n\r\nfor x in ans:\r\n print(x)\r\n", "# [https://codeforces.com/contest/724/submission/21299971]\r\n\r\n(n, m, k) = map(int, input().split())\r\nn = 2*n\r\nm = 2*m\r\na = min(m, n)\r\nb = max(m, n)\r\ntracker = [b]\r\n\r\nwhile a>0:\r\n b = b % a\r\n tracker.append(a)\r\n (a, b) = (b, a)\r\n\r\ng = b\r\nprod=(m*n)//g\r\n\r\nif m!=n:\r\n if len(tracker)>=3:\r\n pair=(1, -(tracker[-3]//tracker[-2]))\r\n for i in range(len(tracker)-4, -1, -1):\r\n new=-(tracker[i]//tracker[i+1])\r\n pair=(pair[1], pair[0]+pair[1]*new)\r\n\r\n if min(m, n) == n:\r\n pair=(pair[1], pair[0])\r\n (a, b) = pair\r\n else:\r\n if m>n:\r\n a = 1\r\n b = 0\r\n else:\r\n a = 0\r\n b = 1\r\n\r\n for i in range(k):\r\n (x, y) = [int(i) for i in input().split()]\r\n if (x-y)%g != 0 and (x+y)%g != 0:\r\n print(-1)\r\n continue\r\n else:\r\n shortlist = []\r\n for nx in (x, -x):\r\n if ((nx-y)%g) == 0:\r\n new=(nx+a*n*((y-nx)//g))%prod\r\n shortlist.append(new)\r\n shortlist.append(prod-new)\r\n if len(shortlist)>0:\r\n print(min(shortlist))\r\n else:\r\n print(-1)\r\nelse:\r\n for i in range(k):\r\n (x, y) = [int(i) for i in input().split()]\r\n if x!=y:\r\n print(-1)\r\n else:\r\n print(x)", "n, m, k = map(int,input().split())\ndm, dp = {}, {}\nvis = {}\nsensors = []\nborder = set()\nfor el in [(0, m), (n, 0), (0, 0), (n, m)]:\n border.add(el)\n\nfor _ in range(k):\n x, y = map(int, input().split())\n if not (x - y) in dm:\n dm[x - y] = []\n dm[x - y].append((x, y))\n if not (x + y) in dp:\n dp[x + y] = []\n dp[x + y].append((x, y))\n vis[(x, y)] = -1\n sensors.append((x,y))\n\nx, y = 0, 0\ntime = 0\nmove = (1,1)\nwhile True:\n if move == (1,1):\n v = min(n - x, m - y)\n nxt = (x + v, y + v)\n if nxt[0] == n:\n move = (-1, 1)\n else:\n move = (1, -1)\n if (x - y) in dm:\n for sensor in dm[x - y]:\n if vis[sensor] == -1:\n #print('doing', sensor)\n vis[sensor] = time + sensor[0] - x\n time += v\n\n elif move == (-1,-1):\n v = min(x, y)\n nxt = (x - v, y - v)\n if nxt[0] == 0:\n move = (1, -1)\n else:\n move = (-1, 1)\n if (x - y) in dm:\n for sensor in dm[x - y]:\n if vis[sensor] == -1:\n #print('doing', sensor)\n vis[sensor] = time + x - sensor[0]\n time += v\n\n elif move == (-1,1):\n v = min(x, m - y)\n nxt = (x - v, y + v)\n if nxt[0] == 0:\n move = (1, 1)\n else:\n move = (-1, -1)\n if (x + y) in dp:\n for sensor in dp[x + y]:\n if vis[sensor] == -1:\n #print('doing', sensor)\n vis[sensor] = time + x - sensor[0]\n time += v\n\n else:\n v = min(n - x, y)\n nxt = (x + v, y - v)\n if nxt[0] == n:\n move = (-1, -1)\n else:\n move = (1, 1)\n if (x + y) in dp:\n for sensor in dp[x + y]:\n if vis[sensor] == -1:\n #print('doing', sensor)\n vis[sensor] = time + sensor[0] - x\n time += v\n\n if nxt in border:\n break\n else:\n border.add(nxt)\n\n x, y = nxt\n #print('bum', x, y)\n\nfor i in range(k):\n #print(sensors[i])\n print(vis[sensors[i]])\n", "import sys\r\nfrom array import array\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ninp_2d = lambda dtype, n: [dtype(input()) for _ in range(n)]\r\nceil1 = lambda a, b: (a + b - 1) // b\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\ncorner = lambda x, y: x in (0, n) and y in (0, m)\r\n\r\n\r\ndef do(x, y, t, signx, signy) -> tuple:\r\n a = []\r\n if y == 0:\r\n a = xd[x]\r\n elif x == 0:\r\n a = yl[y]\r\n elif y == m:\r\n a = xu[x]\r\n else:\r\n a = yr[y]\r\n\r\n while a:\r\n cur = a.pop()\r\n if ans[cur] == -1:\r\n ans[cur] = t + abs(x - xs[cur])\r\n\r\n distx = n - x if signx == 1 else x\r\n disty = m - y if signy == 1 else y\r\n signx_, signy_ = signx, signy\r\n\r\n if distx < disty:\r\n signx_ *= -1\r\n else:\r\n signy_ *= -1\r\n\r\n dist = min(distx, disty)\r\n return x + signx * dist, y + signy * dist, t + dist, signx_, signy_\r\n\r\n\r\nn, m, k = inp(int)\r\nans = [-1] * k\r\nxs = array('i')\r\nxd, xu = [[array('i') for _ in range(n + 1)] for _ in range(2)]\r\nyl, yr = [[array('i') for _ in range(m + 1)] for _ in range(2)]\r\n\r\nfor i in range(k):\r\n x, y = inp(int)\r\n xs.append(x)\r\n if x >= y:\r\n xd[x - y].append(i)\r\n else:\r\n yl[y - x].append(i)\r\n\r\n if n - x >= m - y:\r\n xu[x + (m - y)].append(i)\r\n else:\r\n yr[y + (n - x)].append(i)\r\n\r\n if n - x >= y:\r\n xd[x + y].append(i)\r\n else:\r\n yr[y - (n - x)].append(i)\r\n\r\n if x >= m - y:\r\n xu[x - (m - y)].append(i)\r\n else:\r\n yl[y + x].append(i)\r\n\r\ncurx, cury, time, signx, signy = do(0, 0, 0, 1, 1)\r\nwhile not corner(curx, cury):\r\n curx, cury, time, signx, signy = do(curx, cury, time, signx, signy)\r\n\r\nprint('\\n'.join(map(str, ans)))\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, k = map(int, input().split())\r\nl = n + m + 5\r\nu = [[] for _ in range(l)]\r\nv = [[] for _ in range(l)]\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n u[x + y].append((i, x, y))\r\n v[x - y].append((i, x, y))\r\nans = [-1] * k\r\nx, y = 0, 0\r\ndx, dy = 1, 1\r\nans0 = 0\r\nfor _ in range(2 * l):\r\n z = v[x - y] if dx * dy == 1 else u[x + y]\r\n while z:\r\n i, x0, y0 = z.pop()\r\n if ans[i] ^ -1:\r\n continue\r\n ans[i] = ans0 + abs(x - x0)\r\n x1 = n - x if dx == 1 else x\r\n y1 = m - y if dy == 1 else y\r\n mi = min(x1, y1)\r\n x, y = x + mi * dx, y + mi * dy\r\n ans0 += mi\r\n if x1 == mi:\r\n dx *= -1\r\n if y1 == mi:\r\n dy *= -1\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "from sys import *\r\nf = lambda: map(int, stdin.readline().split())\r\nn, m, k = f()\r\nw, h = 2 * n, 2 * m\r\n\r\ninf = 1e11\r\ns = [inf] * (w + h)\r\na = b = t = 0\r\n\r\nwhile 1:\r\n if s[b - a] == inf: s[b - a] = t - a\r\n d = min(w - a, h - b)\r\n t += d\r\n a = (a + d) % w\r\n b = (b + d) % h\r\n if a % n == b % m: break\r\n\r\nfor i in range(k):\r\n x, y = f()\r\n q = min(s[b - a] + a for a in (x, w - x) for b in (y, h - y))\r\n print(q if q < inf else -1)", "\n\n\"\"\"\nNTC here\n\"\"\"\nimport sys\ninp = sys.stdin.readline\ndef input(): return inp().strip()\n# flush= sys.stdout.flush\n# import threading\n# sys.setrecursionlimit(10**6)\n# threading.stack_size(2**26)\n\ndef iin(): return int(input())\n\n\ndef lin(): return list(map(int, input().split()))\n\n\n# range = xrange\n# input = raw_input\n\n\ndef main():\n\n T = 1\n def fn(ch, x, y):\n return x*ch[0] + y*ch[1] + ch[2]==0\n def fnx(ch, y):\n return (-ch[1]*y-ch[2])/ch[0]\n def fny(ch, x):\n return (-ch[0]*x-ch[2])/ch[1]\n def int_val(x):\n return int(x*10000)==int(x)*10000\n while T:\n T-=1\n n, m, k = lin()\n h = m\n w = n\n end = {(0, h), (0, 0), (w, h), (w, 0)}\n sensors = [lin() for _ in range(k)]\n # we will track ray\n # as line as set of ax+by+c=0\n lines = {(1, -1, 0):[ (0, 0), 0]}\n ch = [1, -1, 0]\n ch1 = 1\n ch2 = 0\n st = [0, 0]\n while 1:\n # print('EQ-', ch)\n # print(st)\n dn = 0\n # y = h\n y1 = h\n x1 = fnx(ch, y1)\n # print(\"D\",[x1, y1])\n if int_val(x1) and 0<=int(x1)<=w and [int(x1), int(y1)]!=st:\n x1 = int(x1)\n if x1 == w:\n break\n dn = 1\n # y = 0\n if dn==0:\n y1 = 0\n x1 = fnx(ch, 0)\n # print(\"A\",[x1, y1])\n if int_val(x1) and 0<=int(x1)<=w and [int(x1), int(y1)] != st:\n x1 = int(x1)\n if x1 == 0:\n break\n dn = 1\n\n if dn==0:\n # x = 0\n x1 = 0\n y1 = fny(ch, x1)\n # print(\"B\",[x1, y1])\n if int_val(y1) and 0<=int(y1)<=h and [int(x1), int(y1)] != st:\n y1 = int(y1)\n if y1 == 0:\n break\n dn = 1\n\n if dn==0:\n # x = w\n x1 = w\n y1 = fny(ch, x1)\n # print(\"C\",[x1, y1])\n if int_val(y1) and 0<=int(y1)<=h and [int(x1), int(y1)] != st:\n y1 = int(y1)\n if y1 == h:\n break\n dn = 1\n if dn:\n \n # print(x1, y1)\n ch2 += abs(st[0]-x1)\n ch1 = -1 if ch1==1 else 1\n ch = [ch1, -1, -ch1*x1+y1]\n if tuple(ch) in lines:continue\n lines[tuple(ch)] = [[x1, y1], ch2]\n if (x1, y1) in end:break\n \n st = [x1, y1]\n else:\n break\n # print(lines)\n for i, j in sensors:\n ch1, ch2 = (1, -1, -i+j), (-1, -1, i+j)\n # print((i, j), ch1, ch2)\n ans = -1\n if ch1 in lines: \n p, c1 = lines[ch1]\n ans = abs(p[0]-i)+c1\n if ch2 in lines:\n p, c1 = lines[ch2]\n ans = abs(p[0]-i)+c1 if ans==-1 else min(abs(p[0]-i)+c1, ans)\n print(ans)\n \n\n\n\n\n\n\nmain()\n\n# threading.Thread(target=main).start()\n" ]

[ "import re\r\ns = input()\r\n\r\nd = re.findall(\".\\d+e\", s)[0][1:-1] + \"0\" * 100\r\na = re.findall(\"\\d+.\", s)[0][:-1]\r\nb = int(re.findall(\"e\\d+\", s)[0][1:])\r\nr = a + d[:b] + \".\" + d[b:]\r\nr = r.replace(\"0\", ' ').strip().replace(' ', '0')\r\nif r[0] == '.':\r\n r = \"0\" + r\r\nif r[-1] == '.':\r\n r = r[:-1]\r\n\r\nprint(r)", "from decimal import Decimal\r\n\r\n\r\ndef barnikl(n):\r\n m = Decimal(n)\r\n if int(m) == m:\r\n return int(m)\r\n return str(m)\r\n\r\n\r\nprint(barnikl(input()))\r\n", "line = input().split('e')\r\n\r\np = line[0]\r\npo = int(line[1])\r\n\r\npos = p.find('.')\r\nnpos = pos + po + 1\r\n\r\nwhile npos > len(p):\r\n\tp = p + '0'\r\n\r\np = p[:pos] + p[pos+1:npos] + '.' + p[npos:]\r\n\r\nnp = len(p) - 1\r\nwhile np >= 0:\r\n\tif p[np] == '.':\r\n\t\tp = p[:np]\r\n\t\tbreak\r\n\tif p[np] != '0':\r\n\t\tbreak\r\n\tnp -= 1\r\n\r\nprint(p)", "from decimal import Decimal\r\ndef isint(n):\r\n return n == int(n)\r\ns = input()\r\nss = Decimal(s)\r\nif isint(ss):\r\n print(int(ss))\r\nelse:\r\n print(ss)", "a, b = input().split(\"e\")\nb = int(b)\nc, d = a.split(\".\")\nd += \"0\" * 100\nans = c + d[:int(b)] + \".\" + d[int(b):]\nwhile ans[-1] == \"0\":\n ans = ans[:-1]\nif ans[-1] == \".\":\n ans = ans[:- 1]\nprint(ans)\n", "s = input()\r\na = s.split('e')[0].split('.')[0]\r\nd = s.split('e')[0].split('.')[1]\r\nb = int(s.split('e')[1])\r\n\r\nif int(d) == 0:\r\n d = ''\r\n\r\nif len(d) <= b:\r\n a += d\r\n for i in range(b - len(d)):\r\n a += '0'\r\nelse:\r\n for i in range(b):\r\n a += d[i]\r\n a += '.'\r\n for i in range(b, len(d)):\r\n a += d[i]\r\n\r\np = list(a.split('.')[0])\r\nwhile len(p) > 1 and p[0] == '0':\r\n del p[0]\r\np = \"\".join(p)\r\n\r\nif len(a.split('.')) > 1:\r\n a = p + '.' + a.split('.')[1]\r\nelse:\r\n a = p\r\nprint(a)", "from decimal import *\r\nd = Decimal(input())\r\nif int(d) == d:\r\n print(int(d))\r\nelse:\r\n print(d)", "n = input().split(\"e\")\r\nz = int(n[1])\r\nres = n[0][0]\r\ni = 2\r\nwhile z > 0:\r\n res += (n[0][i] if i < len(n[0]) else '0')\r\n z -= 1\r\n i += 1\r\nif i < len(n[0]) and n[0][i:] != '0':\r\n res += '.' + n[0][i:]\r\nprint(res)\r\n", "from decimal import *\na = Decimal(input())\nif int(a) == a:\n\tprint(int(a))\nelse:\n\tprint(a)", "from decimal import *\r\na = Decimal(input())\r\nprint(\"%d\" % a) if round(a) == a else print(a)\r\n", "\r\n\r\nfrom decimal import *\r\nn = Decimal(input())\r\nprint(int(n) if int(n)==n else n)", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf():\r\n return [int(i) for i in get().split()]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join(map(str, a)) + end)\r\n\r\ndef isopen(s):\r\n return s in [\"(\", \"{\", \"[\", \"<\"]\r\n\r\ndef main():\r\n s = input()\r\n n = len(s)\r\n for i in range(n):\r\n if(s[i] == \"e\"):\r\n e = int(s[i + 1:])\r\n ln = i\r\n s = [s[0]] + list(s[2 : ln]) + [\"0\"]*e\r\n n = len(s)\r\n x = n - ln + 2\r\n s.insert(x, \".\")\r\n j = n\r\n while(s[j] == \"0\"):\r\n j -= 1\r\n if(s[j] != \".\"):\r\n j += 1\r\n i = 0\r\n while(s[i] == \"0\"):\r\n i += 1\r\n if(s[i] == \".\"):\r\n i -= 1\r\n putf(s[i : j], \"\")\r\nmain()\r\n", "s = input()\r\nbf = s[len(s)-4:]\r\neindex = len(s)-(4-bf.index('e'))\r\nb = int(bf[bf.index('e')+1:])\r\nx = eindex-(2+b)\r\ndlen = eindex-2\r\n\r\nprint(s[0], end = '')\r\nif (dlen == 1) and s[2] == '0' and b == 0:\r\n pass\r\nelif (dlen > b):\r\n print(s[2:2+b], end = '')\r\n print('.', end = '')\r\n print(s[2+b:eindex])\r\nelif (dlen == b):\r\n print(s[2:2+b], end = '')\r\nelif (dlen < b):\r\n print(s[2:eindex], end = '')\r\n print('0'*(b-dlen), end = '')\r\n", "a,b = input().split(\"e\")\nb = int(b)\nc,d = a.split(\".\")\nd += \"0\" * 200\nans = c + d[:b] + \".\" + d[b:]\nwhile ans[-1] == \"0\":\n ans = ans[:-1]\nif ans[-1] == \".\":\n ans = ans[:-1]\nprint(ans)\n", "from decimal import *\r\nimport re\r\n\r\ngetcontext().prec = 1000\r\n\r\ni = input().strip()\r\n\r\nnumber, exp = map(Decimal, i.split('e'))\r\n\r\nnumber *= 10**int(exp)\r\n\r\n\r\nif int(number) - number == 0:\r\n print(int(number))\r\nelse:\r\n print(re.sub(\"0+$\", \"\", str(number)))", "from decimal import *\na=Decimal(input())\nprint([a,'%d'%a][a==round(a)])\n", "from math import floor\r\nfrom decimal import *\r\n\r\ngetcontext().prec = 100\r\na = Decimal(input())\r\nif(a-floor(a) == 0):\r\n print(floor(a))\r\nelse:\r\n print(a, end='')", "from decimal import *\r\ngetcontext().prec = 100\r\nx = Decimal(input())\r\nif(x == int(x)):\r\n print(int(x))\r\nelse:\r\n print(x)", "#File:third.py\r\ndef main():\r\n #initial part\r\n string=input(\"\")\r\n list=string.split(\"e\")\r\n \r\n b=int(list[1])\r\n \r\n L=len(list[0])-2\r\n list1=str(list[0]).split(\".\")\r\n final=\"\".join(list1)\r\n #conditional part\r\n if(L>b):\r\n position=2+b\r\n ans=''\r\n ans1=final[0:position-1]\r\n ans2=final[position-1: ]\r\n \r\n ans=ans1+\".\"+ans2\r\n elif(L==b):\r\n ans=\"\"\r\n ans=final\r\n elif(L<b):\r\n ans1=\"\"\r\n ans=\"\"\r\n for i in range(b-L):\r\n ans1=ans1+'0'\r\n ans=final+ans1\r\n if(ans[1]==\".\" and ans[2]=='0' and len(ans)==3):\r\n print(int(eval(ans)))\r\n\r\n elif(eval(ans)==int(eval(ans))):\r\n \r\n print(ans)\r\n else:\r\n listans=ans.split(\".\")\r\n finalans1=\"\"\r\n finalans2=\"\"\r\n finalans1=str(int(listans[0]))\r\n finalans2=str(listans[1])\r\n finalans=finalans1+\".\"+finalans2\r\n print(finalans)\r\nmain()\r\n \r\n", "a, b = input().split('e')\r\na = a[:1]+a[2:]\r\nb = int(b)\r\na += '0' * 200\r\na = a[:b+1] + '.' + a[b+1:]\r\nwhile a[-1] == '0':\r\n\ta = a[:-1]\r\nif a[-1] == '.':\r\n\ta = a[:-1]\r\nprint(a)", "from decimal import *\r\na = input()\r\nb = Decimal(a)\r\nif round(b) == b:\r\n print(round(b))\r\nelse:\r\n print(b)\r\n", "from decimal import *\r\nn=input()\r\nx=Decimal(n)\r\nif(round(x)==x):\r\n print(\"%d\"%x)\r\nelse:\r\n print(x)\r\n", "from decimal import *\r\nn = Decimal(input())\r\nprint(n if n - int(n) != 0 else int(n))", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 bruno <bruno@bruno-Aspire-F5-571G>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\ns = input()\nl = s.split('e')\nl1 = (l[0].split('.'))[0]\nl2 = (l[0].split('.'))[1]\nl3 = l[1]\nl3 = int(l3)\n\nrazlika = l3 - len(l2)\n\ntocka = len(l1) + l3\n\nif razlika > 0:\n l2 += '0' * razlika\n\nl1l2 = l1 + l2\nl1l2 = l1l2[:tocka] + '.' + l1l2[tocka:]\n\nwhile l1l2[0] == '0':\n l1l2 = l1l2[1:]\nif l1l2[0] == '.':\n l1l2 = '0' + l1l2\nwhile l1l2[-1:] == '0':\n l1l2 = l1l2[:-1]\nif l1l2[-1:] == '.':\n l1l2 = l1l2[:-1]\n\nprint(l1l2)\n\n", "from decimal import *\nx = Decimal(input())\n\nif(x == int(x)):\n print(int(x))\nelse:\n print(x)\n# 1497641411165\n", "from decimal import *\r\n\r\nres = Decimal(input())\r\nprint([res,int(res)][int(res)==res])\r\n", "from decimal import Decimal\r\nfinal = Decimal(input())\r\nprint([final, int(final)][int(final) == final])\r\n", "\r\nliste=input().split(\"e\")\r\np=liste[0]\r\nq=int(liste[1])\r\nif \".\" in p:\r\n\tnum=p.split('.')\r\n\tdec=len(num[1])\r\n\tif num[1]!=\"0\":\r\n\t\tif dec==q:\r\n\t\t\tp=num[0]+num[1]\r\n\t\telif dec<q:\r\n\t\t\tp=num[0]+num[1]+\"0\"*(q-dec)\r\n\t\telse:\r\n\t\t\tp=num[0]+num[1][:q]+\".\"+num[1][q:]\r\n\telse:\r\n\t\tp=num[0]+\"0\"*q\r\nelse:\r\n\tp+='0'*q\r\n\r\nprint(p)\r\n\r\n", "from decimal import *\r\ngetcontext().prec=1000\r\nprint('{0:f}'.format(Decimal(input()).normalize()))", "import decimal\n\ndecimal.getcontext().prec = 999\n\ndef main():\n (x, e) = input().split('e')\n num = decimal.Decimal(x)\n e = int(e)\n num *= (10 ** e)\n s = \"{:.1000f}\".format(num).rstrip(\"0\")\n if s[-1] == '.':\n return s[:-1]\n return s\n\nprint(main())\n\n", "from decimal import *\r\na = Decimal(input())\r\nprint(int(a) if int(a) == a else a)", "s = input()\r\nm = int(s[s.find(\"e\")+1:])\r\nz = s.find(\".\")\r\n \r\ns = s[:z] + s[z+1:s.find(\"e\")]\r\nz += m \r\nif z < len(s):\r\n s = s[:z] + \".\" + s[z:]\r\n \r\nif s[-1] == \".\":\r\n s = s[:-1]\r\n \r\nif z > len(s)-1:\r\n s += (z - len(s))*\"0\"\r\nif len(s) >= 2 and s[-1] == \"0\" and s[-2] == \".\":\r\n s = s[:-2]\r\n \r\n\r\nprint(s) \r\n\r\n\r\n\r\n\r\n ", "from decimal import *\r\nSciNum=Decimal(input())\r\nprint([SciNum,int(SciNum)][int(SciNum)==SciNum])", "from decimal import *\r\na = Decimal(input())\r\nif int(a) == a:\r\n\tprint(int(a))\r\nelse:\r\n\tprint(a)\r\n", "from decimal import *\r\n\r\nres = Decimal(input())\r\nprint([res, int(res)][res == int(res)])\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nx = s.index('e')\r\nb = int(s[x+1:])\r\nd = s[2:x]\r\n\r\nif d == '0':\r\n print(int(s[:1])*(10**b))\r\n exit(0)\r\n\r\nif b < len(d):\r\n print(s[:1]+d[:b]+'.'+d[b:])\r\nelse:\r\n print(int(s[:1]+d)*(10**(b-len(d))))", "a, b = input().split(\"e\")\r\nb = int(b)\r\np = len(a)\r\nq = a.index(\".\")\r\na = a[:q] + a[q + 1:q + b + 1] + \".\" + a[q + b + 1:]\r\nwhile a[-1] == \"0\":\r\n a = a[:-1]\r\nif a[-1] == \".\":\r\n a = a[:-1] + \"0\" * (b - (p - q - 1))\r\nprint(a)", "from decimal import *\r\na=Decimal(input())\r\nprint([a,'%d'%a][a==round(a)])", "s=input()\r\nl,r=s.split('e')\r\na,d=l.split('.')\r\na=int(a)\r\nb=int(r)\r\nif int(b):\r\n d=int(str(d)[-1::-1])\r\n for i in range(b):\r\n a=a*10+d%10\r\n d//=10\r\n d=str(d)[-1::-1]\r\nprint(a,end='')\r\nif int(d):\r\n print('.',end='')\r\n print(d)", "from decimal import *\r\n\r\na = Decimal(input())\r\n\r\nprint([a, '%d' % a][int(a) == a])", "from decimal import *\r\na=Decimal(input())\r\nif(int(a)==a):\r\n print(int(a))\r\nelse:\r\n print(a)\r\n", "line = input()\r\na = line.split(\".\")[0]\r\nb = line.split(\".\")[1].split(\"e\")[0]\r\nc = int(line.split(\".\")[1].split(\"e\")[1])\r\n\r\nb += 1000 * '0'\r\na += b[:c]\r\nb = b[c:]\r\n\r\nif a.count('0') < len(a):\r\n pos = 0\r\n while a[pos] == '0':\r\n pos += 1\r\n a = a[pos:]\r\n\r\nif b.count('0') == len(b):\r\n print(a)\r\nelse:\r\n pos = len(b) - 1\r\n while b[pos] == '0':\r\n pos -= 1\r\n print(a + \".\" + b[:pos+1])\r\n\r\n", "s = str(input())\r\na = s[0]\r\nd = s[2:s.find('e')]\r\nb = int(s[s.find('e') + 1:]) + 1\r\na += d\r\n\r\nwhile len(a) < b:\r\n\ta += '0'\r\n\t\r\na = a[:b] + '.' + a[b:]\r\n\r\nwhile a[0] == '0':\r\n\ta = a[1:]\r\n\t\r\nwhile a[-1] == '0':\r\n\ta = a[:-1]\r\n\t\r\nif a[0] == '.':\r\n\ta = '0' + a\r\n\t\r\nif a[-1] == '.':\r\n\ta = a[:-1]\r\n\t\r\nprint(a)", "from decimal import *\r\na = Decimal(input())\r\nif (int(a)==a):\r\n print('%d'%a)\r\nelse:\r\n print(a)", "from decimal import *\r\na=Decimal(input())\r\nprint([a,int(a)][int(a)==a])", "s=input()\r\na,b=s.split('e')\r\nc,d=a.split('.')\r\nb=int(b)\r\nif(d=='0'):\r\n d=''\r\nif(b<len(d)):\r\n print(c+d[:b]+'.'+d[b:])\r\nelse:\r\n print(c+d+(b-len(d))*'0')\r\n", "a, d = input().split('.')\r\nd, b = d.split('e')\r\nb = int(b)\r\n\r\nif b <= len(d):\r\n a = a + d[:b]\r\n d = d[b:]\r\nelse:\r\n a = a + d + '0' * (b - len(d))\r\n d = ''\r\n\r\nwhile len(a) > 1 and a[0] == '0':\r\n a = a[1:]\r\n\r\nif len(d) == 0 or d == '0':\r\n print(a)\r\nelse:\r\n print('{}.{}'.format(a, d))\r\n", "from decimal import *\r\n\r\nwhile True :\r\n try :\r\n a=input()\r\n b=Decimal(a)\r\n\r\n if(round(b)==b):\r\n print (\"%d\"%b)\r\n else:\r\n print (b)\r\n \r\n except :\r\n break\r\n \r\n\r\n", "def main():\r\n\ts = input()\r\n\tprint(solver(s))\r\n\r\ndef solver(s):\r\n\t(baseS, expS) = s.split('e')\r\n\texp = int(expS)\r\n\tnS = baseS[:firstTrailingZero(baseS)]\r\n\tif len(nS) - 2 > exp:\r\n\t\tnS = nS[0] + nS[2:exp + 2] + \\\r\n\t\t'.' + nS[exp + 2:]\r\n\t\t#if len(baseS) - 2 != exp:\r\n\t\t\t#nS += '.' + baseS[exp + 2:]\r\n\t\t\r\n\t\t#(wholePart, decPart) = nS.split('.')\r\n\t\t#if decPart == '0' * len(decPart):\r\n\t\t#\treturn wholePart\r\n\t\t#else:\r\n\t\t#\treturn nS\r\n\telse:\r\n\t\tnS = nS[0] + nS[2:] + \\\r\n\t\t'0' * (exp - len(nS) + 2)\r\n\treturn nS\r\n\r\n\r\ndef firstTrailingZero(s):\r\n\tindex = len(s) - 1\r\n\twhile s[index] == '0':\r\n\t\tindex -= 1\r\n\treturn index + 1\r\n\r\n#print(firstTrailingZero(\"10.20\"), 1)\r\n\r\n# print(solver(\"8.549e2\"))\r\n# print(solver(\"8.549e3\"))\r\n# print(solver(\"0.33e0\"))\r\n# print(solver(\"1.31e1\"))\r\n# print(solver(\"8.25983e5\"))\r\n# print(solver(\"8.25e5\"))\r\n# print(solver(\"4.28522890224373996236468418851564462623381500262405e30\"))\r\n# print(solver(\"1.0e0\"))\r\n# print(solver(\"1.020e1\"))\r\n\r\nmain()\r\n\r\n", "def validate(ans,typ):\n if typ:\n #Just trim starting zeros\n ptr = 0\n while True:\n if ptr == len(ans):\n break\n if ans[ptr] != '0':\n break\n ptr += 1;\n if ptr == len(ans) :\n return \"0\"\n else:\n return ans[ptr:]\n else:\n # Contains a decimal point\n x , y = ans.split(\".\")\n # print(x,y)\n ptr = 0\n while True:\n if ptr == len(x):\n break\n if x[ptr] != '0':\n break\n ptr += 1\n ans = \"\"\n if ptr == len(x) :\n ans += \"0\"\n else:\n ans += x[ptr:]\n\n \n ptr2 = len(y) - 1\n while True:\n if ptr2 < 0 :\n break\n if y[ptr2] != '0':\n break\n ptr2 -= 1\n if ptr2 == -1:\n return ans\n else:\n return ans + \".\" + y[:ptr2+1]\n\nx = input().split(\"e\")\nprep = \"\"\nstat = 0\ncnt = 0\n\nfor i in x[0]:\n if stat == 1 :\n cnt += 1\n if i != '.' :\n prep += i\n if i == '.':\n stat = 1\n\n\nadd = int(x[1])\nans = \"\"\ntyp = 0\nif cnt > add :\n cnt -= add\n get = len(prep) - cnt\n for i in range(get):\n ans += prep[i]\n ans += \".\"\n for i in range(get,len(prep)):\n ans += prep[i]\nelse:\n typ = 1\n add -= cnt\n ans += prep + \"0\"*add\n# print(ans)\nprint(validate(ans,typ))\n", "s = input().split(\"e\")\r\nk = s[0].split(\".\")\r\na = k[0]\r\nif k[1] != \"0\": a+= k[1]\r\nb = int(s[1]) + 1\r\nif b == len(a):\r\n print(a)\r\nelif b > len(a):\r\n print(a + \"0\" * (b - len(a)))\r\nelse:\r\n print(a[:b] + \".\" + a[b:])\r\n", "while True:\r\n try:\r\n a, tmp = input().split('.')\r\n d, b = tmp.split('e')\r\n b = int(b)\r\n \r\n if d.lstrip('0') == '':\r\n d = '0'\r\n \r\n if d == '0' and b == 0:\r\n print(a)\r\n elif b >= len(d):\r\n d = a + d.ljust(b, '0')\r\n ans = d.lstrip('0')\r\n \r\n if ans == '':\r\n ans = '0'\r\n \r\n print(ans)\r\n else:\r\n p1 = (a + d[:b]).lstrip('0')\r\n p2 = d[b:]\r\n \r\n if p1 == '':\r\n p1 = '0'\r\n \r\n if p2.lstrip('0') == '':\r\n print(p1 + '.' + '0')\r\n else:\r\n print(p1 + '.' + p2)\r\n \r\n except:\r\n break\r\n", "from math import floor\nfrom decimal import *\n\ngetcontext().prec = 100\na = Decimal(input())\nif(a-floor(a) == 0):\n print(floor(a))\nelse:\n print(a)", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nfrom decimal import*\nx=Decimal(input())\ny=x.to_integral_value()\nprint(x if x!=y else int(y))\n", "a,e=input().split('e')\r\ne=int(e)-len(a)+2\r\na=a[0]+a[2:]\r\nif e>=0:print(a+'0'*e);exit()\r\na=int(a)\r\nt=10**-e\r\nr='.'+str(a%t+t)[1:]\r\nif set(r)==set('.0'):r=''\r\nprint(str(a//t)+r)", "s=input()\r\n\r\na=s[0]\r\nd,b=list(s[2:].split('e'))\r\nif a=='0':\r\n\tprint(0 if d=='0' else '0.'+d)\r\nelse:\r\n\tb=int(b)\r\n\tlen_d=len(d)\r\n\tif b==0 and d=='0':\r\n\t\tprint(a)\r\n\telse:\r\n\t\tprint(a+d[:b]+'.'+d[b:] if b<len_d else a+d+'0'*(b-len_d))", "s=input()\r\ni=len(s)-1\r\nwhile s[i]!='e':\r\n i-=1\r\nb=int(s[i+1:len(s)])\r\nj=0\r\nwhile s[j]!='.':\r\n j+=1\r\np=\"\"\r\nif s[i-1]=='0':\r\n p=s[0:j]\r\n for i in range(b):\r\n p=p+'0'\r\nelif i-j>b+1:\r\n p=s[0:j]+s[j+1:j+b+1]+'.'+s[j+b+1:i]\r\nelse:\r\n p=s[0:j]+s[j+1:i]+s[j+b+1:i]\r\n for i in range(b-(i-j-1)):\r\n p=p+'0'\r\nprint(p)\r\n", "from decimal import *\na = input()\nb = Decimal(a)\nif round(b) == b:\n\tprint(\"%d\" % b)\nelse:\n\tprint(b)\n\t \t \t \t \t\t\t \t \t\t \t\t \t \t\t \t", "from decimal import *\na = input()\nb = Decimal(a)\nif round(b) == b:\n print(round(b))\nelse:\n print(b)", "s = input().split('.')\r\ns[1] = s[1].split('e')\r\ns = [s[0]] + s[1]\r\na = int(s[0])\r\nd = int(s[1])\r\nb = int(s[2])\r\nif b >= len(s[1]):\r\n ans = s[0] + s[1] + '0' * (b - len(s[1]))\r\n print(ans)\r\nelse:\r\n ans = s[0] + s[1][:b] + '.' + s[1][b:]\r\n print(ans.rstrip('0').rstrip('.'))", "from decimal import Decimal\n\na = input()\nb = Decimal(a)\nif (round(b) == b):\n print(\"%d\" %b)\nelse:\n print(b)", "from decimal import *\r\n\r\ngetcontext().prec = 100\r\nx = Decimal(input())\r\nprint(int(x) if x == int(x) else x)\r\n", "#!/usr/bin/env python3\n\n\nfrom decimal import Decimal\n\n\ndef main():\n a = Decimal(input())\n if int(a) == a:\n print(int(a))\n else:\n print(str(a))\n\n\nif __name__ == '__main__':\n main()\n", "import decimal as d\n\na = input()\nb = d.Decimal(a)\nif round(b)==b:\n print('%d' % b)\nelse:\n print(b)\n\n\t \t \t \t \t \t \t\t \t", "from decimal import *\r\nn=Decimal(input())\r\nif int(n)==n:print(int(n))\r\nelse:print(n)", "s = input().split(\".\")\r\nt = s[1].split(\"e\")\r\nqnt = int(t[-1])\r\ns.pop()\r\nt.pop()\r\nans = s[0]\r\n\r\nif t[0] == \"0\":\r\n while qnt > 0:\r\n ans += \"0\"\r\n qnt-=1\r\nelse:\r\n for j in range( min(qnt, len(t[0])) ):\r\n ans += t[0][j]\r\n if qnt > len(t[0]):\r\n while qnt > len(t[0]):\r\n ans += \"0\"\r\n qnt-=1\r\n #ans += \".0\"\r\n elif len(t[0]) > qnt:\r\n ans += \".\"\r\n ans += t[0][qnt:]\r\n\r\nprint(ans)", "t=1\r\nwhile t>0:\r\n t-=1\r\n s=input()\r\n k=False\r\n sum=0\r\n pos=0\r\n for i in range(0,len(s)):\r\n if k==True:\r\n sum*=10\r\n sum+=int(s[i])\r\n if s[i]=='e':\r\n k=True\r\n pos=i\r\n str=[]\r\n num=-1\r\n h=False\r\n for i in range(0,pos):\r\n if i==0 and s[i]=='0' and sum!=0:\r\n continue\r\n else:\r\n if s[i]=='.':\r\n num+=1\r\n h=True\r\n else:\r\n if h==True:\r\n if num==sum:\r\n str.append('.')\r\n str.append(s[i])\r\n num+=1\r\n else:\r\n str.append(s[i])\r\n while num<sum:\r\n str.append('0')\r\n num+=1\r\n res1=len(str)\r\n res2=-1\r\n for i in range(0,len(str)):\r\n if str[i]=='.':\r\n res1=i\r\n break\r\n if res1!=len(str):\r\n l=True\r\n for i in range(len(str)-1,res1-1,-1):\r\n if str[i]!='0':\r\n res2=i\r\n break\r\n for i in range(0,res2+1):\r\n if str[i]=='.' and i==res2:\r\n break\r\n print(str[i],end='')\r\n else:\r\n for i in range(0,len(str)):\r\n print(str[i],end='')" ]

[ "a=int(input())\r\ns=str(a)\r\ncount=0\r\nfor i in s:\r\n if i==\"0\":\r\n count+=1\r\nif (count>=6):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "\r\na = input()\r\nsz = len(a)\r\n\r\nflg = 0\r\ncnt = 0\r\nfor i in range (0,sz):\r\n k = a[i]\r\n if(int(k)==1) :\r\n flg = 1\r\n continue\r\n if(flg==1 and int(k)==0) :\r\n cnt+=1\r\n\r\nif(cnt>=6) :\r\n print(\"yes\")\r\nelse :\r\n print(\"no\")\r\n", "x=input()\r\ny=x.find('1')\r\nx=x[y:]\r\ny=x.count('0')\r\nif(y>5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\nif not ('0' in n and '1' in n):\n print('no')\nelif n.count('0') >= (n.index('1') + 6) and len(n) > 6:\n print('yes')\nelse:\n print('no')", "s = input()\r\nf = 0\r\nx = '0' \r\nfor i in s:\r\n if i == '1':\r\n f = 1\r\n continue\r\n if f == 1 and i == '0':\r\n x += i\r\n#print(x)\r\nif len(x) > 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "a=input()\r\narray=list(a)\r\nbirBulundu=False\r\nsifirSayisi=0\r\nfor i in array:\r\n if(i=='1'):\r\n birBulundu=True\r\n else:\r\n if(birBulundu==True):\r\n sifirSayisi=sifirSayisi+1\r\n \r\nif (sifirSayisi>5):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "s = input()\r\ns = s[s.find(\"1\"):]\r\nif (len(s) - s.count(\"1\") >= 6): \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\na = s.find('1')\r\n\r\nc = 0 \r\nif(a == -1):\r\n print('no')\r\nelse:\r\n for el in range(a , len(s)) :\r\n if(s[el] == '0'):\r\n c += 1 \r\n \r\n if(c > 5):\r\n print('yes')\r\n else:\r\n print('no')", "print(\"yes\") if input().lstrip(\"0\").count(\"0\") >= 6 else print(\"no\")", "s = str(int(input()))\r\nif (s.count('0') > 5)and(s.count('1')>0):\r\n print(\"yes\")\r\nelse:\r\n print('no')\r\n", "print('yes' if sum(1 for x in input().partition('1')[2] if x=='0')>=6 else 'no')", "s=list(map(str,input()))\r\nif s.count('1')>0 and len(s)>=7:\r\n i=s.index('1')\r\n s=s[i+1:]\r\n if s.count('0')>=6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")\r\n ", "def main_function():\r\n s = input()\r\n counter = 0\r\n did_start = False\r\n for i in s:\r\n if did_start:\r\n if i == \"0\":\r\n counter += 1\r\n if i == \"1\":\r\n did_start = True\r\n if counter >= 6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nmain_function()", "s=input()\r\np=s.find('1')\r\nif p<0:\r\n print('no')\r\nelse:\r\n s=s[p:]\r\n if s.count('0')>=6:\r\n print('yes')\r\n else:\r\n print('no')", "num = int(input())\r\ncnt = 0\r\nfor i in str(num):\r\n if i == '0':\r\n cnt += 1\r\nif num > 0 and cnt >= 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "s = input()\r\nx = int(s,2)\r\nxl = [int(i) for i in s]\r\nif(x<64 or (1 not in xl)):\r\n print('no')\r\nelse:\r\n if(xl[xl.index(1)+1:].count(0)<6):\r\n print('no')\r\n else:\r\n print('yes')", "s=input().strip()\r\nif(len(s) <= 6):\r\n print(\"no\")\r\nelse:\r\n flag=0\r\n for i in range(len(s)):\r\n if(s[i] == '1'):\r\n c=0\r\n for j in range(i+1,len(s)):\r\n if(s[j] == '0'):\r\n c+=1\r\n if(c>=6):\r\n flag=1\r\n break\r\n if(flag == 1):\r\n break\r\n if(flag == 1):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")", "s=input()\r\nif(len(s)<7):\r\n print('no')\r\nelse:\r\n c=0\r\n for i in range(len(s)):\r\n if s[i]=='1':\r\n for j in range(i+1,len(s)):\r\n if s[j]=='0':\r\n c+=1\r\n break\r\n if(c>=6):\r\n print('yes')\r\n else:\r\n print('no')", "# A. Div. 64\r\n# time limit per test1 second\r\n# memory limit per test256 megabytes\r\n# inputstandard input\r\n# outputstandard output\r\n# Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills.\r\n#\r\n# Her problem is following: for given string, consisting of only 0 and 1, tell if it's possible to remove some digits in such a way, that remaining number is a representation of some positive integer, divisible by 64, in the binary numerical system.\r\n#\r\n# Input\r\n# In the only line given a non-empty binary string s with length up to 100.\r\n#\r\n# Output\r\n# Print «yes» (without quotes) if it's possible to remove digits required way and «no» otherwise.\r\n\r\nprint('yes' if input().lstrip('0').count('0') >= 6 else 'no') ", "n = input()\n\nif n.count('1') == 0:\n\tprint('no')\nfor i in range(len(n)):\n\tif n[i] == '1':\n\t\tif n[i:].count('0') >= 6 :\n\t\t\tprint('yes')\n\t\t\tbreak\n\t\telse:\n\t\t\tprint('no')\n\t\t\tbreak\n\telse:\n\t\tcontinue\n\n", "import itertools\r\nimport re\r\nimport math\r\nimport getpass\r\nimport sys\r\n\r\ndebug = False\r\nfiles = True\r\nif getpass.getuser() == 'frohe':\r\n debug = True\r\n\r\nif debug and files:\r\n sys.stdin = open('test.in')\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\nst = input()\r\non = st.find('1')\r\nif on == -1:\r\n print('no')\r\n exit(0)\r\n\r\nst = st[on:]\r\nif st.count('0') >= 6:\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "a = input().lstrip(\"0\")\r\nif a.count(\"0\") >= 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "#Div.64\r\na =input()\r\n\r\ncounter = 0\r\nF = False\r\n\r\nfor i in range (len (a)-1,-1,-1) :\r\n if a[i]== \"0\" :\r\n counter += 1\r\n\r\n if a[i] == \"1\" and counter>5 :\r\n F = True\r\n break\r\n\r\nif F :\r\n print (\"yes\")\r\nelse:\r\n print (\"No\")\r\n\r\n", "s = input()\r\nok,z = 0,0\r\n\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n ok = 1\r\n elif s[i]=='0' and ok==1:\r\n z+=1\r\n\r\nif z>=6:\r\n print('yes')\r\nelse:\r\n print('no')", "a=(input())\r\na=list(a)\r\n#print(a)\r\ncount=0\r\nc=0\r\nif len(a)<=6:\r\n print(\"NO\")\r\nelse:\r\n for i in a[::-1]:\r\n if i=='0':\r\n count+=1\r\n if count>=6 and i=='1':\r\n print(\"yes\")\r\n c+=1\r\n break\r\n if c==0:\r\n print(\"no\")", "s = str(input())\r\naux = s.find('1')\r\n#print(\"aux = \", aux)\r\ncnt = s[aux:].count('0')\r\n#print(\"cnt = \", cnt)\r\n\r\nif cnt >= 6:\r\n print('YES')\r\nelse:\r\n print('NO')", "# LUOGU_RID: 101736833\ns = input()\r\nif '1' not in s:\r\n exit(print('no'))\r\nprint(s.count('0', s.find('1')) >= 6 and 'yes' or 'no')", "s = input()\r\nc1,c2 = 0,0\r\nif set(s) == {'0'}:\r\n print(\"no\")\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] == '1':\r\n c1 += 1\r\n if c1 == 1:\r\n c2 = i\r\n p = len(s) - (c1 - 1) - c2\r\n print('yneos'[p < 7::2])", "s = input()\r\ncount = 0\r\nhave = False\r\nfor i in range(0, len(s)):\r\n if s[i] == '0' and have:\r\n count += 1\r\n if s[i] == '1':\r\n have = True\r\nif count >= 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "texto = input()\n\npos = texto.find('1')\nif(pos==-1):\n\tprint('no')\nelse:\t\n\tif(texto[pos:].count('0')>=6):\n\t\tprint('yes')\n\telse:\n\t\tprint('no')\t\n\t\n\n", "s=input()\r\nif(\"1\" in s):\r\n print(\"yes\" if (s[s.index(\"1\"):].count(\"0\")>=6) else \"no\");\r\nelse:print(\"no\")", "# cook your dish here\r\nfrom math import ceil\r\nfor _ in range(1):\r\n s=input()\r\n if(len(s)<7):\r\n print(\"no\")\r\n else:\r\n if(s.count('1')==0):\r\n print(\"no\")\r\n else:\r\n if(s.count('1000000')>=1):\r\n print(\"yes\")\r\n else:\r\n cnt=0\r\n f=0\r\n for i in range(0,len(s)):\r\n if(s[i]=='0' and f==1):\r\n cnt+=1;\r\n if(s[i]=='1' and f==0):\r\n f=1;\r\n if(cnt>=6):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n ", "a = input()\r\nb = 0\r\nif '1' not in a:\r\n print(\"no\")\r\nelse:\r\n i = a.index('1')\r\n for k in range(i, len(a)):\r\n if a[k] == '0':\r\n b += 1\r\n if b >= 6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")", "c = o = 0\r\nfor cc in input():\r\n if ord(cc)&1: o = 1\r\n elif o: c += 1\r\nprint(chr(121)+chr(101)+chr(115) if c >= 6 else chr(110)+chr(111))", "s=input()\r\ni=0\r\nc=0\r\nk=0\r\nwhile(i<len(s)):\r\n if(s[i]==\"1\"):\r\n k=1\r\n if(s[i]==\"0\" and k==1):\r\n c=c+1\r\n if (c==6):\r\n break;\r\n i=i+1\r\nif(c==6):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "s=input()\r\nif(\"1\" in s):\r\n i=s.index(\"1\")\r\n d=s[i::].count(\"0\")\r\n if(d>=6):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")\r\n", "s = input()\r\npos = -1\r\ncnt = 0\r\nfor i in range(len(s) - 1, -1, -1):\r\n if s[i] == '1':\r\n pos = i\r\n \r\nfor i in range(pos, len(s)):\r\n if s[i] == '0':\r\n cnt+= 1\r\n \r\nif cnt >= 6 and pos != -1:\r\n print('yes')\r\nelse:\r\n print('no')", "number = list(str(input()))\r\n\r\nzeros = 0\r\nlast_index = len(number) - 1\r\nfor i in number[::-1]:\r\n if i == '0':\r\n zeros += 1\r\n if(zeros == 6):\r\n break\r\n last_index -= 1\r\n\r\nif(zeros == 6):\r\n if('1' in number[:last_index]):\r\n print('yes')\r\n exit()\r\nprint('no')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# if(number//64 != 0 and number%64 == 0):\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n\r\n", "a=input()\r\nif \"1\" in a:\r\n a=a[a.index(\"1\"):]\r\n if a.count(\"0\")>5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "b=list(input())\r\nb=list(map(int,b))\r\nfor i in range(len(b)):\r\n if b[i]==1:\r\n if b[i:].count(0)>5:\r\n print(\"yes\")\r\n exit()\r\n else:\r\n print(\"no\")\r\n exit()\r\nprint(\"no\")", "s = input()\r\n\r\n\r\nif '1' not in s:\r\n print(\"no\")\r\n\r\nelse:\r\n \r\n s = s[s.index('1'):]\r\n print(\"yes\" if s.count('0') >= 6 else \"no\")", "s = input()\r\nj = 0; foo = ''\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n j = i\r\n break\r\nfor i in range(j, len(s)):\r\n foo += s[i]\r\nif foo.count('0') >= 6 and foo.count('1') >= 1: print('yes')\r\nelse: print('no')\r\n", "\n\ns = input()\nzeros = 0\nans = []\nflag = False\nfor ch in s:\n if ch == '1':\n flag = True\n elif flag:\n zeros += 1\n ans.append(zeros)\n\nprint('yes' if max(ans) >= 6 else 'no')\n", "s=input()\r\nif '1' in s:\r\n a=s.index('1')\r\n ans=0\r\n for i in range(a+1,len(s)):\r\n if s[i]=='0':\r\n ans+=1\r\n if ans>=6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")", "t = input()\r\nif int(t) >= 1000000:\r\n t = t[t.index('1'):]\r\n if t.count('0') >= 6:\r\n print('yes')\r\n else:\r\n print('no')\r\nelse:\r\n print('no')", "A = input()\r\nwhile(A.count(\"1\")>0):\r\n i = A.index(\"1\")\r\n j = A[i+1:].count(\"0\")\r\n if(j>=6):\r\n print(\"yes\")\r\n break\r\n A = A[i+1:]\r\nelse:\r\n print(\"no\")", "n=input()\r\nif len(n)==n.count('0'):\r\n\tprint('NO')\r\nelse:\r\n\twhile n[0] == \"0\":\r\n\t\tn = n[1:]\r\n\tif n.count('0')>=6 and n[0]=='1':\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "t = input()\ntry:\n lt = t.index(\"1\")\nexcept:\n print(\"no\")\nelse:\n ans = t[lt:].count(\"0\") >= 6 and len(t)-lt > 6\n if ans:\n print(\"yes\")\n else:\n print(\"no\")\n", "n = input()\ntry:\n i = n.index('1')\n if n[i + 1:].count('0') < 6:\n print('no')\n else:\n print('yes')\nexcept:\n print('no')", "s = input()\r\ncnt = 0\r\ni = 0\r\nwhile i<len(s) and s[i]=='0':\r\n i += 1\r\ni += 1\r\nwhile i<len(s):\r\n if s[i]=='0': cnt += 1\r\n i += 1\r\nif cnt>=6:\r\n print('yes')\r\nelse:\r\n print('no')", "a = [str(i) for i in input()]\nctr = 0\nwhile a[0] == '0' and len(a) > 1:\n\tdel a[0]\nsize = len(a)\nfor i in range(size):\n\tif a[i] == '0':\n\t\tctr += 1\nif ctr >= 6:\n\tprint('yes')\nelse:\n\tprint('no')\n# print(a)", "s=input()\r\nn=int(s)\r\nif str(n).count('0')>=6:\r\n print('yes')\r\nelse:\r\n print('no')\r\n \r\n", "s = bin(64)[2:]\r\nt = str(input())\r\noutput = \"no\"\r\nfor j in range(len(t)):\r\n if t[j] == s[0]:\r\n ps, pt, count = 0, j, 0\r\n while ps < len(s) and pt < len(t):\r\n if s[ps] == t[pt]:\r\n ps += 1\r\n count += 1\r\n pt += 1\r\n if count == len(s):\r\n output = \"yes\"\r\n break\r\nprint(output)\r\n", "#1000000=64\r\ns=input()\r\nfor i in range(len(s)):\r\n if s[i]=='1' and s[i+1:].count('0')>=6:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "print('yes' if len(input().lstrip('0').replace('1',''))>5 else 'no')", "take = input()\r\ncheck = False\r\nans = 0\r\nfor i in take:\r\n if i == '1':\r\n check = True\r\n if check and i == '0':\r\n ans += 1\r\nif ans >= 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "n = input()\r\nk = 0\r\nh = 0\r\nwhile (n[0] != '1') and (len(n) >= 6):\r\n n = n[1:]\r\nfor i in range(len(n)):\r\n if n[i] == '1':\r\n k += 1\r\nif (len(n)-k) >= 6:\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "string = input()\r\nflag = False\r\ncount = 0\r\nfound = False\r\nfor i in range(len(string)):\r\n if flag:\r\n if string[i] == '0':\r\n count += 1\r\n if not flag:\r\n if string[i] == '1':\r\n flag = True\r\n if count == 6:\r\n found = True\r\n break\r\nif found:\r\n print(\"Yes\")\r\n\r\nelse:\r\n print(\"No\")", "ch=input()\r\nif ch[ch.find(\"1\"):].count(\"0\")>=6:\r\n print('yes')\r\nelse:\r\n print(\"no\")", "a=input()\r\nc=a.find('1')\r\nif c!=0:\r\n a=a[c::]\r\nif a.count('0')>=6:\r\n print('yes')\r\nelse:\r\n print('no')", "s = input()\r\nwhile s and s[0] == '0':\r\n\ts = s[1:]\r\nprint(['no', 'yes'][s.count('0') > 5])", "def cal(a):\r\n oneFound = False\r\n zeroCount = 0\r\n for i in a:\r\n if oneFound:\r\n if i == '0':\r\n zeroCount += 1\r\n else:\r\n if i == '1':\r\n oneFound = True\r\n\r\n if oneFound:\r\n if zeroCount >= 6:\r\n return 'yes'\r\n else:\r\n return 'no'\r\n else:\r\n return 'no'\r\n\r\n\r\na = input()\r\nprint(cal(a))", "#!/usr/bin/env python3\n\nprint('yes' if input().lstrip('0').count('0')>=6 else 'no')\n", "print('yes' if input().lstrip('0').count('0') >= 6 else 'no') ", "a=input()\r\nif a.count('1')==0:\r\n print('no')\r\nelse:\r\n a=a[a.index('1')::]\r\n if a.count('0')>=6:\r\n print('yes')\r\n else:\r\n print('no')", "s = input()\r\nn = len(s)\r\n\r\nif n < 7:\r\n print('no')\r\nelse:\r\n ones = 0 \r\n zeroes = 0\r\n index = -1\r\n \r\n for i in range(n):\r\n if s[i] == '1':\r\n ones += 1 \r\n if index == -1:\r\n index = i \r\n else:\r\n if index != -1 and i > index:\r\n zeroes += 1 \r\n \r\n \r\n if ones > 0 and zeroes > 5:\r\n print('yes')\r\n else:\r\n print('no')\r\n \r\n ", "print(\"yes\" if (input().lstrip('0').count('0')>=6) else \"no\")", "s = input()\r\n\r\ni = 0\r\nwhile i < len(s) and s[i] == '0':\r\n i += 1\r\n\r\ns = s[i:]\r\n\r\nif len(s) - s.count('1') + 1 >= 7:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "# cook your dish here\r\ns = input()\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='1':\r\n break\r\n i+=1\r\n \r\nif s[i:].count('0') >= 6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def div_64(s):\r\n if '1' not in s:\r\n return 'no'\r\n idx = s.index('1')\r\n s = s[idx:]\r\n zero_quantity = s.count('0')\r\n if zero_quantity < 6:\r\n return 'no'\r\n return 'yes'\r\n\r\n\r\nprint(div_64(input()))", "def to_64(b):\r\n n = b.find('1')\r\n if n == -1: return False\r\n return b[n:].count('0') >= 6\r\n\r\nprint('yes' if to_64(input()) else 'no')", "s=input()\r\nif str(int(s)).count('0')>5:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "\r\nx = int(input())\r\n\r\ny = str(x)\r\n\r\nu = y.replace(\"1\", \"\")\r\n\r\np = \"1\"+u\r\ns = int(p)\r\n\r\nif s % 64 == 0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "def solution():\n a = input()\n if len(a) < len('1000000'):\n return 'no'\n z = 0\n for c in a[::-1]:\n if c == '0':\n z += 1\n else:\n if z >= 6:\n return 'yes'\n return 'no'\n\nif __name__ == '__main__':\n print(solution())\n", "s = input()\r\nl = len(s)\r\n\r\n\r\ni = l-1\r\ncount = 0\r\nflag = False\r\nwhile i>=0:\r\n if s[i] == '0':\r\n count+=1\r\n \r\n if (count >= 6 and s[i] == '1'):\r\n flag = True\r\n print('yes')\r\n break\r\n \r\n i-=1\r\n\r\nif flag == False:\r\n print('no')", "x = input()\r\nx=x[x.find('1'):]\r\nprint('yes' if x.count('0')>=6 else 'no')\r\n", "s = input()\r\n\r\nif '1' in s:\r\n first = s.index('1')\r\n k = s[first:].count('0') \r\n if k >= 6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")\r\n", "s = input()\r\ns1='1'\r\nif s1 in s:\r\n a = [i for i in range(s.index('1')+1,len(s)) if s[i]=='0']\r\n if len(a)>=6:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s = s1 = input()\r\nc = 0\r\nfor i in range(len(s)-1,-1,-1):\r\n if c == 6 and s1.count('1') != 0:\r\n print('yes')\r\n exit()\r\n if s[i] == '0':\r\n c += 1\r\n else:\r\n s1 = s1[:i] + s1[i+1:]\r\nprint('no')", "# 887A\r\n\r\nsmstr = input().lstrip(\"0\")\r\nif '1' in smstr and smstr.count(\"0\") >= 6:\r\n\tprint(\"yes\")\r\nelse:\r\n\tprint(\"no\")\r\n\t", "def solve():\n s = input()\n\n if len(s) < 7 or s.find('1') == -1 : \n print(\"no\");return \n\n if s[s.find('1'):].count('0') >= 6 : print('yes')\n else: print(\"no\\n\") \n\nsolve()\n \t\t\t\t\t\t\t \t \t \t\t \t \t\t \t \t \t", "n = str(input())\r\nn = (n.lstrip(\"0\"))\r\n#print(n)\r\nif n.count(\"0\") >=6 and len(n)>=7:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "import sys;\r\n\r\ns = input();\r\na = list(s[::-1]);\r\nc = ['0', '0', '0', '0', '0', '0'];\r\nwhile len(a) >= 7 and '1' in a:\r\n if a[:6] == c:\r\n print('yes');\r\n sys.exit();\r\n a.remove('1');\r\nprint('no');\r\n", "s = input()\r\ncounter = 0\r\nok = False\r\nfor i in range(len(s) - 1, -1, -1):\r\n if s[i] == '0':\r\n counter += 1\r\n if counter >= 6:\r\n if s[i] == '1':\r\n ok = True\r\nif ok:\r\n print('yes')\r\nelse:\r\n print('no')", "s = input()\r\nl = len(s)\r\nans = \"no\"\r\nc = 0\r\ni = l - 1\r\nwhile i >= 0 and c < 6:\r\n if s[i] == '0':\r\n c += 1\r\n i -= 1\r\nif c == 6:\r\n while i >= 0:\r\n if s[i] == '1':\r\n ans = \"yes\"\r\n i -= 1\r\nprint(ans)", "s=input()\ncnt=0\nflag=0\nss=100000\nfor i in range(len(s)):\n\tif(s[i]=='1'):\n\t\tss=i\n\t\tbreak;\nfor j in range(ss,len(s)):\n\tif(s[j]=='0'):\n\t\tcnt+=1\n\t\tif cnt>=6:\n\t\t\tflag=1\n\t\t\tbreak\nif flag:\n\tprint(\"yes\")\nelse:\n\tprint(\"no\")\n", "a = list(reversed(input()))\r\nflag = False\r\ncnt = 0\r\nfor n in a:\r\n if n == '0':\r\n cnt = cnt + 1\r\n if cnt > 5 and n == '1':\r\n flag = True\r\n\r\nif flag:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "x = input()\r\nindex=x.find(\"1\")\r\nstr=x[index:]\r\na= str.count('0')\r\nif ( a >=6 ):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=str(input())\r\ncz=0\r\nfor i in range(len(n)):\r\n if n[i]==\"0\":\r\n cz+=1\r\nfor i in range(len(n)):\r\n if n[i]==\"0\":\r\n cz-=1\r\n if n[i]==\"1\":\r\n break\r\nif cz>=6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nif '1' not in s:\r\n print(\"no\")\r\n exit(0)\r\ncnt = s[s.index('1'):].count('0')\r\nif cnt < 6:\r\n print(\"no\")\r\n exit(0)\r\nprint(\"yes\")", "ch=input()\r\na,b=0,0\r\nfor i in ch:\r\n if i=='1':\r\n a=1\r\n if a and i=='0':\r\n b+=1\r\nif b-5>0:print('yes')\r\nelse:print('no')\r\n", "n=str(input())\r\nif '1' in n:\r\n one=n.index('1')\r\n if(n[one:].count('0')>=6):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")", "print(['no','yes'][input().lstrip('0').count('0')>=6])", "import math \r\nt = input().lstrip(\"0\")\r\nn=t.count(\"0\")\r\nif n>=6:\r\n print(\"Yes\")\r\nelse: \r\n print(\"No\")\r\n\r\n \r\n", "print('yes' if input().partition('1')[2].count('0')>=6 else 'no')", "n = input()\r\nif \"1\" in n:\r\n\tindex1 = n.index(\"1\")\r\nelse:\r\n\tprint(\"NO\")\r\n\texit()\r\nn = n[index1:]\r\ncount1 = n.count(\"0\")\r\nif count1>=6:\r\n\tprint(\"YES\")\r\nelse:print(\"NO\")\t\t", "s=input()\r\nn=len(s)\r\nif('1' not in s):\r\n print(\"no\")\r\nelse:\r\n ka=0\r\n for i in range(n):\r\n if(s[i]=='1'):\r\n ka=i\r\n break\r\n l=s[ka:].count('0')\r\n if(l>=6):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n", "st = input()\r\nf1 = st.find('1')\r\nst = st[f1:len(st)]\r\n#print(st)\r\nif len(st) < 6:\r\n\tprint('No')\r\nelif st.find('1') != -1 and st.count('0') >= 6:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "n=input()\r\nf=n.find('1')\r\nprint(\"no\") if (f<0 or n[f:].count('0')<6) else print(\"yes\")", "s = input()\r\nif s[0]=='0':\r\n c = 0\r\n for i in s:\r\n if i == '0':\r\n c += 1\r\n if i == '1':\r\n break\r\n s = s[c:]\r\n\r\na = s.count('0')\r\nb = s.count('1')\r\n\r\nif b==1 and a==6 and s.count('1000000')==0:\r\n print('no')\r\nelif b>=1 and a>=6:\r\n print('yes')\r\nelse:\r\n print('no')", "a = input()\r\nl = a.find('1')\r\nif l == -1:\r\n print(\"no\")\r\nelse:\r\n if a[l:].count(\"0\") >= 6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")", "n=input()\r\nif len(n)<7:\r\n print('no')\r\nelif n.count('0')<6 or n.count('1')<1:\r\n print('no')\r\nelse:\r\n r=n.find('1')\r\n n=n[r+1:]\r\n if n.count('0')>5:\r\n print('yes')\r\n else:\r\n print('no')\r\n\r\n", "s=input()\r\nh=0\r\nc=0\r\nfor i in range(len(s)):\r\n if(s[i]=='1'):\r\n h=1\r\n else:\r\n if(h==1):\r\n c=c+1\r\n if(c==6):\r\n break\r\nif(c==6):\r\n print(\"yes\",end=\"\")\r\nelse:\r\n print(\"no\",end=\"\")\r\n ", "st = input()\r\nx = list(bin(int(st, 2))[2:])\r\nif x.count('0') > 5 and st.count('1') > 0:\r\n print('yes')\r\nelse:\r\n print('no')", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, ceil\r\nfrom bisect import bisect_right, bisect_left\r\n\r\ns = input()\r\n\r\ncounting_start = False\r\ncnt = 0\r\nfor i, char in enumerate(s, start=1):\r\n if char == \"1\":\r\n counting_start = True\r\n if char == \"0\" and counting_start:\r\n cnt += 1\r\nif cnt >= 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "bi=(input()+'1').strip('0')\r\nif bi.count('0')>=6 :\r\n print (\"YES\")\r\nelse :\r\n print(\"NO\") ", "n=list(input())\r\nif '1' not in n:\r\n print('no')\r\nelse:\r\n z=n.index('1')\r\n if n[z:].count('0')>=6:\r\n print('yes')\r\n else:\r\n print('no')\r\n", "from collections import Counter\r\nn = Counter(input().lstrip('0'))\r\nif n['0']>=6 and n['1']>=1:print('yes')\r\nelse:print('no')", "val = input()\n\nseq = val.find('1')\n\nif seq >= 0 and val[seq + 1 : ].count('0') >= 6:\n print('yes')\nelse:\n print('no')\n \t \t\t \t\t\t\t \t\t\t \t\t \t\t\t\t \t", "a=list(map(int,list(input())))\r\na=a[::-1]\r\nif 1 in a:\r\n while a.index(1)<6:\r\n a.remove(1)\r\n if not(1 in a):\r\n break\r\n if 1 in a:\r\n print('yes')\r\n else:\r\n print('no')\r\nelse:\r\n print('no')\r\n ", "s=input()\r\nj=len(s)\r\n\r\nfor x in range(j):\r\n\tif s[x]=='1':\r\n\t\tif s[x+1:].count('0') >=6:\r\n\t\t\tprint('yes')\r\n\t\t\tbreak\r\nelse:\r\n\tprint('no')", "binary = input()\r\n\r\nif binary.count('0') != len(binary) and binary[binary.index('1') + 1:].count('0') >= 6:\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "import sys\ns =input()\none = False\nzero_count =0\nfor i in s:\n if one:\n if i == '0':\n zero_count += 1\n if zero_count ==6:\n print('yes')\n sys.exit()\n continue\n if i =='1':\n one = True\nprint('no')", "#A444 created on 13/11/2017 Code1191\r\na = input()\r\nif a[a.find(\"1\"):].count(\"0\") >= 6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ns = s.lstrip('0')\r\nx = s.count('0')\r\nprint(['no', 'yes'][x >= 6])", "a=input()\r\ntry:\r\n inn=a.index('1')\r\n if(a[inn:].count('0')>=6):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nexcept:\r\n print(\"no\")", "s = list(input())\r\ni = 0\r\nflag = True\r\nwhile i < len(s):\r\n if s[i] == '0' and flag == True:\r\n s.pop(i)\r\n\r\n elif s[i] == '1' and flag == True:\r\n i += 1\r\n flag = False\r\n\r\n elif s[i] == '1' and flag == False:\r\n s.pop(i)\r\n\r\n else:\r\n i += 1\r\ns = ''.join(s)\r\nif '1000000' in s:\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "z = 0\r\no = 0\r\nn = list(str(input()))\r\nfor idx in range(-1, -len(n)-1, -1):\r\n if n[idx] == '0':\r\n z += 1\r\n if n[idx] == '1' and z >= 6:\r\n o += 1\r\nprint('yes') if o > 0 else print('no')", "nu = input()\r\nif nu.find('1') == -1:\r\n print('no')\r\nelse:\r\n nu = nu[nu.find('1'):]\r\n if nu.count('0') >= 6:\r\n print('yes')\r\n else:\r\n print('no')\r\n\r\n\r\n", "a = int(input())\r\ns = 0\r\nfor i in range(1, len(str(a))):\r\n\tif str(a)[i] == '0':\r\n\t\ts+=1\r\nif str(a)[0] == '1' and 10**s >= 1000000:\r\n\tprint('yes')\r\nelse:\r\n\tprint('no')", "s = list(input())\r\nf = True\r\nfor i in range(len(s)):\r\n if s[i] == \"1\":\r\n s = s[i:len(s)]\r\n if s.count(\"0\") >= 6:\r\n print(\"yes\")\r\n f = False\r\n break\r\nif f:\r\n print(\"no\")", "s = input()\r\nans = 'no'\r\nif '1' in s:\r\n\tc = 0\r\n\tfor i in range(s.index('1')+1,len(s)):\r\n\t\tif s[i] == '0' :\r\n\t\t\tc+=1\r\n\t\t\tif c > 5:\r\n\t\t\t\tans = 'yes'\r\n\t\t\t\tbreak\r\nprint(ans)\r\n", "\r\ndef main():\r\n\ts = input()\r\n\tl = list(s)\r\n\tl.reverse()\r\n\tcount = 0\r\n\tfor c in l:\r\n\t\tif count < 6 and c == '0':\r\n\t\t\tcount += 1\r\n\t\telif count >= 6 and c == '1':\r\n\t\t\tprint('yes')\r\n\t\t\treturn\r\n\tprint('no')\r\n\r\nmain()", "s = input()\r\nprint('yes' if len(s) >= 7 and s[s.find('1'):].count('0') >= 6 else 'no')", "a=str(input())\nb=a.find(\"1\")\nc=a.count(\"0\",b,len(a))\nif(c>=6):\n\tprint(\"yes\")\nelse:\n\tprint(\"no\")", "string = input()\r\n\r\nif len(string) < 7 or \"1\" not in string:\r\n print (\"no\")\r\nelse:\r\n index = string.index(\"1\")\r\n string2 = string [index:]\r\n if string2.count(\"0\") >=6:\r\n print (\"yes\")\r\n else:\r\n print (\"no\")", "def main():\n s = list(input())\n s = s[-1::-1]\n n = len(s)\n del_count = 0\n div = False\n for i in range(n):\n if i-del_count < 6:\n if s[i] ==\"1\":\n del_count += 1\n else:\n if s[i] == \"1\":\n div = True\n break\n if div:\n print(\"yes\")\n else:\n print(\"no\")\nif __name__ == '__main__':\n main()\n", "x = input()\r\ncount = 0\r\nflag=0\r\nfor i in x:\r\n if i=='1':\r\n flag=1\r\n elif i=='0' and flag==1:\r\n count= count+1\r\nif count>=6:\r\n print('yes')\r\nelse:\r\n print('no')", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\ns = input()\r\nn = len(s)\r\nflag = False\r\ncnt = 0\r\nfor i in range(n):\r\n if s[i] == '1':\r\n flag = True\r\n if flag and s[i] == '0':\r\n cnt += 1\r\nif flag and cnt >= 6:\r\n print('yes')\r\nelse:\r\n print('no')", "number = input()\r\n\r\nis_posible = False\r\ncount_zero = 0\r\ncount_one = 0\r\n\r\nfor i in number:\r\n if count_one:\r\n count_zero += i == '0'\r\n count_one += i == '1'\r\n\r\n if count_zero == 6:\r\n is_posible = True\r\n break\r\n\r\nif is_posible:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n\r\n\r\n", "s=input()\r\nif (s.count(\"1\")>0 and s[s.index(\"1\"):].count(\"0\")>=6):\r\n print (\"yes\")\r\nelse:\r\n print (\"no\")", "ss=int(input())\r\ns=str(ss)\r\ncount=0\r\nx=len(s)\r\nfor i in range(1,x):\r\n if(s[i]==\"1\"):\r\n count+=1\r\nif(x-count>6):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "s = input()\n\nif \"1\" in s and s[s.index(\"1\"):].count(\"0\") >= 6:\n print(\"yes\")\nelse:\n print(\"no\")", "s = input()\r\nz = 0\r\none = 0\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n z += 1\r\n if z >= 1 and s[i] == '0':\r\n one += 1\r\nif z >= 1 and one >= 6:\r\n print('yes')\r\nelse:\r\n print('no')", "s = input()\r\n\r\nif len(s) <= 6:\r\n print('no')\r\nelse:\r\n for j in range(len(s)):\r\n if s[j]=='1':\r\n break\r\n count = 0\r\n for i in range(j+1,len(s)):\r\n if s[i]=='0':\r\n count+=1\r\n if count>=6:\r\n print('yes')\r\n else:\r\n print('no')\r\n", "\r\n## 887A\r\n\r\np=input()\r\ns=list(p.lstrip('0'))\r\nif len(s)>=7 and '1' in s[:(len(s)-6)] and s.count('0')>=6 :\r\n\tprint('yes')\r\nelse:\r\n\tprint('no')", "#██████████ █ █ /█\\ █ █ ███ /█\\ ██████████████\r\n\"█ █ █ /███\\ █ █ █ ██ /███\\ /██/ \"\r\n#█ █ █ /█████\\ █ █ █ ██ /█████\\ /██/ \r\n\"█ █ █ █!:) █ █ █ █ ██ █ █ /██/ \"\r\n#██████████ █████████ █(:| █ ████████ ████ █ █ /██/ \"\r\n\" █ █ █ █!:) █ █ █ █ ██ █ █ /██/ \"\r\n# █ █ █ ███████ █ █ █ ██ ███████ /██/\r\n\" █ █ █ █ █ █ █ █ ██ █ █ ██/ \"\r\n#██████████ █ █ █ █ █ █ ███ █ █ ██████████████\r\nn=list(input())\r\nif '1' not in n:\r\n print('no')\r\nelse:\r\n ind=n.index('1')\r\n n=n[ind:]\r\n c=n.count('0')\r\n if c>=6:\r\n print('yes')\r\n else:\r\n print('no')\r\n", "s=input()\r\nl=[i for i in s]\r\nif int(s)>0 and len(s)>=7:\r\n j=l.index('1')\r\n l=l[j+1:]\r\n if l.count('0')>=6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")", "import sys\r\ns, f = input(), [0] * 105\r\nfor x in range(len(s)): f[x + 1] = f[x] + (int(s[x]) ^ 1)\r\nfor x in range(len(s)):\r\n if s[x] == '1' and f[len(s)] - f[x] > 5:\r\n print(\"yes\")\r\n sys.exit()\r\nprint(\"no\")", "n = input()\r\nf=n.find('1')\r\nstr=n[f:]\r\ncount=str.count('0')\r\nif count>=6:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n=list(input())\r\nif \"1\" in n:\r\n p=n.index(\"1\")\r\n if n[p+1:].count(\"0\")>=6 and p!=len(n)-1:\r\n print(\"YES\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n print(\"No\")\r\n ", "'''\r\nAuthor: Sofen Hoque Anonta\r\n'''\r\n\r\nimport re\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport collections\r\n\r\ndef inputArray(TYPE= int):\r\n return [TYPE(x) for x in input().split()]\r\n\r\n\r\ndef solve():\r\n s = input()\r\n\r\n z = 0\r\n pos = 0\r\n for x in s[::-1]:\r\n pos+= 1\r\n if x == '0':\r\n z+= 1\r\n if z == 6:\r\n break\r\n\r\n \r\n print('yes' if '1' in s[:-pos] else 'no')\r\n\r\nif __name__ == '__main__':\r\n #sys.stdin= open('F:/input.txt')\r\n solve()\r\n", "ivestis = input()\r\ntaip = False\r\nfor i in range(len(ivestis)):\r\n if ivestis[i] == '1':\r\n nuliu_skc = 0\r\n for z in ivestis[i:]:\r\n if z == \"0\":\r\n nuliu_skc += 1\r\n if nuliu_skc >= 6:\r\n taip = True\r\nif taip == True:\r\n print('yes')\r\nelse:\r\n print('no')\r\n \r\n ", "s = input()\ns = list(reversed(s))\nzero_count = 0\none = False\nfor c in s:\n if c == '0':\n zero_count += 1\n elif zero_count >= 6:\n one = True\n break\nprint('yes' if one else 'no')\n\n \t\t\t\t\t \t \t\t \t\t \t\t \t \t", "n=input()\r\nfor i,x in enumerate(n):\r\n if x=='1':break\r\nif n[i:].count('0')>=6:print('yes')\r\nelse:print('no')", "print(\"yes\"if str(int(input())).count(\"0\")>5else\"no\")", "n = input()\r\nA = n.split('1')\r\nif len(A)>=1:\r\n sz = 0\r\n for j in A[1:]:\r\n sz += len(j)\r\n if sz>=6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")\r\n ", "s = input()\r\nif '1' in s and s.count('0', s.index('1')) > 5:\r\n print('yes')\r\nelse:\r\n print('no')", "s=input()\r\nx=s.find('1')\r\nif x!=-1 and s[x:].count('0')>=6:\r\n\tprint('yes')\r\nelse:\r\n\tprint('no')", "n=str(int(input()));print(\"yes\"if n.count(\"0\")>5else\"no\")", "a = str(input())\r\nprint(\"nyoe s\"[a.count('1') > 0 and a[a.index('1')::].count('0') > 5::2])", "s = input()\r\ni = s.find('1')\r\n\r\nprint('no' if i < 0 or s[i:].count('0') < 6 else 'yes')", "S=input()\r\nb=0\r\nk=0\r\nfor i in range(len(S)) :\r\n if S[i]=='1' :\r\n b=b+1\r\n if S[i]=='0' and b>0 :\r\n k=k+1\r\nif k>=6 :\r\n print('yes')\r\nelse :\r\n print('no')\r\n", "num=input()\r\none=num.find(\"1\")\r\nif num.count(\"0\",one)>=6 and one !=-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "binary_number = input()\r\nfirst_one = binary_number.find('1')\r\nif first_one == -1:\r\n print('NO')\r\nelse:\r\n print('YES') if binary_number.count('0', first_one + 1) >= 6 else print('NO')\r\n", "e = list(input())\r\nn = []\r\nt = 0\r\nfor x in range(0, len(e)):\r\n if e[x] == '1' and t== 0:\r\n n.append(e[x])\r\n t = 1\r\n else:\r\n if t == 1 and e[x] == '0':\r\n n.append(e[x])\r\nif len(n) == 0:\r\n print('no')\r\nelif int(''.join([str(elem) for elem in n])) >= 1000000:\r\n print('yes')\r\nelse:\r\n print('no')", "s = input()\r\nnum2 = s.find(\"1\")\r\nif num2 != -1:\r\n num = s[num2:].count(\"0\")\r\n if num > 5:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")\r\n", "s= input()\r\nn = len(s)\r\nif '1' not in s:\r\n print('no')\r\nelse:\r\n for i in range(n):\r\n if s[i]=='1':\r\n s = s[i:]\r\n break\r\n n = len(s)\r\n tp = s.count('1')-1\r\n if (n-tp)<7:\r\n print('no')\r\n else:\r\n print('yes')", "n = str(input())\npos = n.find('1')\nif pos == -1:\n print('no')\nelse:\n if n[pos:].count('0') < 6:\n print('no')\n else:\n print('yes')\n ", "s = input()\r\ni = 0\r\nwhile i < len(s) and s[i] == '0':\r\n i += 1\r\nc = 0\r\nwhile i < len(s):\r\n if s[i] == '0':\r\n c += 1\r\n i += 1\r\n\r\nif c >= 6:\r\n print('yes')\r\nelse:\r\n print('no')", "a=input()\r\nz_count=0\r\nflag=False\r\nfor i in range(len(a)-1,-1,-1):\r\n if a[i]==\"0\":\r\n z_count+=1\r\n if z_count==6:\r\n k=i\r\n flag=True\r\n break\r\nif not flag:\r\n print(\"no\")\r\nelse:\r\n if \"1\" in a[:k]:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n", "a=input()\r\nt=False\r\nc=0\r\nv=False\r\nfor i in range(len(a)):\r\n if t:\r\n if a[i]=='0':\r\n c+=1\r\n else:\r\n if a[i]=='1':\r\n t=True\r\n if c>=6:\r\n v=True\r\n break\r\nif v:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "s = input()\r\n\r\ntry:\r\n print(['no', 'yes'][int(s[s.index('1'):].count('0') >= 6)])\r\nexcept:\r\n print('no')\r\n", "s=input()\r\nhas1=False\r\nkol=0\r\nfor i in s:\r\n if has1:\r\n if i=='0':\r\n kol+=1\r\n else:\r\n if i == '1':\r\n has1=True\r\nif kol>=6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "s = list(input().split())[0]\r\n\r\nfirst_1_found = False\r\nzero_cnt = 0\r\nfor i in s:\r\n if i == '1' and not first_1_found:\r\n first_1_found = True\r\n elif i == '0' and first_1_found:\r\n zero_cnt += 1\r\n if zero_cnt == 6:\r\n print(\"yes\")\r\n exit(0)\r\nprint(\"no\")\r\n", "s = str(input())\r\nk = 0\r\nfor el in s:\r\n if(el!='1'):\r\n k += 1\r\n else:\r\n break\r\nif(s.count('1')>=1 and s.count('0')-k>=6):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "x=input()\r\nif \"1\" in x:\r\n ind=x.index(\"1\")\r\n x=x[ind:]\r\n x=x.count(\"0\")\r\n if x>=6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")", "import sys\r\ns=input()\r\nif s.count('0')==len(s):\r\n print('no')\r\n sys.exit()\r\nwhile s[0]=='0':s=s[1:]\r\nif(s.count('0')>5):print('yes')\r\nelse:print('no')\r\n", "val = input()\n\nidx = val.find('1')\nif idx == -1:\n print('no')\nelse:\n cnt = val[idx + 1 : ].count('0')\n\n if cnt >= 6:\n print('yes')\n else:\n print('no')\n\n \t \t\t \t\t\t \t\t\t\t\t \t\t\t \t \t\t", "n = int(input())\n\nif str(n).count('0') >= 6:\n print('yes')\nelse:\n print('no')", "s = input()\nres = \"YES\" if \"1\" in s and s[s.find(\"1\"):].count(\"0\") > 5 else \"NO\"\nprint(res)\n", "str = input()\r\n\r\ncnt = 0\r\nflag = 0\r\n\r\nfor i in str:\r\n\tif flag == 1:\r\n\t\tif i == '0':\r\n\t\t\tcnt += 1\r\n\telse:\r\n\t\tif i == '1':\r\n\t\t\tflag = 1\r\n\r\nif cnt > 5:\r\n\tprint(\"yes\")\r\nelse:\r\n\tprint(\"no\")", "s = str(input())\r\nn = len(s)\r\nle = int(len(s))\r\nbo = True\r\nznum = 0\r\nfor i in range(n):\r\n if (znum != 6):\r\n if (s[n - i - 1] == '0'):\r\n znum += 1\r\n else:\r\n le -= 1\r\n if (le < 7):\r\n print('no')\r\n bo = False\r\n break\r\n else:\r\n if (s[n - i - 1] == '1'):\r\n print('yes')\r\n bo = False\r\n break\r\nif (bo): print('no')\r\n", "s = input()\none = s.find('1')\nzero = s[one + 1 :].count('0')\nif one != -1 and zero >= 6:\n print('yes')\nelse:\n print('no')\n", "'''Repairing :P '''\r\ns=input()\r\npos=s.find('1')\r\nif s[pos:].count('0')>=6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "s = input()\r\nans = 'no'\r\n\r\nif s.count('1') > 0:\r\n s1 = s[s.find('1')+1:]\r\n \r\n if s1.count('0') >= 6:\r\n ans = 'yes'\r\n \r\nprint(ans)\r\n", "s=input()\r\np=0\r\nif '1' in s : \r\n pos=s.index('1')\r\n if len(s)-pos<=6 :\r\n print('no')\r\n else:\r\n for j in range (pos+1,len(s)):\r\n if s[j]=='0':\r\n p+=1\r\n if p<6 :\r\n print('no')\r\n else:\r\n print('yes')\r\nelse :\r\n print(\"no\")\r\n", "list = [int(i) for i in input()]\r\nst = True\r\ncounter = 0\r\n\r\nfor k in range(0, len(list)-1):\r\n if list[k] == 1:\r\n for m in range(k, len(list)):\r\n if list[m] == 0:\r\n counter += 1\r\n break\r\n\r\n#print(counter)\r\nif counter >= 6:\r\n print(\"yes\")\r\nelse: print(\"no\")", "s=input()\r\nif len(s)<7:\r\n print(\"NO\")\r\nelif s.count('1')==0:\r\n print(\"NO\")\r\nelse:\r\n f1=s.index(\"1\")\r\n s=s[f1+1:]\r\n c=s.count(\"0\")\r\n if c>5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = str(input())\r\nn = list(n)\r\nif n.count('1') == 0:\r\n print(\"no\")\r\n exit(0)\r\nk = 0\r\nfor i in range(len(n)):\r\n if n[i] == '1':\r\n k = i\r\n break\r\nif (n[k:]).count('0') >= 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "s = input()\r\nindex = s.find('1')\r\ns = s[index :]\r\nif s.count('0') >= 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "str = input()\r\nif str.count(\"0\", str.find(\"1\")) >= 6:\r\n print('yes')\r\nelse:\r\n print('no')", "s = input()\r\nprint(\"yes\" if s.count('0', s.find('1')) > 5 else \"no\")", "s = input()\r\n\r\nif '1' not in s:\r\n print('no')\r\n exit()\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n s = s[i:]\r\n break\r\n\r\nif s.count('0') >= 6:\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-19 23:27:30\nLastEditTime: 2021-11-19 23:30:38\nDescription: Div64\nFilePath: CF887A.py\n'''\n\n\ndef func():\n s = input().strip().lstrip(\"0\")\n print(\"yes\" if s.count(\"0\") >= 6 else \"no\")\n\n\nif __name__ == '__main__':\n func()\n", "import sys\n\nline = sys.stdin.readline()\nisYes = False\nzeros = 0\nfor digit in line[::-1]:\n if zeros >= 6 and digit == '1':\n isYes = True\n break\n if digit == '0':\n zeros += 1\n\nif isYes:\n print('yes')\nelse:\n print('no')\n", "from collections import defaultdict\r\nn = list(input())\r\nc = 0\r\nif '1' not in n:\r\n print('no')\r\n exit()\r\nelse:\r\n x = n.index('1')\r\n\r\n for i in range(x,len(n)):\r\n if n[i]=='0':\r\n c+=1\r\n if c>=6:\r\n print('yes')\r\n else:\r\n print('no')\r\n\r\n ", "n=int(input())\r\nn=str(n)\r\nk=list(n)\r\nif k.count('0')>=6 :\r\n print('yes')\r\nelse :\r\n print('no')\r\n \r\n", "x = int(input())\r\n\r\nbam = str(x).count(\"0\")\r\nif (bam>=6):print(\"yes\")\r\nelse: print(\"no\")\r\n", "string = str(input())\r\n\r\ndef div64(string):\r\n zeros = 0\r\n for i in string[::-1]:\r\n if zeros >= 6 and i == '1':\r\n return 'yes'\r\n if i == '0':\r\n zeros += 1\r\n return 'no'\r\n \r\nprint(div64(string))", "name = input()\r\nl=len(name)\r\ncount=0;\r\ni=l-1;\r\nwhile(i>=0):\r\n if(name[i]=='1'):\r\n count=count+1;\r\n if(l-i-count>=6):\r\n break;\r\n i=i-1\r\nif(i<0):\r\n print(\"no\")\r\nelse:\r\n print(\"yes\")\r\n", "s=str(input())\r\ne=s.find('1')\r\nf=s[e:]\r\nif(s.count('0')>=6 and s.count('1')>=1 and f.count('0')>=6):\r\n print('yes')\r\nelse:\r\n print('no')", "s = input()\r\nc=0\r\nj=s.find('1')\r\nif(j!=-1):\r\n for i in range(j+1,len(s)):\r\n if(s[i]=='0'):\r\n c+=1\r\n if(c==6):\r\n print(\"yes\")\r\n exit(0)\r\nprint(\"no\")", "n=input()\r\nif '1' not in n:\r\n print('NO')\r\nelse:\r\n s=n.index('1')\r\n temp=n[s+1:]\r\n if temp.count('0')>=6:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "C = input()\r\nC = str(C)\r\nU = C.find(\"1\")\r\nif(U==-1):\r\n print(\"no\")\r\nelse:\r\n CAux = C[U:]\r\n if(CAux.count(\"0\")>=6):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n", "s = input()\r\n\r\ni = s.find('1')\r\ncnt = 0\r\n\r\nfor c in s[i:]:\r\n if c == '0':\r\n cnt += 1\r\n\r\nprint(\"yes\" if cnt >= 6 else \"no\")", "x = input()\r\n\r\nif len(x) < 7:\r\n print(\"no\")\r\nelse:\r\n zeros = 0\r\n one = False\r\n for i in range(len(x) - 1, -1, -1):\r\n if zeros < 6:\r\n if x[i] == \"0\":\r\n zeros += 1\r\n else:\r\n if x[i] == \"1\":\r\n print(\"yes\")\r\n ones = True\r\n exit()\r\n print(\"no\")", "s = str(input())\r\n\r\nans = False\r\np = False\r\ncount = 0\r\nfor i in range(len(s)):\r\n if p:\r\n if s[i] =='0': count += 1\r\n else:\r\n if s[i] == '1': p = True\r\n if count == 6:\r\n ans = True\r\n\r\nif ans : print(\"yes\")\r\nelse : print(\"no\")\r\n", "flag = False\r\ncheck = False\r\ncnt = 0\r\n\r\ndata = list(input())\r\nfor i in range(len(data)):\r\n if data[i] == '1':\r\n check = True\r\n if check and data[i] == '0':\r\n cnt += 1\r\n if cnt == 6:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "s = input()\r\nt = s.find('1')\r\nif t < 0 or s[t:].count('0') < 6:\r\n print('no')\r\nelse:\r\n print('yes')", "s=input()\r\nc=0\r\nn=len(s)\r\ni=n-1\r\nflag=0\r\nwhile(i>=0):\r\n if s[i]==\"0\":\r\n c+=1\r\n if c>=6 and s[i]==\"1\":\r\n print(\"yes\")\r\n flag=1\r\n break\r\n \r\n i-=1\r\n\r\nif flag==0:\r\n print(\"no\")\r\n\r\n", "s = list(input())\r\nsz = len(s)\r\nc = 0\r\nq = 0\r\nfor i in range(sz):\r\n if int(s[i]) == 1:\r\n f = i\r\n q = 1\r\n break\r\nif q == 1:\r\n for i in range(f, sz):\r\n if int(s[i]) == 0:\r\n c += 1\r\nif c >= 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "number = input().strip()\r\n\r\nnumZero = 0\r\nsliceNum = ''\r\nfor x in range(len(number)):\r\n if number[x] == '1':\r\n sliceNum = number[x:]\r\n break\r\nfor x in range(len(sliceNum)):\r\n if sliceNum[x] == '0':\r\n numZero += 1\r\nif numZero >= 6:\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "s=list(input())\r\ns=s[::-1]\r\nsum1=0\r\nj=0\r\nnd=0\r\nnk=0\r\nfor i in s:\r\n if i=='0':\r\n nd+=1\r\n if nd>=6 and i=='1':\r\n nk=1\r\n break\r\nif nk==1:\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "ch=input()\r\nif ('1' in ch) and (ch[(ch.index('1')):].count('0')>5):\r\n print('yes')\r\nelse :\r\n print('no')\r\n", "s=input()\r\nhas1=False\r\nkol=0;\r\nfor i in s:\r\n if has1:\r\n if i == '0':\r\n kol+=1\r\n else:\r\n if i == '1':\r\n has1=True\r\nif kol >= 6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nstring = input()\r\n\r\nif len(string) < 6:\r\n print(\"no\")\r\nelse:\r\n if '0' not in string:\r\n print(\"no\")\r\n else:\r\n flag = False\r\n count = 0\r\n for i in string:\r\n if i == '1':\r\n flag = True\r\n if i == '0' and flag:\r\n count += 1\r\n \r\n if flag and count >= 6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n\r\n\r\n", "s=input()\r\na=s.find('1')\r\nc=s[a:].count('0')>=6\r\nprint('yes'if c else 'no')", "s=input()\r\nif('1' not in s):\r\n print('no')\r\nelse:\r\n ind = s.index('1')\r\n zero=0\r\n for i in range(ind+1,len(s)):\r\n if(s[i]=='0'):\r\n zero+=1\r\n if(zero>=6):\r\n print('yes')\r\n else:\r\n print('no')\r\n", "x = str(input())\ny = len(x)\ncont = 0\nif y < 7:\n\tprint(\"no\")\nelif int(x) < 1000000:\n\tprint(\"no\")\nelse:\n\td = int(x)\n\td = str(d)\n\tfor c in range(1, len(d)):\n\t\tif d[c] == \"1\":\n\t\t\tcont += 1\n\tif len(d) - cont < 7:\n\t\tprint(\"no\")\n\telse:\n\t\tprint(\"yes\")\n\t\n", "n = input()\r\nr = 0\r\ncnt = 0\r\nfor i in n:\r\n\tif r:\r\n\t\tif i=='0':\r\n\t\t\tcnt+=1\r\n\t\t\tif cnt==6:\r\n\t\t\t\tbreak\r\n\t\tcontinue\r\n\tif i=='1':\r\n\t\tr = 1\r\nif cnt==6:\r\n\tprint('yes')\r\nelse:\r\n\tprint('no')\r\n", "s = input()\r\na = s.find(\"1\")\r\nc = 0\r\nfor x in s[a:]:\r\n if x == \"0\":\r\n c += 1\r\nif c > 5:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "class stack:\r\n def __init__(self):\r\n self.slist = []\r\n self.length = 0\r\n def push(self,element):\r\n self.slist += [element]\r\n self.length+=1\r\n def pop(self):\r\n if(self.length>0):\r\n self.length-=1\r\n c = self.slist[self.length]\r\n self.slist = self.slist[:self.length:]\r\n return c\r\n return -1\r\n def top(self):\r\n if(self.length>0):\r\n return self.slist[self.length-1]\r\n return -1\r\n\r\n\r\na = [i for i in input()]\r\na = a[::-1]\r\ns = stack()\r\nc = False\r\nif(len(a)>=7):\r\n cont = 0\r\n while(cont!=7 and a!=[]):\r\n if(cont<6):\r\n if(a[0]==\"0\"):\r\n s.push(\"0\")\r\n cont+=1\r\n else:\r\n if(a[0]==\"1\"):\r\n s.push(\"1\")\r\n cont+=1\r\n a = a[1::]\r\n if(cont==7):\r\n c = True\r\n \r\nif(c):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "s = input()\r\nif s.count('1') == 0:\r\n print('NO')\r\nelif s[s.find('1'):].count('0') < 6:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "n=str(input())\r\nt=0\r\na=0\r\n\r\nfor i in range(len(n)-1,-1,-1):\r\n if n[i]=='0':\r\n t+=1\r\n if t==6:\r\n a=i\r\n break\r\n\r\nif t<6:\r\n print('no')\r\n \r\n \r\n\r\nelse:\r\n if '1' in n[0:a] :\r\n print('yes')\r\n else:\r\n print('no')\r\n \r\n\r\n", "x = input()\r\nx = x[x.find(\"1\"):]\r\nif (x.count(\"0\")>=6) and (x!=-1):\r\n\tprint('yes')\r\nelse:\r\n\tprint('no')", "from sys import stdin,stdout\r\nn=stdin.readline()\r\nm=n\r\nfor i in range(len(n)):\r\n if n[i]!='1':\r\n m=m[1:]\r\n if n[i]=='1':\r\n break\r\nzero=m.count('0')\r\nif zero<6:\r\n stdout.write('no')\r\nelse:\r\n stdout.write('yes')\r\n", "word = input().lstrip(\"0\")\r\nprint([\"NO\",\"YES\"][\"1\" in word and word.count(\"0\") >= 6])", "str = input()\r\nl = len(str)\r\nflag = 0\r\nok = 0\r\nfor i in range(l - 1, -1, -1):\r\n if flag < 6 and str[i] == '0':\r\n flag = flag + 1\r\n elif flag == 6 and str[i] == '1':\r\n ok = 1\r\nif ok:\r\n print('yes')\r\nelse:\r\n print('no')", "s = list(input())\r\nif not '1' in s:\r\n print(\"no\")\r\n exit(0)\r\ns = s[s.index('1'):]\r\nif s.count('0') >= 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "i=input()\r\na=list(i)\r\n\r\nif(a.count('1')==0):\r\n print('no')\r\n exit(0)\r\n\r\nwhile(a[0]!='1'):\r\n del a[0]\r\n\r\nif(len(a)<7):\r\n print('no')\r\n exit(0)\r\nelse:\r\n zero=a.count('0')\r\n if(zero>=6):\r\n print('yes')\r\n else:\r\n print('no')", "s=str(int(input()))\r\n\r\nl=len(s)\r\na=['1']\r\nfor i in range(1,l):\r\n\tif(s[i]=='0'):\r\n\t\ta.append('0')\r\nif(a.count('0')>=6):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\nm = 0\r\nwhile m < len(s) and s[m] == \"0\":\r\n m += 1\r\ns = s[m:]\r\nk = s.count(\"0\")\r\nif k >= 6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "print(['no','yes'][input().lstrip('0').count('0') >= 6])\r\n# love you baby:\r\n# baby = no_one", "import re\r\n\r\ns = input()\r\nmatch = re.match(r'0+', s)\r\nst = 0\r\nif match:\r\n st = len(match.group(0))\r\ncnt = 0\r\nfor i in range(st, len(s)):\r\n if s[i] == '0':\r\n cnt += 1\r\nif cnt >= 6:\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "s = input()\r\nif s[s.find('1'):].count('0') >= 6:\r\n print('yes')\r\nelse:\r\n print('no')\r\n \r\n ", "s = str(input())\r\n'''\r\nif len(s) < 7:\r\n print('no')\r\ns = s[s.index(1):] \r\nfor i in range(1,len(s)):\r\n if s[i] == '0':\r\n continue\r\n else:\r\n if s.remove())\r\n'''\r\nif '1' in s:\r\n n = s.index('1')\r\n zero = s[n:].count('0')\r\n if zero >= 6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")\r\n\r\n", "A = list(input())\r\ndef check(A,x):\r\n A.reverse()\r\n while x>0:\r\n if A.count(\"0\") ==0:\r\n return (\"NO\")\r\n break\r\n else:\r\n A = A[A.index(\"0\")+1:]\r\n x -=1\r\n if A.count(\"1\") == 0:\r\n return (\"NO\")\r\n else:\r\n return (\"YES\")\r\nprint(check(A,6))", "a=input()\r\nfor i in range(len(a)):\r\n if a[i]==\"1\" and a[i::].count(\"0\")>5:exit(print(\"yes\"))\r\nprint(\"no\")\r\n", "s=input()\r\nif len(s)<7:\r\n print(\"NO\")\r\nelse:\r\n if s.count('1')==0:\r\n print(\"NO\")\r\n else:\r\n d = s.index(\"1\")\r\n s = s[d + 1:]\r\n e = s.count(\"0\")\r\n if e > 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "\r\ntry:\r\n string = input()\r\n one = string.index(\"1\")\r\n string = string[one:]\r\n num = string.count(\"0\")\r\n if(num>= 6):\r\n print(\"yes\")\r\n else:\r\n print(\"no\") \r\nexcept:\r\n print(\"no\")", "s = input()\r\n#s = \"100\"\r\nn = len(s)\r\nflag = False\r\nfor i in range(n):\r\n\t\r\n\tif (s[i] == '1'):\r\n\t\t#print (i), \" \"\r\n\t\tcnt = 0\r\n\t\tfor j in range(i, n):\r\n\t\t\tif (s[j] == '0'):\r\n\t\t\t\tcnt += 1\r\n\t\t#print (cnt)\r\n\t\tif (cnt >= 6):\r\n\t\t\tflag = True\r\n\t\t\tbreak\r\n\t\tif (flag == True):\r\n\t\t\tbreak\r\nif (flag == True):\r\n\tprint (\"yes\")\r\nelse:\r\n\tprint (\"no\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\na = s.find('1')\r\nprint('yes' if s[a:].count('0') >= 6 else \"no\")", "N = input()\r\n\r\nif N.count(\"1\") == 0:\r\n print(\"no\")\r\n\r\nelse:\r\n i = N.index(\"1\")\r\n if N[i:].count(\"0\") > 5:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")", "import io\r\nimport sys\r\nimport math\r\n\r\ndef main():\r\n # It helps to use an input file when testing or debugging your code locally.\r\n # with open(\"main.in\", \"r\", encoding='utf-8') as f:\r\n with sys.stdin as f:\r\n n = f.readline()\r\n while n[0] == \"0\":\r\n n = n[1:]\r\n k = n.count('0')\r\n if k > 5:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nmain()", "n = input()\n\nif '1' in n and n[n.index('1'):].count('0') >= 6:\n print('yes')\nelse:\n print('no')\n", "def izabella(s):\r\n count1, count2, ind = 0, 0, 0\r\n for i in range(len(s)):\r\n if s[i] == '1':\r\n ind = i\r\n break\r\n for elem in s[ind:]:\r\n if elem == '0':\r\n count1 += 1\r\n if elem == '1':\r\n count2 += 1\r\n if count1 >= 6 and count2 > 0:\r\n return \"yes\"\r\n return \"no\"\r\n\r\n\r\nprint(izabella(input()))\r\n", "def main():\r\n\tsolver(input())\r\n\r\ndef solver(s):\r\n\tfirstone = s.find('1')\r\n\tif (firstone != -1 and \r\n\ts[firstone:].count('0') >= 6):\r\n\t\tprint('yes')\r\n\telse:\r\n\t\tprint('no')\r\n\r\n#solver('10001001')\r\nmain()", "from sys import exit\r\ns = [int(i) for i in input()]\r\nif len(s)<=6:\r\n print('no')\r\n exit()\r\nc = 0\r\ns = s[::-1]\r\nfor i in range(len(s)):\r\n if c==6:\r\n break\r\n if s[i]==0:\r\n c+=1\r\nif c<6:\r\n print('no')\r\n exit()\r\nfor j in range(i,len(s)):\r\n if c==7:\r\n break\r\n if s[j]==1:\r\n c+=1\r\nif c==7:\r\n print('yes')\r\nelse:\r\n print('no')", "s=input()\r\nif '1' not in s:\r\n print(\"no\")\r\nelse:\r\n o=s.index('1')\r\n ss=s[o+1:len(s)]\r\n if ss.count('0')>=6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")", "s = input()\r\none = s.find('1')\r\nif one == -1:\r\n print(\"no\")\r\nelse:\r\n zeros = s.count('0', one)\r\n if zeros >= 6:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")", "n=input()\r\np=0\r\nif '1' in n:\r\n m=n.index('1')\r\n for i in n[m+1:]:\r\n if i=='0':\r\n p+=1\r\n if p>=6:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "x=input()\r\ne='0'\r\nce=0\r\nfor i in reversed(range(len(x))):\r\n if x[i] == e:\r\n ce+=1\r\n if (ce == 6) and (e=='0'):\r\n e='1'\r\n ce=0\r\n if (ce==1) and (e=='1'):\r\n print('yes')\r\n exit(0)\r\nprint('no')", "s = input()\r\np = s.find('1')\r\nprint('yes' if p != -1 and s[p:].count('0') >= 6 else 'no')", "n=0\r\na=input()\r\nfor i in a[::-1]:\r\n if i=='0':\r\n n=n+1\r\n if n>=6 and i=='1':\r\n print('yes')\r\n exit()\r\n\r\nprint('no')\r\n", "s = input()\r\n\r\ntry:\r\n if s[s.index('1'):].count('0') >= 6:\r\n print('yes')\r\n else:\r\n print('no')\r\nexcept ValueError:\r\n print('no')\r\n", "N=list(input())\r\nif(len(N)>=7):\r\n if '1' in N:\r\n S=N.count('1')\r\n if(S==1):\r\n H=N.index('1')\r\n H1=N[H:]\r\n if(H1.count('0')>=6):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n else:\r\n W=len(N)-(S-1)\r\n if(W>=7):\r\n H=N.index('1')\r\n H1=N[H:]\r\n if(H1.count('0')>=6):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n else:\r\n print(\"no\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\")", "s = input()\r\nind = -1\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n ind = i\r\n break\r\nif ind == -1:\r\n print('no')\r\n exit()\r\ncnt = 0\r\nfor i in range(ind + 1, len(s)):\r\n if s[i] == '0':\r\n cnt += 1\r\nif cnt >= 6:\r\n print('yes')\r\nelse:\r\n print('no')", "s = input()\r\ni = s.find('1')\r\nif i == -1:\r\n print('no')\r\nelse:\r\n if s[i+1:].count('0') < 6:\r\n print('no')\r\n else:\r\n print('yes')", "s=input()\r\none=s.find('1')\r\nif one==-1:print(\"no\")\r\nelse:\r\n zero=s[one:].count('0')\r\n if zero>=6:print(\"yes\")\r\n else:print(\"no\")", "s = input()\ntry:\n s = s[s.index('1'):]\nexcept ValueError:\n s = ''\nif s.count('0') >= 6:\n print('yes')\nelse:\n print('no')\n\n", "s=str(input())\r\nl=len(s)\r\nf=0\r\ng=0\r\nx=0\r\ny=0\r\nfor i in range(len(s)-1,-1,-1):\r\n if(int(s[i])==0):\r\n x=x+1\r\n if(x==6):\r\n y=i\r\n g=1\r\n break\r\nfor i in range(y):\r\n if(int(s[i])==1):\r\n f=1\r\n break\r\n#print(f, g, y)\r\nif(f==1 and g==1):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n \r\n \r\n", "from sys import stdin\r\ns = stdin.readline()[:-1]\r\nprint('yes' if s.lstrip('0').count('0') > 5 else 'no')", "print([\"no\", \"yes\"][str(int(input())).count(\"0\")>5])", "n=input()\r\ni=n.find('1')\r\nif n[i:].count('0')>=6:\r\n print('yes')\r\nelse:\r\n print('no')", "p = str(input(''))\r\ns = 0\r\nanswer = 'no'\r\nfor i in range(len(p) - 1, -1, -1):\r\n if s >= 6 and int(p[i]) == 1:\r\n answer = 'yes'\r\n break\r\n elif int(p[i]) == 0:\r\n s += 1\r\n else:\r\n continue\r\nprint(answer)", "S = input()\r\nif len(S) < 7:\r\n print(\"no\")\r\nelse:\r\n cntZero = 0\r\n ind = 99\r\n flag = False\r\n for i, ch in enumerate(S[::-1]):\r\n if ch == \"0\":\r\n cntZero += 1\r\n if cntZero >= 6:\r\n ind = len(S) - i - 1\r\n flag = True\r\n break\r\n # print(ind)\r\n if flag == False:\r\n print(\"no\")\r\n else:\r\n if \"1\" in S[0:ind+1]:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n", "x = int(input())\r\nb = str(x).count(\"0\")\r\nif (b>=6):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "n=input()\r\nflag1=False\r\ncount=0\r\nfor letter in n:\r\n if letter=='1'and flag1==False:\r\n flag1=True\r\n if flag1==True and letter=='0':\r\n count+=1\r\nif count>=6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "s=input()\r\nnum2=s.find('1')\r\nif num2!=-1:\r\n num=s[num2:].count('0')\r\n if num>5:\r\n print('yes')\r\n else:\r\n print('no')\r\nelse:\r\n print('no')\r\n", "s = input()\r\nif(len(s)<7):\r\n print(\"NO\")\r\nelse:\r\n cons=0\r\n flag=0\r\n for i in range(len(s)-1,0,-1):\r\n if(s[i]==\"0\"):\r\n cons+=1\r\n if(cons==6):\r\n flag=1\r\n k=i\r\n break\r\n if(flag==1):\r\n flag=0\r\n for i in range(k,-1,-1):\r\n if(s[i]==\"1\"):\r\n flag=1\r\n break\r\n if(flag==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "x = input(); print(\"yes\" if x.count('0', x.find('1')) > 5 else \"no\")", "n=str(input())\r\nif len(n)<7:\r\n print(\"NO\")\r\nelif n.lstrip('0').count('0')>=6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\n\nzeroes = 0\nflag = 0\n\nfor x in s:\n if (x == '1'):\n flag = 1\n if (x == '0' and flag == 1):\n zeroes += 1\n\nif (zeroes >= 6):\n print('yes')\nelse:\n print('no')", "s = input()\r\ntry:\r\n s.index(\"1\")\r\nexcept ValueError:\r\n print(\"no\")\r\nelse:\r\n print(\"yes\" if s[s.index(\"1\"):].count(\"0\") > 5 and s.count(\"1\") > 0 else \"no\")\r\n", "if __name__ == \"__main__\":\n d = input()\n\n b = d\n for i, a in enumerate(d):\n if a == \"0\":\n b = d[i+1:]\n elif a == \"1\":\n break\n\n c = sum(1 for a in b if a == '0')\n if c >= 6:\n print(\"yes\")\n else:\n print(\"no\")\n" ]

[ "from sys import stdin\r\ndef main():\r\n mod = 10**9 + 7\r\n\r\n _all = map(str, stdin.read().split())\r\n m, d, a, b = int(next(_all)), int(next(_all)), next(_all), next(_all)\r\n n = len(a)\r\n n_2, re, list_not_d, dp = n & 1, [0]*n, [i for i in range(10) if i ^ d], [[0]*m for i in range(n)]\r\n re[0] = 1\r\n dp[0][0] = 1\r\n for i in range(1, n): re[i] = re[i-1] * 10 % m\r\n for i in range(1, n):\r\n x, y, r = dp[i-1], dp[i], re[i-1]\r\n if n_2 ^ i & 1:\r\n diff = (r * d) % m\r\n rev = diff - m\r\n for j in range(m-diff):\r\n y[j] = (y[j] + x[j + diff]) % mod\r\n for j in range(m-diff, m):\r\n y[j] = (y[j] + x[j + rev]) % mod\r\n else:\r\n for dd in list_not_d:\r\n diff = (r * dd)%m\r\n rev = diff - m\r\n for j in range(m-diff):\r\n y[j] = (y[j] + x[j + diff]) % mod\r\n for j in range(m-diff, m): \r\n y[j] = (y[j] + x[j + rev]) % mod\r\n \r\n def get(s):\r\n total, ans, bad = 0, 0, 0\r\n for i in range(n):\r\n c = int(s[i])\r\n ptr = n-i-1\r\n for j in range(c):\r\n if i & 1 ^ (j == d): continue\r\n ans += dp[ptr][(total + j * re[ptr]) % m]\r\n total = (total + c * re[ptr]) % m\r\n if i & 1 ^ (c == d):\r\n bad = 1\r\n break\r\n if (bad == total == 0): ans += 1\r\n return ans\r\n a = str(int(a) - 1).zfill(n)\r\n print((get(b)-get(a)+mod)%mod)\r\n\r\nif __name__ == '__main__':\r\n main()", "from sys import stdin\r\nmod = 10**9 + 7\r\n\r\n_all = map(str, stdin.read().split())\r\nm, d, a, b = int(next(_all)), int(next(_all)), next(_all), next(_all)\r\nn = len(a)\r\ndin, din1 = [0]*m, [0]*m\r\neqa, eqb, eqab = 1, 1, 1\r\nxa, xb = 0, 0\r\nfor i in range(n):\r\n\teqa1, eqb1, eqab1 = 0, 0, 0\r\n\tdin1 = [0]*m\r\n\tfor dig in range(10):\r\n\t\tif i % 2 == 1 and dig != d or i % 2 == 0 and dig == d: continue\r\n\t\tfor x in range(m):\r\n\t\t\ty = (10 * x + dig) % m\r\n\t\t\tdin1[y] = (din1[y] + din[x]) % mod\r\n\t\tif eqab:\r\n\t\t\tif (int(a[i]) < dig and dig < int(b[i])):\r\n\t\t\t\ty = (10 * xa + dig) % m\r\n\t\t\t\tdin1[y] = din1[y] + 1\r\n\r\n\t\telse:\r\n\t\t\tif (eqa and int(a[i]) < dig):\r\n\t\t\t\ty = (10 * xa + dig) % m\r\n\t\t\t\tdin1[y] = din1[y] + 1\r\n\t\t\tif (eqb and dig < int(b[i])):\r\n\t\t\t\ty = (10 * xb + dig) % m\r\n\t\t\t\tdin1[y] = din1[y] + 1\r\n\t\teqa1 |= eqa and dig == int(a[i])\r\n\t\teqb1 |= eqb and dig == int(b[i])\r\n\t\teqab1 |= eqab and dig == int(a[i]) & dig == int(b[i])\r\n\t\r\n\txa = (10 * xa + (int(a[i]))) % m\r\n\txb = (10 * xb + (int(b[i]))) % m\r\n\teqa = eqa1\r\n\teqb = eqb1\r\n\teqab = eqab1\r\n\tdin, din1 = din1, din\r\nans = din[0]\r\nif (eqab):\r\n\tans = ans + (xa == 0)\r\nelse:\r\n\tans = ans + (eqa and xa == 0)\r\n\tans = ans + (eqb and xb == 0)\r\nprint(ans%mod)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nm, d = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\na = list(input().rstrip())\r\nb = list(input().rstrip())\r\nn = len(a)\r\npow10 = [1 % m]\r\nfor _ in range(2005):\r\n pow10.append(10 * pow10[-1] % m)\r\ns = []\r\nfor i in range(10):\r\n if i ^ d:\r\n s.append(i)\r\n\r\ndef dp(a):\r\n dp0 = [0] * m\r\n dp1 = [0] * m\r\n dp2 = [0] * m\r\n dp3 = [0] * m\r\n dp0[0] = 1\r\n for i in range(n):\r\n p = pow10[n - i - 1]\r\n ai = int(a[i])\r\n if i % 2 == 0:\r\n for j in range(m):\r\n if not dp0[j]:\r\n continue\r\n dp0j = dp0[j]\r\n for k in s:\r\n if k < ai:\r\n dp3[(j + k * p) % m] += dp0j\r\n dp3[(j + k * p) % m] %= mod\r\n elif k == ai:\r\n dp1[(j + k * p) % m] += dp0j\r\n dp1[(j + k * p) % m] %= mod\r\n break\r\n elif d < ai:\r\n for j in range(m):\r\n if not dp0[j]:\r\n continue\r\n dp0j = dp0[j]\r\n dp3[(j + d * p) % m] += dp0j\r\n dp3[(j + d * p) % m] %= mod\r\n elif d == ai:\r\n for j in range(m):\r\n if not dp0[j]:\r\n continue\r\n dp0j = dp0[j]\r\n dp1[(j + d * p) % m] += dp0j\r\n dp1[(j + d * p) % m] %= mod\r\n if i % 2 == 0:\r\n for j in range(m):\r\n if not dp2[j]:\r\n continue\r\n dp2j = dp2[j]\r\n for k in s:\r\n dp3[(j + k * p) % m] += dp2j\r\n dp3[(j + k * p) % m] %= mod\r\n else:\r\n for j in range(m):\r\n if not dp2[j]:\r\n continue\r\n dp2j = dp2[j]\r\n dp3[(j + d * p) % m] += dp2j\r\n dp3[(j + d * p) % m] %= mod\r\n for j in range(m):\r\n dp0[j] = dp1[j]\r\n dp1[j] = 0\r\n for j in range(m):\r\n dp2[j] = dp3[j]\r\n dp3[j] = 0\r\n return (dp0[0] + dp2[0]) % mod\r\n\r\nl = dp(a)\r\nr = dp(b)\r\nf, c = 1, 0\r\nfor i in range(n):\r\n c += int(a[i]) * pow10[n - i - 1]\r\n c %= m\r\nfor i in range(n):\r\n if not min(int(a[i]) ^ d, 1) ^ (i % 2):\r\n f = 0\r\n break\r\nif f and not c:\r\n l -= 1\r\nans = (r - l) % mod\r\nprint(ans)", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nmod=10**9+7\r\nM,D=map(int,readline().split())\r\ndef solve(N,equal=False):\r\n dp=[[0]*M for ij in range(4)]\r\n for x in range(1,int(N[0])):\r\n if x==D:\r\n continue\r\n dp[0][x%M]+=1\r\n if int(N[0])!=D:\r\n dp[2][int(N[0])%M]+=1\r\n for n in N[1:]:\r\n n=int(n)\r\n prev=[[dp[ij][m] for m in range(M)] for ij in range(4)]\r\n dp=[[0]*M for ij in range(4)]\r\n for j in range(2):\r\n for x in [d for d in range(10) if d!=D] if j%2 else [D]:\r\n for m in range(M):\r\n dp[j^1][(10*m+x)%M]+=prev[j][m]\r\n if x<n:\r\n dp[j^1][(10*m+x)%M]+=prev[2+j][m]\r\n if x==n:\r\n dp[2+(j^1)][(10*m+x)%M]+=prev[2+j][m]\r\n for x in range(10):\r\n if x==D:\r\n continue\r\n dp[0][x%M]+=1\r\n for i in range(2):\r\n for j in range(2):\r\n for m in range(M):\r\n dp[i*2+j][m]%=mod\r\n retu=dp[0][0]+dp[1][0]\r\n if equal:\r\n retu+=dp[2][0]+dp[3][0]\r\n retu%=mod\r\n return retu\r\nA=readline().rstrip()\r\nB=readline().rstrip()\r\nans=(solve(B,equal=True)-solve(A))%mod\r\nprint(ans)" ]

[ "import sys, math\nn=int(input())\na=sorted(int(x) for x in sys.stdin)\ni=(n//2)-1\nj=n-1\nk=0\nwhile j>((n//2)-1) and i>=0:\n if 2*a[i]<=a[j]:\n j-=1\n k+=1\n i-=1\n#print(a)\nprint(n-k)\n \t\t \t \t \t \t\t\t \t\t \t \t\t\t\t \t\t", "n = int(input())\nsizes = sorted([int(input()) for i in range(n)])\nopt = n-1\ncnt = 0\n\nfor i in range(n//2-1, -1, -1):\n if sizes[i] * 2 <= sizes[opt]:\n opt -= 1\n cnt += 1\n\nprint(opt+1)\n\n\t \t\t\t \t\t\t \t\t\t\t\t\t \t \t \t \t\t", "import sys\nn=int(input())\narr = sorted([int(i) for i in sys.stdin])\n\nl=(n//2) - 1\nr=n-1\nres=0\nwhile l>=0 and r>n//2 -1:\n if arr[l]*2<=arr[r]:\n res+=1\n r-=1\n l-=1\nprint(n-res)\n", "n=int(input())\nls= sorted([int(input()) for _ in range(n)])\ncnt=0\nright=n-1\nfor mid in range(n//2-1,-1,-1):\n if ls[right]>=2*ls[mid]:\n cnt+=1\n right-=1\nprint(n-cnt)\n\t\t\t \t\t\t\t\t\t\t \t\t \t \t \t\t \t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nq = sorted([int(input()) for _ in range(n)])\r\nc = 0\r\ni = (n-1)//2\r\nj = n-1\r\nwhile i >= 0:\r\n if q[i]*2 <= q[j]:\r\n i -= 1\r\n j -= 1\r\n c += 1\r\n else:\r\n i -= 1\r\nprint(n-min(c, n//2))", "def f(L):\r\n S=sorted(L)\r\n n=len(S)\r\n X=S[:n//2]\r\n Y=S[n//2:]\r\n i=len(Y)-1\r\n ans=n\r\n j=len(X)-1\r\n while i>=0 and j>=0:\r\n if Y[i]>=2*X[j]:\r\n ans-=1\r\n i-=1\r\n j-=1\r\n else:\r\n j-=1\r\n return ans\r\n\r\n\r\nn=int(input())\r\nL=[]\r\nfor i in range(n):\r\n x=int(input())\r\n L.append(x)\r\nprint(f(L))", "import sys\nnum = int(sys.stdin.readline())\n(kang := list(int(sys.stdin.readline()) for _ in range(num))).sort()\nans = num \npos = num//2\nfor i in range(num//2):\n for d in range(num//2):\n if kang[pos]>=kang[i]*2:\n ans-=1\n pos+=1\n break\n pos+=1\n if pos == num:\n break\n if pos == num:\n break\nprint(ans)\n\n", "from sys import stdin\n\ndef lmap(function, iterable): return list(map(function, iterable))\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return lmap(converter, line().split(delimeter))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMULTIPLE_CASES = 0\n\ndef main():\n N = rd(int)\n S = rls(N,int)\n\n S.sort()\n i2 = N//2\n ans = N\n\n for i1 in range(N):\n if S[i1] == -1: continue\n while i2 < N and S[i2] < S[i1]*2: i2 += 1\n\n if i2 < N:\n ans -= 1\n S[i2] = -1\n\n print(ans)\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "import sys\r\nsys.setrecursionlimit(200000)\r\nimport math\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\nfrom functools import lru_cache\r\nimport heapq \r\nimport threading\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s)-1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn = inp()\r\narr= [] \r\nfor index in range(n):\r\n x = inp()\r\n arr.append(x)\r\n\r\narr.sort()\r\nr = len(arr) - 1\r\nl = len(arr)// 2 \r\nif len(arr)%2 == 0:\r\n l -= 1 \r\n\r\nmid = l\r\ncounter = len(arr)\r\n\r\nwhile r > mid and l > -1:\r\n if arr[r] >= 2 * arr[l]:\r\n r -=1\r\n l -=1\r\n counter -= 1\r\n else:\r\n l -= 1\r\n\r\nprint(counter)\r\n \r\n \r\n\r\n\r\n \r\n \r\n# if name == \"main\":\r\n# # for _ in range(inp()):\r\n# main()\r\n \r\n \r\n# threading.stack_size(1 << 27)\r\n# sys.setrecursionlimit(1 << 30)\r\n# main_thread = threading.Thread(target=main)\r\n# main_thread.start()\r\n# main_thread.join()", "n = int(input())\nli = []\nfor i in range(n):\n li.append(int(input()))\n\nli.sort()\ni = (n // 2) - 1\nj = n-1\n\nrem = n\nwhile i >= 0 and j >= n//2:\n if li[i] <= li[j]//2:\n rem -= 1\n j -= 1\n i -= 1\n\nprint(rem)\n\n \t \t \t\t \t\t \t\t \t \t\t \t\t \t \t", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\nn, = Neo()\r\nA = [int(input()) for i in range(n)]\r\nA.sort()\r\nans = n\r\nj = n-1\r\nfor i in range(n//2-1,-1,-1):\r\n if(A[i] * 2 <= A[j]):\r\n j -= 1\r\n ans -= 1\r\nprint(ans) \r\n", "import sys\r\nn = int(sys.stdin.readline().lstrip().rstrip())\r\narr = []\r\nfor i in range(n):\r\n arr.append(int(sys.stdin.readline().lstrip().rstrip()))\r\narr.sort()\r\nans = 0\r\na,b =0,n//2\r\nwhile a<n//2 and b<n:\r\n if arr[a]*2<=arr[b]:\r\n ans+=1\r\n a+=1\r\n b+=1\r\n else:\r\n b+=1\r\nsys.stdout.write(str(n-ans)+'\\n')", "n = int(input())\nsizes = sorted([int(input()) for i in range(n)]) #take the n elements sort the numbers\ndes = n-1 \ncnt = 0\n \nfor i in range(n//2-1, -1, -1): #reduce the n size half \n if sizes[i] * 2 <= sizes[des]:\n des -= 1\n cnt += 1\n \nprint(des+1)\n\n \t \t\t\t\t \t\t\t \t\t \t\t \t", "from math import ceil\r\n\r\ndef solve(kangaroos):\r\n kangaroos.sort(reverse=True)\r\n middle = ceil(len(kangaroos)/2) - 1\r\n i = 0\r\n j = middle + 1\r\n result = len(kangaroos)\r\n while i <= middle:\r\n while j < len(kangaroos) and kangaroos[j] * 2 > kangaroos[i]:\r\n j += 1\r\n if j == len(kangaroos):\r\n break\r\n result -= 1\r\n i += 1\r\n j += 1\r\n\r\n return result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n kangaroos = [int(input()) for x in range(n)]\r\n print(solve(kangaroos))", "n = int(input())\nsizes = sorted([int(input()) for i in range(n)])\nopt1= n-1\ncnt = 0\n \nfor i in range(n//2-1, -1, -1):\n if sizes[i] * 2 <= sizes[opt1]:\n opt1 -= 1\n cnt += 1\n \nprint(opt1+1)\n \t\t \t\t\t \t \t\t \t\t\t \t", "l=[]\r\nn=int(input())\r\nfor _ in range(n):\r\n l.append(int(input()))\r\n\r\nl.sort()\r\n\r\ne=n-n//2\r\na=l[:e]\r\n\r\nans=0\r\nfor x in l[e:][::-1]:\r\n while e!=0:\r\n e-=1\r\n if a[e]*2<=x:\r\n ans+=1\r\n break\r\n\r\nprint(n-ans)", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = [0 for _ in range(0,n)]\r\ncnt = 0\r\n\r\nfor i in range(0,n):\r\n a[i] = int(input())\r\n \r\na.sort()\r\ni = 0\r\nj = n//2\r\n\r\nwhile(i<n//2 and j<n):\r\n if(2*a[i] <= a[j]):\r\n cnt += 1\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\n\r\nprint(n - cnt)", "n = int(input())\n\nv = []\n\nfor i in range(n):\n v.append(int(input()))\n\nv = sorted(v)\nmeio = int(n/2)\n\nesq = 0\ndir = meio\n\nvisible = n\n\nwhile dir < n and esq < meio:\n if (v[dir] / v[esq]) >= 2:\n esq += 1\n dir += 1\n visible -= 1\n else:\n dir += 1\n\nprint(visible)\n\n \t\t \t \t \t \t\t \t\t \t \t\t \t", "import sys\r\nimport math\r\nn=int(input())\r\na=sorted(int(x) for x in sys.stdin)\r\ni=(n//2)-1\r\nj=n-1\r\nk=0\r\nwhile j>((n//2)-1) and i>=0:\r\n b = int(2*a[i]<=a[j])\r\n j-=1*b\r\n k+=1*b\r\n i-=1\r\n#print(a)\r\nprint(n-k)\r\n", "NumberOfKangaros = int(input())\r\nLengthOfArray = sorted([int(input()) for i in range(NumberOfKangaros)])\r\n\r\nj = NumberOfKangaros-1\r\ncounter = 0\r\nfor i in range(NumberOfKangaros//2-1,-1,-1):\r\n if(LengthOfArray[i] * 2 <= LengthOfArray[j]):\r\n j -= 1\r\n counter +=1\r\nprint(NumberOfKangaros-counter)", "from collections import deque\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l+=[int(input())]\r\nl.sort()\r\nq=deque(l[:n//2])\r\nw=deque(l[n//2:])\r\no=0\r\nfor i in range(n//2):\r\n if q[-1]*2<=w[-1]:\r\n o+=1\r\n w.pop()\r\n q.pop()\r\nprint(n-o)", "from math import *\r\nfrom collections import *\r\nfrom random import *\r\nfrom decimal import Decimal\r\nfrom bisect import *\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\ndef inp():\r\n return int(input())\r\ndef fk(a,s,k):\r\n b=[]\r\n for i in range(len(a)):\r\n b.append(a[i]+(i+1)*k)\r\n b.sort()\r\n return sum(b[:k])\r\nn=inp()\r\nr=[]\r\nfor i in range(n):\r\n x=inp()\r\n r.append(x)\r\nr.sort()\r\nco=0\r\npo=0\r\npo1=0\r\nfor i in range(n//2):\r\n if(po1+(n//2)==n):\r\n break\r\n if(r[po]*2<=r[n//2 + po1]):\r\n co+=1\r\n po1+=1\r\n po+=1\r\n continue\r\n else:\r\n po1+=1\r\nprint(n-(2*co)+co)\r\n \r\n\r\n \r\n \r\n \r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(int(input()))\r\n \r\na.sort()\r\nans=n\r\npt=n//2\r\nfor i in range(pt):\r\n while(1):\r\n if(a[i]*2<=a[pt]):\r\n ans-=1\r\n pt+=1\r\n break\r\n else:\r\n pt+=1\r\n if(pt==n):\r\n break\r\n if(pt==n):break\r\nprint(ans)", "n=int(input());arr=[int(input()) for _ in [0]*n];arr.sort();i=n-1;j=n//2-1;ans=n\r\nwhile i>=n//2 and j>=0:\r\n if arr[j]*2<=arr[i]:i-=1;ans-=1\r\n j-=1\r\nprint(ans)", "from bisect import bisect_left\r\nfrom sys import stdin\r\ninput = stdin.buffer.readline\r\n\r\ndef func():\r\n find_ind = n // 2-1\r\n count = 0\r\n\r\n for i in range(n//2):\r\n if s[i] == 0:\r\n continue\r\n else:\r\n ind = bisect_left(s, s[i]*2, find_ind+1)\r\n if ind == n:\r\n break\r\n else:\r\n count += 1\r\n find_ind = ind\r\n\r\n print(n - count)\r\n\r\n\r\nn = int(input())\r\ns = list(int(input()) for _ in range(n))\r\ns.sort()\r\nfunc()\r\n", "# from: https://codeforces.com/problemset/problem/372/A\r\n\r\nimport unittest\r\nimport io\r\nimport os\r\nimport sys\r\nfrom atexit import register\r\nimport random\r\nimport math\r\nimport itertools\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nsys.stdout = io.BytesIO()\r\nregister(lambda: os.write(1, sys.stdout.getvalue()))\r\n\r\ntokens = []\r\ntokens_next = 0\r\n\r\ndef nextStr():\r\n global tokens, tokens_next\r\n while tokens_next >= len(tokens):\r\n tokens = input().split()\r\n tokens_next = 0\r\n tokens_next += 1\r\n\r\n if type(tokens[tokens_next - 1]) == str:\r\n return tokens[tokens_next - 1]\r\n return tokens[tokens_next - 1].decode()\r\n\r\n\r\ndef nextInt():\r\n return int(nextStr())\r\n\r\n\r\ndef nextIntArr(n):\r\n return [nextInt() for i in range(n)]\r\n\r\n\r\ndef print(*argv, end='\\n'):\r\n for arg in argv:\r\n sys.stdout.write((str(arg) + ' ').encode())\r\n sys.stdout.write(end.encode())\r\n\r\ndef OptimalKangarooCount(a): \r\n a = sorted(a)\r\n half = len(a) // 2\r\n left = 0\r\n right = half\r\n res = 0\r\n while left < half and right < len(a):\r\n if a[left] * 2 <= a[right]:\r\n res += 1\r\n left += 1\r\n right += 1\r\n else:\r\n res += 1\r\n right += 1\r\n\r\n return res + (half - left) + (len(a) - right)\r\n\r\n\r\nclass CoutingKangaroosTest(unittest.TestCase):\r\n def test_GivenTests(self):\r\n self.assertEqual(OptimalKangarooCount([2, 4, 6, 8]), 2) # reduced version of the first case\r\n self.assertEqual(OptimalKangarooCount([2, 5, 7, 6, 9, 8, 4, 2]), 5)\r\n self.assertEqual(OptimalKangarooCount([9, 1, 6, 2, 6, 5, 8, 3]), 5)\r\n \r\n def test_TwoKangaroos(self):\r\n self.assertEqual(OptimalKangarooCount([2, 3]), 2)\r\n self.assertEqual(OptimalKangarooCount([2, 4]), 1)\r\n \r\n def test_ThreeKangaroos(self):\r\n self.assertEqual(OptimalKangarooCount([2, 4, 3]), 2)\r\n\r\n def test_MustMergeWithLeastPossibleCandidate(self):\r\n self.assertEqual(OptimalKangarooCount([4, 5, 8, 10]), 2)\r\n\r\nif __name__ == \"__main__\":\r\n # unittest.main()\r\n\r\n a = nextIntArr(nextInt())\r\n print(OptimalKangarooCount(a))\r\n sys.stdout.flush()\r\n", "n=int(input())\narr=sorted([int(input()) for i in range(n)])\nj=int(n)-1\ni=(n//2)-1\ncount=0\nwhile i>=0 and j>((n//2)-1):\n if(arr[j]>=arr[i]*2):\n j=j-1\n count=count+1\n i=i-1\nprint(n-count)\n\t\t \t \t\t \t \t\t\t\t \t\t \t\t \t\t \t", "n = int(input())\nlist = []\nfor i in range(n):\n list.append(int(input()))\n\nlist.sort()\ni = (n // 2) - 1\nj = n-1\n\nrem = n\nwhile i >= 0 and j >= n//2:\n if list[i] <= list[j]//2:\n rem -= 1\n j -= 1\n i -= 1\n\nprint(rem)\n \t \t \t\t \t \t\t \t\t\t\t \t \t \t\t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = sorted([int(input()) for i in range(n)])\r\n\r\ndef check(x):\r\n if n - x > x: return False\r\n # print(x)\r\n # print(s[:n-x])\r\n # print(s[-x:])\r\n for i in range(n-x):\r\n if s[i] * 2 > s[x+i]:\r\n return False\r\n return True\r\n\r\nl, r = (n+1)//2, n\r\nwhile l < r:\r\n mid = (l+r) // 2\r\n if check(mid): r = mid\r\n else: l = mid + 1\r\n#print(check(l))\r\nprint(l)", "\"\"\"\r\nCode of Ayush Tiwari\r\nCodeforces: servermonk\r\nCodechef: ayush572000\r\n\r\n\"\"\"\r\nimport sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef solution():\r\n n=int(input())\r\n l=[]\r\n for i in range(n):\r\n x=int(input())\r\n l.append(x)\r\n l.sort()\r\n i=0\r\n j=n//2\r\n # a=[0]*100003\r\n ans=n\r\n for i in range(n//2):\r\n while j<n:\r\n if 2*l[i]<=l[j]:\r\n ans-=1\r\n j+=1\r\n break\r\n else:\r\n j+=1\r\n\r\n print(ans)\r\n\r\n\r\n\r\nsolution()", "# توكلت على الله\r\n\r\nimport sys \r\ninput = sys.stdin.readline \r\n\r\ndef solve():\r\n n =int(input())\r\n ls = []\r\n for i in range(n):\r\n ls.append(int(input()))\r\n ls.sort()\r\n app = n \r\n i = n//2-1\r\n j = n-1\r\n while i >= 0 and j >= n//2:\r\n if ls[i] <= ls[j]//2:\r\n app-=1\r\n j-=1\r\n i-=1\r\n print(app)\r\n \r\n \r\n#for i in range(int(input())):\r\nsolve()", "t = int(input())\nq = t\nl = []\n\nfor i in range(t):\n l.append(int(input()))\n\nl = sorted(l)\nmeio = int(t/2)\n\nn = 0\nm = meio\n\nwhile(m<t and n<meio):\n if(l[m] / l[n]) >= 2:\n q -=1\n n +=1\n m +=1\n\nprint(q)\n\t \t \t \t\t \t\t\t \t\t \t", "import sys,io,os\r\nfrom os import path\r\nimport bisect\r\nimport math\r\nfrom collections import Counter,defaultdict\r\nif(path.exists('input.txt')):\r\n sys.stdin = open('input.txt','r')\r\n sys.stdout = open('output.txt','w')\r\nelse:\r\n input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\ndef main():\r\n n=int(input())\r\n a=[]\r\n if n==1:\r\n print(1)\r\n return\r\n for i in range(n):\r\n a.append(int(input()))\r\n a.sort()\r\n x=a[:math.floor(n/2)]\r\n y=a[math.floor(n/2):]\r\n x_poin=0\r\n y_poin=0\r\n score=0\r\n a=[0 for i in range(len(y))]\r\n for i in range(len(x)):\r\n # print(\"A\")\r\n while y_poin<len(y) and y[y_poin]<2*x[x_poin]:\r\n y_poin+=1\r\n if y_poin==len(y):\r\n # a[i]=1\r\n # print(score)\r\n score+=len(x)-x_poin\r\n break\r\n a[y_poin]=1\r\n score+=1\r\n x_poin+=1\r\n y_poin+=1\r\n for i in range(len(a)):\r\n if a[i]==0:\r\n score+=1\r\n print(score)\r\n\r\n\r\n\r\nfor _ in range(1):\r\n main()\r\n", "import sys\r\nimport math\r\nn=int(input())\r\na=sorted(int(x) for x in sys.stdin)\r\ni=(n//2)-1\r\nj=n-1\r\nk=0\r\nwhile j>((n//2)-1) and i>=0:\r\n if 2*a[i]<=a[j]:\r\n j-=1\r\n k+=1\r\n i-=1\r\n#print(a)\r\nprint(n-k)\r\n", "# Тупо скопировал решение, ибо никак не пойму поверить в решение за менее чем 1 #секунду((( \r\n\r\nfrom sys import stdin\r\n\r\ndef run(n, s):\r\n m = 0\r\n small = n // 2\r\n for big in range(n-1, (n+1)//2-1, -1):\r\n while small >= 0 and s[small] > s[big] / 2:\r\n small -= 1\r\n if small == -1:\r\n break\r\n small -= 1\r\n m += 1\r\n print(n-m)\r\n\r\nn = int(input())\r\ns = sorted([int(x) for x in stdin.read().strip().split('\\n')])\r\nrun(n, s)", "size=int(input())\n\nsizes1=[]\n\nfor _ in range(size):\n sizes1.append(int(input()))\n \n\nsizes=sorted(sizes1)\n\nfirst=0\nmiddle=size//2\n\ncount=0\n\nwhile( first!=size//2 and middle!=size):\n if sizes[middle]>=2*sizes[first]:\n count=count+1\n middle=middle+1\n first=first+1\n else:\n middle=middle+1\n\nprint(size-count)\n \n \n\t \t\t\t \t\t\t\t \t\t\t\t \t\t \t\t \t\t\t", "kan = int(input())\nlistt = []\nfor i in range(kan):\n s = int(input())\n listt.append(s)\n\nlistt.sort()\n\ni = 0\nj = kan // 2\ncount = 0\nwhile j < kan and i < kan // 2:\n if (listt[i] * 2) <= listt[j]:\n count = count + 1\n i = i + 1\n j = j + 1\n else:\n j = j + 1\n\nprint(kan - count)\n \t\t\t\t\t\t\t\t \t \t \t\t\t \t \t\t \t \t\t \t", "n=int(input())\r\n# from bisect import *\r\nnums=[]\r\nfor _ in range(n):\r\n s=int(input())\r\n nums.append(s)\r\nans=0\r\nnums.sort()\r\nlast=n-1\r\nlow=n//2-1\r\nwhile low>=0:\r\n if 2*nums[low]<=nums[last]:\r\n ans+=1\r\n low-=1\r\n last-=1\r\n else:\r\n low-=1\r\nprint(n-ans)\r\n ", "n = int(input())\nv = []\nvisible = n\n\nfor i in range(n):\n v.append(int(input()))\n\nv = sorted(v)\n\nleft = 0\nright = n//2\n\nwhile left != n//2 and right != n:\n if(v[right] // v[left] >= 2):\n visible -= 1\n right += 1\n left += 1\n else:\n right += 1\n\nprint(visible)\n\n \t\t \t \t\t\t\t \t\t \t\t\t\t\t\t \t", "t= int(input())\nkang_list= []\n\nfor i in range(t):\n kang_list.append(int(input()))\n\nkang_list = sorted(kang_list)\nkang_middle = int(t/2)\nkang_aux=kang_middle\nkang_greater = 0\nkang_small = t\n\nwhile(kang_aux < t and kang_greater < kang_middle):\n kang_count=kang_list[kang_aux]/kang_list[kang_greater]\n if(kang_count)>=2: \n kang_small -=1\n kang_greater +=1\n kang_aux +=1\nprint(kang_small)\n\n\t \t\t\t \t \t\t\t\t\t \t \t\t \t\t\t\t \t \t\n\t \t \t \t \t \t \t\t \t\t\t\t\t \t \t\t", "import sys\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(int(sys.stdin.readline()))\r\n\r\na.sort()\r\n\r\nres = 0\r\n\r\nsecond = n-1\r\nfor first in range(n//2-1, -1, -1):\r\n\r\n if a[first]*2<=a[second]:\r\n res += 1\r\n second -= 1\r\n\r\nprint(n - res)\r\n# 2 2 4 5 6 7 8 9", "n = int(input())\r\ns = sorted([int(input()) for _ in range(n)])\r\n\r\nmid = n // 2\r\nres = 0\r\n\r\ni, j = 0, mid\r\nwhile i < mid and j < n:\r\n if s[i] * 2 <= s[j]:\r\n res += 1\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\n\r\nprint(n - res)\r\n", "import sys\nimport io, os\nimport math\ngcd=math.gcd\nceil=math.ceil\nsqrt=math.sqrt\n#arr=list(map(int, input().split()))\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\nmod1=(10**9)+7\nmod2=998244353\ndef strinp(testcases):\n k=5\n if(testcases==-1 or testcases==1):\n k=1\n f=str(input())\n f=f[2:len(f)-k]\n return f\ndef alp(a):\n return (ord(a)-ord(\"a\"))\ndef main():\n n=int(input())\n arr=[0]*n\n for i in range(n):\n arr[i]=int(input())\n arr.sort()\n c=n\n j=n-1\n i=n//2-(1-n%2)\n temp=i\n while(j>temp and i>-1):\n if(arr[j]>=2*arr[i]):\n c-=1\n j-=1\n i-=1\n else:\n i-=1\n print(c)\nif __name__ == '__main__':\n main()\n\t \t\t \t\t\t \t\t\t \t \t \t \t \t \t\t\t", "n=int(input())\r\nkanguroo=[0]\r\nfor i in range(n):\r\n kanguroo.append(int(input()))\r\nkanguroo.sort()\r\nl=n//2\r\nr=n\r\nres=0\r\nwhile r>n//2 and l>0:\r\n if 2*kanguroo[l]<=kanguroo[r]:\r\n l-=1\r\n r-=1\r\n res+=1\r\n else:\r\n l-=1\r\nprint(n-res)", "from sys import stdin, stdout\r\nn = int(input())\r\nkang = [int(x) for x in stdin.read().split()]\r\nkang.sort()\r\n\r\nsol = n\r\np = n // 2\r\n\r\nfor i in range(n // 2):\r\n while True:\r\n if 2 * kang[i] <= kang[p]:\r\n sol -= 1\r\n p += 1\r\n break\r\n \r\n else:\r\n p += 1\r\n \r\n if p == n:\r\n break\r\n if p == n:\r\n break\r\n\r\nstdout.write(str(sol))", "a=[]\r\n\r\nn=int(input())\r\n\r\n\r\nfor i in range(n):\r\n x= int(input())\r\n a.append(x)\r\n\r\na.sort()\r\ni=n//2-1\r\nj=n-1\r\nv=n\r\nwhile i>=0 and j>=n//2:\r\n if(a[i]<=a[j]//2):\r\n v-=1\r\n j-=1\r\n i-=1\t\r\n \r\nprint(v)", "import sys\r\nn=int(input())\r\nls=[]\r\nfor _ in range(n):\r\n s=sys.stdin.readline()\r\n ls.append(int(s))\r\nls.sort()\r\n\r\ncnt=0\r\nmid=n//2-1\r\nright=n-1\r\nmated=0\r\nfor _ in range(n//2):\r\n if ls[right]>=2*ls[mid] and mid>=0:\r\n cnt+=1\r\n mid-=1\r\n right-=1\r\n mated+=2\r\n else:\r\n mid-=1\r\nprint(cnt+n-mated)", "n = int(input())\r\na = []\r\n\r\nfor i in range(n):\r\n a += [int(input())]\r\n\r\na.sort()\r\n\r\n\r\nj, cnt = n // 2, 0\r\nfor i in range(n // 2):\r\n while j < n:\r\n if a[i] * 2 <= a[j]:\r\n cnt += 1\r\n j += 1\r\n break\r\n else:\r\n j += 1\r\n\r\nprint(n - cnt)\r\n", "n = int(input())\r\narr= sorted([int(input()) for _ in range(n)])\r\n\r\nl = (n // 2) - 1\r\nr = n - 1\r\nres = 0\r\nwhile l >= 0 and r > n // 2 - 1:\r\n if arr[l] * 2 <= arr[r]:\r\n res += 1\r\n r -= 1\r\n l -= 1\r\nprint(n - res)", "\r\nimport sys\r\nn=int(input())\r\nsize = sorted(list(int(x) for x in sys.stdin))\r\nind=n//2\r\ni=0\r\nj=n//2\r\nhidden=0\r\nwhile i<ind and j<n:\r\n if 2*size[i]<=size[j]:\r\n hidden+=1\r\n i+=1\r\n j+=1\r\nprint(n-hidden)\r\n \r\n ", "import sys\r\ninput = sys.stdin.readline\r\na = int(input())\r\nz = []\r\nfor i in range(a):\r\n r = int(input())\r\n z.append(r)\r\nz.sort()\r\nl = 0\r\nr = a // 2\r\ncount = 0\r\nwhile (l < a // 2 and r < len(z)):\r\n if (z[l] * 2 <= z[r]):\r\n count += 1\r\n r += 1\r\n l += 1\r\n else:\r\n r += 1\r\nprint(len(z) - count)\r\n\r\n\r\n\r\n\r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn = int(input())\r\ns = []\r\nfor _ in range(n):\r\n size = int(input())\r\n s.append(size)\r\ns.sort()\r\n# print(*s)\r\nmid = n // 2 - 1\r\nl = 0\r\nr = n - 1\r\nwhile mid >= 0:\r\n if s[mid] * 2 <= s[r]:\r\n r -= 1\r\n l += 1\r\n mid -= 1\r\nprint(n - l)\r\n", "from sys import stdin, stdout\r\na = []\r\nn = int(stdin.readline())\r\nfor _ in range(n):\r\n a.append(int(stdin.readline()))\r\n\r\na.sort()\r\nj = n // 2\r\nans = n\r\nfor i in range(n//2):\r\n while j < n:\r\n if a[i] * 2 <= a[j]:\r\n ans -= 1\r\n j += 1\r\n break\r\n else:\r\n j += 1\r\n if j == n:\r\n break\r\n if j == n:\r\n break\r\n\r\nstdout.write(str(ans) + '\\n')", "def main():\n num = int(input())\n vec = []\n\n for i in range(num):\n zan = int(input())\n vec.append(zan)\n\n vec.sort()\n pt = num // 2\n ans = num\n\n for i in range(num // 2):\n while True:\n if vec[i] * 2 <= vec[pt]:\n ans -= 1\n pt += 1\n break\n else:\n pt += 1\n if pt == num:\n break\n if pt == num:\n break\n\n print(ans)\n\nif __name__ == \"__main__\":\n main()\n\n \t \t \t\t \t \t \t\t\t\t\t \t \t", "n = int(input())\r\nl = sorted([int(input()) for i in range(n)])\r\nt=n-1\r\ncnt=0\r\nfor i in range((n//2)- 1,-1,-1):\r\n if l[i]*2<=l[t]:\r\n cnt=cnt+1\r\n t=t-1\r\nprint(cnt+(n-2*cnt))\r\n\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\nmod = int(1e9)+7\r\n\r\n\r\nn = iinput()\r\na = []\r\n\r\nfor _ in range(n):\r\n\ta.append(iinput())\r\n\r\na.sort(reverse = True)\r\n# print(a)\r\ni = 0\r\nj = n//2\r\nans = n\r\nvis = [0 for _ in range(n)]\r\n\r\nwhile(i<n and j<n):\r\n\tif (a[i]>=2*a[j] and vis[i]==0 and vis[j]==0):\r\n\t\tans-=1\r\n\t\tvis[j] = 1\r\n\t\t# print(a[i], a[j])\r\n\t\ti+=1\r\n\t\tj+=1\r\n\t\tcontinue\r\n\t\r\n\tif (vis[i]==1):\r\n\t\ti+=1\r\n\telse:\r\n\t\tj+=1\r\n\r\nprint(ans)", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd,log\r\nfrom collections import deque\r\nfrom bisect import bisect_left,bisect_right\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\ta=int(input())\r\n\tl.append(a)\r\n# stack=deque()\r\nl.sort()\r\nj=n-1\r\ncount=0\r\ni=n//2-1\r\nwhile i>=0:\r\n\tif 2*l[i]<=l[j]:\r\n\t\tcount+=1\r\n\t\tj-=1\r\n\ti-=1\r\nprint(n-count)", "n = int(input())\r\n \r\nk = sorted([int(input()) for _ in range(n)])\r\n \r\nj = n-1\r\n \r\ncount = 0\r\n \r\nfor i in range((n//2) - 1,-1,-1):\r\n if k[i] * 2 <= k[j]:\r\n j-=1\r\n count += 1\r\nprint(n-count)", "n = int(input())\n\narr = [int(input()) for x in [0]*n]\narr.sort()\n \n \n \ntemp1=n-1\ntemp2=(n//2)-1\nres=n\n\nwhile temp1>=temp2+1 and temp2>=0:\n if arr[temp2]*2<=arr[temp1]:\n temp1-=1\n res-=1\n temp2-=1\nprint(res)\n\n \t \t \t \t\t \t\t \t \t\t\t\t\t\t \t\t\t", "from sys import stdin\r\ninput=stdin.readline\r\nn=int(input())\r\ns=[int(input()) for i in range(n)]\r\ns.sort()\r\nm=(n+1)//2\r\nx=n-m\r\nl=s[:m]\r\nr=s[m:]\r\ncnt=0\r\ni,j=0,0\r\nwhile i<m and j<x:\r\n if l[i]*2<=r[j]:\r\n cnt+=1\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(n-cnt)", "n = int(input())\nl = sorted([int(input()) for i in range(n)])\nans = n\nj = n-1\n\nfor i in range(n // 2-1, -1, -1):\n if(l[i] * 2 <= l[j]):\n j = j-1\n ans = ans - 1\n \nprint(ans)\n\n\t\t \t \t\t\t\t\t\t\t \t \t\t\t\t\t \t \t" ]

[ "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nimport time\r\nfrom collections import Counter,deque,defaultdict\r\nfrom functools import lru_cache,reduce\r\nfrom heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max\r\ndef _heappush_max(heap,item):\r\n heap.append(item)\r\n heapq._siftdown_max(heap, 0, len(heap)-1)\r\ndef _heappushpop_max(heap, item):\r\n if heap and item < heap[0]:\r\n item, heap[0] = heap[0], item\r\n heapq._siftup_max(heap, 0)\r\n return item\r\nfrom math import gcd as GCD\r\nread=sys.stdin.read\r\nreadline=sys.stdin.readline\r\nreadlines=sys.stdin.readlines\r\nwrite=sys.stdout.write\r\n\r\nN,K=map(int,readline().split())\r\nP=list(map(int,readline().split()))\r\nfor i in range(N):\r\n P[i]-=1\r\nseen=[False]*N\r\nS=[]\r\nfor i in range(N):\r\n if seen[i]:\r\n continue\r\n s=0\r\n while not seen[i]:\r\n seen[i]=True\r\n i=P[i]\r\n s+=1\r\n S.append(s)\r\nS.sort()\r\nma=min(N,min(K,sum(s//2 for s in S))+K)\r\ndp=1\r\nfor s,cnt in Counter(S).items():\r\n C=[]\r\n c=1\r\n while cnt:\r\n C.append(min(cnt,c))\r\n cnt-=min(cnt,c)\r\n c*=2\r\n for c in C:\r\n dp|=dp<<s*c\r\nif dp&1<<K:\r\n mi=K\r\nelse:\r\n mi=K+1\r\nprint(mi,ma)" ]

[ "k = int(input())\r\nn = input()\r\na = dict()\r\nans = 0\r\nfor i in range(10):\r\n a[i] = 0\r\nfor i in n:\r\n a[int(i)] += 1\r\n ans += int(i)\r\nx = 0\r\nfor i in range(10):\r\n while a[i] > 0 and ans < k:\r\n x += 1\r\n a[i] -= 1\r\n ans += 9 - i\r\nprint(x)\r\n", "k=int(input())\r\np=input()\r\nn=sorted(map(int,p))\r\ns=sum(n)\r\nif s>=k:\r\n\tprint(0)\r\nelse:\r\n\ti=0\r\n\twhile(s<k):\r\n\t\ts=s+9-n[i]\r\n\t\ti+=1\r\n\tprint(i)\r\n\t", "\r\n\r\nk = int(input())\r\ns = input()\r\nl = list(map(int,s))\r\n#l.sort()\r\nadd = sum(l)\r\n\r\nif(add >= k):\r\n\tprint(0)\r\nelse:\r\n\tl.sort()\r\n\tcount ,i=0,0\r\n\twhile( add < k):\r\n\t\tadd = add+9- l[i]\r\n\t\ti = i+1\r\n\t\tcount = count +1\r\n\tprint(count)\r\n", "s = int(input())\nt = list(map(int,list(input())))\nif sum(t)>=s:\n print(0)\nelse:\n d = s-sum(t)\n t.sort()\n for i in range(len(t)):\n d-=(9-t[i])\n if d<=0:\n print(i+1)\n exit()", "k=int(input())\r\nn=input()\r\nsum=0\r\nfor i in n:\r\n sum+=int(i)\r\ncnt=0\r\nn=sorted(n)\r\ni=0\r\nwhile(k>sum):\r\n if n[i]!='9':\r\n sum+=(9 - int(n[i]))\r\n cnt+=1\r\n i+=1\r\nprint(cnt)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk = int(input())\r\nn = list(input().rstrip())\r\nn = [i - 48 for i in n]\r\ns = sum(n)\r\nn.sort()\r\nans = 0\r\nfor i in n:\r\n if s >= k:\r\n break\r\n ans += 1\r\n s += 9 - i\r\nprint(ans)", "from collections import Counter\nimport math\n\n\nclass CodeforcesTask835BSolution:\n def __init__(self):\n self.result = ''\n self.k = 0\n self.n = 0\n\n def read_input(self):\n self.k = int(input())\n self.n = input()\n\n def process_task(self):\n digits = [int(x) for x in self.n]\n real_k = sum(digits)\n cnt = Counter(digits)\n if real_k >= self.k:\n self.result = \"0\"\n else:\n lvl = 0\n diff = 0\n while real_k < self.k:\n # print(lvl, self.k, real_k)\n df_lvl = 9 - lvl\n if cnt[lvl] * df_lvl >= self.k - real_k:\n diff += math.ceil((self.k - real_k) / df_lvl)\n real_k = self.k\n # print((self.k - real_k) / df_lvl, self.k, real_k)\n else:\n diff += cnt[lvl]\n real_k += cnt[lvl] * df_lvl\n lvl += 1\n self.result = str(diff)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask835BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "k=int(input())\nn=input()\ndig=[]\nfor x in n:\n\tdig.append(int(x))\ndig.sort()\ns=sum(dig)\ncount=0\nl=0\nwhile s<k:\n\t#print(dig)\n\t#print(s)\n\tcount+=1\n\ts+=9-dig[l]\n\tl+=1\nprint(count)\n\t \t\t\t\t\t \t\t \t \t \t\t\t\t\t\t\t \t\t \t\t", "import sys\n\n## ------------------------------------------------------ ##\n## IF MY CODE WORKS, IT WORKS. DON'T ASK ANYTHING FURTHER ##\n## ------------------------------------------------------ ##\n\n\n# -------------------------- I/O HELPER FUNCTIONS ------------\ndef input_int():\n return int(sys.stdin.readline())\n\ndef input_str():\n return sys.stdin.readline().rstrip()\n\ndef input_int_arr():\n return list(map(int, sys.stdin.readline().split()))\n\ndef input_char_arr():\n return sys.stdin.readline().rstrip().split()\n\ndef print_ln(arg):\n sys.stdout.write(str(arg) + '\\n')\n\ndef print_sp(arg):\n sys.stdout.write(str(arg) + ' ')\n\ndef print_only(arg):\n sys.stdout.write(str(arg))\n# -----------------------------------------------------\n\n\ndef solve():\n pass\n\n\n\n\ndef main():\n standard = input_int()\n s_lst = sorted(input_str())\n \n total = sum(int(digit) for digit in s_lst)\n\n ans = 0\n\n for digit in s_lst:\n if total >= standard:\n break\n\n total += (9 - int(digit))\n ans += 1\n\n\n print(ans)\n\n\nmain()\n \t \t \t\t\t \t\t \t \t\t\t \t \t \t", "k = int(input())\r\nstring = input()\r\nlst = []\r\nfor i in range(len(string)):\r\n x = ord(string[i]) - 48\r\n lst.append(x)\r\nlst.sort()\r\ns = 0\r\nfor i in string:\r\n x = ord(i) - 48\r\n s += x\r\nrs = 0\r\nfor i in lst:\r\n x = min(9 - i, k - s)\r\n if x <= 0:\r\n break\r\n s += x\r\n rs += 1\r\n\r\nprint(rs)\r\n", "k = int(input())\r\nn = int(input())\r\na = [int(i) for i in str(n)]\r\na.sort()\r\npas = 0\r\nc = sum(a)\r\nif sum(a) > k:\r\n exit(print(0))\r\nelse:\r\n i = 0\r\n while k > c:\r\n c += 9-a[i]\r\n i += 1\r\n pas += 1 \r\nprint(pas)", "k = int(input())\r\nl = sorted([int(i) for i in input()])\r\na, s = 0, sum(l)\r\nj = 0\r\nwhile s<k:\r\n s+=(9-l[j])\r\n a+=1\r\n j+=1\r\nprint(a)", "k = int(input())\r\nn = sorted(input())\r\nfor g in n:\r\n g = int(g)\r\n k -= g\r\ncnt = 0\r\nfor g in n:\r\n if k <= 0:\r\n continue\r\n k += int(g)\r\n k -= 9\r\n cnt += 1\r\nprint(cnt)\r\n \r\n \r\n\r\n", "k = int(input())\r\nst = input()\r\nn = [int(ch) for ch in st]\r\nn.sort()\r\n\r\nfor i in range(len(n)):\r\n k -= n[i]\r\n\r\nif k <= 0:\r\n print(0,end='')\r\nelse:\r\n for i in range(len(n)):\r\n k -= 9 - n[i]\r\n if k <= 0: break\r\n print(i+1,end='')", "n=int(input())\r\ns=input().rstrip()\r\nx=list(s)\r\nV=0;\r\nfor i in range(0,len(x)):\r\n V+=int(x[i])\r\nif V>=n:\r\n print(0)\r\nelse:\r\n x.sort(key=int)\r\n G=0;\r\n for i in range(0,len(x)):\r\n A=9-int(x[i])\r\n V+=A;\r\n G+=1;\r\n if V>=n:\r\n break;\r\n print(G)\r\n", "k=int(input());m=input();m=m.replace(\"\",\" \")\r\na=sorted(map(int,m.split()));l=sum(a)\r\nif l>=k:print(0)\r\nelse:\r\n x=0\r\n for i in a:\r\n if l>=k:break\r\n else:l+=9-i;x+=1\r\n print(x)", "#The number on the board\n\n\nk = int(input())\nn = list(map(int,input()))\nn.sort()\nc=0\nntot = sum (n)\nfor i in range(len(n)):\n if ntot < k:\n ntot += 9-n[i]\n c+=1\n else: \n break\nprint(c)\n\n\n\n", "def main(): \r\n k = int(input())\r\n s = input()\r\n L = []\r\n cnt = 0\r\n for i in s:\r\n L.append(int(i))\r\n cnt += int(i)\r\n if (cnt >= k):\r\n print(0)\r\n else:\r\n L.sort()\r\n res = 0\r\n for i in L:\r\n cnt -= i\r\n cnt += 9\r\n res += 1\r\n if (cnt >= k):\r\n print(res)\r\n break\r\n\r\nmain()", "#Ya Hassan Mojtaba\r\na=int(input())\r\nb=input()\r\nmy=[0,0,0,0,0,0,0,0,0,0]\r\nsum=ans=0\r\nfor i in b:\r\n sum+=int(i)\r\n my[int(i)]+=1\r\nfor i in range(10):\r\n if sum>=a:\r\n print(ans)\r\n break\r\n else:\r\n for j in range (my[i]):\r\n sum+=(9-i)\r\n ans+=1\r\n if sum>=a:\r\n break", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom itertools import combinations, permutations\r\n\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nk = ii()\r\narr = list(map(int, list(input())))\r\n\r\narr.sort()\r\nx = sum(arr)\r\nc = 0\r\nfor i in arr:\r\n if x >= k:\r\n break\r\n \r\n x += 9 - i\r\n c += 1\r\n \r\nprint(c)\r\n ", "import sys\r\nk=int(input())\r\nN=int(input())\r\n\r\nif sum([int(x) for x in str(N)])>=k:\r\n print(0)\r\n\r\nelse:\r\n L=list(map(int,list(str(N))))\r\n Sum=sum(L)\r\n L.sort()\r\n #print(L)\r\n x=len(L)\r\n for i in range(x):\r\n if 9-L[i]>=k-Sum:\r\n print(i+1)\r\n sys.exit(0)\r\n else:\r\n Sum+=(9-L[i])\r\n \r\n \r\n", "k = int(input())\r\nn = input()\r\n \r\ndigits = []\r\n \r\nfor c in n:\r\n digits.append(ord(c) - ord('0'))\r\n \r\ndigits.sort()\r\ncur = sum(digits)\r\nans = 0\r\n \r\nfor d in digits:\r\n if cur < k:\r\n cur += 9 - d\r\n ans += 1\r\n \r\nprint(ans)", "n=int(input())\r\n\r\n\r\nt=list(input())\r\n\r\n\r\n\r\ng=[int(i) for i in t]\r\n\r\np=sum(g)\r\ng.sort()\r\n\r\nif p >= n:\r\n print(0)\r\nelse:\r\n\r\n\r\n for k in range(len(g)):\r\n p= (p+9)-g[k]\r\n if p>=n:\r\n print(k+1)\r\n break\r\n", "k = int(input())\r\nn = list(map(int, list(input())))\r\nn.sort()\r\nch = sum(n)\r\n\r\ncount = 0\r\nwhile ch < k:\r\n ch += 9 - n[count]\r\n count += 1\r\nprint(count)", "k = int(input())\r\nn = int(input())\r\nt = 0\r\nfor i in str(n):\r\n t += int(i)\r\nif t >= k:\r\n print(0)\r\nelse:\r\n diff = k-t\r\n l = sorted(list(str(n)))\r\n ans = 0\r\n i = 0\r\n while diff > 0:\r\n p = int(l[i])\r\n diff -= 9-p\r\n ans += 1\r\n i += 1\r\n print(ans)\r\n", "k= int(input())\r\nn= input()\r\ns= 0\r\nfor i in n:\r\n s+= int(i)\r\nif s>= k:\r\n print(\"0\")\r\nelse:\r\n p= k- s\r\n l= sorted(n)\r\n c=0\r\n curr =0\r\n for i in range(len(l)):\r\n if curr>= p:\r\n break\r\n else:\r\n curr+= (9- int(l[i]))\r\n c+=1\r\n print(c)\r\n", "k=int(input())\r\nn=input()\r\nl=list(n)\r\nfor i in range(len(n)):\r\n l[i]=int(l[i])\r\nl.sort()\r\ns=sum(l)\r\n#print(*l)\r\na=0\r\nfor i in range(len(n)):\r\n if s<k:\r\n s+=9-l[i]\r\n a+=1\r\nprint(a)", "k=int(input())\nn=list(map(int,input().rstrip()))\ntot=sum(n)\nn.sort()\ncount=0\nif tot<k:\n for i in n:\n tot+=9-i\n count+=1\n if tot>=k:\n break\nprint(count)\n \t \t \t \t\t\t \t\t \t \t\t\t \t\t \t\t", "# B. The number on the board\r\nk=int(input())\r\nn=input()\r\nd=[]\r\nfor i in n:\r\n d.append(ord(i) - ord('0'))\r\nd.sort()\r\nsm=sum(d)\r\nans=0\r\nif sm>=k:\r\n print(0)\r\nelse:\r\n for j in d:\r\n if sm<k:\r\n sm+=9-j\r\n ans+=1\r\n print(ans)", "\r\ndef solve():\r\n k=int(input());n=input()\r\n n=sorted(list(map(int,n)))\r\n sm=sum(n);c=0\r\n for i in range(len(n)):\r\n if sm>=k:break\r\n sm+=9-n[i]\r\n c+=1\r\n print(c)\r\nsolve()", "k=int(input())\r\nn=input()\r\nN=sorted(n)\r\nfor i in N:\r\n k-=int(i)\r\nans=0\r\nfor i in N:\r\n if k<=0:\r\n break\r\n k+=(int(i)-9)\r\n ans+=1\r\nprint(ans)", "k=int(input())\r\nn=input()\r\nlst,summa=[],0\r\nfor i,x in enumerate(n):\r\n x=int(x)\r\n lst.append(x)\r\n summa+=x\r\ni=-1\r\nif summa<k:\r\n lst.sort()\r\n for i,x in enumerate(lst):\r\n summa+=(9-x)\r\n if summa>=k:break\r\nprint(i+1)", "def digisum(num):\r\n count = 0\r\n while num!='':\r\n count+=int(num[-1])\r\n num = num[:len(num)-1]\r\n return count\r\nk = int(input())\r\nn = input()\r\ntotal = digisum(n)\r\nif total>=k:\r\n print(0)\r\nelse:\r\n arr = list(map(str,n))\r\n arr.sort()\r\n arr = ''.join(str(x) for x in arr)\r\n diff = k-total\r\n ind = 0\r\n count = 0\r\n while diff>0:\r\n cur = 9-int(arr[ind])\r\n diff-=cur\r\n ind+=1\r\n count+=1\r\n print(count)\r\n\r\n\r\n", "k = int(input())\r\ns = input()\r\nsu=0\r\nhas=[0]*10\r\nfor i in s:\r\n su+=int(i)\r\n has[int(i)]+=1\r\nif su>=k:\r\n print(0)\r\nelse:\r\n i=0\r\n ans=0\r\n while i<10 and su<k:\r\n if has[i]==0:\r\n i+=1\r\n else:\r\n has[i]-=1\r\n su+=(9-i)\r\n ans+=1\r\n print(ans) \r\n", "k = int(input()) # 3\r\nn = input() # 11\r\ns = 0\r\nl = [0]*10\r\nfor i in n:\r\n t = int(i)\r\n s += t\r\n l[t] += 1\r\n \r\nif s < k: # S = 2, l = [0,2,0,0,0,0,0,0,0,0]\r\n t = 0\r\n flag = 1\r\n for i in range(10):\r\n if l[i] == 0:\r\n pass\r\n else:\r\n while l[i] and flag:\r\n l[i] -= 1\r\n s += 9-i\r\n t += 1\r\n if s >= k:\r\n print(t)\r\n flag = 0\r\nelse:\r\n print(0)", "k = int(input())\r\nn = input()\r\na = [int(i) for i in n]\r\na.sort()\r\ncnt = sum(a)\r\nif(k <= cnt):\r\n print(0)\r\n exit()\r\nfor i in range(len(a)):\r\n while(a[i] < 9):\r\n a[i] += 1\r\n cnt += 1\r\n if(cnt == k):\r\n print(i + 1)\r\n exit(0)\r\n", "k = int(input())\r\nn = input()\r\n\r\ntotal = 0\r\nfor i in range(len(n)):\r\n el = int(n[i])\r\n total += el\r\n \r\ndiff = total - k\r\nans = 0\r\nif diff < 0:\r\n n = sorted(n)\r\n \r\n for i in range(len(n)):\r\n if diff < 0:\r\n gain = 9-int(n[i])\r\n diff += gain\r\n ans += 1\r\n if diff >=0:\r\n break\r\nprint(ans)", "k = int(input())\r\nl = sorted([int(i) for i in input()])\r\nans, s = 0, sum(l)\r\ni = 0\r\nwhile s<k:\r\n s+=(9-l[i])\r\n ans+=1\r\n i+=1\r\nprint(ans)", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nk=int(input())\r\ns=str(input())\r\n \r\ndigits = []\r\n \r\nfor i in range(0,len(s),1):\r\n digits.append(int(s[i]))\r\ndigits.sort()\r\ncur = sum(digits)\r\nans = 0\r\n \r\nfor i in digits:\r\n if cur < k:\r\n cur += 9 - i\r\n ans += 1\r\n \r\nprint(ans)\r\n", "import math\r\n\r\nk = int(input())\r\nn = input()\r\nsum = 0\r\nv = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\r\nfor i in range(len(n)):\r\n d = int(n[i])\r\n sum += d\r\n v[d] += 1\r\nans = 0\r\nif sum < k:\r\n r = k - sum\r\n for i in range(9):\r\n c = min(int(math.ceil(r / (9 - i))), v[i])\r\n r = max(0, r - (9 - i) * c)\r\n ans += c\r\n if r == 0:\r\n break\r\nprint(ans)", "c = int(input())\r\nl = sorted(list(map(int,input())))\r\nx = 0\r\ns = sum(l)\r\nwhile s < c:\r\n s += 9-l[x]\r\n x += 1\r\nprint(x)", "k = int(input())\r\nn = input()\r\n \r\ns = sum(map(int,n))\r\n \r\na = 0\r\nfor i in sorted(n) :\r\n\tif s >= k :\r\n\t\tbreak\r\n\tif(s<k) :\r\n\t\ts = s - int(i) + 9\r\n\t\ta += 1\r\nprint(a)", "import math\ndef main():\n k=int(input())\n n=input()\n sum=0\n b=list(n)\n b.sort()\n for char in n:\n sum+=int(char)\n if sum>=k:\n print(0)\n else:\n x=abs(sum-k)\n count=0\n for elem in b:\n k=9-int(elem)\n x=x-k;\n count+=1\n if x<=0:\n break\n print(count)\nmain()\n", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input()))\r\nk=iinput()\r\nn=listinput()\r\nn.sort()\r\ni=0\r\ns=sum(n)\r\nwhile s<k:\r\n s+=9-n[i]\r\n i+=1\r\nprint(i)", "# / *\r\n#\r\n# / \\ | | / \\ | | | |\r\n# / __\\ | | / __\\ |--| | |\r\n# / \\ |__ | __ / \\ | | \\__ /\r\n#\r\n# __ __\r\n# / \\ | / | ) / \\ | )\r\n# / __\\ |< |-< / __\\ |-<\r\n# / \\ | \\ |__) / \\ | \\\r\n#\r\n# * /\r\ndef main():\r\n k, st = int(input()), input()\r\n s = []\r\n for i in st:\r\n s.append(i)\r\n sum = 0\r\n for i in s:\r\n sum += int(i)\r\n # print(\"Sum : \", sum)\r\n if sum >= k:\r\n print(0)\r\n else:\r\n diff = k - sum\r\n ans = 0\r\n s.sort()\r\n for i in range(len(s)):\r\n digit_limit = 9 - int(s[i])\r\n # print(\"diff\", diff, \" digit_limit\", digit_limit)\r\n if diff <= digit_limit:\r\n ans += 1\r\n print(ans)\r\n return\r\n else:\r\n ans += 1\r\n diff -= digit_limit\r\n # print(\"ans: \", ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "k = int(input())\r\nn = sorted(list(map(int, list(input()))))\r\n\r\ns = sum(n)\r\n\r\ncount = 0\r\ni = 0\r\nfor x in n:\r\n if s < k:\r\n s += 9 - x\r\n count += 1\r\n else:\r\n break\r\n\r\nprint(count)", "k = int(input())\r\nn = list(input())\r\ns = sum([int(i) for i in n]) \r\nn.sort()\r\nc = 0\r\ni = 0\r\nwhile(i < len(n) and s < k):\r\n s += 9 - int(n[i])\r\n i += 1\r\n c += 1 \r\nprint(i)", "n = int(input())\r\nA = list(map(int,list(input())))\r\ns = sum(A)\r\nif(s>=n):\r\n print(\"0\")\r\nelse:\r\n A.sort()\r\n x=0\r\n for i in range(len(A)):\r\n x+=1\r\n if(s-A[i]+9>=n):\r\n print(x)\r\n break\r\n s = s-A[i]+9\r\n else:\r\n print(\"-1\")\r\n ", "k = int(input())\r\ndigits = [ int(i) for i in input()]\r\ndigits.sort()\r\ncur = sum(digits)\r\nans = 0\r\nfor d in digits:\r\n if cur < k:\r\n cur += 9 - d\r\n ans += 1\r\nprint(ans)\r\n", "x=input(\"\")\r\nx=int(x)\r\ny=(input(\"\"))\r\nholder=[]\r\ncounter=0\r\nadd=0\r\nfor i in y:\r\n add+= int(i)\r\n holder.append(int(i))\r\nholder.sort()\r\nif add<x:\r\n while x>add:\r\n add+= 9-holder[counter]\r\n counter+=1\r\n \r\n print(counter)\r\nelse:\r\n print(0)\r\n\r\n", "k = int(input())\nn = list(map(int, input()))\nn.sort()\ndif = k - sum(n)\nans, i = 0, 0\nwhile dif > 0:\n ans += 9 - n[i]\n dif -= (9 - n[i])\n i += 1\nprint(i)\n", "from sys import stdin, stdout\r\n\r\n\r\ndef main():\r\n global io\r\n io = Stdio()\r\n\r\n k = io.read_int()\r\n tmp = io.read()\r\n\r\n n = [ord(tmp[i]) - ord('0') for i in range(len(tmp))]\r\n s = 0\r\n\r\n for i in range(len(n)):\r\n s += n[i]\r\n\r\n n.sort()\r\n ans = 0\r\n\r\n for i in range(len(n)):\r\n if s >= k:\r\n break\r\n s += 9 - n[i]\r\n ans += 1\r\n\r\n print(ans)\r\n\r\n\r\nclass Stdio:\r\n index = 0\r\n tokens = []\r\n\r\n def read_line(self):\r\n return stdin.readline()[:-1]\r\n\r\n def read(self):\r\n while (self.index >= len(self.tokens)):\r\n self.tokens = self.read_line().strip().split()\r\n num_empty_lines = 0\r\n if self.tokens == []:\r\n return None\r\n self.index = 0\r\n token = self.tokens[self.index]\r\n self.index += 1\r\n return token\r\n\r\n def read_int(self):\r\n return int(self.read())\r\n\r\n def read_float(self):\r\n return float(self.read())\r\n\r\n def read_char(self):\r\n return chr(self.read())\r\n\r\n def print(self, *objectsToPrint):\r\n for _obj_ in objectsToPrint:\r\n stdout.write(str(_obj_))\r\n\r\n def println(self, *objectsToPrint):\r\n for _obj_ in objectsToPrint:\r\n stdout.write(str(_obj_))\r\n stdout.write('\\n')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "k = int(input())\r\nn = [int(i) for i in input()]\r\n\r\ncs=0\r\nfor i in n:\r\n\tcs+=i\r\n\r\n\r\nn.sort()\r\nv = k-cs\r\nres = 0\r\nfor i in n:\r\n\tif v<=0:\r\n\t\tbreak\r\n\telse:\r\n\t\tv-=(9-i)\r\n\t\tres+=1\r\nprint(res)\r\n", "# import io\n# import os\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\nk = int(input())\n\na = tuple(map(int, tuple(input())))\n\nsum = 0\nfor num in a:\n sum += num\n\nif sum >= k:\n print(0)\nelse:\n b = sorted(a)\n ans = 0\n for num in b:\n sum += 9 - num\n ans += 1\n if sum >= k:\n print(ans)\n exit(0)\n\t\t\t\t\t \t\t\t\t\t\t \t\t\t \t \t \t", "k=int(input())\ns=input()\na=list()\nfor i in s:\n a.append(int(i))\na=sorted(a)\np=sum(a)\nj=0\nwhile(p<k):\n p=p+9-a[j]\n j=j+1\n #print(p,j)\nprint(j)\n \t\t\t \t \t\t\t \t \t \t\t \t\t\t", "k=int(input())\r\nn=int(input())\r\np=list(str(n))\r\np.sort()\r\nans=0\r\ntot=0\r\nfor ele in p:\r\n tot+=int(ele)\r\nfor ele in p:\r\n if tot<k:\r\n tot+=(9-int(ele))\r\n ans+=1\r\nprint(ans)", "'''import math\n\nclass Heap:\n\tdef __init__(self, A):\n\t\tself.heap = A\n\t\tself.size = len(A)\n\n\tdef parent(self, i):\n\t\treturn math.floor((i)/2)\n\tdef left_child(self, i):\n\t\treturn 2*i\n\tdef right_child(self, i):\n\t\treturn (2*i)+1\n\n\tdef max_heapify(self, i):\n\t\tl = self.left_child(i)\n\t\tr = self.right_child(i)\n\t\tlargest = i\n\t\tif l<self.size:\n\t\t\tif self.heap[i]< self.heap[l]:\n\t\t\t\tlargest = l\n\t\tif r<self.size:\n\t\t\tif self.heap[r]>self.heap[largest]:\n\t\t\t\tlargest = r\n\n\t\tif largest!= i:\n\t\t\ttemp = self.heap[i]\n\t\t\tself.heap[i] = self.heap[largest]\n\t\t\tself.heap[largest] = temp\n\t\t\tself.max_heapify(largest)\n\n\tdef build_max_heap(self):\n\t\tfor i in range(math.floor(self.size/2),0,-1):\n\t\t\tself.max_heapify(i)\n\n\tdef heapsort(self):\n\t\tself.build_max_heap()\n\t\tfor i in range(len(self.heap)-1, 1, -1):\n\t\t\ttemp = self.heap[1]\n\t\t\tself.heap[1] = self.heap[i]\n\t\t\tself.heap[i] = temp\n\t\t\tself.size-=1\n\t\t\tself.max_heapify(1)\n\n\n\nA = [0,16,4,10,14,7,9,3,2,8,1]\nheapcls = Heap(A)\nprint(heapcls.heap)\nheapcls.heapsort()\nprint(heapcls.heap)\n\n\nG = {0:[1],1:[2,3],2:[0],3:[2,4],4:[1]}\n\ndef bfs(G, source):\n\tcolour = ['white' for i in G]\n\tdist = [-1 for i in G]\n\tQ = []\n\tQ.append(source)\n\tdist[source] = 0\n\twhile Q!=[]:\n\t\ts = Q.pop(0)\n\t\tfor i in G[s]:\n\t\t\tif colour[i]=='white':\n\t\t\t\tcolour[i] = 'grey'\n\t\t\t\tdist[i] = dist[s]+1\n\t\t\t\tQ.append(i)\n\n\t\tcolour[s] = 'black'\n\treturn dist, colour\n\ndistance, colour = bfs(G, 0)\nprint(distance, colour)\n\nvisited = [False for i in G]\ndist = [0 for i in G]\ndef dfs(G, i):\n\tfor x in G[i]:\n\t\tif not visited[x]:\n\t\t\tvisited[x] = True\n\t\t\tdist[x]+= dist[i]+1\n\t\t\tdfs(G, x)\n\ndfs(G, 0)\nprint(dist, visited)\n\n\nn,m = map(int, input().split())\nar = [input() for i in range(n)]\nprs = []\nalone = []\npairs = 0\npitself = 0\nfor i in range(n):\n\tif(ar[i] == ar[i][::-1]):\n\t\talone.append(ar[i])\n\tfor j in range(i+1,n):\n\t\tif(ar[i] == ar[j][::-1]):\n\t\t\tprs.append((ar[i],ar[j]))\n\t\t\tpairs+=1\n\nalone = list(set(alone))\nfor i in alone:\n\tfor j in prs:\n\t\tif i == j[0]:\n\t\t\talone.remove(i)\nif(len(alone)):\n\tpitself=1\nprint((m*2*pairs)+(pitself*m))\nstring = ''\nfor i in prs:\n\tstring+=i[0]\nif(len(alone)):\n\tstring+=alone[0]\nfor i in prs[::-1]:\n\tstring+= i[1]\n\nprint(string)\n'''\nk = int(input())\nn = input()\n \ndigits = []\n \nfor c in n:\n digits.append(ord(c) - ord('0'))\n \ndigits.sort()\ncur = sum(digits)\nans = 0\n \nfor d in digits:\n if cur < k:\n cur += 9 - d\n ans += 1\n \nprint(ans)\n ", "def f(k,n):\r\n\tcs=sum(n)\r\n\ti=len(n)-1\r\n\tn=sorted(n)\r\n\tcnt=0\r\n\tfor i in n:\r\n\t\tif cs<k:\r\n\t\t\tcs-=i\r\n\t\t\tcs+=9\r\n\t\t\tcnt+=1\r\n\t\telse:\r\n\t\t\tbreak\r\n\treturn cnt\r\nk=int(input())\r\nn=list(input())\r\nn=list(map(int,n))\r\n\r\nprint(f(k,n))", "from bisect import bisect, bisect_left\r\n\r\n\r\nk=int(input())\r\ns=sorted(input())\r\nd=[]\r\nt=0\r\nc=0\r\nfor ch in s:\r\n c+=int(ch)\r\n t+=9-int(ch)\r\n d.append(t)\r\nif c>=k:\r\n print(0)\r\nelse :\r\n k-=c\r\n ind=bisect_left(d,k)\r\n print(ind+1)\r\n ", "k=int(input())\r\nn=int(input())\r\nl=len(str(n))\r\nli=list(str(n))\r\ns=0\r\nfor i in range(l):\r\n s=s+int(li[i])\r\nif s>=k:\r\n print(0)\r\nelse:\r\n c=0\r\n x=abs(s-k)\r\n li.sort()\r\n# print(li,s)\r\n for i in range(l):\r\n s=s-int(li[i])+9\r\n c+=1\r\n if s>=k:\r\n break\r\n print(c)\r\n", "\r\nk=int(input())\r\nn=input()\r\ndig=[]\r\nfor x in n:\r\n\tdig.append(int(x))\r\ndig.sort()\r\ns=sum(dig)\r\ncount=0\r\nl=0\r\nwhile s<k:\r\n\t#print(dig)\r\n\t#print(s)\r\n\tcount+=1\r\n\ts+=9-dig[l]\r\n\tl+=1\r\nprint(count)\r\n\t\t\t\t#unknown_2433", "k = int(input())\r\n\r\nn = int(input())\r\n\r\narr = list(map(int, list(str(n))))\r\n\r\nn = sum(arr)\r\n\r\ncnt = 0\r\n\r\narr.sort()\r\ni = 0\r\nans = 0\r\n\r\nif n > k:\r\n print(0)\r\nelse:\r\n while n < k:\r\n n += 9 - arr[i]\r\n ans += 1\r\n i += 1\r\n\r\n print(ans)", "k = int(input())\r\n\r\nx = [0] * 10\r\nfor c in input():\r\n c = int(c)\r\n k -= c\r\n x[c] += 1\r\nt = 0\r\ni = 0\r\nwhile k > 0 and i != 9:\r\n c = min(k // (9 - i) + (1 if k % (9 - i) != 0 else 0), x[i])\r\n k -= c * (9 - i)\r\n i += 1\r\n t += c\r\nprint(t)", "k, n = int(input()), input()\r\nsum_n = 0\r\nfor i in n:\r\n sum_n += int(i)\r\nif sum_n < k:\r\n nums = list(n)\r\n nums.sort()\r\n c = 0\r\n for i in nums:\r\n sum_n += 9 - int(i)\r\n c += 1\r\n if sum_n >= k:\r\n break\r\n print(c)\r\nelse:\r\n print(0)", "k=int(input())\r\nn=list(input())\r\ns=0\r\nfor j in range(len(n)):\r\n\ts=s+int(n[j])\r\nif(s>=k):\r\n\tprint(0)\r\nelse:\r\n\tn.sort()\r\n\tc=1\r\n\tfor j in range(len(n)):\r\n\t\tif((s+9-int(n[j]))<k):\r\n\t\t\ts=s+9-int(n[j])\r\n\t\t\tc=c+1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tprint(c)", "k=int(input())\r\nn=list(input())\r\ns=0\r\nfor i in n:\r\n s+=int(i)\r\nif(s>=k):\r\n print(0)\r\nelse:\r\n d=k-s\r\n n.sort()\r\n c=0\r\n for i in n:\r\n c+=1\r\n d=d-min(d,9-int(i))\r\n if(d==0):\r\n break\r\n print(c)", "k = int(input())\r\nn = input()\r\ndigits = [0] * 26\r\nsum = 0 \r\n\r\nfor char in n:\r\n x = ord(char) - ord('0')\r\n digits[x] += 1\r\n sum += x\r\n\r\nres = 0 \r\n\r\nfor i in range(9):\r\n if (sum < k):\r\n delta = k - sum\r\n if delta > digits[i] * (9 - i):\r\n increase = digits[i]\r\n else:\r\n increase = delta // (9 - i)\r\n if (delta % (9 - i) != 0):\r\n increase += 1\r\n\r\n sum += increase * (9 - i)\r\n res += increase\r\n #print(i, sum, res)\r\nprint(res)\r\n\r\n ", "k=int(input())\r\nn=input()\r\nd=list()\r\nfor i in n:\r\n d.append(ord(i)-ord('0'))\r\nd.sort()\r\ns=sum(d)\r\nc=0\r\nfor i in d:\r\n if(s<k):\r\n s+=9-i\r\n c+=1\r\nprint(c)", "s=int(input())\r\nl=list(input())\r\nc=0\r\nfor i in l:\r\n\tc+=int(i)\r\nif c>=s:\r\n\tprint(0)\r\nelse:\r\n\ts=s-c\r\n\tc=0\r\n\tl.sort()\r\n\tfor i in l:\r\n\t\ts-=(9-int(i))\r\n\t\tc+=1\r\n\t\tif s<=0:\r\n\t\t\tprint(c)\r\n\t\t\tbreak", "k = int(input())\r\n\r\nn = int(input())\r\n\r\ndigits = [int(z) for z in str(n)]\r\n\r\ndigits.sort()\r\n\r\nif sum(digits) < k:\r\n rc = sum(digits); p1 = 0\r\n while rc < k:\r\n rc += (10 - digits[p1] - 1)\r\n p1 += 1\r\n print(p1)\r\nelse:\r\n print(0)\r\n\r\n", "def handle(a, k):\r\n\ta.sort()\r\n\tcnt = 0\r\n\ttmp = sum(a)\r\n\tif(tmp >= k ):\r\n\t\treturn 0\r\n\t\t\r\n\tfor item in a:\r\n\t\tif(tmp >= k):\r\n\t\t\t\r\n\t\t\treturn cnt\r\n\t\telse:\r\n\t\t\tcnt += 1\r\n\t\t\ttmp = tmp - item + 9\r\n\treturn cnt\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tk = int(input())\r\n\tn = input()\r\n\ta = list(map(int, n))\r\n# \tprint(a)\r\n\tans = handle(a, k)\r\n\tprint(ans)", "k=int(input())\r\nd=list(map(int,list(input())))\r\nd.sort()\r\nl=sum(d)\r\ni=0\r\nwhile l<k:\r\n l+=9-d[i]\r\n i+=1\r\nprint(i)\r\n", "import copy\r\n\r\nk = int(input())\r\nn = input()\r\na = []\r\n\r\nres = 0\r\nfor i in n:\r\n res += ord(i) - ord('0')\r\n a.append(ord(i) - ord('0'))\r\nif res > k:\r\n print(0)\r\nelse:\r\n ans = 0\r\n\r\n a.sort()\r\n\r\n cnt = 0\r\n l = 0\r\n while res < k :\r\n res += 9 - a[l]\r\n l += 1\r\n \r\n print(l)", "#The number on the board\n\n\nk = int(input())\nn = list(map(int,input()))\nn.sort()\nc=0\nntot = sum (n)\nif ntot >= k:\n pass\nelse:\n for i in range(len(n)):\n ntot += 9-n[i]\n c+=1\n if ntot >= k :\n break\n if i == len(n)-1:\n c = 0\nprint(c)\n\n\n\n", "K = int(input())\r\n\r\nx = [0] * 10\r\nfor i in input():\r\n i = int(i)\r\n K -= i\r\n x[i] += 1\r\nt = 0\r\nit = 0\r\nwhile K > 0 and it != 9:\r\n i = min(K // (9 - it) + (1 if K % (9 - it) != 0 else 0), x[it])\r\n K -= i * (9 - it)\r\n it += 1\r\n t += i\r\nprint(t)", "k = int(input())\r\ns = input()\r\ndigits = []\r\nfor c in s:\r\n digits.append(ord(c) - ord('0'))\r\ndigits.sort()\r\ncurrent, result = sum(digits), 0\r\nfor d in digits:\r\n if current < k:\r\n current += 9 - d\r\n result += 1\r\nprint(result)\r\n\r\n", "k = int(input())\r\nn = list(input())\r\nn.sort()\r\nsum=0\r\nfor i in n:\r\n sum+=int(i)\r\nm=0\r\nif k>sum:\r\n j=0\r\n while sum<k:\r\n sum+=9-int(n[j])\r\n j+=1\r\n m+=1\r\nprint(m)", "k = int(input())\r\nn = int(input())\r\n\r\nl = [int(i) for i in str(n)]\r\ns = sum(l)\r\n\r\nif k <= s:\r\n\tprint(0)\r\nelse:\r\n\tl.sort()\r\n\tp = k - s\r\n\tj = 0\r\n\twhile j < len(l) and p > 0:\r\n\t\tp -= 9 - l[j]\r\n\t\tj += 1\r\n\t\r\n\tprint(j)", "k=int(input())\r\nn=input()\r\nc=0\r\nfor i in n:\r\n c+=int(i)\r\nif c>=k:\r\n print(0)\r\nelse:\r\n n=sorted(n)\r\n c1=0\r\n for i in n:\r\n c+=(9-int(i))\r\n c1+=1\r\n if c>=k:\r\n break\r\n print(c1)", "k=int(input())\r\nn=sorted(list(map(int,input())))\r\ns=sum(n)\r\nif s >= k:\r\n print(0)\r\nelse:\r\n c=0\r\n ch=k-s\r\n for i in range(len(n)):\r\n diff=9-n[i]\r\n ch-=diff\r\n c+=1\r\n if ch<=0:\r\n break\r\n print(c)\r\n \r\n\r\n\r\n", "# RawCoder : https://bit.ly/RCyouTube\r\n# Author : MehulYK\r\n\r\nk = int(input())\r\nn = int(input())\r\ns = list(str(n))\r\nn = str(n)\r\ndig = []\r\nfor c in n:\r\n dig.append(ord(c) - ord('0'))\r\n \r\ndig.sort()\r\nsu = sum(dig) \r\nif(k < su):print(0)\r\nelse:\r\n \r\n s.sort()\r\n #print(s)\r\n ch = k - su\r\n mnt = 0\r\n i = 0\r\n while(ch > 0):\r\n ch -= (9 - int(s[i]))\r\n mnt += 1\r\n i += 1\r\n print(mnt) \r\n ", "from math import ceil\r\nk = int(input())\r\nn = input()\r\nsm = 0; cnt = 0\r\nl = [0]*10\r\nfor i in n:\r\n l[int(i)] += 1 \r\nfor i in range(10):\r\n sm += l[i]*i\r\nif sm >= k:\r\n print(0)\r\n exit()\r\nfor i in range(10):\r\n for j in range(l[i]):\r\n if sm < k:\r\n cnt += 1\r\n sm += 9-i\r\nprint(cnt)\r\n\r\n \r\n", "k = int(input())\nn = int(input())\ncheck = k - sum(int(i) for i in str(n))\nif check <= 0:\n print(0)\nelse:\n count = 0\n main = sorted([int(i) for i in str(n)])\n for i in range(len(main)):\n if main[i] + check > 9:\n check -= 9 - main[i]\n count += 1\n else:\n if check > 0:\n count += 1\n break\n\n \n print(count)\n \n \n \n", "k=int(input())\r\nn=list(map(int,input().rstrip()))\r\ntot=sum(n)\r\nn.sort()\r\ncount=0\r\nif tot<k:\r\n for i in n:\r\n tot+=9-i\r\n count+=1\r\n if tot>=k:\r\n break\r\nprint(count)", "k=int(input())\r\nn=sorted(map(int,input()))\r\ni=0\r\ns=sum(n)\r\n\r\nwhile(s<k):\r\n s+=(9-n[i])\r\n i+=1\r\nprint(i)", "k=int(input())\r\ns=input()\r\nl=[]\r\nss=0\r\nfor i in s:\r\n l.append(i)\r\n ss+=(ord(i)-ord('0'))\r\nl.sort()\r\ncnt=0\r\nwhile(cnt<len(l) and ss<k):\r\n ss+=(ord('9')-ord(l[cnt]))\r\n cnt+=1\r\nprint(cnt)" ]

[ "# [https://codeforces.com/contest/633/submission/33363209]\r\n\r\nn = int(input())\r\nt = input()[::-1]\r\nm = int(input())\r\nd = {q.lower(): q for q in [input() for i in range(m)]}\r\nk = 0\r\ns = []\r\nl = sorted(set(map(len, d)))\r\nwhile n:\r\n k -= 1\r\n if len(l) + k < 0: k, n = s.pop()\r\n elif n >= l[k] and t[n - l[k]:n] in d:\r\n s.append((k, n))\r\n n -= l[k]\r\n k = 0\r\nprint(*[d[t[n - l[i]:n]] for i, n in s])", "import sys\r\np=sys.stdin.read().split()\r\nn,t=int(p[0]),p[1][::-1]\r\nd={q.lower(): q for q in p[3:]}\r\nk,s=0,[]\r\nl=sorted(set(map(len,d)))\r\nwhile n:\r\n k-=1\r\n if len(l)+k<0: k,n=s.pop()\r\n elif n>=l[k] and t[n-l[k]:n] in d:\r\n s.append((k,n))\r\n n-=l[k]\r\n k=0\r\nprint(*[d[t[n-l[i]:n]] for i,n in s])" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,a,b = map(int, input().split())\r\n\r\ndef deal(x1,y1,x2,y2):\r\n ans = []\r\n x = x1+x2\r\n y = max(y1,y2)\r\n ans.append((x,y))\r\n \r\n x = max(x1,x2)\r\n y = y1+y2\r\n ans.append((x,y))\r\n \r\n return ans\r\n\r\ndef check(x1,y1,x2,y2):\r\n for x,y in deal(x1,y1,x2,y2):\r\n if x<=a and y<=b:\r\n return True\r\n if x<=b and y<=a:\r\n return True\r\n \r\n for x,y in deal(y1,x1,x2,y2):\r\n if x<=a and y<=b:\r\n return True\r\n if x<=b and y<=a:\r\n return True\r\n \r\n return False\r\n\r\nA = []\r\nfor _ in range(N):\r\n x,y = map(int, input().split())\r\n A.append((x,y))\r\n \r\nans = 0\r\nfor i,(x1,y1) in enumerate(A):\r\n for j,(x2,y2) in enumerate(A):\r\n if i==j:continue\r\n if check(x1,y1,x2,y2):\r\n ans = max(ans, x1*y1+x2*y2)\r\n \r\nprint(ans)\r\n ", "n, A, B = map(int, input().split())\nl = []\nfor i in range(n):\n x, y = map(int, input().split())\n l.append((x, y))\n\ndef checkList(a, b):\n return (a <= A and b <= B) or (b <= A and a <= B)\n\ndef checkPear(ax, ay, bx, by):\n return (checkList(ax + bx, max(ay, by)) or\n checkList(ax + by, max(ay, bx)) or\n checkList(ay + by, max(ax, bx)) or\n checkList(ay + bx, max(ax, by))\n )\nmaxs = 0\n\nfor i in range(n-1):\n for j in range(i+1, n):\n if checkPear(*l[i],*l[j]):\n if l[i][0]*l[i][1] + l[j][0]*l[j][1] > maxs:\n maxs = l[i][0]*l[i][1] + l[j][0]*l[j][1]\n\nprint(maxs)", "f = lambda: map(int, input().split())\r\n\r\nn, a, b = f()\r\nc = a + b\r\n\r\ns, t = 0, [list(f()) for i in range(n)]\r\nh = [(i, j, d) for i in [0, 1] for j in [0, 1] for d in [a, b]]\r\n\r\nfor k, u in enumerate(t, 1):\r\n for v in t[k:]:\r\n if not all(u[i] + v[j] > d or max(u[1 - i], v[1 - j]) > c - d for i, j, d in h):\r\n s = max(s, u[0] * u[1] + v[0] * v[1])\r\n\r\nprint(s)", "def valid(x1,x2,y1,y2):\r\n if x1+x2<=X and max(y1,y2)<=Y:\r\n return True\r\n if max(x1,x2)<=X and y1+y2<=Y:\r\n return True\r\n return False\r\n \r\nn,X,Y = map(int,input().split())\r\nlis=[]\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n lis.append([x,y])\r\nans=0 \r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n a,b = lis[i]\r\n c,d = lis[j]\r\n if valid(a,c,b,d) or valid(a,d,b,c) or valid(b,d,a,c) or valid(b,c,a,d):\r\n ans=max(a*b+c*d,ans)\r\n# print(ans)\r\nprint(ans) \r\n\r\n", "import sys\r\nn, a, b = map(int, input().split())\r\np = []\r\nfor i in range(n):\r\n p.append(list(map(int, input().split())))\r\nsMax = 0\r\nfor i in range(n-1):\r\n j = i+1\r\n while j < n:\r\n l = []\r\n nSq = p[i][0]*p[i][1]+p[j][0]*p[j][1]\r\n \r\n s1, s2 = p[i][0]+p[j][0], max(p[i][1],p[j][1])\r\n if max(s1,s2) <= max(a,b) and min(s1,s2) <= min(a,b):\r\n sMax = max(sMax,nSq)\r\n \r\n s1, s2 = p[i][0]+p[j][1], max(p[i][1],p[j][0])\r\n if max(s1,s2) <= max(a,b) and min(s1,s2) <= min(a,b):\r\n sMax = max(sMax,nSq)\r\n \r\n s1, s2 = p[i][1]+p[j][0], max(p[i][0],p[j][1])\r\n if max(s1,s2) <= max(a,b) and min(s1,s2) <= min(a,b):\r\n sMax = max(sMax,nSq)\r\n \r\n s1, s2 = p[i][1]+p[j][1], max(p[i][0],p[j][0])\r\n if max(s1,s2) <= max(a,b) and min(s1,s2) <= min(a,b):\r\n sMax = max(sMax,nSq)\r\n j += 1\r\nprint(sMax)\r\n", "def coExist(s1, s2, a, b):\n if s1[0] > a or s1[1] > b or s2[0] > a or s2[1] > b:\n return False\n if s1[0] + s2[0] <= a and s2[1] <= b:\n return True\n if s1[1] + s2[1] <= b and s2[0] <= a:\n return True\n\nif __name__ == '__main__':\n n, a, b = [int(x) for x in input().split()]\n seals = []\n for i in range(n):\n x, y = [int(z) for z in input().split()]\n seals.append((x, y))\n\n mxAr = 0\n\n for i in range(n):\n seal = (seals[i][0], seals[i][1])\n for j in range(i+1, n):\n if coExist(seal, (seals[j][0], seals[j][1]), a, b):\n mxAr = max(mxAr, seal[0]*seal[1] + seals[j][0]*seals[j][1])\n if coExist(seal, (seals[j][1], seals[j][0]), a, b):\n mxAr = max(mxAr, seal[0]*seal[1] + seals[j][0]*seals[j][1])\n\n seal = (seals[i][1], seals[i][0])\n for j in range(i+1, n):\n if coExist(seal, (seals[j][0], seals[j][1]), a, b):\n mxAr = max(mxAr, seal[0]*seal[1] + seals[j][0]*seals[j][1])\n if coExist(seal, (seals[j][1], seals[j][0]), a, b):\n mxAr = max(mxAr, seal[0]*seal[1] + seals[j][0]*seals[j][1])\n print(mxAr)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, a, b = map(int, input().split())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nc = 0\r\nfor i in range(n):\r\n x, y = g[i]\r\n c1 = x+y\r\n for j in range(i+1, n):\r\n x1, y1 = g[j]\r\n c2 = x1 + y1\r\n for q in [x, y]:\r\n for w in [x1, y1]:\r\n q1 = c1 - q\r\n w1 = c2 - w\r\n if q > a or q1 > b or w > a or w1 > b:\r\n continue\r\n else:\r\n if q + w > a and q1 + w1 > b:\r\n continue\r\n else:\r\n c = max(c, q*q1 + w*w1)\r\nprint(c)", "import sys\r\n#import random\r\nfrom bisect import bisect_left as lb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**8)\r\nfrom queue import PriorityQueue as pq\r\nfrom math import *\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\ninv =lambda x:pow(x,mod-2,mod)\r\nmod = 10**9 + 7\r\n\r\ndef cal(x1,y1,x2,y2,a,b):\r\n return x1+x2<=a and max(y1,y2)<=b\r\n\r\n\r\nn,a,b = il()\r\n\r\npt = []\r\n\r\nfor i in range (n) :\r\n pt.append(il())\r\n\r\nans = -float('inf')\r\n\r\nfor i in range (n) :\r\n for j in range (i+1,n) :\r\n a1 = pt[i][0]*pt[i][1]\r\n a2 = pt[j][0]*pt[j][1]\r\n\r\n for p1 in range(2):\r\n for p2 in range(2):\r\n if cal(pt[i][p1],pt[i][1-p1],pt[j][p2],pt[j][1-p2],a,b) or cal(pt[i][p1],pt[i][1-p1],pt[j][p2],pt[j][1-p2],b,a):\r\n ans = max( ans , a1+a2 )\r\n\r\n \r\nif (ans == -float('inf')) :\r\n ans = 0\r\nprint(ans)\r\n \r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Aug 7 23:58:26 2017\n\n@author: root\n\"\"\"\n# question: http://codeforces.com/contest/837/problem/C\n\ndef compatible(arr1, arr2, a, b):\n # l, m, n, o,\n l = arr1[0]\n m = arr1[1]\n n = arr2[0]\n o = arr2[1]\n # (2, 3) (9, 11)\n\n as_it_is = l + n <= a and m <= b and o <= b or m + o <= b and l <= a \\\n and n <= a\n # rotate first\n l = arr1[1]\n m = arr1[0] # (3, 2), (9, 11)\n rot_first = l + n <= a and m <= b and o <= b or m + o <= b and l <= a \\\n and n <= a\n #rotate second\n l = arr1[0]\n m = arr1[1]\n n = arr2[1]\n o = arr2[0] # \n rot_sec = l + n <= a and m <= b and o <= b or m + o <= b and l <= a \\\n and n <= a\n # rotate both\n l = arr1[1]\n m = arr1[0]\n n = arr2[1]\n o = arr2[0]\n rot_both = l + n <= a and m <= b and o <= b or m + o <= b and l <= a \\\n and n <= a\n \n return as_it_is or rot_first or rot_sec or rot_both\n\ndef main():\n n, a, b = [int(num) for num in input().split(\" \")]\n rects = []\n for i in range(n):\n x, y = [int(num) for num in input().split(\" \")]\n rects.append([x, y])\n \n inds = []\n for i in range(0, len(rects)):\n inds.append([rects[i][0]*rects[i][1]+rects[j][0]*rects[j][1]\n for j in range(i+1, len(rects)) if compatible(rects[i], rects[j],a,b)])\n \n # print(\"Inds: \", inds)\n m = 0\n for ind in inds:\n for more in ind:\n if more > m:\n m = more\n \n print(m)\n \nif __name__ == \"__main__\":\n main()\n\n#==============================================================================\n# \n# a <= a1 and b <= b1 or a <= b1 and b <= a1\n# a' <= a1 and b' <= b1 or a' <= b1 and b' <= a1\n# \n# \n# \n# # both compatible as they are\n# as_it_is = a+a'<=a1 and b<=b1 and b'<=b1 or b+b'<=b1 and a<=a1 and a'<=a1\n# rot_first = b+a'<=a1 and a<=b1 and b'<=b1\n# rot_sec = a+b'<=a1 and b<=b1 and a'<=b1\n# rot_both = b+b'***sth out of nothing (ignore)*** <=a1 and a<=b1 and a'<=b1\n# \n#==============================================================================", "n, a, b = map(int, input().split())\r\nl = [[int(j) for j in input().split()] for i in range(n)]\r\nms = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if l[i][0] + l[j][0] <= a and max(l[i][1], l[j][1]) <= b:\r\n ms = max(ms, l[i][0] * l[i][1] + l[j][0] * l[j][1])\r\n if l[i][1] + l[j][1] <= a and max(l[i][0], l[j][0]) <= b:\r\n ms = max(ms, l[i][0] * l[i][1] + l[j][0] * l[j][1])\r\n if l[i][0] + l[j][1] <= a and max(l[i][1], l[j][0]) <= b:\r\n ms = max(ms, l[i][0] * l[i][1] + l[j][0] * l[j][1])\r\n if l[i][1] + l[j][0] <= a and max(l[i][0], l[j][1]) <= b:\r\n ms = max(ms, l[i][0] * l[i][1] + l[j][0] * l[j][1])\r\n if l[i][0] + l[j][0] <= b and max(l[i][1], l[j][1]) <= a:\r\n ms = max(ms, l[i][0] * l[i][1] + l[j][0] * l[j][1])\r\n if l[i][1] + l[j][1] <= b and max(l[i][0], l[j][0]) <= a:\r\n ms = max(ms, l[i][0] * l[i][1] + l[j][0] * l[j][1])\r\n if l[i][0] + l[j][1] <= b and max(l[i][1], l[j][0]) <= a:\r\n ms = max(ms, l[i][0] * l[i][1] + l[j][0] * l[j][1])\r\n if l[i][1] + l[j][0] <= b and max(l[i][0], l[j][1]) <= a:\r\n ms = max(ms, l[i][0] * l[i][1] + l[j][0] * l[j][1])\r\nprint(ms)", "def cal(x1,y1,x2,y2,a,b):\r\n\treturn x1+x2<=a and max(y1,y2)<=b\r\nn , a , b = map( int , input().split() )\r\nxy = []\r\nfor i in range(n):\r\n\tx , y = map( int , input().split() )\r\n\txy.append((x,y))\r\nans = 0\r\nfor i in range(n):\r\n\tfor j in range(i+1,n):\r\n\t\tfor p1 in range(2):\r\n\t\t\tfor p2 in range(2):\r\n\t\t\t\tif cal(xy[i][p1],xy[i][1-p1],xy[j][p2],xy[j][1-p2],a,b) or cal(xy[i][p1],xy[i][1-p1],xy[j][p2],xy[j][1-p2],b,a):\r\n\t\t\t\t\tans = max( ans , xy[i][0]*xy[i][1] + xy[j][0]*xy[j][1] )\r\nprint(ans)\t", "ans=[0]\r\ndef an(x1,y1,x2,y2):\r\n if( x1+x2 <=a and max(y1,y2)<=b ) or (y1+y2<=b and max(x1,x2)<=a ):\r\n \r\n ans.append(x1*y1 + x2*y2) \r\n \r\n \r\nn,a,b = map(int,input().split()) \r\narr =[]\r\n\r\nfor i in range(n):\r\n x,y = map(int,input().split()) \r\n arr.append([x,y]) \r\n\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n x1,y1,x2,y2 = arr[i][0] , arr[i][1] ,arr[j][0] , arr[j][1]\r\n \r\n an(x1,y1,x2,y2)\r\n an(y1,x1,x2,y2)\r\n an(x1,y1 ,y2,x2)\r\n an(y1,x1,y2,x2)\r\nprint(max(ans))\r\n \r\n \r\n \r\n", "def check(l):\n global a, b, s, ans\n if min(l) <= min(a, b) and max(l) <= max(a, b):\n ans = max(ans, s)\n\n\nans = 0\nx = []\ny = []\nn, a, b = map(int, input().split())\nfor _ in range(n):\n xi, yi = map(int, input().split())\n x.append(xi)\n y.append(yi)\n\nans = 0\nfor i in range(n - 1):\n for j in range(i + 1, n):\n s = x[i] * y[i] + x[j] * y[j]\n check([max(x[i], x[j]), y[i] + y[j]])\n check([max(x[i], y[j]), y[i] + x[j]])\n check([max(y[i], x[j]), x[i] + y[j]])\n check([max(y[i], y[j]), x[i] + x[j]])\n check([x[i] + x[j], y[i] + y[j]])\n check([x[i] + y[j], y[i] + x[j]])\n\nprint(ans)\n", "n, a, b = map(int, input().split())\r\nl=[]\r\n\r\ndef find(x1,y1,x2,y2,a,b):\r\n t = x1*y1+x2*y2\r\n if (x1+x2 <= a and y1 <= b and y2 <= b) or (y1+y2 <= b and x1 <= a and x2 <= a):\r\n return t\r\n else: return 0\r\n\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\n\r\nans=0\r\nfor i in range(n-1):\r\n for j in range(i+1, n):\r\n first, second = l[i], l[j]\r\n curans1 = find(first[0], first[1], second[0], second[1], a, b)\r\n curans2 = find(first[1], first[0], second[0], second[1], a, b)\r\n curans3 = find(first[0], first[1], second[1], second[0], a, b)\r\n curans4 = find(first[1], first[0], second[1], second[0], a, b)\r\n cur = max(curans1, curans2, curans3, curans4)\r\n if cur > ans: ans = cur\r\n\r\nprint(ans)", "import sys, math\r\ninput=sys.stdin.readline\r\nfrom itertools import permutations\r\nINF=int(1e9)+7\r\n\r\n\r\ndef solve():\r\n n,a,b=map(int,input().split())\r\n data=[list(map(int,input().split())) for _ in range(n)]\r\n def can(c,d,a,b):\r\n if max(c[0],d[0])<=a and c[1]+d[1]<=b: return True\r\n if max(c[0],d[1])<=a and c[1]+d[0]<=b: return True\r\n if max(c[1],d[0])<=a and c[0]+d[1]<=b: return True\r\n if max(c[1],d[1])<=a and c[0]+d[0]<=b: return True\r\n return False\r\n ans=0\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n if can(data[i],data[j],a,b) or can(data[i],data[j],b,a):\r\n ans=max(data[i][0]*data[i][1]+data[j][0]*data[j][1],ans)\r\n print(ans)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "n,w,h=map(int,input().split())\r\n\r\ndef chk(w1,h1,w2,h2):\r\n if w1<=w and h1<=h:\r\n if w-w1>=w2 and h>=h2 or w-w1>=h2 and h>=w2 or w>=w2 and h-h1>=h2 or w>=h2 and h-h1>=w2:\r\n return True\r\n if h1<=w and w1<=h:\r\n if w-h1>=w2 and h>=h2 or w-h1>=h2 and h>=w2 or w>=w2 and h-w1>=h2 or w>=h2 and h-w1>=w2:\r\n return True\r\n return False\r\n \r\n\r\n\r\na,ans=[],0\r\nfor i in range(n):\r\n x,y=map(int, input().split())\r\n a.append([x,y])\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[i][0]*a[i][1]+a[j][1]*a[j][0]>ans and chk(a[i][0],a[i][1],a[j][0],a[j][1]):\r\n ans=a[i][0]*a[i][1]+a[j][1]*a[j][0]\r\nprint(ans)\r\n", "n, width, height = map(int, input().split())\nstamp = []\nmax_s = 0\n\n\ndef set_stamp(stamp_1_width, stamp_1_height, stamp_2_width, stamp_2_height):\n global max_s\n s = stamp_1_width * stamp_1_height + stamp_2_width * stamp_2_height\n\n if stamp_1_height + stamp_2_height > height and stamp_1_width + stamp_2_width > width:\n return\n\n if stamp_1_width + stamp_2_width <= width:\n if stamp_1_height > height or stamp_2_height > height:\n return\n\n if stamp_1_height + stamp_2_height <= height:\n if stamp_1_width > width or stamp_2_width > width:\n return\n\n if s > max_s:\n max_s = s\n\n\nfor i in range(n):\n w, h = map(int, input().split())\n stamp.append((w, h))\n\nfor it_first_stamp in range(n):\n for it_second_stamp in range(n):\n if it_second_stamp != it_first_stamp:\n set_stamp(stamp[it_first_stamp][0], stamp[it_first_stamp][1],\n stamp[it_second_stamp][0], stamp[it_second_stamp][1])\n\n set_stamp(stamp[it_first_stamp][0], stamp[it_first_stamp][1],\n stamp[it_second_stamp][1], stamp[it_second_stamp][0])\n\n set_stamp(stamp[it_first_stamp][1], stamp[it_first_stamp][0],\n stamp[it_second_stamp][0], stamp[it_second_stamp][1])\n\n set_stamp(stamp[it_first_stamp][1], stamp[it_first_stamp][0],\n stamp[it_second_stamp][1], stamp[it_second_stamp][0])\n\nprint(max_s)\n", "n,a,b=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n l+=[(x,y)]\r\ndef checker(x1,y1,x2,y2):\r\n if (x1+x2<=a and max(y1,y2)<=b) or (y1+y2<=b and max(x1,x2)<=a):\r\n return x1*y1+x2*y2\r\n return 0\r\nans=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j:\r\n x,y=l[i]\r\n u,v=l[j]\r\n ans=max(ans,checker(x,y,u,v),checker(x,y,v,u),checker(y,x,u,v),checker(y,x,v,u))\r\nprint(ans)", "\r\nn,a,b = list(map(int, input().strip().split()))\r\ncoo = []\r\nfor i in range(n):\r\n x, y = list(map(int, input().strip().split()))\r\n coo.append((x,y))\r\n\r\nm = 0\r\n\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n (x1,y1) = coo[i]\r\n (x2,y2) = coo[j]\r\n flag = False\r\n c = max(x1,x2)\r\n d = y1+y2\r\n if min(c,d)<=min(a,b) and max(c,d) <= max(a,b):\r\n flag = True\r\n c = max(x1,y2)\r\n d = y1+x2\r\n if min(c,d)<=min(a,b) and max(c,d) <= max(a,b):\r\n flag = True\r\n c = max(x2,y1)\r\n d = x1+y2\r\n if min(c,d)<=min(a,b) and max(c,d) <= max(a,b):\r\n flag = True\r\n c = max(y1,y2)\r\n d = x1+x2\r\n if min(c,d)<=min(a,b) and max(c,d) <= max(a,b):\r\n flag = True\r\n if flag:\r\n m = max(m, x1*y1+x2*y2)\r\nprint(m)", "k, n, m = map(int,input().split())\r\nx, y = [],[]\r\nfor i in range(k):\r\n q, p = map(int, input().split())\r\n x.append(min(q, p))\r\n y.append(max(q, p))\r\nMAX = 0\r\nfor i in range(k):\r\n for j in range(i+1,k):\r\n ok = False\r\n if x[i] + x[j] <= n and y[i] <= m and y[j] <= m:\r\n ok = True\r\n elif x[i] + y[j] <= n and y[i] <= m and x[j] <= m:\r\n ok = True\r\n elif y[i] + y[j] <= m and x[i] <= n and x[j] <= n:\r\n ok = True\r\n elif y[i] + x[j] <= m and x[i] <= n and y[j] <= n:\r\n ok = True\r\n elif y[i] + y[j] <= n and x[i] <= m and x[j] <= m:\r\n ok = True\r\n elif y[i] + x[j] <= n and x[i] <= m and y[j] <= m:\r\n ok = True\r\n elif x[i] + x[j] <= m and y[i] <= n and y[j] <= n:\r\n ok = True\r\n elif x[i] + y[j] <= m and y[i] <= n and x[j] <= n:\r\n ok = True\r\n if ok:\r\n MAX = max(MAX, x[i]*y[i] + x[j]*y[j])\r\nprint(MAX)\r\n", "def check_fit_seal(grid, seal):\n if grid[0] >= seal[0] and grid[1] >= seal[1]:\n return True\n else:\n return False\n\n\ndef check_fit_seals(grid, seal1, seal2):\n ans = False\n if check_fit_seal(grid, seal1):\n ans = ans or check_fit_seal((grid[0] - seal1[0], grid[1]), seal2)\n ans = ans or check_fit_seal((grid[0], grid[1] - seal1[1]), seal2)\n ans = ans or check_fit_seal((grid[0] - seal1[0], grid[1]), (seal2[1], seal2[0]))\n ans = ans or check_fit_seal((grid[0], grid[1] - seal1[1]), (seal2[1], seal2[0]))\n\n seal1 = (seal1[1], seal1[0])\n if check_fit_seal(grid, seal1):\n ans = ans or check_fit_seal((grid[0] - seal1[0], grid[1]), seal2)\n ans = ans or check_fit_seal((grid[0], grid[1] - seal1[1]), seal2)\n ans = ans or check_fit_seal((grid[0] - seal1[0], grid[1]), (seal2[1], seal2[0]))\n ans = ans or check_fit_seal((grid[0], grid[1] - seal1[1]), (seal2[1], seal2[0]))\n\n return ans\n\n\nn, a, b = [int(i) for i in input().strip().split(' ')]\n\nseals = []\nfor _ in range(n):\n seals.append([int(i) for i in input().strip().split(' ')])\n\nmax_area = 0\nfor i, seal1 in enumerate(seals):\n for j, seal2 in enumerate(seals):\n if i != j:\n if check_fit_seals((a, b), seal1, seal2):\n max_area = max(max_area, seal1[0] * seal1[1] + seal2[0] * seal2[1])\n\nprint(max_area)\n", "n,x,y = map(int,input().split())\r\nMax = 0\r\nlst\t\t= []\r\nfor i in range(n):\r\n\ta,b = map(int,input().split())\r\n\tlst.append((a,b))\r\n\r\n\r\nfor i in range(n):\r\n\tx1,y1 = lst[i]\r\n\tfor j in range(i+1,n):\r\n\t\tx2,y2 = lst[j]\r\n\t\tif(x1+x2<=x and max(y1,y2)<=y):\r\n\t\t\tMax = max(Max,x1*y1+x2*y2)\r\n\t\telif(x1+y2<=x and max(y1,x2)<=y):\r\n\t\t\tMax = max(Max,x1*y1+x2*y2)\r\n\t\telif(y1+y2<=x and max(x1,x2)<=y):\r\n\t\t\tMax = max(Max,x1*y1+x2*y2)\r\n\t\telif(y1+x2<=x and max(y2,x1)<=y):\r\n\t\t\tMax = max(Max,x1*y1+x2*y2)\r\n\r\n\t\telse:\r\n\t\t\tx1,x2,y1,y2,x,y = y1,y2,x1,x2,y,x\r\n\t\t\tif(x1+x2<=x and max(y1,y2)<=y):\r\n\t\t\t\tMax = max(Max,x1*y1+x2*y2)\r\n\t\t\telif(x1+y2<=x and max(y1,x2)<=y):\r\n\t\t\t\tMax = max(Max,x1*y1+x2*y2)\r\n\t\t\telif(y1+y2<=x and max(x1,x2)<=y):\r\n\t\t\t\tMax = max(Max,x1*y1+x2*y2)\r\n\t\t\telif(y1+x2<=x and max(y2,x1)<=y):\r\n\t\t\t\tMax = max(Max,x1*y1+x2*y2)\r\n\r\n\r\nprint(Max)\r\n\r\n", "n, a, b = [int(i) for i in input().split()]\ndef fit_check(p,q,r,s):\n if p > a or r > a or q > b or s > b:\n return 0\n if p + r <= a or q + s <= b:\n return p * q + r * s\n else:\n return 0\nans = 0\nseals = [[int(i) for i in input().split()] for j in range(n)]\nfor i in range(n):\n p, q = seals[i]\n for j in range(i+1, n):\n r, s = seals[j]\n ans = max(ans, fit_check(p,q,r,s), fit_check(q,p,r,s), fit_check(p,q, s,r), fit_check(q,p,s,r))\nprint(ans)\n \t \t \t \t\t\t\t\t \t\t", "import sys, math\r\n\r\nn, a, b = map(int, input().split())\r\nx=[0 for i in range(n)]\r\ny=[0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n u,v = map(int, input().split())\r\n x[i]=u\r\n y[i]=v\r\n\r\nm=0\r\nfor i in range(n):\r\n for j in range (n):\r\n if i!=j:\r\n if (x[i]+x[j]<=a and max(y[i],y[j])<=b) or (x[i]+y[j]<=a and max(y[i],x[j])<=b) or (y[i]+x[j]<=a and max(x[i],y[j])<=b) or (y[i]+y[j]<=a and max(x[i],x[j])<=b) or (x[i] + x[j] <= b and max(y[i], y[j]) <= a) or (x[i] + y[j] <= b and max(y[i], x[j]) <= a) or (y[i] + x[j] <= b and max(x[i], y[j]) <= a) or (y[i] + y[j] <= b and max(x[i], x[j]) <= a):\r\n if m<x[i]*y[i]+x[j]*y[j]: m=x[i]*y[i]+x[j]*y[j]\r\nprint(m)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a, b = map(int, input().split())\r\nxy = [list(map(int, input().split())) for _ in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n xi, yi = xy[i]\r\n si = xi * yi\r\n if si > a * b:\r\n continue\r\n for j in range(i + 1, n):\r\n xj, yj = xy[j]\r\n sj = xj * yj\r\n if si + sj > a * b:\r\n continue\r\n ok = 0\r\n if xi + xj <= a and max(yi, yj) <= b:\r\n ok = 1\r\n if xi + yj <= a and max(yi, xj) <= b:\r\n ok = 1\r\n if yi + xj <= a and max(xi, yj) <= b:\r\n ok = 1\r\n if yi + yj <= a and max(xi, xj) <= b:\r\n ok = 1\r\n if max(xi, xj) <= a and yi + yj <= b:\r\n ok = 1\r\n if max(xi, yj) <= a and yi + xj <= b:\r\n ok = 1\r\n if max(yi, xj) <= a and xi + yj <= b:\r\n ok = 1\r\n if max(yi, yj) <= a and xi + xj <= b:\r\n ok = 1\r\n if ok:\r\n ans = max(ans, si + sj)\r\nprint(ans)", "n, a, b = map(int, input().split(' '))\r\nseals = []\r\nfor i in range(n): seals.append(list(map(int, input().split(' '))))\r\n\r\ndef canFit(rect, a, b):\r\n\tx1, x2 = max(a, b), min(a, b)\r\n\ty1, y2 = max(rect[0], rect[1]), min(rect[0], rect[1])\r\n\treturn x1 >= y1 and x2 >= y2;\r\n\r\nseals.sort(key = lambda x: -x[0]*x[1])\r\nbest = 0\r\n#Rects not squares\r\nfor i in range(n):\r\n\tfor j in range(i+1, n):\r\n\t\tfirst = [seals[i][0] + seals[j][0], max(seals[i][1], seals[j][1])]\r\n\t\tsecond = [seals[i][0] + seals[j][1], max(seals[i][1], seals[j][0])]\r\n\t\tthird = [max(seals[i][0], seals[j][0]), seals[i][1] + seals[j][1]]\r\n\t\tfourth = [max(seals[i][0], seals[j][1]), seals[i][1] + seals[j][0]]\r\n\t\tif canFit(first, a, b) or canFit(second, a, b) or canFit(third, a, b) or canFit(fourth, a, b):\r\n\t\t\tbest = max(best, seals[i][0]*seals[i][1] + seals[j][0]*seals[j][1])\r\n\r\nprint(best)", "n, a, b = map(int, input().split())\r\nxy = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nmx = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if xy[i][0] + xy[j][0] <= a and max(xy[i][1], xy[j][1]) <= b or \\\r\n xy[i][1] + xy[j][0] <= a and max(xy[i][0], xy[j][1]) <= b or \\\r\n xy[i][1] + xy[j][1] <= a and max(xy[i][0], xy[j][0]) <= b or \\\r\n xy[i][0] + xy[j][1] <= a and max(xy[i][1], xy[j][0]) <= b or \\\r\n xy[i][0] + xy[j][0] <= b and max(xy[i][1], xy[j][1]) <= a or \\\r\n xy[i][1] + xy[j][0] <= b and max(xy[i][0], xy[j][1]) <= a or \\\r\n xy[i][1] + xy[j][1] <= b and max(xy[i][0], xy[j][0]) <= a or \\\r\n xy[i][0] + xy[j][1] <= b and max(xy[i][1], xy[j][0]) <= a :\r\n mx = max(xy[i][0] * xy[i][1] + xy[j][0] * xy[j][1], mx)\r\nprint(mx)\r\n", "#!/usr/bin/env python3\ndef pred(h, w, y1, x1, y2, x2):\n return (y1 + y2 <= h and x1 <= w and x2 <= w) \\\n or (x1 + x2 <= w and y1 <= h and y2 <= h)\ndef main():\n n, h, w = map(int, input().split())\n y = [None] * n\n x = [None] * n\n for i in range(n):\n y[i], x[i] = map(int, input().split())\n ans = 0\n for i in range(n):\n for j in range(i):\n if pred(h, w, y[i], x[i], y[j], x[j]) \\\n or pred(h, w, y[i], x[i], x[j], y[j]) \\\n or pred(h, w, x[i], y[i], y[j], x[j]) \\\n or pred(h, w, x[i], y[i], x[j], y[j]):\n ans = max(ans, y[i] * x[i] + y[j] * x[j])\n print(ans)\nmain()\n\n\t \t\t\t \t \t\t\t\t\t \t\t \t \t\t \t\t\t\t", "def main():\n n, a, b = [int(t) for t in input().split()]\n\n points = []\n for _ in range(n):\n point = [int(t) for t in input().split()]\n points.append(point)\n\n largest_area = 0\n for i, (x1, y1) in enumerate(points):\n for j, (x2, y2) in enumerate(points):\n if i == j:\n continue\n if satisfy(x1, y1, x2, y2, a, b):\n area = x1 * y1 + x2 * y2\n largest_area = max(area, largest_area)\n\n print(largest_area)\n\n\ndef satisfy(x1, y1, x2, y2, a, b):\n if satisfy_single(max((x1, x2)), sum((y1, y2)), a, b):\n return True\n if satisfy_single(sum((x1, x2)), max((y1, y2)), a, b):\n return True\n if satisfy_single(max((x1, y2)), sum((y1, x2)), a, b):\n return True\n if satisfy_single(sum((x1, y2)), max((y1, x2)), a, b):\n return True\n if satisfy_single(max((y1, x2)), sum((x1, y2)), a, b):\n return True\n if satisfy_single(sum((y1, x2)), max((x1, y2)), a, b):\n return True\n\n return False\n\n\ndef satisfy_single(x, y, a, b):\n if x <= a and y <= b:\n return True\n if x <= b and y <= a:\n return True\n\n return False\n\n\nif __name__ == '__main__':\n main()\n", "def check(a, b, x1, y1, x2, y2):\n if x1 + x2 <= a and max(y1, y2) <= b:\n return 1\n if x1 + y2 <= a and max(y1, x2) <= b:\n return 1\n if x1 + x2 <= b and max(y1, y2) <= a:\n return 1\n if y1 + x2 <= a and max(x1, y2) <= b:\n return 1\n if max(x1, x2) <= a and y1 + y2 <= b:\n return 1\n if max(x1, y2) <= a and y1 + x2 <= b:\n return 1\n if max(x1, x2) <= b and y1 + y2 <= a:\n return 1\n if max(y1, x2) <= a and x1 + y2 <= b:\n return 1\n return 0\n\n\nn, a, b = map(int, input().split())\nps = []\nfor i in range(n):\n ps.append([int(x) for x in input().split()])\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n if check(a, b, ps[i][0], ps[i][1], ps[j][0], ps[j][1]):\n ans = max(ans, ps[i][0] * ps[i][1] + ps[j][0] * ps[j][1])\nprint(ans)", "import sys\r\nfrom itertools import product\r\n\r\nn, a, b = map(int, input().split())\r\nseal = [list(map(int, input().split())) for _ in range(n)]\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n for (w1, h1), (w2, h2) in product(((seal[i][0], seal[i][1]), (seal[i][1], seal[i][0])), ((seal[j][0], seal[j][1]), (seal[j][1], seal[j][0]))):\r\n if w1+w2 <= a and max(h1, h2) <= b or max(w1, w2) <= a and h1+h2 <= b:\r\n ans = max(ans, w1*h1 + w2*h2)\r\n\r\nprint(ans)\r\n", "n, a, b = map(int, input().split())\r\nA = []\r\nfor i in range(n):\r\n A.append(list(map(int, input().split())))\r\n\r\n\r\ndef sqr(f, s):\r\n\r\n for i in range(3):\r\n if (a >= f[0] + s[0] and b >= max(f[1], s[1])) or (b >= f[0] + s[0] and a >= max(f[1], s[1])):\r\n return f[0]*f[1] + s[0]*s[1]\r\n elif (a >= max(f[0], s[0]) and b >= f[1] + s[1]) or (b >= max(f[0], s[0]) and a >= f[1] + s[1]):\r\n return f[0] * f[1] + s[0] * s[1]\r\n\r\n elif(i == 0):\r\n f[0], f[1] = f[1], f[0]\r\n elif (i == 1):\r\n f[0], f[1] = f[1], f[0]\r\n s[0], s[1] = s[1], s[0]\r\n\r\n return 0\r\n\r\nmaxi = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n maxi = max(maxi, sqr(A[i], A[j]))\r\nprint(maxi)", "from sys import stdin as fin\n# fin = open(\"ecr26c.in\", \"r\")\n\ndef check_place(x1, y1, x2, y2, x, y):\n return (\n # (x1 + x2 <= x and y1 + y2 >= y) or\n (x1 + x2 <= x and max(y1, y2) <= y) or\n (max(x1, x2) <= x and y1 + y2 <= y)\n )\n\nn, a, b = map(int, fin.readline().split())\n# m = int(fin.readline())\nmaxs = 0\nrects = tuple(tuple(map(int, fin.readline().split())) for i in range(n))\nfor i in range(n):\n for j in range(n):\n if i != j:\n (x1, y1), (x2, y2) = rects[i], rects[j]\n if (\n check_place(x1, y1, x2, y2, a, b) or\n check_place(x1, y1, y2, x2, a, b) or\n check_place(y1, x1, x2, y2, a, b) or\n check_place(y1, x1, y2, x2, a, b)\n ):\n maxs = max(maxs, x1*y1 + x2*y2)\n pass\nprint(maxs)", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn,a,b=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(list(map(int,input().split())))\r\nm=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if (l[i][0]+l[j][0]<=a and max(l[i][1],l[j][1])<=b) or (l[i][0]+l[j][1]<=a and max(l[i][1],l[j][0])<=b) or (l[i][1]+l[j][0]<=a and max(l[i][0],l[j][1])<=b) or (l[i][1]+l[j][1]<=a and max(l[i][0],l[j][0])<=b) or (l[i][0]+l[j][0]<=b and max(l[i][1],l[j][1])<=a) or (l[i][0]+l[j][1]<=b and max(l[i][1],l[j][0])<=a) or (l[i][1]+l[j][0]<=b and max(l[i][0],l[j][1])<=a) or (l[i][1]+l[j][1]<=b and max(l[i][0],l[j][0])<=a):\r\n m=max(m,l[i][0]*l[i][1]+l[j][0]*l[j][1])\r\nprint(m)" ]

[ "h,m = list(map(int,input().split(':')))\r\nprint((h*30+m/2)%360,m*6)\r\n", "s=input()\r\n\r\nh=int(s[:2])\r\nm=int(s[3:])\r\nif h>=12:\r\n h=h%12\r\nm1=6*m\r\nh1=30*h+(1/12)*m1\r\nprint(h1,m1)\r\n", "time = input()\r\n\r\nhh = int(time[:2])\r\nmm = int(time[3:])\r\n\r\nif hh >= 12:\r\n\tr = int(hh)-12\r\nelse:\r\n\tr = int(hh)\r\n\r\nprint(r*30+int(mm)/2,mm*6)", "a, b = map(int, input().split(':'))\n\nx = ((a * 60) + b) / 2\ny = b * 6\n\nx = x % 360\n\nprint(x, y)\n\n \t \t \t\t \t\t\t\t\t\t \t\t\t \t\t\t\t", "h, m = map(int, input().split(':'))\r\nif (h>=12):\r\n h-=12\r\nprint(h*30+30*m/60, m*6)\r\n", "h, m = input().split(\":\")\nh, m = int(h), int(m)\n\nmhTurn = (m / 60) * 360\nhhTurn = (((h % 12) / 12) * 360) + ((m / 60) * (360 / 12))\n\nprint(hhTurn, mhTurn)\n \t \t\t \t \t\t\t\t\t\t\t \t \t\t\t \t\t", "'https://codeforces.com/contest/80/problem/B'\r\nhr,minute=map(int,input().split(':'))\r\nif(hr>=12):\r\n\thr=hr-12\r\nmin1=minute*6\r\nhr1=hr*30\r\nhr1=hr1+minute/2\r\nprint(hr1,min1)", "a=input()\r\nb=int(a[:2])\r\nc=int(a[3:])\r\nd=c/60\r\ne=((b+d)*30)%360\r\nf=(c*6)%360\r\nprint(e,f)", "s=input()\r\nh=int(s[:2])\r\nm=int(s[3:])\r\nprint(h%12*30+m/2,m*6)", "h, m = map(int, input().split(\":\"))\r\nh %= 12\r\nprint(0.5*(60*h+m), 6*m)", "# Read the desired time in HH:MM format\r\ndesired_time = input().strip().split(\":\")\r\nhour = int(desired_time[0])\r\nminute = int(desired_time[1])\r\n\r\n# Calculate the angle for the hour hand\r\nhour_angle = (hour % 12) * 30 + (minute / 60) * 30\r\n\r\n# Calculate the angle for the minute hand\r\nminute_angle = minute * 6\r\n\r\nprint(hour_angle, minute_angle)\r\n\r\n\r\n\r\n", "t = input()\r\nhour = int(t[:2])\r\nminute = int(t[3:])\r\n \r\nhour %= 12\r\n \r\n \r\ny = minute * 6.0\r\n \r\nif (hour == 0 or hour == 12) and minute == 0: \r\n x = 0\r\nelse:\r\n x = hour * 30.0 + minute * 0.5\r\nprint(\"{:5f} {:5f}\".format(x, y))\r\n ", "h, m = map(int, input().split(':'))\r\nprint(30 * (h % 12) + m / 2, m * 6)# 1698237007.1978533", "a, b = map(int, input().split(':'))\r\n\r\nm, n = 12, 00\r\n\r\nminute = ((b - n) % 60) * 6\r\nhour = ((a - m) % 12 + (b / 60)) * 30\r\n\r\nprint(hour, minute)\r\n", "h, m = map(int, input().split(':'))\n\nif h >= 12:\n hd = (60*(h - 12) + m) * 0.5\nelse:\n hd = (60*h + m) * 0.5\n\nmd = 6*m\n\nprint(str(hd) + \" \" + str(md))", "time = input()\r\nh = int(time[0])*10 + int(time[1])\r\nm = int(time[3])*10 + int(time[4])\r\nh = h % 12\r\nangle1 = h*30 + m//2\r\nif m%2 == 1:\r\n angle1 += 0.5\r\nangle2 = m*6\r\nprint(angle1, angle2)\r\n", "h,m = map(int,input().strip().split(':'))\r\n\r\nh -= 12*(h >= 12)\r\nmin_angle = m * 6 # or min(m*6, 360 - m*6), we'll see\r\n\r\nhour_angle = 30*h + m/2\r\n\r\nprint(hour_angle, min_angle)\r\n\r\n\r\n\"\"\"\r\n⢸⣿⣿⣿⣿⠃⠄⢀⣴⡾⠃⠄⠄⠄⠄⠄⠈⠺⠟⠛⠛⠛⠛⠻⢿⣿⣿⣿⣿⣶⣤⡀⠄\r\n⢸⣿⣿⣿⡟⢀⣴⣿⡿⠁⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⣸⣿⣿⣿⣿⣿⣿⣿⣷\r\n⢸⣿⣿⠟⣴⣿⡿⡟⡼⢹⣷⢲⡶⣖⣾⣶⢄⠄⠄⠄⠄⠄⢀⣼⣿⢿⣿⣿⣿⣿⣿⣿⣿\r\n⢸⣿⢫⣾⣿⡟⣾⡸⢠⡿⢳⡿⠍⣼⣿⢏⣿⣷⢄⡀⠄⢠⣾⢻⣿⣸⣿⣿⣿⣿⣿⣿⣿\r\n⡿⣡⣿⣿⡟⡼⡁⠁⣰⠂⡾⠉⢨⣿⠃⣿⡿⠍⣾⣟⢤⣿⢇⣿⢇⣿⣿⢿⣿⣿⣿⣿⣿\r\n⣱⣿⣿⡟⡐⣰⣧⡷⣿⣴⣧⣤⣼⣯⢸⡿⠁⣰⠟⢀⣼⠏⣲⠏⢸⣿⡟⣿⣿⣿⣿⣿⣿\r\n⣿⣿⡟⠁⠄⠟⣁⠄⢡⣿⣿⣿⣿⣿⣿⣦⣼⢟⢀⡼⠃⡹⠃⡀⢸⡿⢸⣿⣿⣿⣿⣿⡟\r\n⣿⣿⠃⠄⢀⣾⠋⠓⢰⣿⣿⣿⣿⣿⣿⠿⣿⣿⣾⣅⢔⣕⡇⡇⡼⢁⣿⣿⣿⣿⣿⣿⢣\r\n⣿⡟⠄⠄⣾⣇⠷⣢⣿⣿⣿⣿⣿⣿⣿⣭⣀⡈⠙⢿⣿⣿⡇⡧⢁⣾⣿⣿⣿⣿⣿⢏⣾\r\n⣿⡇⠄⣼⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⢻⠇⠄⠄⢿⣿⡇⢡⣾⣿⣿⣿⣿⣿⣏⣼⣿\r\n⣿⣷⢰⣿⣿⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⢰⣧⣀⡄⢀⠘⡿⣰⣿⣿⣿⣿⣿⣿⠟⣼⣿⣿\r\n⢹⣿⢸⣿⣿⠟⠻⢿⣿⣿⣿⣿⣿⣿⣿⣶⣭⣉⣤⣿⢈⣼⣿⣿⣿⣿⣿⣿⠏⣾⣹⣿⣿\r\n⢸⠇⡜⣿⡟⠄⠄⠄⠈⠙⣿⣿⣿⣿⣿⣿⣿⣿⠟⣱⣻⣿⣿⣿⣿⣿⠟⠁⢳⠃⣿⣿⣿\r\n⠄⣰⡗⠹⣿⣄⠄⠄⠄⢀⣿⣿⣿⣿⣿⣿⠟⣅⣥⣿⣿⣿⣿⠿⠋⠄⠄⣾⡌⢠⣿⡿⠃\r\n⠜⠋⢠⣷⢻⣿⣿⣶⣾⣿⣿⣿⣿⠿⣛⣥⣾⣿⠿⠟⠛⠉⠄⠄\r\n\"\"\"\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(s):\r\n h = int(s[0:2])\r\n h %= 12\r\n m = int(s[3:])\r\n h = (h * 60 + m) * (360) / (60 * 12)\r\n m = m * 360 / 60\r\n return (h, m)\r\n\r\ndef main():\r\n ans = solve(input())\r\n print('%.10f %.10f' % (ans[0], ans[1]))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# n,l = [int(x) for x in input().split()]\n\n# s =[int(x) for x in input().split()]\n# s.sort()\n\n# max_d = 0\n# for i in range(len(s) - 1):\n# \tif s[i+1] - s[i] > max_d:\n# \t\tmax_d = s[i+1] - s[i]\n\n# print(max(min(s), max_d/2, l-max(s)))\n\n#===========================================#\n\n# a,x,y = [int(x) for x in input().split()]\n\n# if x < 0 or y < 0 or x > a or y > a:\n# \tprint(2)\n# elif x!=0 and y!=0 and x+y < 2*a:\n# \tprint(0)\n# else:\n# \tprint(1)\n\n#===========================================#\n\ns = input()\nhours = int(s[:2])\nminutes = int(s[3:])\n\n# print(hours%12,minutes)\n\nh_turn = hours/12 * 360\nm_turn = minutes/60 * 360\n\nprint(h_turn%360 + (30*m_turn/360),m_turn%360)\n", "x=(input())\r\na=int(x[0:2])\r\nb=int(x[3:])\r\nif a>12:\r\n a-=12\r\nif a==12:\r\n a=0\r\nlol=a*30+0.5*b\r\nyo=b*6\r\n\r\nprint(lol,yo)", "# \n\n# solving: \n# from: https://vjudge.net/contest/417235#problem/D\n\ndef main():\n inlist = input().split(\":\")\n hh, mm = int(inlist[0]), int(inlist[1])\n\n deg_per_h = 360/12\n deg_per_m = 360/60\n\n print(\"{} {}\".format(((hh+mm/60) * deg_per_h) % 360, (mm * deg_per_m) % 360))\n\nmain()\n \t \t \t \t\t\t\t \t \t \t \t\t \t\t\t", "s=input()\r\n\r\nh=int(s[0]+s[1])\r\nif(h>=12):\r\n h-=12\r\nm=int(s[3]+s[4])\r\n\r\nhh=30*h+(m*0.5)\r\nmm=6*m\r\n\r\nprint(hh,mm)\r\n", "str=input()\r\nhr=int(str[0]+str[1])\r\nmin=int(str[3]+str[4])\r\nif hr==12:\r\n\tprint(min/2,min*6)\r\nelif hr>12:\r\n\t\r\n print((hr-12)*30+min/2,min*6)\r\n\r\nelse:\t\r\n print(hr*30+min/2,min*6)", "import sys\r\n\r\ndef ans(x):\r\n minutes = (x[1])*6.0\r\n hours = (x[0]%12)*30\r\n extra = ((x[1])*(0.5))\r\n hours+=extra\r\n \r\n check1 = check(hours)\r\n check2 = check(minutes) \r\n if check1:\r\n hours = int(hours)\r\n \r\n if check2:\r\n minutes = int(minutes)\r\n \r\n return [hours, minutes]\r\n\r\ndef check(x):\r\n out = str(x)\r\n k = out.strip().split('.')\r\n k = k[1]\r\n for i in range(len(k)):\r\n if k[i] is not '0':\r\n return False\r\n \r\n return True\r\n\r\nx = list(map(int, input().strip().split(':')))\r\n\r\nout = ans(x)\r\nprint(out[0], end = ' ')\r\nprint(out[1])", "s=input()\r\nhr=int(s[0:2])\r\nmin=int(s[3:])\r\nif(hr>=12):\r\n hr-=12\r\nprint((hr*60+min)/2,int(min*6)) ", "s = str(input())\r\nl = s.split(\":\")\r\nhrs = int(l[0])\r\nmins = int(l[1])\r\nif hrs >=12 :\r\n hrs -= 12\r\n\r\nprint(((hrs *30) + (mins /2)), mins * 6)", "h, m = (int(i) for i in input().split(\":\"))\n\nnh = h*30 + (30*m)/60\nnm = 6*m\n\nprint(nh%360, nm)\n", "for _ in range(1):\r\n s=input()\r\n h=(((int)(s[0]))*10)+((int)(s[1]))\r\n if h>=12:\r\n h-=12\r\n m=(((int)(s[3]))*10)+((int)(s[4]))\r\n y=m*6\r\n x=30*h+(m/2.0);\r\n print(x,y,end=' ')", "time=input()\r\ntime=time.split(\":\")\r\nhour=int(time[0])\r\nminute=int(time[1])\r\nhour_angle=(30*hour)+(minute*0.5)\r\nminute_angle=6*minute\r\nif hour_angle>=360:\r\n hour_angle=hour_angle-360\r\nprint(hour_angle,minute_angle,sep=\" \")", "hh, mm = map(int, input().split(':'))\r\nhh -= 12 if hh >= 12 else 0\r\nprint(30 * hh + mm / 2, 6 * mm, sep=' ')\r\n", "h,m=map(int,input().split(\":\"))\r\nif h>=12: h-=12\r\nh=(h*60+m)/60\r\nhl=h*(360//12)\r\nml=m*(360//60)\r\nprint(hl,ml)\r\n", "h, m = map(int, input().split(':'))\r\nh = h % 12\r\ntm = h * 60 + m\r\nans = ''\r\nif tm % 2 == 0:\r\n ans = str(tm // 2)\r\nelse:\r\n ans = str(tm / 2)\r\nans = ans + \" \" + str(m * 6)\r\nprint(ans)", "from sys import stdin,stdout\n\nhdic = {1:30,2:60,3:90,4:120,5:150,6:180,7:210,8:240,9:270,10:300,11:330,12:0}\n\nh,m = map(int,stdin.readline().split(':'))\n\nh = h%12\n\nangH = (h*60+m)*0.5\n\nangM = m*6\n\nprint(angH,angM)\n\t \t\t \t \t \t\t \t \t\t", "H,M = map(int,input().replace(':',' ').split())\r\nprint(30*(H%12)+M/2,6*M)\r\n", "H, M = [int(x) for x in input().split(':')]\nH = H % 12\n\nhAngle = 360 / 12\nhmAngle = hAngle / 60\nmAngle = 360 / 60\n\nprint(H * hAngle + M * hmAngle, end=' ') \nprint(M * mAngle)\n\t \t \t \t \t\t\t \t \t\t \t \t \t", "\nhour, minute = map(int, input().split(\":\"))\n\nif hour // 12 > 0:\n hour = hour - (12 * (hour // 12))\n\ndef FindAngle(hour, minute):\n \n if minute > 0:\n hourAngle = (hour * 30) + (minute / 2)\n if (minute % 2 == 0):\n hourAngle = int(hourAngle)\n \n else: hourAngle = (hour * 30)\n \n minuteAngle = minute * 6\n \n print(hourAngle, minuteAngle)\n\nFindAngle(hour, minute)" ]

[ "n = int(input())\r\nmySet = set(())\r\nfor i in range(n):\r\n s = input()\r\n mySet.add(s)\r\n\r\nprint(len(mySet))", "n=int(input())\r\nset=set()\r\nfor i in range(0,n):\r\n set.add(input())\r\nprint(len(set))", "t=int(input())\nd={}\nfor i in range(t):\n s=input().strip()\n d.setdefault(s,0)\n d[s]+=1\nprint(len(d))\n \t\t\t \t \t\t\t\t\t \t\t \t \t\t\t\t\t", "t=int(input())\nh={}\ncount=0\nfor _ in range(t):\n a=input()\n if(a not in h):\n h[a]=1\n count=count+1\n else:\n pass\nprint(count)\n\n \t\t \t \t\t\t \t\t \t\t\t\t \t\t \t \t", "n=int(input())\nd={}\nfor i in range(n):\n q,s=map(str,input().split())\n d[q+\" \"+s]=0\nprint(len(d))\n \t \t\t\t\t\t\t \t\t \t\t \t\t\t\t\t \t \t \t", "# LUOGU_RID: 113129863\nd=[]\nn=int(input())\nfor i in range(n):\n a=input()\n if a not in d:\n d.append(a)\nprint(len(d))", "# your code goes here\nn=int(input())\nlst1=set()\nfor i in range(n):\n\ts=input()\n\tlst1.add(s)\nprint(len(lst1))\n\n\t\n \t\t\t\t\t \t \t \t \t \t \t \t\t\t", "k = set()\r\nfor _ in range(int(input())):\r\n k.add(input().strip())\r\nprint(len(k))\r\n \t\t \t ", "n=int(input())\nl=[]\nfor i in range(n):\n s=input()\n l.append(s)\n le=len(set(l))\nprint(le)\n\t\t \t\t\t\t\t \t \t \t \t\t \t\t", "lst1=[]\nlst2=[]\ntest=int(input())\nfor i in range(test):\n x=input()\n if x not in lst1:\n lst1.append(x)\n else:\n lst2.append(x)\nprint(len(lst1))\n \t \t \t \t \t\t \t \t \t\t", "s = set()\nfor _ in range(int(input())):\n\ts.add(input())\nprint(len(s))\n\t \t \t\t \t \t \t\t \t \t\t \t \t \t", "n_1=int(input())\narr_1=[]\nfor i in range(n_1):\n s=input()\n arr_1.append(s)\nset_1=set(arr_1)\nprint(len(set_1))\n \t \t\t\t\t\t\t \t\t \t \t\t\t", "st = set()\nfor _ in range(int(input())):\n st.add(input().strip())\nprint(len(st))\n \t\t \t\t \t \t \t \t \t \t", "t=int(input())\nar=[]\nfor i in range(1,t+1):\n s=input()\n if(s not in ar):\n ar.append(s)\nprint(len(ar)) \n \n\t \t\t\t\t\t \t \t \t \t\t\t\t \t\t \t", "numnum=int(input())\narr=[]\nfor _ in range(numnum):\n st=input()\n arr.append(st)\nb=set(arr)\nprint(len(b))\n \t\t \t \t\t \t\t \t \t\t\t\t\t \t\t", "n = int(input())\r\n\r\ndata = []\r\nfor i in range(n):\r\n I = input().split()\r\n data.append((I[0], I[1]))\r\n\r\nresults = []\r\nfor i in data:\r\n if i not in results:\r\n results.append(i)\r\n\r\nprint(len(results))", "x=int(input())\r\nlt=[]\r\nfor i in range(x):\r\n\ta=input().strip()\r\n\tlt.append(a)\r\nlt1=[]\r\nfor i in lt:\r\n\tif i not in lt1:\r\n\t\tlt1.append(i)\r\nprint(len(lt1))\r\n", "n = int(input())\nb = []\nfor i in range(n):\n s = ''\n a = list(map(str,input().split()))\n for i in range(len(a)):\n s = s + ' ' + a[i]\n b.append(s)\nb = set(b)\nprint(len(b))\n \t \t\t\t \t\t\t\t\t\t\t\t \t\t\t", "x=[]\nfor _ in range(int(input())):\n a=input()\n x.append(a)\nprint(len(set(x)))\n \t\t \t\t\t\t \t \t \t\t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nprint(len(set([input()[:-1].replace(' ','azkkk') for _ in range(int(input()))])))\r\n", "n = int(input())\r\nleaves = []\r\nfor i in range(n):\r\n [t, c] = input().split()\r\n if [t, c] in leaves:\r\n continue\r\n leaves.append([t, c])\r\nprint(len(leaves))", "# your code goes here\r\nn=int(input())\r\nl=[]\r\nwhile n!=0:\r\n\tn=n-1\r\n\ts=input()\r\n\tl.append(s)\r\nprint(len(set(l)))\r\n\t ", "a = int(input())\r\nthisset = set()\r\nfor i in range(a):\r\n thisset.add(input())\r\nprint(len(thisset))", "a=[]\nb=[]\nn=int(input(\"\"))\nfor y in range(n):\n z=input(\"\")\n a.append(z)\n # print(a)\nfor tt in a:\n if tt not in b:\n b.append(tt)\n else:\n continue\nprint(len(b))\n\n\n\n\n\n\n\n\n \t \t\t \t \t \t\t \t\t\t \t\t", "t=int(input())\r\na=[]\r\nfor i in range(t):\r\n s=input()\r\n a.append(s)\r\nl=set(a)\r\nprint(len(l))", "a=[]\nfor i in range(int(input())):\n a.append(input())\nprint(len(set(a)))\n \n \t \t\t \t \t\t\t\t \t \t \t \t \t\t\t \t", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n a = input()\r\n s.add(a)\r\nprint(len(s))", "n=int(input())\nl=[]\nfor i in range(n):\n\ts=input()\n\tl.append(s)\nl1=set(l)\nprint(len(l1))\n\t\t \t\t\t \t \t \t \t\t\t \t \t \t\t\t", "j=[]\nfor i in range(int(input())):\n i=str(input())\n j.append(i)\ng=set(j)\nprint(len(g))\n\t\t\t\t \t\t \t \t \t\t\t\t \t \t\t\t", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\nprint(len(set(l)))", "#Let's go\nimport sys\nimport math\nimport random\n\nsys.setrecursionlimit(100000)\n\nt, ar = int(input()), []\nfor i in range(t):\n a, b=input().split()\n ar.append((a, b))\nar=set(ar)\nprint(len(ar))\n\n \t\t\t \t \t\t \t\t\t \t\t \t\t \t", "n=int(input())\nst=set()\nfor i in range(n):\n k=input()\n st.add(k)\nprint(len(st))\n\t\t\t \t\t \t \t\t\t\t \t \t \t \t\t \t", "t = int(input())\nc = 0\nbucket = {}\ntree = {}\nfor i in range(t):\n breech , color = [(x) for x in input().split()]\n color = color+breech\n if(breech in bucket and color in tree and tree[color] == breech ):\n pass \n else:\n bucket[breech] = color \n tree[color] = breech\n c += 1 \nprint(c)\n \n \n\t \t \t\t \t\t\t \t\t\t \t \t \t", "t1=int(input())\nl2=set()\nfor i in range(t1):\n s=input()\n l2.add(s)\nprint(len(l2))\n\t\t \t \t\t\t\t\t \t \t\t\t\t \t \t\t \t", "list = []\nN = int(input())\nfor i in range(N):\n M = input()\n list.append(M)\nlist = set(list)\nprint(len(list))\n\t\t\t \t \t\t\t \t\t \t \t\t\t \t\t\t \t\t", "d = {}\nfor _ in range(int(input())):\n\td[input()] = 1\nprint(len(d))\n \t\t \t\t\t \t\t\t \t\t\t\t\t \t \t \t", "n = int(input())\nl = []\nfor i in range(n):\n\ts = input()\n\tl.append(s)\nl1 = list(set(l))\nprint(len(l1))\n \t\t\t\t\t \t\t\t\t \t \t\t \t \t \t\t\t \t", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn = int(input())\r\ns = set()\r\nfor i in range(n):\r\n s.add(input())\r\nprint(len(s))\r\n", "n = int(input())\nm = set()\nfor i in range(n):\n s = input()\n m.add(s)\nprint(len(m))\n\t\t\t\t\t\t \t\t\t\t\t \t\t \t \t\t \t\t\t\t\t", "n = int(input())\r\nb = set()\r\nfor i in range(n):\r\n s = input()\r\n b.add(s)\r\nprint(len(b))", "n=int(input())\nset1=set()\nfor i in range(n):\n s1=input()\n set1.add(s1)\nprint(len(set1))\n \t\t \t \t \t\t\t \t\t\t \t\t\t\t \t \t", "n=int(input())\r\nk=[]\r\nfor i in range(n):\r\n s=input()\r\n if(s not in k):\r\n k.append(s)\r\nprint(len(k))\r\n", "n=int(input())\r\nnonDublicat=[]\r\nfor i in range(n):\r\n txt=input()\r\n if txt not in nonDublicat:\r\n nonDublicat.append(txt)\r\n\r\nprint(len(nonDublicat)) ", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n inp = input()\r\n if inp not in lst:\r\n lst.append(inp)\r\nprint(len(lst))", "n = int(input())\r\nl = set()\r\nfor i in range(n):\r\n l.add(tuple(input().split(' ')))\r\nprint(len(l))", "s=[]\r\nfor i in range(int(input())):\r\n \r\n d=input()\r\n if d not in s:\r\n s.append(d)\r\nprint(len(s))\r\n", "n = int(input())\r\nleaves=[]\r\nfor i in range(n):\r\n leaves.append(input());\r\nprint(len(set(leaves)))\r\n \r\n", "ans=set()\r\nfor _ in range(int(input())):\r\n a=input()\r\n ans.add(a)\r\nprint(len(ans))", "t=int(input())\nk1={}\nfor i in range(t):\n s=input()\n k1[s]=1 \nprint(len(k1))\n \t\t\t \t\t \t \t \t\t\t \t\t\t \t\t\t \t", "t=int(input())\narr=[]\nfor i in range(t):\n a=input()\n arr.append(a)\ns=list(set(arr))\nprint(len(s))\n \t\t \t \t\t\t\t \t\t \t \t \t\t\t", "# https://codeforces.com/problemset/problem/44/A\n# 900\n\nn = int(input())\n\nd = {}\no = 0\nfor _ in range(n):\n leaf = input()\n if d.get(leaf) is None:\n o += 1\n d[leaf] = True\n\nprint(o)", "def test0k():\n a = int(input())\n # li = [[input()] for i in range(a)]\n li = set(input() for i in range(a))\n print(len(li))\n\n\nif __name__ == '__main__':\n test0k()\n\n \t\t \t \t \t \t \t\t \t\t\t\t \t \t\t \t\t", "n=int(input())\ns=set()\nfor i in range(n):\n s1=input()\n s.add(s1)\nprint(len(s))\n\t \t\t \t\t\t \t\t \t\t \t\t \t \t\t", "n=int(input())\r\nhh=set()\r\nfor _ in range(n):\r\n a,b=input().split()\r\n hh.add((a,b))\r\nprint(len(hh))\r\n", "n=int(input())\r\nans=set()\r\nfor i in range(n):\r\n ans.add(str(input()))\r\nprint(len(ans))\r\n", "n=int(input())\r\n\r\nbouqet=[]\r\nsize=0\r\nfor _ in range(n):\r\n leaf = input()\r\n if leaf not in bouqet:\r\n size+=1\r\n bouqet.append(leaf)\r\n\r\nprint(size)\r\n ", "n=int(input())\nlst=[]\nfor i in range(n):\n lst.append(input())\nlst=set(lst)\nprint(len(lst))\n\t \t \t \t \t\t\t\t\t\t\t \t\t \t \t\t \t", "t = int(input())\nword_dict = {}\ncount = 0\nfor case in range(t):\n type, color = map(str, input().split())\n if type not in word_dict.keys():\n count += 1\n word_dict[type] = [color]\n else:\n if color not in word_dict[type]:\n count += 1\n word_dict[type].append(color)\nprint(count)\n\n \t \t\t \t\t\t\t \t \t\t \t\t\t \t", "l=[]\r\nfor _ in range(int(input())):\r\n t=input()\r\n t.replace(' ','')\r\n l.append(t)\r\ns=set(l)\r\nprint(len(s)) ", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n m = input()\r\n l.append(m)\r\nl = set(l)\r\nprint(len(l))", "n = int(input())\narr = []\nfor _ in range(n):\n l = (input())\n arr.append(l)\nprint(len(list(set(arr))))\n\t \t\t\t\t\t \t \t\t \t\t\t \t \t \t", "a = int(input())\r\ns = set()\r\nfor i in range(a):\r\n d = input()\r\n s.add(d)\r\n\r\n\r\nprint(len(s))", "l=set()\nfor i in range(int(input())):\n\tk=str(input())\n\tl.add(k)\nprint (len(l))\n", "n = int(input())\r\ncollected = []\r\nc = 1\r\ntyp, col = input().split()\r\ncollected.append((typ, col))\r\nfor zzz in range(n-1):\r\n typ, col = input().split()\r\n for i in range(c):\r\n if(collected[i][0]==typ and collected[i][1]==col):\r\n break\r\n else:\r\n c+=1\r\n collected.append((typ, col))\r\nprint(c)", "T = int(input())\r\narr = []\r\nfor i in range(T):\r\n inp = input()\r\n if(inp not in arr):\r\n arr.append(inp)\r\nprint(len(arr))", "n = int(input())\r\np = set()\r\nfor _ in range(n):\r\n p.add(input())\r\nprint(len(p))\r\n", "l = []\r\nfor i in range(int(input())):\r\n n = input()\r\n l.append(n)\r\n \r\nprint(len(set(l)))", "n = int(input())\r\nstream = []\r\nfor j in range(n):\r\n s = str(input())\r\n if s not in stream:\r\n stream.append(s)\r\nprint(len(stream))\r\n", "s = []\r\nfor _ in range(int(input())):\r\n a = input()\r\n for i in a:\r\n s += [a]\r\nprint(len(set(s)))\r\n", "def f():\r\n lst=[]\r\n count=0\r\n for i in range(int(input())):\r\n s=input()\r\n if(lst.count(s)>0):\r\n continue\r\n else:\r\n count+=1\r\n lst.append(s)\r\n print(count)\r\nf()", "t=int(input())\ns=[]\nfor i in range(t):\n n=input()\n s.append(n)\n dup=set(s)\nprint(len(dup))\n\t \t \t\t \t \t\t\t\t\t \t \t \t \t \t", "\r\nlista = []\r\ncantidad = 0\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n hoja = input()\r\n i = 0\r\n while i < cantidad:\r\n if hoja == lista[i]:\r\n break\r\n i = i+1\r\n if i == cantidad:\r\n lista.append(hoja)\r\n cantidad = cantidad+1\r\nprint(cantidad)\r\n ", "n=int(input())\nk=set()\nfor _ in range(n):\n s,c=input().lower().split()\n k.add((s,c))\nprint(len(k))\n\t\t \t \t\t \t\t \t\t\t \t \t\t\t\t\t \t \t", "t=int(input())\na=set()\nfor i in range(t):\n s=input()\n a.add(s)\nprint(len(a))\n \n\t\t \t\t\t\t\t \t\t\t \t \t\t\t\t\t\t\t \t \t", "n = int(input())\r\ns1 = []\r\nfor i in range(n):\r\n s = input()\r\n s1.append(s)\r\na = list(set(s1))\r\nb = len(a)\r\nprint(b)\r\n \r\n\r\n", "leaves = []\n\nn = int(input())\nfor i in range(0, n):\n x = input()\n if not x in leaves:\n leaves.append(x)\n\nprint(len(leaves))", "n=int(input())\r\nlist=[0]*n\r\nfor i in range (n):\r\n list[i]=input()\r\nflowers=[]\r\nfor k in list:\r\n if k not in flowers:\r\n flowers.append(k)\r\nprint(len(flowers))", "n = int(input())\nlis = set()\nfor i in range(n):\n a,b = map(str,input().split())\n lis.add((a,b))\nprint(len(lis))\n \t \t \t\t\t \t \t\t \t\t \t \t\t", "# cook your dish here\r\nd={}\r\nc=0\r\nn=int(input())\r\nfor _ in range(n):\r\n a,b=input().split()\r\n if(a in d and b not in d[a]):\r\n d[a].append(b)\r\n c+=1\r\n elif(a not in d):\r\n d[a]=[b]\r\n c+=1\r\n#(d)\r\nprint(c)", "def doo(l):\n return len(set(l))\n \n \nn=int(input())\nl=[]\nfor i in range(n):\n l.append(input())\nprint(doo(l))\n\t \t \t \t\t\t\t\t\t\t\t \t \t \t\t \t \t", "n = int(input())\r\nleaves = set()\r\nfor i in range(n):\r\n leaf = input()\r\n leaves.add(leaf)\r\n\r\nprint(len(leaves))\r\n\r\n\r\n", "d = {}\nfor _ in range(int(input())):\n a,b = map(str,input().split())\n if a not in d:\n l = []\n l.append(b)\n d[a] = l \n else:\n if b not in d[a]:\n d[a].append(b)\n\nc = 0\nfor i in d:\n for j in d[i]:\n c+=1 \nprint(c)\n \t \t\t\t\t\t \t\t \t \t\t \t\t \t\t \t\t", "n=int(input())\r\nlist=[]\r\nfor i in range(n):\r\n list.append(input())\r\nprint(len(set(list)))", "ar=[]\nfor _ in range(int(input())):\n\tar.append(input())\nprint(len(set(ar)))\n \t\t \t\t\t\t\t \t\t\t \t\t \t \t \t \t", "n = int(input())\r\na = set()\r\nfor i in range(n):\r\n a.add(tuple(input().split()))\r\nprint(len(a)) \r\n ", "arr=[]\nfor _ in range(int(input())):\n arr.append(input())\nprint(len(set(arr)))\n \t \t \t\t\t \t\t \t\t\t\t\t\t\t\t\t\t\t \t\t", "print(len({tuple(input().split()) for _ in range(int(input()))}))", "n = int(input())\r\nleaves = []\r\ncount = 0\r\n\r\nfor i in range(n):\r\n leaves.append(input())\r\n\r\nleaves.sort()\r\n\r\nfor i in range(len(leaves)):\r\n if i == len(leaves) - 1:\r\n count += 1\r\n else:\r\n if not (leaves[i] == leaves[i+1]):\r\n count += 1\r\n\r\nprint(count)", "s1 = input()\r\ns2 = int(s1)\r\n\r\nl=[[x for x in input().split()] for i in range(s2)]\r\n\r\nmaniual = []\r\ncounter = 0\r\nfor i in l:\r\n if i not in maniual:\r\n maniual.append(i)\r\n counter += 1\r\n \r\nprint(counter)", "d={}\ncount=0\nfor _ in range(int(input())):\n a=input().split()\n if(a[0] in d and a[1] not in d[a[0]]):\n d[a[0]].append(a[1])\n count+=1\n elif(a[0] not in d):\n d[a[0]]=[a[1]]\n count+=1\nprint(count)\n\n\n \t\t\t \t \t \t\t\t\t\t\t\t \t \t\t \t\t", "n=int(input())\r\nc=[]\r\nfor _ in range(n):\r\n c.append(input())\r\n\r\nprint(len(set(c)))", "trees=[]\nfor i in range(int(input())):\n trees.append(input())\nprint(len(set(trees)))", "a=[]\nfor i in range(int(input())):\n p=input()\n a.append(p)\nprint(len(list(set(a))))\n\t\t\t \t\t\t\t \t \t\t \t\t \t\t \t \t\t", "n = int(input())\ns = []\nfor i in range(n):\n x = input()\n s.append(x)\nprint(len(set(s)))\n\t\t\t \t\t\t\t\t \t \t\t\t\t\t\t\t\t\t \t \t", "num=int(input())\r\nprint(len(set([input() for i in ' '*num])))", "n=int(input())\nfreq={}\nfor i in range(n):\n l,c=map(str,input().split())\n if (l,c) in freq:\n freq[(l,c)]+=1 \n else:\n freq[(l,c)]=1 \nprint(len(freq))\n\n\t \t \t\t\t \t \t\t \t\t\t \t\t \t\t", "n = int(input())\n\nposs = []\ncnt = 0\nfor i in range(n):\n a, c = input().split()\n l = (a,c)\n \n if l not in poss:\n poss.append(l)\n cnt += 1\n \nprint(cnt)\n\n \t \t \t \t \t\t \t \t \t\t\t \t \t", "z=int(input())\nlist=[]\nfor j in range(z):\n s=input().split()\n str=\" \".join(s)\n list.append(str)\nprint(len(set(list)))\n\t\t\t \t\t\t\t\t\t\t \t\t\t \t\t \t \t\t", "# your code goes here\nn=int(input())\nl=[]\nfor i in range(0,n):\n\tinp=input()\n\tl.append(inp)\n#print(l)\ns=set(l)\n#print(s)\nprint(len(s))\n\n\t\t \t\t \t \t\t\t\t \t \t \t\t", "t=int(input())\nlst=set()\nfor i in range(0,t):\n sum=input()\n lst.add(sum)\nprint(len(lst))\n\t \t\t \t\t \t\t\t\t \t\t \t\t\t \t\t", "n=int(input())\r\nli=[]\r\nlis=[]\r\ncount=0\r\nfor i in range(n):\r\n tree,color=input().split()\r\n s=tree+ \" \" +color\r\n li.append(s)\r\nfor x in li:\r\n if x not in lis:\r\n count+=1\r\n lis.append(x)\r\nprint(count)\r\n", "n = int(input())\nleaf=[]\nwhile n!=0 :\n leaf.append(input())\n n-=1\nleaf=set(leaf)\nprint(len(leaf))\n \t\t\t\t\t\t \t\t\t\t\t\t \t \t\t\t \t\t\t\t \t", "# your code goes here\nt = int(input())\na = []\nwhile t > 0:\n b = input()\n a.append(b)\n t = t - 1\na = set(a)\nprint(len(a))\n\t \t\t \t \t\t\t \t \t\t \t\t \t \t", "t=int(input())\r\nlis=[]\r\nfor j in range(0,t):\r\n n=input()\r\n \r\n if n not in lis:\r\n lis.append(n)\r\n\r\n\r\nprint(len(lis))\r\n ", "n = int(input())\r\nlist = {''}\r\nfor i in range(n):\r\n leaf = input()\r\n if leaf in list:\r\n continue\r\n else:\r\n list.add(leaf)\r\nprint(len(list)-1)\r\n", "n=int(input())\r\nname=[]\r\nfor i in range(n):\r\n x=input()\r\n name.append(x)\r\nname=set(name)\r\nprint(len(name))", "t = int(input())\r\nA = set([])\r\nfor i in range(t):\r\n leaf = input()\r\n A.add(leaf)\r\nprint(len(A))", "s = set()\nfor _ in range(0, int(input())):\n s.add(input())\nprint(len(s))\n", "t=int(input())\nl=[]\nfor i in range(t):\n s=input()\n l.append(s)\nl=list(set(l))\nprint(len(l))\n\t \t \t \t\t \t \t\t\t \t \t\t \t\t\t\t \t\t", "TESTC= int(input())\narr = []\nfor i in range(TESTC):\n str = input()\n arr.append(str)\n l=len(set(arr))\nprint(l)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \t\t \t \t\t \t \t \t\t \t\t\t\t \t\t\t", "sthring=set()\nfor _ in range(int(input())):\n sthring.add(input().strip())\nprint(len(sthring))\n \t\t \t \t \t \t \t\t\t\t\t \t \t", "n=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n s=input()\r\n lst.append(s)\r\n le=len(set(lst))\r\nprint(le) ", "n = int(input())\nk = {}\ncount = 0\nfor i in range(n):\n str1, str2 = input().split()\n if (str1, str2) not in k:\n k[(str1, str2)] = 0\n count+=1\nprint(count)\n \t\t \t\t\t \t\t\t\t\t\t \t \t \t \t\t \t", "n = int(input())\r\n#cont = {}\r\ncont = set()\r\nfor i in range(n):\r\n cont.add(input())\r\n \r\n\r\nprint(len(cont))", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n s = set()\r\n for _ in range(int(input())):\r\n s.add(input())\r\n print(len(s))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\narr = set()\r\n\r\nfor i in range(n):\r\n arr.add(input())\r\n\r\nprint(len(arr))\r\n", "n=int(input())\nans1=[]\ncount=0\nfor i in range(n):\n data=input().split()\n if data not in ans1:\n ans1.append(data)\n count+=1\nprint(count)\n \t \t\t\t\t \t \t \t\t \t\t\t\t", "count=0\nd={}\nfor _ in range(int(input())):\n\ttree,color=input().split()\n\tif tree not in d:\n\t\td[tree]=[color]\n\tif color not in d[tree]:\n\t\td[tree].append(color)\nfor i in d:\n\tcount+=len(d[i])\nprint(count)\n \t\t \t \t \t\t \t \t\t \t \t \t \t\t", "\n\n\n\n'''input\n'''\nimport sys\nimport math\nimport bisect\nfrom sys import stdin,stdout\nfrom math import gcd,floor,sqrt,log\nfrom collections import defaultdict as dd\nfrom bisect import bisect_left as bl,bisect_right as br\n\nsys.setrecursionlimit(100000000)\n\ninp =lambda: int(input())\nstrng =lambda: input().strip()\njn =lambda x,l: x.join(map(str,l))\nstrl =lambda: list(input().strip())\nmul =lambda: map(int,input().strip().split())\nmulf =lambda: map(float,input().strip().split())\nseq =lambda: list(map(int,input().strip().split()))\n\nceil =lambda x: int(x) if(x==int(x)) else int(x)+1\nceildiv=lambda x,d: x//d if(x%d==0) else x//d+1\n\nflush =lambda: stdout.flush()\nstdstr =lambda: stdin.readline()\nstdint =lambda: int(stdin.readline())\nstdpr =lambda x: stdout.write(str(x))\n\nmod=1000000007\n\n\nt = stdint()\ns = set()\nfor _ in range(t):\n\ttree, color = input().split()\n\ts.add(tree + \"#\" + color)\nprint(len(s))\n \t \t\t \t \t\t\t \t \t \t\t \t", "f={}\nfor i in range(int(input())):\n a,b=map(str,input().split())\n if(a,b)not in f:\n f[(a,b)]=1\nprint(len(f))\n\t\t\t \t\t \t\t\t \t \t\t \t \t\t\t \t \t", "tree_leave = {}; ans = 0\r\nfor i in range(int(input())):\r\n tree, leave = input().split()\r\n if tree in tree_leave:\r\n if leave not in tree_leave[tree]:\r\n ans+=1\r\n tree_leave[tree].append(leave)\r\n else:\r\n ans+=1\r\n tree_leave[tree] = [leave]\r\nprint(ans)", "miniDict = {}\r\niSummer = []\r\nchkList = []\r\ntest = int(input())\r\nfor i in range(test):\r\n t, c = map(str, input().split())\r\n miniDict = {t: c}\r\n iSummer.append(miniDict)\r\nfor i in iSummer:\r\n if i not in chkList:\r\n chkList.append(i)\r\nprint(len(chkList))", "s=int(input())\nt=set()\nfor i in range(s):\n t.add(input())\nprint(len(t))\n\t \t \t \t\t\t\t \t\t\t \t\t", "import math\r\nchecked = []\r\nn = int(input())\r\nc = 0\r\nfor i in range(n):\r\n a = input()\r\n if a not in checked:\r\n checked.append(a)\r\n c+=1\r\nprint(c)", "n = int(input())\r\nmoo = set()\r\nfor i in range(n):\r\n moo.add(input())\r\nprint(len(moo))", "n = int(input())\nans = []\nfor i in range(n):\n s = input()\n ans.append(s)\nprint(len(set(ans)))\n\t \t \t \t \t \t \t\t \t \t\t \t\t\t\t\t \t", "num = int(input())\r\nlist = []\r\n\r\nfor i in range(num):\r\n list.append(input())\r\n\r\nlist2 = []\r\n\r\nfor i in range(len(list)):\r\n if list[i] not in list2:\r\n list2.append(list[i])\r\n else:\r\n continue\r\n\r\nprint(len(list2))\r\n", "n = int(input())\r\na = set()\r\nfor i in range(n):\r\n a.add(input())\r\nprint(len(list(a)))", "import sys\ninput = sys.stdin.buffer.readline\n\nt = int(input())\narr = []\nfor _ in range(t):\n s = str(input())\n arr.append(s)\n\nprint(len(set(arr)))", "t=int(input())\narr=[]\nfor i in range(t):\n ins=input()\n \n if ins not in arr:\n arr.append(ins)\nprint(len(arr))\n \t \t \t \t\t\t \t \t\t\t\t\t\t\t \t", "t=int(input())\nx=[]\nfor i in range(t):\n\ts=input()\n\tx.append(s)\na=set(x)\nprint(len(a))\n\n \t \t\t \t\t \t \t \t \t\t \t\t\t\t \t\t\t", "n = int(input())\ns = set()\nfor i in range(n):\n\ts.add(input())\nprint(len(s))\n", "my_dict = {}\r\ncount = 0\r\nn = int(input())\r\nfor i in range(n):\r\n x,y = map(str, input().split())\r\n if x not in my_dict:\r\n count += 1\r\n my_dict[x] = [y]\r\n elif y not in my_dict[x]:\r\n count += 1\r\n my_dict[x].append(y)\r\nprint(count)\r\n", "t=int(input())\nres=[]\nwhile t:\n s=input()\n res.append(s)\n t-=1\nprint(len(set(res)))\n\t \t\t\t \t\t \t\t\t \t \t\t \t", "n=int(input())\r\nset={0}\r\nfor i in range(n):\r\n x=input()\r\n set.add(x)\r\nset.discard(0)\r\nprint(len(set))", "def my_fuction(n):\n a=n.lower()\n a=set(a)\n if len(a)==26:\n print(\"YES\")\n else:\n print(\"NO\")\ndef strings(n):\n lst=[]\n for i in range(n):\n a=input()\n lst.append(a)\n c=set(lst)\n print(len(c))\nn=int(input())\nstrings(n)\n \n \t\t \t \t \t \t\t \t \t \t", "n=int(input())\nl=[]\nwhile(n):\n\ts=input()\n\tl.append(s)\n\ts=set(l)\n\tn-=1\nprint(len(s))\n\t\t \t\t \t \t \t\t\t\t\t \t\t\t \t", "tot = set()\r\n\r\nfor _ in range(int(input())):\r\n tot.add(tuple(input().split()))\r\n\r\nprint(len(tot))\r\n", "n = int(input())\r\nmySet = set()\r\nfor i in range(n):\r\n line = input()\r\n mySet.add(line)\r\nprint(len(mySet))", "t=int(input())\nlists=[]\nfor i in range(t):\n x=str(input())\n lists.append(x)\nk=set(lists) \nprint(len(k))\n \n\n\n\t \t \t\t\t\t \t \t \t\t \t\t \t \t\t\t", "t = int(input())\na = []\nfor i in range(t):\n x = input()\n a.append(x)\n b = set(a)\nprint(len(b))\n \t\t \t \t \t\t \t \t\t \t \t\t \t", "n=int(input())\ns=[]\nfor i in range(n):\n\tq=input()\n\ts.append(q)\nprint(len(set(s)))\n\t\n \t \t \t\t \t \t \t \t\t \t \t\t \t", "print(len(set(input() for i in range(int(input())))))", "if __name__ == \"__main__\":\n\t# Your code goes here\n\ta = []\n\tfor _ in range(int(input())):\n\t\ts = input()\n\t\ta.append(s)\n\tprint(len(set(a)))\n\tpass\n\t\t \t\t \t \t\t\t\t \t \t \t \t\t\t\t", "# your code goes here\na=int(input())\nlst=[]\nfor i in range(a):\n\tb=input()\n\tlst.append(b)\nlst2=[]\nfor i in lst:\n\tif i not in lst2:\n\t\tlst2.append(i)\nprint(len(lst2))\n\t\t\n\n\t \t\t\t\t\t \t \t\t\t \t \t \t", "a,e={},0\r\nfor i in range(int(input())):\r\n c,d=list(map(str,input().split()))\r\n if c not in a.keys():\r\n a.update({c:[d]})\r\n e+=1\r\n elif d not in a[c]:\r\n a[c].append(d)\r\n e+=1\r\nprint(e)", "n = int(input())\nfrq = {}\nfor _ in range(n):\n s1, s2 = map(str, input().split())\n frq[(s1, s2)] = frq.get((s1, s2), 0) + 1\nc = 0 \nfor k in frq:\n c += 1\n #print(k, frq[k])\n \nprint(c)\n\t \t \t\t \t \t \t \t \t\t\t \t \t\t\t\t", "n=int(input())\nk=[]\nfor i in range(n):\n t=input()\n k.append(t)\nprint(len(set(k)))\n\t \t\t\t\t\t \t\t\t\t\t \t\t \t \t \t \t", "x = int(input())\r\nstrList = []\r\nfor i in range(x):\r\n\tstring = input()\r\n\tif string not in strList:\r\n\t\tstrList.append(string)\r\nprint(len(strList))", "n = int(input())\nleaves = {}\nfor i in range(n):\n a, b = input().split()\n key = a + '|' + b\n if key not in leaves:\n leaves[key] = True\nprint(len(leaves))\n\t\t\t \t\t\t\t\t \t \t\t\t \t\t \t\t\t\t\t \t", "n = int(input())\nl = []\nfor i in range(n):\n l.append(input())\nprint(len(set(l))) \n\t\t \t \t\t \t\t\t \t \t\t\t \t", "summer=[]\nfor i in range(int(input())):\n inl=input()\n summer.append(inl)\nprint(len(list(set(summer))))\n \t\t\t \t \t\t\t \t\t \t \t\t\t\t\t \t", "n = int(input())\ntree_set = set()\n\nfor i in range(n):\n\ttree = tuple(input().split(' '))\n\tif tree not in tree_set:\n\t\ttree_set.add(tree)\nprint(len(tree_set))\n", "n = int(input())\nb = []\nfor i in range(n):\n k = input()\n b.append(k) \nprint(len(set(b)))\n \t \t \t\t \t \t \t \t\t\t\t\t \t", "t = int(input())\na = []\nfor i in range(t):\n s = input()\n a.append(s)\n l=len(set(a))\nprint(l)\n \t \t\t\t \t \t \t \t \t \t \t\t", "p=int(input())\r\nstr1=[]\r\nfor i in range(p):\r\n x=input()\r\n str1.append(x)\r\nprint(len(set(str1)))\r\n\t\t \t\t \t \t \t \t \t \t\t \t \t\t\t", "n = int(input())\r\nc=0\r\nmat=[]\r\nfor _ in range(n):\r\n\r\n k = list(map(str,input().split()))\r\n\r\n\r\n if k not in mat:\r\n c+=1\r\n mat.append(k)\r\n\r\nprint(c)", "a=[]\nfor i in range(int(input())):\n \n x=input()\n if x not in a:\n a.append(x)\nprint(len(a))\n#hhhhhhhhhhhhhh\n\t\t \t \t\t \t \t\t\t\t\t\t \t \t\t\t", "n = int(input())\r\ntree = []\r\n\r\nfor i in range(n):\r\n l = list(map(str, input().split()))\r\n if l not in tree :\r\n tree.append(l)\r\na = len(tree)\r\nprint(a)", "def main():\r\n n = int(fin())\r\n li = []\r\n res = 0\r\n for i in range(n):\r\n *s, = fin().split()[:2]\r\n if s not in li:\r\n li.append(s)\r\n res += 1\r\n fout(res)\r\n\r\n# FastIO\r\nfrom sys import stdin, stdout\r\ndef fin(): return stdin.readline().strip(\"\\r\\n\")\r\ndef fout(s): return stdout.write(str(s)+'\\n')\r\nif __name__ == \"__main__\":\r\n t = 1 or int(fin())\r\n for i in range(t): main()", "#\nb=[]\nfor i in range(int(input())):\n s=input()\n b.append(s)\nprint(len(set(b)))\n\n \t \t\t \t\t\t \t\t\t \t\t \t \t \t\t", "# your code goes here\nn=int(input())\nprint(len({input() for i in range(n)}))\n \t \t \t\t\t \t\t\t \t\t \t \t\t", "n = int(input())\r\nset1 = set()\r\nfor i in range(n):\r\n str = input()\r\n set1.add(str)\r\nprint(len(set1)) ", "lis=[]\nfor _ in range(int(input())):\n a,b=map(str,input().split())\n lis.append([a,b])\nans = []\nfor i in range(len(lis)):\n if lis[i] in ans:\n pass\n else:\n ans.append(lis[i])\nprint(len(ans))\n\n \t\t \t\t\t\t \t \t \t \t\t\t\t\t\t", "k=set()\nfor i in range(int(input())):\n k.add(input())\nprint(len(k))\n \n\t \t\t\t \t \t \t \t\t\t \t \t\t \t\t\t", "n = int(input())\nl = []\nel = []\nd = {}\ns = set()\nfor i in range(n):\n pair = list(map(str,input().split()))\n l.append(pair)\nfor i in l:\n if i not in el:\n el.append(i)\nprint(len(el))\n\t\t\t \t \t \t\t \t \t\t \t \t\t \t\t", "n = int(input())\ns = set()\nwhile n:\n n-=1\n s.add(input())\nprint(len(s))\n\t \t\t\t\t\t \t \t \t \t \t \t \t\t \t", "t=int(input())\nar=[]\nc=0\nfor test in range(t):\n x=input()\n if(x not in ar):\n ar.append(x)\n c=c+1 \nprint(c)\n \t \t \t \t\t\t \t \t \t \t \t \t \t \t", "t = int(input())\r\narray = []\r\n\r\nfor i in range(t):\r\n array.append(input())\r\n\r\narray = sorted(array)\r\n\r\ncount = 1\r\n\r\nfor i in range(len(array)-1):\r\n if array[i] != array[i+1]:\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\narr = []\r\nfor _ in range(n):\r\n inp = input()\r\n if(inp not in arr):\r\n arr.append(inp)\r\nprint(len(arr))", "n=int(input())\r\ns=[]\r\nfor x in range(n):\r\n s.append(input())\r\nprint(len(set(s)))\r\n", "n = int(input())\r\nleaves = set()\r\n\r\nfor _ in range(n):\r\n tree_species, leaf_color = input().split()\r\n leaves.add((tree_species, leaf_color))\r\n\r\nprint(len(leaves))\r\n", "n=int(input())\nl=[]\nfor i in range(n):\n st=list(input().split('\\n'))\n for x in st:\n if x not in l:\n l.append(x)\nprint(len(l))\n\n\t\t\t \t\t\t \t\t\t \t \t\t\t\t \t\t \t\t\t", "def CountOfUnique(has_picked):\n count=len(set(has_picked))\n return count\nx=int(input())\nhas_picked=[]\nfor i in range(x):\n has_picked.append(input())\nprint(CountOfUnique(has_picked))\n\t \t \t \t\t\t\t \t\t\t\t \t \t\t \t\t\t \t", "n = int(input())\r\nl = []\r\nfor x in range(n):\r\n a = input()\r\n if a not in l:\r\n l.append(a)\r\nprint(len(l))", "\r\nn = int(input())\r\nmySet = set()\r\nfor i in range(n):\r\n mySet.add(input())\r\nprint(len(mySet))\r\n", "s=set()\nfor _ in range(int(input())):\n a,b=input().split()\n s.add((a,b))\nprint(len(s))\n\t\t \t \t \t \t\t \t \t\t \t\t\t \t", "A= int(input())\nprint(len({input() for i in range(A)}))\n \t \t\t \t\t\t\t\t \t \t", "test_cases=int(input())\nr=[]\nfor i in range(test_cases):\n s=input()\n r.append(s)\nresult=set(r)\nprint(len(result))\n\t\t \t \t\t\t\t\t\t \t\t\t\t \t\t \t\t\t \t", "n = int(input())\r\nbouquet = set()\r\ni = 0\r\nwhile i < n:\r\n\ttree_leaf = input()\r\n\tbouquet.add(tree_leaf)\r\n\ti += 1\r\nprint(len(bouquet))", "n=int(input())\nf={}\nfor _ in range(n):\n s1,s2=input().split()\n if (s1,s2) not in f:\n f[(s1,s2)]=1\nprint(len(f))\n\t\t \t \t\t\t\t \t \t\t\t\t \t\t \t \t \t", "n=int(input())\nd=set()\nfor i in range(n):\n s,k=map(str,input().split())\n j=s+\"-\"+k\n d.add(j)\nprint(len(d))\n \t \t \t\t\t\t \t \t\t \t\t\t\t \t \t \t", "l=[]\r\nfor _ in range(int(input())):\r\n s=input()\r\n if not s in l:\r\n l.append(s)\r\nprint(len(l))\r\n", "from sys import stdin\ninput = stdin.readline\n \ndef answer():\n\n a = set()\n\n for i in range(n):\n st = input().strip().split()\n\n a.add(tuple(st))\n\n return len(a)\n \n \n \nfor T in range(1):\n\n n = int(input())\n \n \n print(answer())\n\n\t \t\t\t\t \t\t \t \t \t \t\t \t\t\t\t\t", "testcase = int(input())\nc = 0\nb = {}\nflag = {}\ncnt = 0\nfor j in range(testcase):\n brech , c = [(y) for y in input().split()]\n c = c+brech\n if(brech in b and c in flag and flag[c] == brech ):\n pass \n else:\n b[brech] = c\n flag[c] = brech\n cnt += 1 \nprint(cnt)\n \n \t\t\t\t \t \t \t\t \t\t\t \t\t\t\t \t\t", "s = set()\nfor i in range(int(input())):\n x = tuple(input().split())\n s.add(x)\nprint(len(s))\n \t\t\t\t\t\t \t \t\t\t \t \t\t\t\t\t", "s=set()\r\nfor i in range(int(input())):\r\n s.add(input())\r\nprint(len(s))", "n = int(input())\nl = []\nfor i in range(n):\n l.append(input())\nl = list(set(l))\nprint(len(l))\n\t \t\t \t \t\t \t\t \t\t\t\t\t \t \t", "n = int(input())\r\nl = [ input().strip() for i in range(n) ]\r\nl = set(l)\r\nprint(len(l))", "n = int(input())\ns = set()\nfor i in range(n):\n n1, n2 = input().split()\n s.add((n1, n2))\nprint(len(s))\n\t \t\t\t \t \t \t\t\t \t\t \t", "n=int(input())\r\nl=list()\r\nfor i in range(n):\r\n l.append(list(map(str,input().split())))\r\nl=sorted(l)\r\nc=1\r\nfor i in range(n-1):\r\n if l[i]!=l[i+1] :\r\n c=c+1\r\nprint(c)", "# Coded By Block_Cipher\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom math import gcd\r\nfrom math import sqrt\r\n\r\n\r\nst = set()\r\nfor _ in range(int(input())):\r\n\tst.add(input())\r\nprint(len(st))\r\n\r\n", "n=int(input())\na=[]\nfor i in range(n):\n s=input().lower()\n \n a.append(s)\nprint(len(set(a)))\n\t\t\t \t \t \t \t \t\t\t \t \t\t\t\t\t", "n= int(input())\nbouquet = []\nfor x in range(0,n):\n [tree,leaf] = input() .split()\n if ([tree,leaf] in bouquet):\n continue\n bouquet.append([tree,leaf])\n \nprint(len(bouquet))", "n = int(input())\ns = set()\nfor r in range(n):\n\tst = input()\n\ts.add(st)\nprint(len(s))\n \t \t\t\t\t \t\t \t \t \t \t\t \t\t\t\t\t", "t=int(input())\r\nar = set()\r\nfor i in range(t):\r\n ar.add(input())\r\nprint(len(list(ar)))", "# LUOGU_RID: 132115841\na=int(input())\r\nsort=[]\r\nsu=0\r\nfor i in range(a):\r\n b=input()\r\n if b not in sort:\r\n sort.append(b)\r\n su+=1\r\nprint(su)", "\"\"\"Indian summer is such a beautiful time of the year!\r\nA girl named Alyona is walking in the forest and picking a bouquet from fallen leaves.\r\nAlyona is very choosy - she doesn't take a leaf\r\n if it matches the color and the species of the tree of one of the leaves she already has.\r\nFind out how many leaves Alyona has picked.\r\n\r\nInput\r\nThe first line contains an integer n (1 <= n <= 100) - the number of leaves Alyona has found.\r\nThe next n lines contain the leaves' descriptions.\r\nEach leaf is characterized by the species of the tree it has fallen from and by the color.\r\nThe species of the trees and colors are given in names, consisting of no more than 10 lowercase Latin letters.\r\nA name can not be an empty string.\r\nThe species of a tree and the color are given in each line separated by a space.\r\n\r\nOutput\r\nOutput the single number - the number of Alyona's leaves.\"\"\"\r\n\r\nn = int(input())\r\nleaves = {\"\"}\r\n\r\nfor i in range(n):\r\n leaf = input()\r\n if leaf not in leaves:\r\n leaves.add(leaf)\r\n\r\nprint(str(len(leaves) - 1))", "'''\r\n\n13.07.2021\r\n\r\n\n\nCF 044 A\r\n\n'''\n\n\r\n\r\nn = int (input ())\r\n\r\n\n\n\ns = []\r\n\nt = input ()\r\n\ns.append (t)\r\n\n\nfor i in range (n-1) :\r\n\n t = input ()\n\r\n m = -1\r\n\n for sj in s :\r\n\n if t == sj :\r\n\n m = 1\n\r\n break\r\n\n\n if m == -1 :\n\r\n s.append (t)\r\n\r\n\n\nprint (len (s))\n", "'''\r\nn = int(input())\r\nlist = []\r\nfor i in range(n):\r\n leaf = input()\r\n if leaf in list:\r\n continue\r\n else:\r\n list.append(leaf)\r\nprint(list)\r\n\r\n\r\n'''\r\n\r\nn = int(input())\r\ncont = set()\r\nfor i in range(n):\r\n cont.add(input())\r\nprint(len(cont))\r\n", "t=int(input())\nprint(len({input() for x in range(t)}))\n\t \t \t \t \t \t\t\t\t\t \t \t \t \t\t", "t=int(input())\r\nl=[]\r\nfor i in range(t):\r\n\tn=input()\r\n\tl.append(n)\r\nprint(len(set(l)))", "t = int(input())\nA = []\nfor _ in range(t):\n s = str(input())\n A.append(s)\nprint(len(list(set(A))))\n \t\t\t \t \t\t \t\t \t", "N_leaves = int(input())\nA_list = []\nfor i in range(N_leaves):\n S_leafname = input()\n A_list.append(S_leafname)\nB_set = set(A_list)\nprint(len(B_set))\n \t\t\t \t\t\t\t \t\t\t\t\t \t \t \t\t \t\t\t \t", "# your code goes here\r\nn=int(input())\r\nlst=set()\r\nfor i in range(n):\r\n\ts=input()\r\n\tlst.add(s)\r\nprint(len(lst))\t", "n=int(input())\r\ncount=0\r\ns=[]\r\nfor i in range (n):\r\n leaves=(str(input()))\r\n if leaves not in s:\r\n count = count +1\r\n s.append(leaves)\r\nprint (count)\r\n \r\n", "k=set()\r\nfor i in range(int(input())):\r\n s=input()\r\n k.add(s)\r\nprint(len(k))", "x = []\r\nfor _ in range(int(input())):\r\n x.append(input())\r\nprint(len(set(x)))", "n = int(input())\nprint(len(set([input() for i in range(n)])))\n \t\t \t \t \t\t \t \t \t\t\t\t \t\t \t", "t = int(input())\nl = []\nfor i in range(t):\n s = input()\n l.append(s)\nprint(len(set(l)))\n\n \t \t\t \t \t\t\t\t\t \t \t \t \t", "n = int(input())\r\nres = [] \r\nfor i in range(n): \r\n x = input() \r\n if x not in res : \r\n res.append(x) \r\nprint(len(res))\r\n", "test = int(input())\nl = []\nfor i in range(test):\n\ts = input()\n\tl.append(s)\na = set(l)\nprint(len(a))\n \t \t \t\t\t \t \t\t \t \t \t \t\t \t\t", "l=[]\nfor i in range(int(input())):\n s=input()\n if s not in l:\n l.append(s)\nprint(len(l))\n \t\t \t\t \t\t\t \t\t \t\t \t \t", "n = int(input())\nl = set()\nfor i in range(n):\n\tl.add(input())\nprint(len(l))\n \t\t \t \t \t \t \t \t\t\t\t \t\t \t", "t=int(input())\nx=[]\nwhile t!=0:\n s=input()\n x.append(s)\n t-=1\ny=set(x)\nprint(len(y))\n \t \t \t \t\t \t\t\t\t\t \t\t\t \t\t \t", "n=int(input())\nd={}\nfor i in range(n):\n s1,s2=input().split()\n if (s1,s2) not in d:\n d[(s1,s2)]=1\nprint(len(d))\n \t \t\t \t\t\t\t\t\t \t\t \t", "n = int(input())\r\nl =[]\r\nc = 0\r\nfor i in range(n):\r\n w = str(input())\r\n if w not in l :\r\n c+=1\r\n l.append(w)\r\nprint(c)\r\n", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n\tt = input()\r\n\ts.add(t)\r\nprint(len(s))", "v=[]\nn=int(input())\nfor i in range(n):\n tree=str(input())\n v.append(tree)\nk=set(v)\nprint(len(k))\n\t\t\t\t \t \t \t\t \t \t\t \t \t \t \t \t", "n = int(input())\r\na = set()\r\nfor i in range(n):\r\n s = input()\r\n a.add(s)\r\nprint(len(a))", "n = int(input())\nvalor = 1;a=0;resta=0;banderita=0;i=0;index=0\ncadena = []\nfor xxx in range(n):\n cadena.append(str(input()))\nwhile(index!=len(cadena)-1):\n index=index+1\n if(len(cadena)==1):\n break\n while(valor!=len(cadena)):\n if(cadena[a]==cadena[valor]):\n resta = resta+1\n cadena.pop(valor)\n banderita=1\n if(banderita==1):\n valor = a + 1\n banderita=0\n else:\n valor=valor+1 \n a=a+1\n valor=a+1\n if(valor>=len(cadena)):\n index=len(cadena)-1\nprint(n-resta)\n \t\t \t \t\t\t\t \t \t \t\t \t \t \t \t\t", "spp = set() # initializing the set \n\ndef summerprob(strnga): # function declaration\n \n spp.add((strnga)) # adding all the string inputs into the set\n \n return spp # return stmt\n\ntstcses = int(input()) # Number of test cases to be taken for the problem\n\nfor xxyy in range(0, tstcses): # for loop for test cases\n \n strnga = input() # string inputs\n \n xxx = summerprob(strnga) # calling the function\n \nprint(len(xxx)) # printing the len of the set as output\n \t \t \t \t\t\t \t\t \t \t", "n = int(input())\nL = []\nfor i in range(n):\n s = input()\n if s in L:\n continue\n L.append(s)\n\nprint(len(L))\n \t\t \t \t\t\t\t\t \t\t \t\t\t \t \t", "I=input\r\nprint(len(set(I()for _ in'0'*int(I()))))", "from collections import Counter\r\nl=[]\r\nfor i in range(int(input())):\r\n\ts=input()\r\n\tl.append(s)\r\nprint(len(list(Counter(l).values())))", "st=set()\nfor i in range(int(input())):\n s=input()\n st.add(s)\nprint(len(st))\n\t\t \t \t\t\t\t\t \t\t\t \t\t\t\t \t\t\t\t\t \t", "# your code goes here\nx=int(input())\nlis=[]\nfor i in range(x):\n\ty=input()\n\tlis.append(y)\nli=[]\nfor i in lis:\n\tif i not in li:\n\t\tli.append(i)\nprint(len(li))\n\t\n\t \t \t \t\t \t\t\t \t\t \t \t\t", "total_leaves = int(input())\r\n\r\nleaves = set()\r\n\r\nfor _ in range(total_leaves):\r\n leaves.add(input())\r\n\r\ntotal_leaves = len(leaves)\r\nprint(total_leaves)\r\n", "t=int(input())\r\nlist=[]\r\nwhile(t>0):\r\n a=input()\r\n if a not in list:\r\n list.append(a)\r\n t-=1\r\nprint(len(list))", "t=int(input())\narr=[]\nfor i in range(t):\n x=input()\n arr.append(x)\n \ns=set(arr)\nprint(len(s))\n \t \t \t \t\t \t \t\t\t\t\t\t\t\t", "from sys import stdin\r\n\r\ndef main():\r\n n= int(stdin.readline())\r\n t=[]\r\n c=[]\r\n while n > 0:\r\n t.append(stdin.readline().strip())\r\n n-=1\r\n for i in t:\r\n if i not in c:\r\n c.append(i)\r\n \r\n print(len(c))\r\nmain()\r\n \r\n", "res=[]\nt=int(input())\nfor i in range(t):\n res.append(input())\nprint(len(set(res)))\n \n \t \t\t\t \t\t \t \t\t \t \t\t\t\t \t\t\t", "t = int(input())\nlst = []\nfor i in range(t):\n a = input()\n lst.append(a)\nprint(len(set(lst)))\n\t\t\t \t \t \t\t \t\t\t\t \t\t\t\t\t \t \t\t \t \t", "n=int(input())\nnlist1 = []\nfor i in range(n):\n s = input()\n # nlist1.append(s)\n nlist1.append(s)\n#print(set(nlist1)) \nprint(len(set(nlist1)))\n\t \t\t\t\t \t\t\t\t \t \t\t \t\t\t \t\t", "l=[]\r\nfor _ in range(int(input())):\r\n l.append(input())\r\nprint(len(set(l)))", "T = int(input())\ncolor = set()\nfor i in range(T):\n\tS = input()\n\tcolor.add(S)\nprint(len(color))\n \t\t\t\t\t \t \t \t \t \t\t\t", "n=int(input())\nmylist=[]\nfor i in range(n):\n a=input()\n mylist.append(a)\n\n#print(mylist)\nfreq = {}\nfor item in mylist:\n if (item in freq):\n freq[item] += 1\n else:\n freq[item] = 1 \n\n#print(freq)\nc=0\nfor key, value in freq.items():\n c+=1\n\nprint(c)\n \t \t\t \t\t \t\t\t \t\t\t\t \t\t \t", "a=int(input())\np=[]\nfor i in range(a):\n g=input()\n p.append(g)\np=set(p)\nprint(len(p))\n \t \t\t\t \t\t\t\t\t\t\t\t\t \t\t \t\t \t\t \t", "data=set()\nfor i in range(int(input())):\n data.add(input())\nprint(len(data))\n\t \t \t\t \t\t\t\t\t\t \t\t \t \t\t\t\t\t \t", "s = set()\nfor _ in range(int(input())):\n s.add(input().strip())\nres = len(s)\nprint(res)\n \t\t \t \t \t\t \t \t \t\t", "s=set()\nfor _ in range(int(input())):\n l=list(map(str,input().split()))\n t=tuple(l)\n s.add(t)\nprint(len(s))\n\t\t \t \t\t \t \t\t\t \t\t \t \t\t", "l=[]\nm=int(input())\nfor i in range(m):\n n=input()\n l.append(n)\ny=set(l)\nprint(len(y))\n\t \t\t \t \t\t\t\t\t \t\t \t \t \t\t \t\t \t", "import sys\n\nt = int(sys.stdin.readline())\nd = {}\ncount = 0\nfor i in range(t):\n a,b = sys.stdin.readline().split()\n if(a in d):\n if(b not in d[a]):\n count += 1\n d[a].append(b)\n else:\n count += 1\n d[a] = [b]\nprint(count)\n \n \t \t\t \t \t \t\t \t \t \t\t\t", "n = int(input());\r\nleaves = set();\r\nfor i in range(n):\r\n a = input();\r\n leaves.add(a);\r\nprint(len(leaves));", "li = []\r\nnum = int(input())\r\nfor i in range(num):\r\n leaf = input()\r\n if leaf not in li:\r\n li.append(leaf)\r\n \r\nprint(len(li))", "n=int(input())\nx=[]\nfor i in range(n):\n x.append(input())\nx=set(x)\na=len(x)\nprint(a)\n \t\t \t\t \t \t\t \t\t \t\t \t\t\t \t \t\t \t", "st=set()\r\nfor i in range(int(input())):\r\n st.add(input())\r\nprint(len(st))\r\n", "n = int(input())\r\nl =[]\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\n lem = len(set(l))\r\nprint(lem)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat May 23 16:44:59 2020\r\n\r\n@author: Ritvik Agarwal\r\n\"\"\"\r\n\r\ns = set()\r\n\r\nfor _ in range(int(input())):\r\n s.add(input())\r\n \r\nprint(len(list(s)))", "n = int(input())\n\nleaf_list = []\n\nfor i in range(n):\n leaf = input()\n if i == 0:\n leaf_list.append(leaf)\n else:\n if leaf not in leaf_list:\n leaf_list.append(leaf)\n\nprint(len(leaf_list))", "num = int(input())\n\nleafTypes = []\n\nfor i in range(num):\n leaf = input()\n if leaf not in leafTypes:\n leafTypes.append(leaf)\n\nprint(len(leafTypes))", "flowers = set()\r\nn = int(input())\r\nfor i in range(n):\r\n flowers.add(input())\r\nprint(len(flowers))\r\n", "leaves = {}\r\n\r\ndef select_leaves(leave):\r\n specie, color = leave\r\n \r\n if specie not in leaves:\r\n leaves[specie] = []\r\n leaves[specie].append(color)\r\n else:\r\n colors = leaves[specie]\r\n if color not in colors:\r\n leaves[specie].append(color)\r\n\r\n\r\nif __name__ == '__main__':\r\n amount_leaves = int(input())\r\n while amount_leaves > 0:\r\n leave = input()\r\n select_leaves(leave.split())\r\n amount_leaves -= 1\r\n \r\n length = 0\r\n for i in leaves:\r\n length += len(leaves[i])\r\n print(length)", "tc = int(input())\nl = []\nfor i in range(tc):\n s = input()\n l.append(s)\n ll = set(l)\nprint(len(ll))\n\t\t\t\t\t\t\t\t \t \t \t\t\t\t\t\t \t \t\t", "import sys\nn = int(sys.stdin.readline())\nl = list()\nfor i in range(n):\n s = str(sys.stdin.readline())\n l.append(s)\nx = set(l)\nprint(len(x))\n\t\t\t\t\t \t \t \t\t\t\t \t \t\t\t\t\t", "n = int(input())\r\nrz = set()\r\nfor i in range(n):\r\n a = input()#.split()\r\n\r\n rz.add(a)\r\n\r\n#a = [int(x) for x in a]\r\nprint(len(rz))", "n=int(input())\nlist1=[]\nfor i in range(n):\n ele=input()\n list1.append(ele)\nlist1=set(list1)\nprint(len(list1))\n\n \t \t \t\t \t \t \t \t \t \t\t \t\t", "n=int(input())\na=[]\nwhile(n):\n f=[input().strip()]\n if(f not in a):\n a.append(f)\n n-=1\nprint(len(a))\n\n \t\t\t\t\t\t \t \t\t \t\t \t\t \t\t\t \t\t\t", "n = int(input())\r\ng = set()\r\nfor i in range(n):\r\n b = input()\r\n g.add(b)\r\nprint(len(g))", "\r\n\r\nimport sys\r\nInput = sys.stdin.readline\r\nn = int(Input())\r\ntmp = []\r\nfor i in range(n):\r\n tmp.append(Input())\r\nprint(len(set(tmp)))\r\n\r\n\r\n# Codeforcesian\r\n# ♥\r\n", "t = int(input())\n\ndes = []\n\nfor _ in range(t):\n\n species = input()\n des.append(species)\nprint(len(set(des)))\n\n\n\n\n\n \t \t \t\t\t \t\t\t \t \t \t\t", "n = int(input())\r\nt = []\r\nfor x in range(0, n):\r\n f = input()\r\n if f not in t:\r\n t.append(f)\r\n\r\nprint(len(t))", "tests=int(input())\nres=[]\nfor i in range(tests):\n s=input()\n res.append(s)\nres=set(res)\nprint(len(res))\n \n\t\t\t\t \t\t\t \t \t \t\t \t \t\t \t\t\t", "\r\nlst = []\r\nfor i in range(int(input())):\r\n input2 = input().split()\r\n lst.append(input2[0]+\" \"+input2[1])\r\nprint(len(set(lst)))", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n t=input()\r\n if t not in arr:\r\n arr.append(t)\r\nprint(len(arr))", "l = set()\r\nfor _ in range(int(input())):\r\n l.add(input())\r\nprint(len(l))", "n=int(input())\nl=[]\nfor i in range(n):\n\ta=input()\n\tl.append(a)\nprint(len(set(l)))\n\t \t \t \t \t\t \t \t\t \t", "n=int(input())\nd=dict()\nfor i in range(n):\n a,b=map(str,input().split())\n if a in d:\n d[a].append(b)\n else:\n d[a]=[b]\nfor i in d:\n d[i]=set(d[i])\ns=0\nfor i in d:\n s+=len(d[i])\nprint(s)\n\t \t \t \t\t \t\t\t\t\t\t\t\t \t\t \t\t\t \t", "number_of_leaves = int(input())\r\n\r\nleaves_set = set()\r\n\r\nfor _ in range(number_of_leaves):\r\n leaves_set.add(input())\r\n\r\nprint(len(leaves_set))", "t = int(input())\r\nl = []\r\nfor _ in range(t):\r\n s = input()\r\n if s not in l:\r\n l.append(s)\r\nprint(len(l))\r\n", "quantity = int(input())\nsheet = (\"\",\"\")\ndic = {}\nres = 0\nfor i in range(quantity):\n sheet = input().split()\n dic[sheet[0]+\"-\"+sheet[1]] = True\nfor i in dic:\n res = res+1\nprint(res)\n \t\t \t\t \t\t \t \t\t \t\t \t\t\t \t", "n=int(input())\r\nempty2=[]\r\nfor a in range(n):\r\n leaf=input()\r\n empty=[]\r\n empty.append(leaf)\r\n if empty not in empty2:\r\n empty2.append(empty)\r\nprint(len(empty2))\r\n", "a = int(input(\"\"))\r\n\r\nss = []\r\nfor i in range(a):\r\n x = input(\"\")\r\n if x not in ss:\r\n ss.append(x)\r\n\r\nprint(len(ss))", "n=int(input())\nl=[]\nd=set(l)\nfor i in range(n):\n s=input()\n d.add(s)\nprint(len(d)) \n \n \t \t \t \t \t\t \t \t\t\t \t \t\t \t", "a=[]\r\ncount=0\r\nfor i in range(int(input())):\r\n string=input()\r\n if string not in a:\r\n count+=1\r\n a.append(string)\r\nprint(count)\r\n", "q=int(input())\nn=[]\nfor i in range(q):\n p=input()\n n.append(p)\nprint(len(set(n)))\n\t\t\t\t \t\t\t \t \t \t \t \t\t\t \t\t", "cases = int(input())\r\nst = set()\r\nwhile cases:\r\n cases -= 1\r\n s = input()\r\n st.add(s)\r\n\r\nprint(len(st))\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nl=set(l)\r\na=len(l)\r\nprint(a)\r\n#######", "print(len({input() for _ in range(int(input()))}))", "n = int(input())\nst = set()\nfor i in range(n):\n s = input()\n st.add(s)\n\nprint(len(st))\n\n\t\t\t \t \t\t \t\t\t \t\t \t \t\t \t\t \t", "n = int(input())\narr = []\nans = 0\nfor i in range(n):\n\ts = input()\n\tif s not in arr:\n\t\tarr.append(s)\n\t\tans += 1\nprint(ans)", "t=int(input())\r\na=set()\r\nfor i in range(t):\r\n x,y=input().split()\r\n res=x+\" \"+y\r\n a.add(res)\r\nprint(len(a))", "arr=[]\nfor i in range(int(input())):\n arr.append(input())\nx=[*set(arr)]\nprint(len(x))\n\t\t\t \t\t\t\t \t \t\t\t\t \t \t\t\t\t\t \t", "t = int(input())\nl = []\nfor _ in range(t):\n x = tuple(input().split())\n l.append(x)\nprint(len(set(l)))\n\n \t \t \t \t \t\t\t\t\t\t\t\t\t\t \t \t", "def main():\n n=int(input())\n arr=[]\n for _ in range(n):\n s=str(input())\n arr.append(s)\n leaves=set(arr)\n print(len(leaves))\nif __name__ == '__main__':\n main()\n\n \t \t\t\t \t \t\t\t \t \t \t\t", "n = int(input())\r\nleaf=[]\r\nfor i in range (n):\r\n newleaf = input()\r\n if newleaf in leaf:\r\n pass\r\n else:\r\n leaf.append(newleaf)\r\n\r\nprint(len(leaf))", "n = int(input())\r\n\r\narr = []\r\n\r\nfor i in range(n):\r\n line = input()\r\n (tree, color) = line.split()\r\n x = (tree, color)\r\n if x not in arr:\r\n arr.append(x)\r\n\r\nprint(len(arr))", "t = int(input())\nlst = []\nfor i in range(t):\n s = input()\n lst.append(s)\nprint(len(set(lst)))\n \t\t \t \t\t \t\t \t\t\t \t\t \t \t\t", "n = int(input())\r\nf = []\r\nfor i in range(n):\r\n ty, co = map(str, input().split())\r\n if [ty, co] not in f:\r\n f.append([ty, co])\r\nprint(len(f))\r\n", "while(True):\n l=[]\n try:\n teja=int(input())\n for i in range(teja):\n a=input()\n l.append(a)\n h=set(l)\n #print(h)\n print(len(h))\n except:\n break\n\t \t \t \t \t \t \t\t\t\t \t \t\t\t\t \t\t", "n = int(input())\nm = []\nres = n\nfor _ in range(n):\n s = input()\n if s not in m:\n m.append(s)\n else:\n res -= 1\nprint(res)\n\t \t\t\t\t \t\t\t\t\t \t\t \t \t \t\t\t\t\t\t\t\t", "# your code goes here\nx=int(input())\nl1=[]\nfor i in range(x):\n\ty=input()\n\tl1.append(y)\nl2=[]\nfor i in l1:\n\tif i not in l2:\n\t\tl2.append(i)\nprint(len(l2))\n\t \t\t \t \t \t\t \t \t\t\t", "n=int(input())\nl=[]\nfor i in range(n):\n s=input()\n l.append(s)\n lem=len(set(l))\nprint(lem)\n\t\t \t \t \t\t \t \t\t\t\t\t\t\t \t\t\t\t \t\t \t", "p=int(input())\nl=[]\nfor i in range(p):\n q=input()\n l.append(q)\nprint(len(set(l)))\n \t \t \t \t \t\t \t\t \t \t\t \t", "n=int(input())\r\n\r\nprint(len(set([input() for i in ' '*n])))", "T = int(input())\nA = set()\nfor i in range(T):\n\tS = input()\n\tA.add(S)\nprint(len(A))\n \t \t \t \t\t \t \t\t", "leaves = []\r\n\r\nfor _ in range(int(input())):\r\n leaves.append(input())\r\n \r\nprint(len(set(leaves)))", "t = int(input())\narr = []\nfor i in range(t):\n s = input()\n arr.append(s)\nprint(len(set(arr)))\n\t\t \t \t\t\t\t \t\t \t\t \t\t", "ans=set()\nfor _ in range(int(input())):\n a=input()\n ans.add(a)\nprint(len(ans))\n \t\t\t\t\t\t\t \t\t\t\t \t\t\t \t\t\t \t\t \t", "n=int(input())\r\nl1=[]\r\nfor i in range(n):\r\n key,value=map(str,input().split())\r\n if([key,value] not in l1):\r\n l1.append([key,value])\r\nprint(len(l1))\r\n", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n n1, n2 = input().split()\r\n s.add((n1, n2))\r\nprint(len(s))", "s=[]\r\nfor n in range(int(input())):\r\n\td=input()\r\n\tif d not in s:\r\n\t\ts.append(d)\r\nprint(len(s))", "n = int(input())\r\nmySet = set()\r\n\r\nfor i in range(n):\r\n a = input()\r\n mySet.add(a)\r\n\r\nc = 0\r\nfor item in mySet:\r\n c += 1\r\nprint(c)", "t = int(input())\narr = []\nfor i in range(t):\n s = input()\n arr.append(s)\n l=len(set(arr))\nprint(l)\n\t\t\t \t\t \t\t \t\t \t\t\t\t", "l=[]\nc=0\nfor _ in range(int(input())):\n s=input()\n if(s not in l):\n l.append(s)\n c+=1\nprint(c)\n \t\t \t\t\t \t\t\t\t \t \t \t\t \t\t", "p= 0\nd={}\nfor _ in range(int(input())):\n tree,color=input().split()\n if tree not in d:\n d[tree]=[color]\n if color not in d[tree]:\n d[tree].append(color)\nfor i in d:\n p+=len(d[i])\nprint(p)\n\t \n \t\t \t\t \t\t \t\t \t\t", "t=int(input())\nli=[]\n\nwhile t:\n\tfrnd=input()\n\tif frnd not in li:\n\t\tli.append(frnd)\n\tt-=1\nprint(len(li))\n\n \t\t\t \t \t\t \t\t\t \t\t\t\t \t \t", "n=int(input())\r\ns=[]\r\nfor i in range(0,n):\r\n e=input()\r\n s.append(e)\r\nprint(len(set(s)))\r\n", "import sys\r\n#import math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\n#pt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\ns = set()\r\nfor i in range(n):\r\n s.add(get_string())\r\nprint(len(s))", "k=int(input())\r\nl=[]\r\nfor i in range (k):\r\n x= input()\r\n l.append(x)\r\ns=set(l) \r\nprint(len(s))\r\n\r\n", "n=int(input())\r\nct=0\r\nx=[]\r\n\r\nfor j in range(n):\r\n s=input()\r\n if s not in x:\r\n x.append(s)\r\n ct=ct+1\r\nprint(ct)", "n=int(input())\r\nprint(len({input()for i in range(n)}))", "n=int(input())\r\ncount=0\r\nlist=[]\r\nsen=-1\r\nfor i in range(n):\r\n list.append(input().split())\r\nfor i in range(len(list)-1):\r\n if list[i]!=sen:\r\n for j in range(i+1,len(list)):\r\n if list[i]==list[j]:\r\n list[j]=sen\r\nfor i in range(len(list)):\r\n if list[i]!=sen:\r\n count+=1\r\n \r\n \r\nprint(count)\r\n", "def CountOfUnique(has_picked):\r\n count=len(set(has_picked))\r\n return count\r\nx=int(input())\r\nhas_picked=[]\r\nfor i in range(x):\r\n has_picked.append(input())\r\nprint(CountOfUnique(has_picked))", "T = int(input())\narr = []\nfor i in range(T):\n inp = input()\n if(inp not in arr):\n arr.append(inp)\nprint(len(arr))\n\t\t \t\t \t \t \t \t\t \t \t \t\t\t", "n = int(input())\r\nd = set()\r\nfor i in range(n):\r\n\ts = input()\r\n\tif s not in d:\r\n\t\td.add(s)\r\nprint(len(d))", "n = int(input())\r\nbase = []\r\nfor t in range(n):\r\n s = input()\r\n base.append(s)\r\nprint(len(set(base)))", "l = []\r\nn =int(input())\r\nfor _ in range(n):\r\n l.append(input())\r\n\r\nprint(len(set(l)))", "arr=set()\nfor _ in range(int(input())):\n s=input()\n arr.add(s)\nprint(len(arr))\n \t \t\t\t\t\t \t\t\t \t \t\t \t\t\t \t", "S= int(input())\nprint(len({input() for i in range(S)}))\n \t\t\t \t\t \t\t \t\t \t\t \t \t\t", "pan=int(input())\nk=set()\nfor i in range(pan):\n s=input()\n k.add(s)\nprint(len(k))\n\t\t \t\t \t \t \t\t \t\t \t\t \t \t\t", "n = int(input())\ns = []\nfor i in range(n):\n a = input()\n s.append(a)\nr = set(s)\nprint(len(r))\n\t\t \t \t\t \t\t\t\t \t \t\t\t\t\t \t \t\t", "n = int(input())\r\na = [input() for _ in range(n)]\r\nprint(len(set(a)))", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nl=list(set(l))\r\nprint(len(l))", "R= int(input())\nprint(len({input() for i in range(R)}))\n \t\t\t\t\t \t\t\t \t \t\t\t \t \t", "hojas = {}\nnro=int(input())\nfor i in range(nro):\n h = input()\n if h not in hojas:\n hojas[h]=1\n else:\n hojas[h]+=1\nprint(len(hojas))\n \t\t\t \t\t\t\t \t \t\t\t\t \t \t \t \t", "nk=int(input())\nlk=[]\nfor i in range(nk):\n s=input()\n lk.append(s)\n lemo=len(set(lk))\nprint(lemo)\n\t \t \t \t \t \t\t\t\t\t\t\t \t \t\t", "a=int(input())\nb=[]\nfor _ in range(a):\n b.append(input())\nprint(len(set(b)))\n \t\t\t \t \t\t \t\t\t\t \t \t \t \t", "t=int(input())\narr=[]\nfor i in range(t):\n k=input()\n arr.append(k)\nprint(len(set(arr)))\n \t \t \t\t\t\t\t\t\t \t \t", "def solve(l):\r\n b = [l[0]]\r\n for j in l:\r\n if j not in b:\r\n b.append(j)\r\n\r\n print(len(b))\r\n\r\n\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\nsolve(l)\r\n", "b=[]\r\nfor i in range(int(input())):\r\n t,c=map(str,input().split())\r\n a=(t,c)\r\n if a not in b:\r\n b.append(a)\r\nprint(len(b))\r\n ", "r=int(input())\r\nprint(len({input()for i in range(r)}))", "n = int(input())\r\nans = []\r\nfor i in range(n):\r\n s = input()\r\n ans.append(s)\r\nprint(len(set(ans)))", "n=int(input())\r\nSET=set()\r\nfor i in range(n):\r\n SET.add(input())\r\n\r\nprint(len(SET))\r\n", "t = int(input())\nans =[]\nfor i in range(t):\n ans.append(input())\nprint(len(set(ans)))\n\n \t\t \t\t \t\t \t \t \t \t\t\t \t\t\t", "n = int(input())\r\ntt = {}\r\nans = 0\r\nfor _ in range(n):\r\n t, c = map(str, input().split())\r\n if t not in tt:\r\n tt[t] = [c]\r\n ans += 1\r\n else:\r\n if c not in tt[t]:\r\n ans += 1\r\n tt[t] = tt[t] + [c] \r\nprint(ans) ", "n = int(input())\n\nleaves = []\n\nfor _ in range(n):\n leaf = input()\n if leaf not in leaves:\n leaves.append(leaf)\n\nprint(len(leaves))\n\n \t\t \t \t\t\t\t\t \t\t\t \t\t\t", "print(len({input() for i in range(int(input()))}))", "l=set()\nfor _ in range(int(input())):\n s=input()\n l.add(s)\nprint(len(l))\n\n \n \t\t\t \t \t \t \t\t \t \t\t \t\t", "x = int(input())\nlst = []\nfor i in range(x):\n\ts = input()\n\tlst.append(s)\nlst = list(set(lst))\nprint(len(lst))\n\t \t\t\t \t \t\t \t\t\t\t \t\t \t\t \t \t", "import sys\ndef print(a):\n sys.stdout.write(str(a)+'\\n')\ndef input():\n return sys.stdin.readline().strip()\n\nst=set()\nfor _ in range(int(input())):\n s=input()\n st.add(s)\nprint(len(st))\n\n \t \t\t\t\t\t \t \t \t\t\t \t\t \t \t\t\t", "l = []\nfor i in range(int(input())):\n s = input()\n l.append(s)\nprint(len(list(dict.fromkeys(l))))\n\t\t \t\t\t \t \t \t\t\t\t\t\t\t\t \t\t", "from collections import defaultdict\r\n\r\ng = defaultdict(list)\r\nn = int(input())\r\nval = 0\r\nfor _ in range(n):\r\n u, v = map(str, input().split())\r\n g[u].append(v)\r\n\r\nfor a in g:\r\n val2 = len(set(g[a]))\r\n val = val + val2\r\nprint(val)\r\n", "n=int(input())\ns=[]\nfor i in range(n):\n a=input()\n s.append(a)\ns=set(s)\nprint(len(s))\n \t\t \t\t \t \t\t\t\t \t \t \t \t \t \t", "n = int(input())\r\nans = 0\r\nc = []\r\nfor i in range(n):\r\n tc = input().split()\r\n if tc not in c:\r\n c.append(tc)\r\n ans += 1\r\nprint(ans)\r\n\r\n", "t = 0\r\nl = []\r\nfor _ in range(int(input())):\r\n s = input()\r\n if s not in l:\r\n t += 1\r\n l.append(s)\r\nprint(t)\r\n", "ll=set()\r\nfor _ in range(int(input())):\r\n ll.add(input())\r\nprint(len(ll))", "n= int(input())\r\ncolour_tree = []\r\ncollected = []\r\nfor i in range(n):\r\n s = input()\r\n colour_tree.append(s)\r\n\r\ncollected.append(colour_tree[0])\r\nfor i in colour_tree:\r\n if i==colour_tree[0]:\r\n continue\r\n else:\r\n col, tree = tuple(i.split(\" \"))\r\n for j in collected:\r\n if i==j:\r\n break\r\n else:\r\n collected.append(i)\r\nprint(len(collected))", "from collections import Counter\r\nt = int(input())\r\nleaves = []\r\n\r\nfor i in range(t):\r\n s = input()\r\n leaves.insert(i, s)\r\n\r\ndata = dict(Counter(leaves))\r\nprint(len(data))", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n m = input()\r\n if s.count(m) == 0:\r\n s.append(m)\r\nprint(len(s))", "s = set()\r\nt = int(input())\r\nfor i in range(t):\r\n a = input()\r\n s.add(a)\r\nprint(len(s))\r\n \r\n ", "n=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n temp=input()\r\n if(temp not in lst):\r\n lst.append(temp)\r\nprint(len(lst))", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\ta=input()\r\n\tif(a not in l):\r\n\t\tl.append(a)\r\nprint(len(l))", "k=int(input())\nprint(len({input() for i in range(k)}))\n \t\t\t \t \t\t\t\t \t\t \t \t \t", "u=[]\nfor _ in range(int(input())):\n b=input()\n u.append((b))\nprint(len(set(u)))\n\n\t\t \t \t\t \t\t\t \t \t\t \t \t\t \t", "l=[]\r\nfor i in range(int(input())):\r\n x=input()\r\n if x not in l:\r\n l.append(x)\r\nprint(len(l))", "n=int(input(\"\"))\r\narr1=[]\r\nn1='b'\r\ncount=0\r\nfor i in range(0,n):\r\n x=str(input(\"\"))\r\n arr1.append(x)\r\nfor j in range(0,n-1):\r\n for k in range(j,n-1):\r\n n1=n1+'2'\r\n if(arr1[j]==arr1[k+1]):\r\n del arr1[k+1]\r\n arr1.insert(k+1,n1)\r\n count+=1\r\nprint(n-count)", "a=[]\r\nn=int(input())\r\nk=0\r\nfor i in range(0,n):\r\n s=str(input())\r\n s=s.replace(' ','1')\r\n for b in range(0,len(a)):\r\n if a[b]==s:\r\n k=k+1\r\n if k==0:\r\n a.append(s)\r\n else:\r\n k=0\r\nprint(len(a))\r\n", "n=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n lst.append(input())\r\nprint(len(set(lst)))", "\r\nimport sys\r\nimport math\r\nfrom collections import Counter\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\ndef inps():\r\n return str(input())\r\n \r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n \r\ndef inlst():\r\n return(list(map(str,input().split())))\r\n \r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split())) \r\n\r\nn = inp()\r\nlea = []\r\nfor i in range(n):\r\n lea.append(inps())\r\n\r\nlea = list(map(lambda s: s.strip(), lea))\r\nprint(len(list(set(lea))))\r\n \r\n ", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = [input().rstrip() for _ in range(n)]\r\n\r\nprint(len(set(data)))", "n = int(input())\r\n\r\nk = set()\r\n\r\nfor i in range(n):\r\n S = input()\r\n k.add(S)\r\n\r\nprint(len(k))", "no_of_leaves = int(input())\n\nleaf_color = [input().split(\" \") for i in range(no_of_leaves)]\n\ncolor = [i[1] for i in leaf_color]\n\nunique = 0\nfor c in set(color) :\n leaf = [lc[0] for lc in leaf_color if lc[1] == c]\n unique += len(set(leaf))\n\nprint(unique)\n", "t=int(input())\narr=[]\nc=0\nfor i in range(t):\n s=list(input().split())\n if s in arr:\n continue\n else:\n c=c+1\n arr.append(s)\nprint(c) \n \n \n\t\t \t\t\t\t \t \t\t\t \t \t \t \t", "# Indian Summer\r\nleaves = []\r\nfor _ in range(int(input())):\r\n temp = input()\r\n leaves.append(temp)\r\n\r\nprint(len(set(leaves)))", "def q44a():\n\tn = int(input())\n\tname_set = set()\n\tfor _ in range(n):\n\t\tname = input()\n\t\tname_set.add(name)\n\tprint(len(name_set))\n\nq44a()", "ans = set()\nfor _ in range(int(input())):\n\ta,b = map(str,input().split())\n\tans.add((a,b))\nprint(len(ans))\n \t\t\t \t\t\t \t\t\t\t \t \t\t\t \t \t", "t=int(input())\r\nfreq={}\r\nfor i in range(t):\r\n s=input()\r\n if s in freq:\r\n freq[s]+=1\r\n else:\r\n freq[s]=1\r\nprint(len(freq))", "# your code goes here\r\nn=int(input())\r\nl=[]\r\nfor i in range(0,n):\r\n\tinp=input()\r\n\tl.append(inp)\r\n#print(l)\r\ns=set(l)\r\n#print(s)\r\nprint(len(s))\r\n", "ar=[ ]\r\nfor _ in range (int(input())):\r\n s=input()\r\n ar.append(s)\r\nprint(len(set(ar)))\r\n", "number = int(input())\n\nlist_leaf = []\ncounter = 0\n\nfor i in range(number):\n in_s = str(input()).split()\n new = in_s[0] + '_' + in_s[1]\n if new in list_leaf:\n pass\n else:\n counter += 1\n list_leaf.append(new)\nprint(counter)\n", "v=[]\nfor i in range(int(input())):\n a=input()\n s=0\n v.append(a)\nprint(len(set(v)))\n\t \t\t \t\t \t\t \t \t \t \t \t", "n = int(input())\n\nleaves = dict()\nfor i in range(0, n):\n leaves.update({input(): 1})\n\nprint(len(leaves))\n\t\t \t \t \t \t\t\t \t \t \t \t\t \t\t \t\t", "n=int(input())\ntemp=0\nstr=[]\nfor i in range(0,n):\n str.append(input())\n i=i+1\nfor i in range(0,n):\n count=0\n for j in range(0,i):\n if str[i]==str[j]:\n count=count+1\n j=j+1\n if count == 0:\n temp=temp+1\n i=i+1\nprint(temp)\n \n\t \t\t \t\t\t \t \t\t\t \t\t\t\t \t\t \t", "testcases = int(input())\nsetSet = {'dummyValue'}\nwhile(testcases):\n inputValue = input()\n setSet.add(inputValue)\n testcases-=1\nprint(len(setSet)-1)\n\t\t\t\t\t \t \t\t\t\t\t\t \t \t\t\t\t \t \t", "c=0\nl=[]\nfor i in range(int(input())):\n a=input()\n if a not in l:\n l.append(a)\n c+=1\nprint(c)\n\t\t \t \t\t\t \t\t \t \t\t \t\t\t", "n =int(input())\narr = []\nfor i in range(n):\n \n arr.append(str(input()))\n\nans = set(arr)\nprint(len(ans)) \n \t \t \t \t\t \t\t \t\t \t \t\t \t\t", "n=int(input())\r\nl=list()\r\nfor i in range(0,n):\r\n p=input().split(\" \")\r\n if p not in l:\r\n l.append(p)\r\nprint(len(l))", "n=int(input())\na=[]\nfor i in range(0,n):\n s=input()\n if s not in a:\n a.append(s)\nprint(len(a))\n \t\t\t \t \t\t\t\t \t \t\t \t\t", "lst =[]\nn=int(input())\nfor j in range(n):\n s=input()\n lst.append(s)\na=set(lst)\nprint(len(a))\n \n\t\t\t\t \t \t \t \t \t \t \t \t\t", "n=int(input())\nd={}\nwhile(n>0):\n a,b=map(str,input().split())\n # s=set()\n if a in d:\n d[a].append(b)\n else:\n d[a]=[b]\n n-=1\nfor a in d:\n d[a]=set(d[a])\nc=0\nfor a in d:\n c=c+len(d[a])\nprint(c)\n\t \t \t\t\t\t \t\t \t \t \t \t", "t=set()\nfor i in range(int(input())):\n t.add(input().strip())\nprint(len(t))\n \t\t\t \t \t\t\t\t \t \t\t \t\t", "n=int(input())\narr=[]\nfor i in range(n):\n t=input()\n if t not in arr:\n arr.append(t)\nprint(len(arr))\n \t \t \t\t\t\t\t\t \t\t\t \t\t\t\t \t\t \t \t", "n=int(input())\nlist=set()\nfor i in range(n):\n s=input()\n list.add(s)\nprint(len(list))\n \t \t\t \t\t \t \t\t\t \t \t \t", "# your code goes here\nd={}\nn=int(input())\nfor _ in range(n):\n\ts,c=map(str,input().split())\n\tif c in d.keys():\n\t\td[c].append(s)\n\telse:\n\t\td[c]=list()\n\t\td[c].append(s)\nc=0\nfor k in d:\n\tc+=len(set(d[k]))\nprint(c)\n\t \t \t\t \t\t\t \t\t\t\t\t \t \t \t\t\t\t", "n=int(input())\nl=[]\nfor i in range(0,n):\n s=input()\n l.append(s)\nl=set(l)\nprint(len(l))\n\t \t\t \t \t\t \t \t \t\t \t \t", "n = int(input())\nleaves = [ input().strip() for i in range(n) ]\nprint(len(set(leaves)))\n", "n=int(input());s=[]\nfor i in range(0,n):\n s.append(input())\ns=list(set(s))\nprint(len(s))", "n=int(input())\r\nl=[];ans=0\r\nfor i in range(n):\r\n a=input().split(\" \")\r\n if a not in l:\r\n l.append(a);ans+=1\r\nprint(ans)\r\n", "amount = int(input())\r\nlist_of_flowers = []\r\ncounter = 0\r\nfor i in range(amount):\r\n info = input().split()\r\n if info not in list_of_flowers:\r\n counter += 1\r\n list_of_flowers.append(info)\r\nprint(counter)", "# /**\r\n# * author: brownfox2k6\r\n# * created: 01/08/2023 14:52:42 Hanoi, Vietnam\r\n# **/\r\n\r\nprint(len({*[*open(0)][1:]}))", "n = int(input())\r\nmas = []\r\nres = 0\r\n\r\nfor i in range(n):\r\n buf = input()\r\n if buf not in mas:\r\n res += 1\r\n mas.append(buf)\r\nprint(res)", "t=int(input())\narr=[]\nu=0\nfor i in range(t):\n x=input()\n if x not in arr:\n u=u+1\n arr.append(x)\nprint(u)\n \t\t\t \t\t\t\t \t \t \t\t\t\t\t \t\t", "x = []\r\nt = int(input())\r\nfor i in range(t):\r\n a = input()\r\n x.append(a)\r\nprint(len(set(x)))\r\n", "a = set()\nfor i in range(int(input())):\n a.add(input())\nprint(len(a))\n \t\t \t\t \t \t \t \t\t \t\t \t\t\t", "# your code goes here\r\nt = int(input())\r\na = []\r\nwhile t > 0:\r\n b = input()\r\n a.append(b)\r\n t = t - 1\r\na = set(a)\r\nprint(len(a))", "n=int(input())\nl=[]\nfor i in range(n):\n str=input()\n l.append(str)\nq=list(set(l))\nprint(len(q))\n\t\t\t\t\t\t \t\t \t \t \t\t\t\t \t \t\t\t", "n = int(input())\r\ns = set()\r\nfor r in range(n):\r\n\tst = input()\r\n\ts.add(st)\r\nprint(len(s))", "b=[]\r\nfor i in range(int(input())):\r\n a=input()\r\n b.append(a)\r\nprint(len(set(b)))", "k = int(input())\r\nleaves = []\r\nfor a in range(k):\r\n leaf = input().split()\r\n if leaf not in leaves:\r\n leaves.append(leaf)\r\nprint(len(leaves))\r\n", "# LUOGU_RID: 101449965\n_, *s = open(0)\r\nprint(len(set(s)))", "res = []\r\nfor _ in range(int(input())):\r\n k = input().split()\r\n if k not in res:\r\n res.append(k)\r\nprint(len(res))", "t = int(input())\nsp = []\nfor it in range(t):\n s = input()\n sp.append(s)\n \nprint(len(set(sp)))\n\n \t \t \t\t \t \t\t\t \t\t\t\t \t", "print(len(set([input() for x in range(int(input()))])))", "t=int(input())\nlst=set()\nfor i in range(0,t):\n sam=input()\n lst.add(sam)\nprint(len(lst))\n \t \t\t\t\t\t\t\t\t\t\t \t\t\t \t\t\t \t", "a=int(input())\ncount=0\ndic={}\nfor b in range(0,a):\n c=input()\n if c not in dic:\n dic[c]=1\n count=count+1\nprint(str(count))\n\n \t\t\t \t\t\t\t\t\t\t\t \t\t\t\t\t \t \t\t", "l=[]\nfor _ in range(int(input())):\n n=input()\n l.append(n)\nl=set(l)\nprint(len(l))\n \n \t \t \t\t\t \t \t\t\t\t\t\t\t \t \t\t\t \t", "# your code goes here\nc=0\nd={}\nfor _ in range(int(input())):\n\ta,b=map(str,input().split())\n\tif a in d:\n\t\tif b not in d[a]:\n\t\t\td[a].append(b)\n\telse:\n\t\td[a]=[]\n\t\td[a].append(b)\nfor i in d:\n\tc+=len(d[i])\nprint(c)\n\t \t\t\t\t \t\t\t \t\t \t \t\t \t\t\t\t \t\t", "n=int(input())\r\ns=set()\r\nfor i in range(0,n):\r\n\ts.add(input())\r\nprint(len(s))", "n=int(input())\r\ns=set()\r\nfor i in range(n):\r\n l=input()\r\n s.add(l)\r\nprint(len(s)) \r\n\r\n \r\n \r\n", "n_leaves= int(input())\ns=set()\nc=0\nfor i in range(n_leaves):\n d=input()\n s.add(d)\n \nfor j in range(len(s)):\n c=c+1\n \nprint(c)\n \t \t \t \t \t \t \t \t\t\t\t \t", "def indiansummer(arr,str):\n ans = set(arr)\n print(len(ans))\nn = int(input())\nlst =[]\nfor i in range(n):\n str = input()\n lst.append(str)\nindiansummer(lst,str)\n \t\t\t \t \t\t \t \t\t \t\t\t\t \t", "a=[]\r\nc=0\r\nfor i in range(int(input())):\r\n\ts=input()\r\n\tif s not in a:\r\n\t\tc+=1\r\n\t\ta.append(s)\r\nprint(c)", "n =int(input())\narr=[]\nfor i in range(n):\n s = input()\n \n arr.append(s)\nl = list(set(arr))\nprint(len(l))\n\t \t\t\t\t\t\t \t\t\t\t\t \t \t\t \t \t\t \t \t\t", "n=int(input())\nv=[]\nfor i in range(n):\n\ta=input()\n\ts=0\n\tv.append(a)\nprint(len(set(v)))\n\n \t \t\t \t \t \t \t \t \t \t\t", "a=int(input())\r\nl=[]\r\nfor i in range(a):\r\n x=input()\r\n if x not in l:\r\n l.append(x)\r\nprint(len(l))", "p = int(input())\nprint(len({input() for i in range(p)}))\n\t \t\t\t \t\t\t \t\t \t\t\t\t \t \t\t", "X=int(input())\r\ni=0\r\nK=[]\r\nwhile i<X:\r\n T=str(input())\r\n K.append(T)\r\n i+=1\r\nXX=set(K)\r\nprint(len(XX))\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n vls = set()\r\n for _ in range(n):\r\n s = input()\r\n vls.add(s)\r\n print(len(vls))\r\n", "n=int(input())\r\nl=[]\r\ncount=0\r\nfor i in range(n):\r\n fruit,colour=input().split()\r\n v=str(len(fruit))\r\n if l.count(fruit+v+colour)==0:\r\n l.append(fruit+v+colour)\r\n count+=1\r\nprint(count)", "n = int(input())\nbouquet = set()\nfor i in range(n):\n bouquet.add(input())\nprint(len(bouquet))", "t=int(input())\r\nl=[]\r\nc=0\r\nfor i in range(0,t):\r\n s=str(input())\r\n if s in l:\r\n pass\r\n else:\r\n l.append(s)\r\n c=c+1\r\nprint(c)\r\n\r\n", "numDeLeaves = int(input())\r\ntrees = dict()\r\nfor i in range(numDeLeaves):\r\n tree = input()\r\n trees[tree] = \"*\"\r\nprint(len(trees))", "n=int(input())\nl=[]\nc=0\nwhile n>0:\n l.append(input())\n n-=1\nl=set(l)\nprint(len(l))\n\t \t\t \t \t\t\t \t \t \t\t\t\t \t", "n = int(input())\r\nans = set()\r\nfor _ in range(n):\r\n ans.add(input().strip())\r\nprint(len(ans))\r\n", "n = int(input())\r\nmySet = set()\r\nwhile n != 0:\r\n flower = input()\r\n mySet.add(flower)\r\n n -= 1\r\nprint(len(mySet))\r\n\r\n", "n=int(input())\nstr=[]\nfor i in range(n):\n t=input()\n str.append(t)\nprint(len(set(str)))\n\t\t \t\t \t \t \t \t \t \t\t \t \t\t\t", "my_set = set({})\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n leafcolor = input()\r\n my_set.add(leafcolor)\r\n\r\nprint(len(my_set))", "a=set()\r\nfor i in range(int(input())):\r\n x=input()\r\n if x in a: continue\r\n a.add(x)\r\nprint(len(a))\r\n \r\n \r\n", "n=int(input(''))\r\nleaves_list=[]\r\nfor i in range(n):\r\n inp=input('')\r\n leaves_list.append(inp)\r\nset_leaves=list(set(leaves_list))\r\nprint(len(set_leaves))", "n=int(input())\narr=[]\nfor i in range(n):\n str=input()\n arr.append(str)\n l=len(set(arr))\nprint(l)\n \t \t\t \t \t\t \t \t \t\t\t \t\t", "n=int(input())\r\nc=0\r\nresult=[]\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(input().split())\r\nfor i in range(n):\r\n\tif l[i] not in result:\r\n\t\tresult.append(l[i])\r\n\t\tc+=1\r\nprint(c)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-03 23:20:47\nLastEditTime: 2021-11-03 23:25:29\nDescription: Indian Summer\nFilePath: CF44A.py\n'''\n\n\ndef func():\n n = int(input())\n leaves = []\n for _ in range(n):\n tree, color = input().strip().split()\n if [tree, color] not in leaves:\n leaves.append([tree, color])\n return len(leaves)\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "n = int(input())\nar = []\nfor _ in range(n):\n s = input()\n ar.append(s)\n\nprint(len(set(ar)))\n\n\n\t\t \t\t \t \t\t \t \t \t\t \t \t\t\t \t", "tt=int(input())\nx=[]\nfor i in range(tt):\n t=input()\n x.append(t)\nx=set(x)\nprint(len(x))\n\t \t\t\t \t\t\t\t \t\t \t \t \t\t\t\t\t", "n=int(input())\nl=[]\nfor i in range(n):\n t=input()\n l.append(t)\nk=set(l)\no=list(k)\nprint(len(o))\n\t\t\t \t\t \t \t\t \t \t \t\t \t\t\t\t", "xin=int(input())\nst=[]\nfor i in range(xin):\n ris=str(input())\n st.append(ris)\nele=set(st)\nprint(len(ele))\n \t \t \t \t \t\t\t\t \t\t \t\t\t \t\t \t", "n = int(input())\r\ntrees = []\r\nfor i in range(0,n):\r\n trees.append(str(input()))\r\ntrees = list(set(trees))\r\nprint(len(trees))", "df=set()\nfor i in range(int(input())):\n df.add(input())\nprint(len(df))\n\t \t \t\t\t \t\t\t \t\t\t\t\t \t \t\t \t\t", "a=[]\r\nfor i in range(int(input())):\r\n k=input()\r\n a.append(k)\r\nprint(len(list(set(a))))", "n = int(input())\nboque = set()\nfor i in range(n):\n boque.add(input())\nprint(len(boque))\n\t \t \t\t\t \t\t \t \t \t\t \t\t\t \t\t", "\r\n\r\n\r\n\r\nt=[]\r\n\r\n\r\n\r\n\r\nfor j in range(int(input())):\r\n a=input()\r\n if j==0:\r\n t.append(a)\r\n else:\r\n if a not in t:\r\n t.append(a)\r\n else:\r\n pass\r\n\r\nprint(len(t))\r\n", "t=int(input())\r\n\r\nprint(len(set([input() for i in ' '*t])))", "l=[]\nfor i in range(int(input())):\n l.append(input())\nprint(len(list(set(l))))\n \t\t \t \t\t\t \t\t\t \t\t \t \t\t \t \t\t", "s = set()\r\n\r\nt = int(input())\r\n\r\nfor i in range(t):\r\n\ta, b = [x for x in input().split()]\r\n\ts.add((a,b))\r\n\r\nprint(len(s))", "s=set()\nfor _ in range(int(input())):\n st=input()\n s.add(st)\nprint(len(s))\n\t \t\t \t\t \t\t\t \t \t \t \t \t\t", "tst = int(input())\r\n\r\nvals = []\r\n\r\nfor i in range(0,tst):\r\n arr = [str(x) for x in input().split()]\r\n if arr not in vals:\r\n vals.append(arr)\r\n\r\nprint(len(vals))", "import sys\ndef input():\n return sys.stdin.readline().strip()\ndef print(n):\n return sys.stdout.write(str(n)+\"\\n\")\nd=dict()\nfor _ in range(int(input())):\n a=input()\n if a not in d:\n d[a]=1\n \nprint(len(d))\n \t \t \t \t \t \t\t \t \t \t \t \t", "t = int(input())\nlst = []\nfor i in range(t):\n s = input()\n lst.append(s)\n r = len(set(lst))\nprint(r)\n\t \t\t \t\t\t \t \t \t \t\t \t\t\t\t", "n = int(input())\nres = len(set(input() for _ in range(n)))\nprint(res)\n", "ans=[]\nfor i in range(int(input())):\n inp=input()\n ans.append(inp)\nprint(len(list(set(ans))))\n \t \t\t \t\t \t\t\t\t \t \t \t\t\t\t", "l = []\nfor _ in range(int(input())):\n a = input()\n l.append(a)\n c = set(l)\nprint(len(c))\n\n\n\t\t \t\t\t \t\t \t\t \t \t \t\t\t\t\t", "num = int(input())\r\nlst = []\r\nfor i in range(num):\r\n lst.append(input())\r\nprint(len(set(lst)))", "def indian_summer():\r\n n = int(input())\r\n b = set()\r\n while n > 0:\r\n l = str(input())\r\n b.add(l)\r\n n -= 1\r\n\r\n print(len(b))\r\n\r\nif __name__ == '__main__':\r\n indian_summer()", "n=int(input())\n#st={}\nst=set()\nfor i in range(n):\n p=input()\n st.add(p)\nprint(len(st))\n\t \t\t \t\t\t \t\t\t\t\t\t\t \t\t \t \t \t", "l = []\nfor t in range(int(input())):\n l.append(input())\nprint(len(set(l)))\n \t\t \t \t \t \t\t \t", "int1=int(input())\r\nd=[]\r\nfor i in range(int1):\r\n d.append(input().strip())\r\n#print(d)\r\nprint(len(set(d)))", "tc=int(input())\nleaves = []\nc = 0\nfor i in range(tc):\n leaves.append(input())\nprint(len(set(leaves))) \n \t\t\t\t \t \t\t\t \t \t \t \t\t", "t=int(input())\nres={'a'}\nfor i in range(t):\n\tval=input()\n\tres.add(val)\nprint(len(res)-1)\n\t\n\t\t \t\t\t \t\t\t\t\t\t \t \t \t\t \t \t\t", "n=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n s=input()\r\n a.append(s)\r\n if(s not in b):\r\n b.append(s)\r\nprint(len(b))", "T = int(input())\na = []\nfor _ in range(T):\n s = input()\n a.append(s)\nans = set(a)\nprint(len(ans))\n \n \n\t \t\t \t \t\t\t \t \t \t\t \t\t \t\t", "n=int(input())\r\na=[]\r\ncnt=0\r\nfor i in range(n):\r\n b=input()\r\n if b not in a:\r\n a.append(b)\r\n cnt=cnt+1\r\nprint(cnt)", "n = int(input())\r\na = []\r\nfor _ in range(n):\r\n x = input()\r\n if x in a : continue\r\n else :\r\n a.append(x)\r\nprint(len(a))", "n=int(input())\r\n\r\nd={}\r\n\r\nfor i in range(n):\r\n leaf= input()\r\n if leaf not in d:\r\n d[leaf]=1\r\n \r\nprint(len(d))\r\n ", "n=int(input())\r\nl=[]\r\nfor i in range(0,n):\r\n l.append(input())\r\ndict1={}\r\ncount=0\r\nfor i in range(0,len(l)):\r\n if(l[i] not in dict1):\r\n dict1[l[i]]=1\r\n count=count+1\r\n else:\r\n dict1[l[i]]=dict1[l[i]]+1\r\n \r\n\r\nprint(count)\r\n", "n=int(input())\nS=set()\nfor i in range(n):\n s=input()\n S.add(s)\n#print(S)\nprint(len(S))", "k=[]\r\nfor i in range(int(input())):\r\n k.append(input())\r\nk=list(set(k))\r\nprint(len(k))\r\n ", "tc = int(input())\narr = []\nfor i in range(tc):\n str = input()\n arr.append(str)\n l=len(set(arr))\nprint(l)\n \t\t\t \t \t\t\t\t \t\t \t \t \t\t\t\t", "import sys\nd=dict()\nfor t in range(int(sys.stdin.readline())):\n a,b=map(str,sys.stdin.readline().split())\n if a not in d:\n d[a]=set()\n d[a].add(b)\n else:d[a].add(b)\nc=0\nfor i in d:\n c+=len(d[i])\nprint(c)\n \t\t \t\t \t\t \t\t\t\t \t \t\t \t \t \t\t", "d = {}\r\nfor i in range(int(input())):\r\n s = list(map(str, input().split()))\r\n if s[0] not in d:\r\n d[s[0]] = [s[1]]\r\n else:\r\n if (s[1] not in d[s[0]]):\r\n d[s[0]].append(s[1])\r\nans = 0\r\n# print(d)\r\nfor key in d:\r\n for value in d[key]:\r\n ans += 1\r\nprint(ans)", "T:int = int(input())\nentries:set = set()\n\nfor _ in range(T):\n\tentry = input()\n\tentries.add(entry)\nprint(len(entries))\n\t\t \t \t \t \t\t \t\t\t \t \t\t\t\t \t\t", "n=int(input())\r\nmySet=set()\r\nfor i in range(n):\r\n mySet.add(input())\r\n\r\nprint(len(mySet))", "n=int(input())\r\nmas=[]\r\nfor i in range(n):\r\n mas.append(input())\r\n\r\nmas=set(mas)\r\nprint(len(mas))", "dic ={}\nfor _ in range(int(input())):\n n , m = map(str,input().split())\n if m in dic.keys():\n dic[m].append(n)\n else:\n dic[m]=list()\n dic[m].append(n)\nc=0\nfor k in dic:\n c+=len(set(dic[k]))\nprint(c)\n\n\t\t \t\t\t \t \t\t \t \t \t\t \t\t \t", "x=int(input())\r\nls=[]\r\nfor i in range(x):\r\n ls.append(input())\r\nprint(len(list(set(ls))))\r\n", "from sys import stdin,stdout\n# from sys import setrecursionlimit\n# from collections import defaultdict\n# from math import gcd,ceil,sqrt\n# setrecursionlimit(int(1e5))\n#input,print = stdin.readline,stdout.write\n# t = 1\nt = int(input())\nx = set()\nfor _ in range(t):\n\ts = input().strip()\n\tx.add(s)\nprint(len(x))\n\t \t \t\t\t \t \t\t\t \t\t \t \t\t", "xin=int(input())\r\nst=[]\r\nfor i in range(xin):\r\n ris=str(input())\r\n st.append(ris)\r\nele=set(st)\r\nprint(len(ele))", "a=[]\nfor _ in range(int(input())):\n n=input()\n if n not in a:\n a.append(n)\nprint(len(a))\n\t \t\t \t\t \t\t \t\t\t\t \t \t\t \t \t", "n = int(input())\nli = []\nfor i in range(n):\n x = list(map(str,input().split()))\n li.append(x)\nc=0\nfor i in range(n):\n if li[i] not in li[i+1:]:\n c += 1\n \nprint(c)\n \t\t \t\t\t \t\t\t\t\t \t \t \t \t \t \t\t", "n=int(input())\nlista=[]\nfor i in range(0,n):\n s=input()\n lista.append(s)\nprint(len(set(lista)))\n\t \t \t\t \t\t\t \t \t", "n1=[]\r\nfor x in range(int(input())):\r\n\tn,m=input().strip().split()[:2]\r\n\tif (n,m) not in n1:\r\n\t\tn1 .append((n,m))\r\nprint(len(n1))\r\n", "t = int(input())\nlst4 = []\nwhile(t):\n stri = input()\n lst4.append(stri)\n t = t - 1\nprint(len(set(lst4)))\n \t\t \t\t\t \t \t \t\t \t\t\t \t", "n = int(input())\r\nl1 = []\r\nfor _ in range(n):\r\n l1.append(input())\r\nprint(len(set(l1)))", "n=int(input())\ns=set()\nwhile n>0:\n s.add(input())\n n=n-1\n\nprint(len(s))\n\n \t \t\t \t\t\t\t\t \t \t\t \t\t\t\t \t", "x=int(input())\r\ncount=0\r\na=[]\r\nfor i in range (x):\r\n y=input()\r\n if y not in a:\r\n count+=1\r\n a.append(y)\r\nprint(count)\r\n", "s = set()\nfor _ in range(int(input())):\n s.add(input().strip())\nprint(len(s))\n \t\t \t \t\t \t\t \t \t \t\t \t", "print(len(list(set([input() for i in range(int(input()))]))))\r\n", "x=int(input())\nl=[]\nfor i in range(x):\n\ta=input()\n\tl.append(a)\nprint(len(set(l)))\n \t \t \t\t\t\t\t \t\t \t\t \t \t\t \t", "a=[]\nfor h in range(int(input())):\n\ts=input()\n\ta.append(s)\nprint(len(set(a)))\n\t \t\t \t \t\t \t\t\t \t \t\t \t\t\t \t", "n=int(input())\nleaves=[]\nfor i in range(n):\n a=input()\n leaves.append(a)\ns=set(leaves)\nprint(len(s))\n\t\t \t \t\t \t \t\t\t \t \t\t\t\t\t \t\t", "\nfrom sys import stdin\n\ninput = stdin.readline\nii = lambda: int(input())\nra = lambda typ : list(map(typ, input().split()))\nrv = lambda typ : map(typ, input().split())\nrs = lambda: input().rstrip()\nmod = 1000000007\n\ndef main():\n\tx = set()\n\tfor _ in range(ii()):\n\t\tx.add(tuple(ra(str)))\n\tprint(len(x))\n\nif __name__ == \"__main__\":\n\tfor _ in range(1): main()\n\t\t \t\t \t\t \t\t\t\t \t\t \t\t\t\t \t", "s=set()\r\nfor _ in range(int(input())):\r\n\tl=input()\r\n\ts.add(l)\r\nprint(len(s))", "vinay = int(input())\nlists = []\nfor j in range(vinay):\n str = input()\n lists.append(str)\nq = list(set(lists))\nprint(len(q))\n\t\t \t\t\t\t \t\t \t\t\t \t\t \t \t \t", "n=int(input())\nd=dict()\nfor i in range(n):\n s=input()\n d[s]=d.get(s,0)+1 \nprint(len(d))\n \t \t\t \t\t \t\t\t\t\t\t\t \t \t \t \t", "n=int(input())\nl=[]\nfor i in range(n):\n\ta=input()\n\tl.append(a)\nli=[]\t\nc=0\nfor i in l:\n\tif i not in li:\n\t\tli.append(i)\n\t\tc=c+1\nprint(c)\t\t\n\t\t\t \t\t\t\t \t\t\t\t\t \t \t\t \t \t\t", "num=int(input())\n\nL=[]\n\nfor i in range(num):\n L.append(input())\n \ns=set(L)\nn=len(s)\nprint(n)\n \t\t\t \t \t \t \t \t\t \t\t \t\t \t\t\t", "c = 0\nd={}\nfor _ in range(int(input())):\n tree,color=input().split()\n if tree not in d:\n d[tree]=[color]\n if color not in d[tree]:\n d[tree].append(color)\nfor i in d:\n c+=len(d[i])\nprint(c)\n \t\t\t \t \t\t\t\t\t \t\t \t\t \t \t\t \t \t", "c2= 0\nd={}\nfor _ in range(int(input())):\n tree,color=input().split()\n if tree not in d:\n d[tree]=[color]\n if color not in d[tree]:\n d[tree].append(color)\nfor i in d:\n c2+=len(d[i])\nprint(c2)\n \t\t \t \t\t \t\t\t\t\t\t\t\t\t \t\t \t \t\t \t", "#44A\r\nn=int(input())\r\ncolor_list=[]\r\nfor i in range(n):\r\n color=input()\r\n color_list.append(color)\r\ncolor_list=set(color_list)\r\nprint(len(color_list))", "#RAVENS #TEAM_2 #ESSI-DAYI_MOHSEN-LORENZO\nd = dict()\nfor i in range(int(input())):d[input()] = 1\nprint(len(d))", "n = int(input())\r\nleaves = set()\r\nfor i in range(n):\r\n tree, color = input().split()\r\n leaf = (tree, color)\r\n if leaf not in leaves:\r\n leaves.add(leaf)\r\nprint(len(leaves))\r\n", "def main ():\r\n n = int(input())\r\n list = []\r\n for i in range (n):\r\n leaf = input()\r\n list.append(leaf)\r\n distinct = set(list)\r\n print(len(distinct))\r\nmain()\r\n", "rm = int(input())\nk = []\nfor w in range(rm):\n v = input()\n k.append(v)\nq = list(set(k))\nprint(len(q))\n\n#2010030296's solution\n \t\t\t\t\t\t\t\t \t\t\t\t \t\t\t \t\t\t \t \t", "t=int(input())\ns=set()\nfor _ in range(t):\n a=input()\n s.add(a)\n\nprint(len(s))\n \n \t \t \t\t\t \t\t\t\t \t \t \t\t\t \t \t", "MySet = set()\r\nfor i in range(int(input())):\r\n MySet.add(input())\r\nprint(len(MySet))\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Mashhad for few days\r\n# Caption: Finally happened what should be happened\r\n# CodeNumber: 691\r\n", "a=[]\ncount=0\nfor i in range(int(input())):\n string=input()\n if string not in a:\n count+=1\n a.append(string)\nprint(count)\n", "n=int(input())\r\np=[]\r\nl=tuple(input().split())\r\np.append(l)\r\na=1\r\nfor i in range(n-1):\r\n l=tuple(input().split())\r\n if(l in p):\r\n pass\r\n else:\r\n p.append(l)\r\n a+=1\r\n \r\nprint(a)\r\n", "l=[]\r\nfor n in range(int(input())):\r\n l.append(input())\r\n#print(l)\r\nprint(len(set(l)))\r\n#print(set(l))", "a=[]\nfor i in range(int(input())):\n b=input().strip()\n if b not in a:\n a.append(b)\nprint(len(a))", "n=int(input())\r\nl=[]\r\nc=0\r\nwhile(n):\r\n n-=1\r\n m=list(input().split())\r\n \r\n if(m not in l):\r\n o=[]+m\r\n l.append(o)\r\n \r\n \r\n \r\n c+=1\r\nprint(c)", "# your code goes here\nn=int(input())\nl=[]\nwhile n!=0:\n\tn=n-1\n\ts=input()\n\tl.append(s)\nprint(len(set(l)))\n\t \n \t\t \t\t\t\t\t \t\t \t \t \t\t\t\t\t\t\t", "alena = []\r\na = int(input())\r\nfor x in range(a):\r\n\tc = input().split(\" \")\r\n\tif c not in alena:\r\n\t\talena.append(c)\r\nprint(len(alena))", "# Indian Summer\nn = int(input())\nbouquet = []\nfor i in range(n):\n [tree,color] = input().split()\n if [tree,color] in bouquet:\n continue\n bouquet.append([tree,color])\nprint(len(bouquet))\n", "n=int(input(''))\r\nleaves_list=[]\r\nfor i in range(n):\r\n inp=input('')\r\n leaves_list.append(inp)\r\nset_leaves=set(leaves_list)\r\nprint(len(set_leaves))", "n=int(input())\r\ns=set()\r\nfor i in range(n):\r\n n1,n2=input().split()\r\n s.add((n1,n2))\r\nprint(len(s)) ", "n = int(input())\r\nst = []\r\nfor j in range(n):\r\n a = input()\r\n st.append(a)\r\ncl = []\r\nlv = 0\r\nfor i in st:\r\n if i not in cl:\r\n lv+=1\r\n cl.append(i)\r\nprint(lv)", "n=int(input())\r\ns=set()\r\nfor i in range(n):\r\n s1=input()\r\n s.add(s1)\r\nprint(len(s))", "n = int(input())\ns = []\nst = set()\nfor i in range(n):\n x = input()\n s.append(x)\n st.add(x)\n\nprint(len(st)) \n\t \t \t\t \t \t \t\t \t\t \t \t\t\t", "a=int(input())\r\nc=[]\r\nfor i in range(a):\r\n b=input()\r\n if c.count(b)==0:\r\n c=c+[b]\r\nprint(len(c))\r\n \r\n", "# your code goes here\r\nx=int(input())\r\nlis=[]\r\nfor i in range(x):\r\n\ty=input()\r\n\tlis.append(y)\r\nli=[]\r\nfor i in lis:\r\n\tif i not in li:\r\n\t\tli.append(i)\r\nprint(len(li))\r\n\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 17 02:28:50 2020\r\n\r\n@author: user\r\nLink :https://codeforces.com/contest/44/problem/A\r\n\"\"\"\r\nn = int(input())\r\nl = []\r\ncount = 0\r\nfor i in range(n):\r\n s = input()\r\n if s not in l:\r\n count += 1\r\n l.append(s)\r\n \r\nprint(count)", "def function(arr):\n return len(set(arr))\nn = int(input())\narr = []\nfor i in range(n):\n s = input()\n arr.append(s)\nval = function(arr)\nprint(val)\n \n\n \t\t\t \t \t \t \t \t\t \t\t\t\t \t\t", "n = int(input())\r\nd = []\r\nfor i in range(n):\r\n a = input().split()\r\n if a not in d:\r\n d.append(a)\r\nprint(len(d))", "n = int(input())\r\n\r\n\r\ncol = set()\r\nx = 0\r\nfor i in range(n):\r\n c = input()\r\n if c in col: continue\r\n else:\r\n x+=1\r\n # sp.add(s)\r\n col.add(c)\r\n\r\n\r\nprint(x)", "n=int(input()) \r\nlist1=[]\r\nfor i in range(n):\r\n j=input()\r\n if(j not in list1):\r\n list1.append(j) \r\n\r\nprint(len(list1))", "n = int(input())\r\nT = list()\r\ncount = 0\r\nfor i in range(n):\r\n leave = input()\r\n if leave not in T:\r\n T.append(leave)\r\n count += 1\r\nprint(count)", "n = int(input())\r\nc = []\r\nfor i in range(n):\r\n v = input()\r\n if v not in c:\r\n c.append(v)\r\nprint(len(c))\r\n", "n = int(input())\r\nans = []\r\nfor i in range(n):\r\n a = str(input())\r\n if a not in ans: ans.append(a)\r\nprint(len(ans))", "n = int(input())\r\nbouquet = []\r\nfor i in range(n):\r\n [s,c] = input().split()\r\n found = False\r\n for [xs,xc] in bouquet: \r\n if s==xs and c==xc: \r\n found = True\r\n break\r\n if not found:\r\n bouquet.append([s,c]) \r\nprint(len(bouquet))\r\n", "n = int(input())\n\nleaves = set(input() for _ in range(n))\nanswer = len(leaves)\nprint(answer)", "array =[]\nfor _ in range(int(input())):\n string = input()\n array.append(string)\nprint(len(set(array)))\n \t \t \t \t \t \t \t \t\t\t \t\t", "a=int(input())\nd={}\nfor i in range(a):\n a,b=map(str,input().split())\n d.setdefault(b,[])\n d[b].append(a)\nc=0\nfor i,j in d.items():\n j=set(j)\n c+=len(j)\nprint(c)\n \n \n\t\t \t \t \t \t\t \t\t\t \t\t \t", "n = int(input())\nprint(len({input() for i in range(n)}))\n\n\t\t \t\t \t \t\t\t\t\t\t \t\t \t \t", "def main():\n flowers = input()\n\n distinct = set()\n\n for i in range(int(flowers)):\n flower_type = input()\n distinct.add(flower_type)\n\n print(len(distinct))\n\n\nif __name__ == '__main__':\n main()\n\n \t\t\t\t\t \t \t\t \t \t \t \t \t\t \t\t\t", "t=int(input())\nk={}\nfor i in range(t):\n s=input()\n k[s]=1 \nprint(len(k))\n\t \t\t\t \t \t \t \t \t\t \t\t", "inp = int(input())\r\nleaf = []\r\nfor i in range(inp):\r\n l = input()\r\n if l in leaf:\r\n pass\r\n else:\r\n leaf.append(l)\r\nprint(len(leaf))\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# your code goes here\nn=int(input())\nlt=[]\nfor i in range(n):\n\ta=input().strip()\n\tlt.append(a)\nlt1=[]\nfor i in lt:\n\tif i not in lt1:\n\t\tlt1.append(i)\nprint(len(lt1))\n\t\t \t\t\t \t \t\t\t\t\t\t\t\t \t\t \t\t", "n=int(input())\r\nlist1=[]\r\nfor i in range(n):\r\n x=input()\r\n list1.append(x)\r\nlist2=[]\r\nfor i in list1:\r\n if i not in list2:\r\n list2.append(i)\r\nprint(len(list2))", "Ais= int(input())\nprint(len({input() for i in range(Ais)}))\n\t \t\t\t \t\t \t\t \t\t\t \t \t\t\t \t \t \t", "n=set()\nfor i in range(int(input())):\n n.add(input())\nprint(len(n))\n\t\t \t\t\t\t\t\t \t \t \t \t \t \t\t", "t=int(input())\narr=[]\nfor _ in range(t):\n str=input()\n arr.append(str)\narr=list(set(arr))\nprint(len(arr))\n \t \t \t\t\t \t \t\t \t\t\t \t\t\t \t\t \t\t\t\t", "t=int(input())\ns1=set()\nfor _ in range(t):\n s=input()\n s1.add(s)\nprint(len(s1))\n\t\t\t\t\t \t\t \t \t \t\t \t \t\t \t", "n = int(input())\r\ncount = 0\r\nres = [[]]\r\nfor _ in range(n):\r\n\tl = []\r\n\ts, c = map(str,input().split())\r\n\tl.append(s)\r\n\tl.append(c)\r\n\tif l not in res:\r\n\t\tcount += 1\r\n\t\tres.append(l)\r\nprint(count)", "from collections import *\nfrom itertools import *\nfrom math import *\nfrom bisect import *\nfrom heapq import *\ns=set({})\nfor i in range(int(input())):\n s.add(input())\nprint(len(s))\n\n \t\t\t \t \t\t \t \t\t\t \t\t \t\t\t\t\t\t\t", "from sys import stdin,stdout\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict\r\n# from math import gcd,ceil,sqrt\r\n# setrecursionlimit(int(1e5))\r\n#input,print = stdin.readline,stdout.write\r\n# t = 1\r\nt = int(input())\r\nx = set()\r\nfor _ in range(t):\r\n\ts = input().strip()\r\n\tx.add(s)\r\nprint(len(x))", "t = int(input())\r\ncount = 0\r\nowned_trees = []\r\n\r\nfor _ in range(t):\r\n tree = input().split()\r\n if tree not in owned_trees:\r\n count += 1\r\n owned_trees.append(tree)\r\nprint(count)\r\n\r\n", "\r\nn = int(input())\r\nset_ = set()\r\nfor _ in range(n):\r\n\tset_.add(input())\r\n\r\nprint(len(set_))\r\n", "n=int(input())\nl=[]\nfor i in range(n):\n m=input()\n l.append(m)\nprint(len(set(l)))\n\t\t \t \t\t\t \t \t \t \t\t \t \t\t", "n =int(input())\r\nleaves = []\r\nfor _ in range(n):\r\n x = input()\r\n leaves.append(x)\r\n\r\nselected = []\r\nfor i in leaves:\r\n if i not in selected:\r\n selected.append(i)\r\n\r\nprint(len(selected))", "t=int(input())\nl=[]\nfor _ in range(t):\n s=input()\n l.append(s)\n l1=set(l)\nprint(len(l1))\n \t\t\t\t\t \t\t\t\t \t\t\t \t\t\t \t\t\t \t", "n = int(input())\nl = []\ncount = 0\nfor i in range(n):\n lst = list(map(str, input().split()))\n l.append(lst)\nfor i in range(n):\n k = l[i + 1:].count(l[i])\n if k == 0:\n count += 1\nprint(count)\n \t\t\t\t \t\t \t \t\t \t \t\t \t \t \t", "n=int(input())\ntemp=set()\nfor i in range(n):\n sp,col=(input().lower().split())\n temp.add((sp,col))\nprint(len(temp))\n\t\t \t \t \t\t \t\t \t\t \t \t\t\t\t\t \t", "n = int(input())\nlst = []\nfor i in range(n):\n s = input()\n lst.append(s)\nlst = set(lst)\nprint(len(lst))\n\n\n\t \t \t\t\t\t \t \t \t \t \t \t\t\t \t", "tc = 1\r\nwhile tc:\r\n tc-=1\r\n n = int(input())\r\n s = []\r\n for i in range(n):\r\n s.append(input())\r\n print(len(set(s)))\r\n\r\n\r\n \r\n ", "n=int(input())\nl=[]\nfor i in range(n):\n temp=input()\n if(temp!=\"\"):\n l.append(temp)\n \ns=set(l)\ncount=0\nfor i in s:\n count +=1\nprint(count)\n\n \t\t\t \t\t \t\t\t\t\t \t \t \t \t\t\t", "n = int(input())\r\nleaflist=[]\r\n\r\nfor i in range(n):\r\n x = input()\r\n if x in leaflist:\r\n pass\r\n else:\r\n leaflist.append(x)\r\n\r\nprint(len(leaflist))\r\n", "n=int(input())\ns=1\nm=[]\nfor i in range(n):\n l=input()\n m.append(l)\nfor i in range(1,len(m)):\n \n if(m[i] not in m[0:i]):\n s+=1\nprint(s) \n\t \t\t\t\t \t \t\t\t \t \t \t\t\t \t \t\t\t\t", "a = []\nfor x in range(int(input())):\n\tb = input()\n\tif b not in a:\n\t\ta.append(b)\nprint(len(a))", "inp = int(input())\r\nlista = list()\r\ntup = tuple()\r\n\r\nfor i in range(inp):\r\n lista.append(tuple(i for i in input().split()))\r\n\r\ns = set(lista)\r\nprint (len(s))", "ll=set()\nfor _ in range(int(input())):\n ll.add(input())\nprint(len(ll))\n\t \t\t\t\t \t \t \t\t \t", "check = {}\r\ncount = 0\r\nfor i in range(int(input())):\r\n species, colour = map(str, input().split())\r\n if species not in check:\r\n check[species] = []\r\n if colour not in check[species]:\r\n check[species].append(colour)\r\n count = count +1\r\nprint(count)", "\nfrom sys import stdin\nfrom math import log, floor, ceil, gcd\nfrom collections import defaultdict as dd\n#from bisect import bisect_left as bl,bisect_right as br\n\n\ninput = stdin.readline\ndef inp(): return int(stdin.readline())\ndef rs(): return stdin.readline().strip()\n\n\ndef ra(typ): return list(map(typ, stdin.readline().split()))\ndef rv(typ): return map(typ, stdin.readline().split())\n\n\n#mod = 1000000007\n\n\ndef main():\n x = set()\n for _ in range(inp()):\n a,b = rv(str)\n x.add((a,b))\n print(len(x))\nmain()\n\n \t\t \t \t\t\t \t \t\t\t \t\t \t", "n = int(input())\r\nbouquet = []\r\nfor i in range(n):\r\n [s,c] = input().split() \r\n if ([s,c] not in bouquet): \r\n bouquet.append([s,c]) \r\nprint(len(bouquet)) ", "a=int(input())\r\nd={}\r\nfor i in range(a):\r\n a,b=map(str,input().split())\r\n d.setdefault(b,[])\r\n d[b].append(a)\r\nc=0\r\nfor i,j in d.items():\r\n j=set(j)\r\n c+=len(j)\r\nprint(c)\r\n \r\n ", "m=[]\nfor i in range(int(input())):\n a=str(input())\n m.append(a)\nd=set(m)\nn=list(d)\nprint(len(n))\n \t \t\t\t\t \t \t \t\t\t \t \t \t \t", "x1=int(input())\nl1=[]\nfor i in range(x1):\n\ta1=input()\n\tl1.append(a1)\nprint(len(set(l1)))\n\t \t \t \t\t\t\t \t\t\t \t \t\t \t", "leaves = {}\nn = int(input())\nfor i in range(n):\n leaves[input()] = 1\nprint(len(leaves))\n# 1538224606811\n", "n = int(input())\r\nbunch = []\r\n\r\nfor i in range(n):\r\n leaf = input()\r\n if (leaf not in bunch):\r\n bunch.append(leaf)\r\n\r\nprint(len(bunch))\r\n", "n=int(input())\r\nL={}\r\nfor i in range(n):\r\n L[input()]=1\r\nprint(len(L))\r\n", "import sys\n\ndef main():\n hs = set()\n for _ in range(int(input())):\n hs.add(sys.stdin.readline())\n print(len(hs))\n return None\n\nmain()", "listt=[]\nn=int(input())\nfor i in range(n):\n t=str(input())\n listt.append(t)\nlength = len(listt)\nlistt1 = []\nfor i in range(length):\n if(listt[i] not in listt1):\n listt1.append(listt[i])\nans = len(listt1)\nprint(ans)\n\t \t \t \t\t \t \t\t \t \t \t \t\t", "l = []\r\nfor _ in range(int(input())):\r\n s = input()\r\n l.append(s)\r\nd = set(l)\r\nprint(len(d))", "l=[]\r\nm=int(input())\r\nfor i in range(m):\r\n n=input()\r\n l.append(n)\r\ny=set(l)\r\nprint(len(y))", "k=int(input())\nl=[]\nfor i in range(k):\n n=input()\n l.append(n)\nprint(len(set(l)))\n \n\t \t\t \t\t\t\t \t\t\t\t \t\t\t\t \t\t\t \t\t", "from sys import stdin,stdout\nd={}\nn=int(stdin.readline())\nfor i in range(n):\n x,y=map(str,stdin.readline().split())\n if x not in d:\n d[x]=set([y])\n else:\n d[x].add(y)\ns=0\nfor i in d:\n s+=len(d[i])\nstdout.write(str(s))\n\n\t\t\t\t\t\t \t\t \t\t \t \t\t\t \t\t \t \t", "'''\r\n\r\nAuthor\t: Indian Coder\r\nDate\t: 29th May ,2021\r\nContest : PWC 2.0 \r\n\r\n'''\r\n\r\n#Imports\r\n\r\nimport math\r\nimport time \r\nimport random\r\nstart=time.time()\r\n\r\nn=int(input())\r\nsample=[]\r\nfor i in range(0,n):\r\n s=input()\r\n sample.append(s)\r\nprint(len(set(sample)))\r\n\r\nend=time.time()\r\n#print(\"Time Of Execution Is\",end-start)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n x=input()\r\n l.append(x)\r\nprint(len(set(l)))", "Dict = {}\nSummer = []\nList = []\nt = int(input())\nfor i in range(t):\n tree, color = map(str, input().split())\n Dict = {tree: color}\n Summer.append(Dict)\nfor i in Summer:\n if i not in List:\n List.append(i)\nprint(len(List))\n\t\t\t \t \t \t\t \t\t\t \t\t \t", "x = []\r\nfor i in range(int(input())):\r\n\ts = str(input())\r\n\tx.append(s)\r\nprint(len(set(x)))", "t = int(input())\nleaves = []\ncount = 0\nfor i in range(t):\n leaves.append(input())\n \nprint(len(set(leaves)))\n \t\t\t \t \t \t \t\t \t \t\t \t", "n = int(input())\r\ncount = 0\r\nleaves = []\r\nfor i in range(n):\r\n leave = input()\r\n if leave not in leaves:\r\n leaves.append(leave)\r\n count += 1\r\nprint(count)", "n = int(input())\r\nl = set()\r\n# [0,1...n-1]\r\nfor i in range(n):\r\n s = input()\r\n l.add(s)\r\nprint(len(l))\r\n\r\n", "seen = set()\ncount = 0\nfor i in range(n := int(input())):\n ip = input()\n if ip not in seen:\n count+=1\n seen.add(ip)\nprint(count)\n", "n = int(input())\nlist1 = []\nfor i in range(0,n):\n s = input()\n if s not in list1:\n list1.append(s)\nprint(len(list1))\n \t \t\t \t\t\t \t\t\t\t\t \t\t\t\t\t\t", "c = int(input())\nk =[]\nfor i in range(0,c):\n s =input()\n if s not in k:\n k.append(s)\nprint(len(k),end='')\n\t\t\t\t \t \t\t \t\t \t \t \t\t \t", "t=[]\nfor i in range(int(input())):\n s = input()\n t.append(s)\nprint(len(set(t)))\n\n\t \t\t\t \t\t \t \t\t \t\t\t\t \t", "n=int(input())\nl=[]\nfor i in range(n):\n l.append(input())\nl=set(l)\na=len(l)\nprint(a)\n \t\t \t\t \t\t\t\t \t\t \t \t\t \t\t \t \t", "n = int(input())\r\nmyset = set()\r\nfor _ in range(n):\r\n myset.add(input())\r\nprint(len(myset))", "a=int(input())\nb=[]\nfor i in range(a):\n n=input()\n b.append(n)\nprint(len(set(b)))\n\t\t \t \t\t\t \t \t \t\t\t \t\t \t\t\t \t", "s=set()\nfor _ in range(int(input())):\n a,b=input().split()\n s.add(a+\"1\"+b)\nprint(len(s))\n\n \t \t \t\t \t\t\t\t\t\t \t \t \t \t\t", "n = int(input())\r\nFlow = []\r\nkol = 0\r\nfor i in range(n):\r\n s = input()\r\n if not(s in Flow):\r\n Flow.append(s)\r\n kol += 1\r\nprint(kol)\r\n", "#Chirag's Submission:\nn=int(input())\nd={}\nfor i in range(0,n):\n l=input()\n if l in d.keys():\n d[l]+=1\n else:\n d[l]=1\nprint(len(d.keys()))\n\n \t \t\t\t \t \t \t\t\t \t \t", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\nimport collections\r\n\r\nd = collections.defaultdict(set)\r\nn = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n t, c = input().split()\r\n if not d[t].__contains__(c):\r\n d[t].add(c)\r\n count+=1\r\n\r\nprint(count)", "n = int(input())\nleaf_list = []\nfor i in range(n):\n leaf = input()\n if leaf not in leaf_list:\n leaf_list.append(leaf)\nprint(len(leaf_list))", "number_of_leaves = int(input())\n\nbag = []\n\nfor i in range(number_of_leaves):\n leave_descriptions = list(map(str, input().split(' ')))\n bag.append(leave_descriptions)\n\nchosen_leaves = []\n\nfor i in set(map(tuple, bag)):\n chosen_leaves.append(i)\n\n\nprint(len(chosen_leaves))", "t = int(input())\nl = []\nfor i in range(t):\n a = input()\n l.append(a)\nprint(len(set(l)))\n\t\t\t\t \t \t \t\t\t\t\t\t \t \t\t \t\t", "n = int(input())\r\n\r\ncont = []\r\n\r\nfor i in range(n):\r\n temp = input()\r\n\r\n if temp not in cont:\r\n cont.append(temp)\r\nprint(len(cont))\r\n\r\n\r\n\r\n", "n = int(input())\na = set()\nfor _ in range(n):\n a.add(input())\n\nprint(len(a))\n \t\t \t\t\t\t \t \t \t\t \t \t\t", "num = int(input())\narray = []\nfor n in range(num):\n ele = input()\n if(ele not in array):\n array.append(ele)\nprint(len(array))\n\t \t\t\t \t\t\t \t\t\t\t \t\t\t\t", "x=set()\nfor i in range(int(input())):\n a=input()\n x.add(a)\nprint(len(x))\n\n\n\t\t \t\t\t \t \t\t \t\t \t\t \t \t", "s=set()\nfor i in range(int(input())):\n a=input()\n s.add(a)\nprint(len(s))\n \t \t\t \t \t\t \t\t \t\t\t\t\t \t \t", "a = int(input())\r\nmy_dic = dict()\r\nfor i in range(a):\r\n line = input()\r\n if line in my_dic:\r\n my_dic[line] += 1\r\n else:\r\n my_dic[line] = 1\r\n\r\nprint(len(my_dic))", "n = int(input())\r\nl = []\r\nm= []\r\no=[]\r\nfor i in range(n):\r\n x = input()\r\n t = x.replace(\" \",'')\r\n o.append(t)\r\n a = set(o)\r\n \r\n y= x.split().pop(0)\r\n z = x.split().pop(1)\r\n l.append(y)\r\n m.append(z)\r\n p = set(l)\r\n q = set(m)\r\nif len(p)==len(q)==n:\r\n print(len(p))\r\nelse:\r\n \r\n print(len(a))\r\n ", "n=int(input())\nc=[]\nfor i in range(n):\n\tc.append(input())\nb=[]\nfor i in c:\n\tif i not in b:\n\t\tb.append(i)\nprint(len(b))\n\t", "i = int(input())\nv = set()\nct = 0\nfor m in range(i):\n s = input()\n if s not in v:\n v.add(s)\n ct += 1\nprint(ct)\n\n# numbers(5)\n# numbers(3)\n", "n=int(input())\ns=set()\nfor i in range(n):\n species=input()\n s.add(species)\nres=len(s)\nprint(res)\n \t \t\t \t \t\t\t\t\t\t \t\t \t \t\t \t", "r = int(input())\nprint(len({input() for i in range(r)}))\n \t \t\t\t\t\t\t\t \t\t\t \t \t \t\t \t\t", "t=int(input())\nlist1=[]\nfor i in range(0,t):\n a=input()\n list1.append(a)\nprint(len(set(list1)))\n \t\t\t \t\t\t \t \t \t \t \t\t\t \t\t \t\t", "def f(arr):\r\n return len(set(arr))\r\nn=int(input())\r\narr=[]\r\nfor i in range(n):\r\n st=input()\r\n arr.append(st)\r\nprint(f(arr))\r\n", "n=int(input())\r\nblist=[]\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n alist=[a,b]\r\n blist.append(alist)\r\nclist=[]\r\nfor i in range(len(blist)):\r\n if not blist[i] in blist[0:i]:\r\n clist.append(blist[i])\r\nprint(len(clist))\r\n ", "arr = []\nn = int(input())\nfor i in range(n):\n string = str(input())\n arr.append(string)\narr1 = []\nfor i in range(len(arr)):\n if arr[i] not in arr1:\n arr1.append(arr[i])\nprint(len(arr1))\n \t \t\t\t \t\t \t \t\t\t \t \t \t\t\t\t", "s=set()\nn=int(input())\nfor _ in range(0,n):\n leaf=input()\n s.add(leaf)\nprint(len(s))\n\t \t\t\t \t \t \t\t \t \t\t\t", "'''\r\n ************************ বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ *********************\r\n\r\n ********************************************* Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''************************************************************************\r\n\r\n PROBLEM :A. Indian Summer\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\ns=set()\r\nfor j in range(int(input())):\r\n a=input()\r\n s.add(a)\r\nprint(len(s))", "tc=int(input())\narr = []\nfor _ in range(tc):\n s=input()\n arr.append(s)\na=set(arr)\nprint(len(a))\n \t\t\t\t\t\t\t\t\t\t \t\t\t \t \t \t\t", "n = int(input())\nbouquet = []\nfor _ in range(n):\n bouquet.append(input())\nprint(len(set(bouquet)))\n\t\t\t\t \t\t \t \t\t\t\t \t\t \t \t", "# your code goes here\nt = int(input())\ns = []\nfor i in range(t):\n\ta = input()\n\ts.append(a)\nprint(len(set(s)))\n \t\t \t \t \t\t \t\t \t\t\t\t\t", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n a = input()\r\n s.append(a)\r\nprint(len(set(s)))", "import sys\ndef print(a):\n sys.stdout.write(str(a)+'\\n')\ndef input():\n return sys.stdin.readline().strip()\ndef printl(a):\n s=[str(i) for i in a]\n s=' '.join(s)\n sys.stdout.write(s+'\\n')\nx=set()\nc=0\nfor _ in range(int(input())):\n s=input()\n if s not in x:\n c+=1\n x.add(s)\nprint(c)\n \t \t\t\t\t \t \t\t\t\t\t\t \t\t", "s=set()\r\nfor _ in range(int(input())):\r\n l=list(map(str,input().split()))\r\n t=tuple(l)\r\n s.add(t)\r\nprint(len(s))", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\nz = list(set(l))\r\nprint(len(z))\r\n \r\n ", "n=int(input())\r\nlst1=set()\r\nfor i in range(n):\r\n\ts=input()\r\n\tlst1.add(s)\r\nprint(len(lst1))", "n=int(input())\nl=[]\nfor i in range(n):\n l.append(input())\ns=set(l)\nprint(len(s))\n \t \t \t\t\t \t \t \t\t \t \t\t\t\t\t \t", "print(len({*[*open(0)][1:]}))\r\n" ]

[ "n,k = [int(i) for i in input().split()]\r\nd = [int(i) for i in input().split()]\r\nl,r=0,0\r\ns= dict()\r\nans = 0\r\nll,rr=0,0\r\nwhile r<n:\r\n while len(s)>=k:\r\n s[d[l]]-=1\r\n if s[d[l]]==0:\r\n s.pop(d[l])\r\n l+=1\r\n while r<n:\r\n if d[r] not in s:\r\n if len(s)<k:\r\n s[d[r]]=1\r\n else:\r\n break\r\n else:\r\n s[d[r]]+=1\r\n r+=1\r\n if r-l>ans:\r\n ans=r-l\r\n ll,rr=l,r\r\nprint(ll+1,rr)", "n, k = list(map(int, input().split(\" \")))\narr = list(map(int, input().split(\" \")))\n\nl = 0\nresL = 0\nresR = 0\ncount = dict()\ncount_of_different = 0\nmaxLen = 0\n\ndef isKGood():\n return count_of_different <= k\n\nfor r in range(n):\n if arr[r] not in count:\n count[arr[r]] = 0\n\n count[arr[r]] += 1\n\n if count[arr[r]] == 1:\n count_of_different += 1\n\n while not isKGood():\n count[arr[l]] -= 1\n\n if count[arr[l]] == 0:\n count_of_different -= 1\n l += 1\n \n currLen = r - l + 1\n\n if count_of_different <= k and maxLen < currLen:\n maxLen = currLen\n resL = l\n resR = r\n\n\nprint(f\"{resL + 1} {resR + 1}\")\n\t\t \t \t\t\t\t\t \t \t \t \t\t \t \t", "'''\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣤⣤⣤⣶⣤⣤⣀⣀⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣶⣄⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⢀⣾⣿⣿⣿⣿⣿⡿⠋⠉⠛⠛⠛⠿⣿⠿⠿⢿⣇⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⣾⣿⣿⣿⣿⣿⠟⠀⠀⠀⠀⠀⡀⢀⣽⣷⣆⡀⠙⣧⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢰⣿⣿⣿⣿⣿⣷⠶⠋⠀⠀⣠⣤⣤⣉⣉⣿⠙⣿⠀⢸⡆⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣿⠁⠀⠀⠴⡟⣻⣿⣿⣿⣿⣿⣶⣿⣦⡀⣇⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢨⠟⡿⠻⣿⠃⠀⠀⠀⠻⢿⣿⣿⣿⣿⣿⠏⢹⣿⣿⣿⢿⡇⠀⠀\r\n⠀⠀⠀⠀⠀⠀⣿⣼⣷⡶⣿⣄⠀⠀⠀⠀⠀⢉⣿⣿⣿⡿⠀⠸⣿⣿⡿⣷⠃⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢻⡿⣦⢀⣿⣿⣄⡀⣀⣰⠾⠛⣻⣿⣿⣟⣲⡀⢸⡿⡟⠹⡆⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⢰⠞⣾⣿⡛⣿⣿⣿⣿⣰⣾⣿⣿⣿⣿⣿⣿⣿⣿⡇⢰⡇⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠘⠀⣿⡽⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢿⠿⣍⣿⣧⡏⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣷⣿⣿⣿⣿⣿⣿⣿⣿⣷⣮⣽⣿⣷⣙⣿⡟⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡟⣹⡿⠇⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠛⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡧⣦⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⢠⡆⠀⠀⠀⠀⠀⠀⠀⠉⠻⣿⣿⣾⣿⣿⣿⣿⣿⣿⡶⠏⠀⠀⠀⠀\r\n⣀⣠⣤⡴⠞⠛⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠚⣿⣿⣿⠿⣿⣿⠿⠟⠁⠀⠀⠀⠀⠀\r\n⠉⠀⢀⡴⠂⠀⠀⠀⠀⠀⠀⠀⠀⢠⠀⠀⢀⣿⣿⠁⠀⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⣠⣴⡿⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⣾⠀⠀⣾⣿⠋⠀⢠⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣆⣼⣿⠁⢠⠃⠈⠓⠦⣄⡀⠀⠀⠀⠀⠀⠀\r\n⠻⠿⢷⣦⣤⣤⣤⣦⣄⣀⣀⠀⢀⣿⣿⠻⣿⣰⠻⠀⠸⣧⡀⠀⠉⠳⣄⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠈⠉⠉⠙⠛⠿⣦⣼⡏⢻⣿⣿⠇⠀⠁⠀⠻⣿⠙⣶⣄⠈⠳⣄⡀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠁⣐⠀⠀⠀⠈⠳⡘⣿⡟⣀⡠⠿⠶⠒⠟⠓⠀⠹⡄⢴⣬⣍⡁\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠙⢀⣀⠐⠲⠤⠁⢘⣠⣿⣷⣦⠀⠀⠀⠀⠀⠀⠙⢿⣿⣏⠁\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠀⠀⠀⠀⠈⣿⣿⣷⣯⠀⠀⠀⠀⠀⠀⠀⠀⠉⠻⠆\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⢦⠀⢹⣿⣏\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠁⣸⣿⣿⡀\r\n⠀⠀⠀⠐⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣷⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⡟⢬⣿⣷⣤⣀⣄⣀⡀⠀⠀⠀⠀⠀⠀⠈⣿⣿⡄⣉⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n'''\r\nln,t=map(int,input().split())\r\narray = list(map(int,input().split()))\r\nfreq = [0]*(int(1e6)+1)\r\nmyset = set()\r\nl,r=0,0\r\nsm = 0\r\nmx = 0\r\nans = [1,1]\r\ndiff = 0\r\nwhile r<ln:\r\n freq[array[r]]+=1\r\n if array[r] not in myset:\r\n myset.add(array[r])\r\n diff+=1\r\n while diff>t:\r\n freq[array[l]]-=1\r\n if freq[array[l]]==0:\r\n myset.remove(array[l])\r\n diff-=1\r\n l+=1\r\n if r-l+1>mx:\r\n mx = r-l+1\r\n ans = [l+1,r+1]\r\n r+=1\r\nprint(*ans)", "from collections import defaultdict,Counter\r\nimport math\r\nimport bisect\r\nfrom itertools import accumulate\r\nfrom math import ceil, log\r\n \r\nfrom sys import stdin, stdout\r\n \r\ndef read():\r\n return stdin.readline().rstrip()\r\n \r\n\r\n \r\n \r\n \r\n# total = int(read())\r\n \r\nn,k = ([int(p) for p in read().split()])\r\n\r\nx= ([int(p) for p in read().split()])\r\n\r\nd = defaultdict(lambda:0)\r\n\r\ni = 0\r\nj=-1\r\nl = -1\r\n\r\nmi = -1\r\nmj = -1\r\nc = 0\r\nwhile j < n-1:\r\n j+=1\r\n if d[x[j]] ==0:\r\n c+=1\r\n d[x[j]]+=1\r\n while c > k:\r\n d[x[i]]-=1\r\n if d[x[i]]==0:\r\n c-=1\r\n i+=1 \r\n if j-i > l:\r\n l = j-i\r\n mi = i\r\n mj = j\r\n \r\n\r\n\r\n\r\nprint(mi+1,mj+1) \r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = {}\r\nans = -1\r\nl_best = -1\r\nr_best = -1\r\nl = 0\r\nfor i in range(n):\r\n if a[i] in s:\r\n s[a[i]] += 1\r\n else:\r\n s[a[i]] = 1\r\n\r\n while len(s) > k:\r\n s[a[l]] -= 1\r\n if s[a[l]] == 0:\r\n del s[a[l]]\r\n l += 1\r\n if i - l + 1 > ans:\r\n ans = i - l + 1\r\n l_best, r_best = l, i\r\n\r\nprint(l_best + 1, r_best + 1)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, k):\r\n answer = [0, None, None]\r\n n = len(A)\r\n i1 = 0\r\n curr = {A[0]: 1}\r\n answer = [1, 1, 1]\r\n for i in range(1, n):\r\n if A[i] not in curr:\r\n curr[A[i]] = 0\r\n curr[A[i]]+=1\r\n while len(curr) > k:\r\n x = A[i1]\r\n curr[x]-=1\r\n i1+=1\r\n if curr[x]==0:\r\n curr.pop(x)\r\n if i1==i:\r\n break\r\n entry = [i-i1+1, i1+1, i+1]\r\n answer = max(answer, entry)\r\n return answer[1:] \r\n\r\nn, k = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\na, b = process(A, k)\r\nprint(f'{a} {b}')", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=0\r\ns={}\r\nx,y=0,0\r\nz=0\r\np,o=0,0\r\nfor i in a:\r\n s[i]=s.get(i,0)+1\r\n if s[i]==1:\r\n l+=1\r\n y+=1\r\n while l>k:\r\n s[a[x]]-=1\r\n if s[a[x]]==0:\r\n l-=1\r\n x+=1\r\n if z<y-x:\r\n z=y-x\r\n o,p=x,y\r\nprint(o+1,p)", "import sys\n \nn,k = map(int, input().split())\nhash = [0]*1000001\nnow = 0\na = list(map(int, input().split()))\nans = 0\nl = 0\n \nfor r in range(n):\n\thash[a[r]]+=1\n\tif hash[a[r]] == 1: now+=1\n\twhile (now>k):\n\t\thash[a[l]]-=1\n\t\tif (hash[a[l]]==0): now-=1\n\t\tl+=1\n\tif r-l+1>ans:\n\t\tal = l\n\t\tar = r\n\t\tans = r-l+1\nprint(al+1,ar+1)\n\n\n \t\t \t\t \t\t\t \t \t\t \t \t\t \t \t", "def find_longest_k_good_segment(x, k, a):\n left = 0\n right = 0\n max_len = 0\n max_left = 0\n\n freq = {}\n\n while right < x:\n freq[n[right]] = freq.get(n[right], 0) + 1\n\n while len(freq) > k:\n freq[n[left]] -= 1\n if freq[n[left]] == 0:\n del freq[n[left]]\n left += 1\n\n if right - left + 1 > max_len:\n max_len = right - left + 1\n max_left = left\n\n right += 1\n\n return max_left + 1, max_left + max_len\n\nx, k = map(int, input().split())\nn = list(map(int, input().split()))\n\nl, r = find_longest_k_good_segment(x, k, n)\nprint(l, r)\n \t \t \t\t\t \t\t \t \t\t \t \t \t", "# /**\r\n# * author: brownfox2k6\r\n# * created: 20/07/2023 21:44:31 Hanoi, Vietnam\r\n# **/\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\nn, k = map(int, input().split())\r\na = [*map(int, input().split())]\r\n\r\ncnt = [0] * 1000005\r\nansl = 1\r\nansr = 1\r\nmaxl = 1\r\nl = 0\r\nr = 1\r\ncnt[a[0]] = 1\r\nk -= 1\r\n\r\nwhile r < n:\r\n if cnt[a[r]] == 0:\r\n k -= 1\r\n cnt[a[r]] += 1\r\n while k < 0:\r\n cnt[a[l]] -= 1\r\n if cnt[a[l]] == 0:\r\n k += 1\r\n l += 1\r\n if r-l+1 > maxl:\r\n maxl = r-l+1\r\n ansl = l+1\r\n ansr = r+1\r\n r += 1\r\n\r\nprint(f\"{ansl} {ansr}\")", "def find_longest_k_good_segment(n, k, a):\n left = 0\n right = 0\n max_len = 0\n max_left = 0\n\n freq = {}\n\n while right < n:\n freq[a[right]] = freq.get(a[right], 0) + 1\n\n while len(freq) > k:\n freq[a[left]] -= 1\n if freq[a[left]] == 0:\n del freq[a[left]]\n left += 1\n\n if right - left + 1 > max_len:\n max_len = right - left + 1\n max_left = left\n\n right += 1\n\n return max_left + 1, max_left + max_len\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nl, r = find_longest_k_good_segment(n, k, a)\nprint(l, r)\n \t \t\t\t \t\t \t\t \t\t \t \t \t\t\t \t\t\t", "I = lambda: [int(x) for x in input().split()]\r\nn, k = I()\r\ns = I()\r\n\r\nfrom collections import Counter\r\n\r\nwindow = Counter()\r\nbeg, end, n, dist = 0, 0, len(s), 0\r\nans = (0, 0)\r\n\r\nwhile beg < n and end < n:\r\n if (dist == k and window[s[end]] > 0) or dist < k:\r\n if end + 1 < n: window[s[end]] += 1\r\n if window[s[end]] == 1: dist += 1\r\n end += 1\r\n ans = max(ans, (end - beg, beg))\r\n else:\r\n window[s[beg]] -= 1\r\n if window[s[beg]] == 0: dist -= 1\r\n beg += 1\r\n\r\nprint(ans[1] + 1, ans[0] + ans[1])", "from collections import deque\n\nN = 5 * 10 ** 5 + 1\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nfreq = [0] * (2 * N)\nq = deque()\n\nun = 0\nres = 0\nl = 0\nr = 0\n\nfor i in range(n):\n if freq[a[i]] == 0:\n un += 1\n freq[a[i]] += 1\n q.append(a[i])\n\n while q and un > m:\n freq[q[0]] -= 1\n if freq[q[0]] == 0:\n un -= 1\n q.popleft()\n\n if res < len(q):\n res = len(q)\n l = i - res + 1\n r = i\n\nprint(l + 1, r + 1)\n\n\t \t\t\t \t \t\t \t \t\t \t", "R = lambda: map(int, input().split())\r\nn, k = R()\r\nvst = [0] * (10 ** 6 + 1)\r\narr = list(R())\r\nj = -1\r\ncnt = 0\r\nl = r = 0\r\nfor i in range(n):\r\n vst[arr[i]] += 1\r\n cnt += vst[arr[i]] == 1\r\n while cnt > k:\r\n j += 1\r\n vst[arr[j]] -= 1\r\n cnt -= vst[arr[j]] == 0\r\n if i - j > r - l:\r\n l, r = j, i\r\nprint(l + 2, r + 1)", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Longest k-Good Segment\"\r\n# Class: D\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, k = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n z = 0 ; l = 0 ; length = 0 ; diff = 0 ; e = dict() ; idx = []\r\n for r in range(n):\r\n if a[r] not in e.keys():\r\n diff+=1\r\n e[a[r]] = 1\r\n else:\r\n e[a[r]] += 1\r\n length+=1\r\n while diff>k:\r\n if e[a[l]] > 1:\r\n e[a[l]] -= 1\r\n else:\r\n e.pop(a[l])\r\n diff -= 1\r\n length -= 1\r\n l+=1\r\n if length > z:\r\n z = length\r\n idx = [l+1, r+1]\r\n\r\n print(*idx)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ns = dict()\r\nans = -1\r\nl_best = -1\r\nr_best = -1\r\nl=0\r\n\r\nfor r in range(n):\r\n if a[r] in s:\r\n s[a[r]] += 1\r\n else:\r\n s[a[r]] = 1\r\n \r\n while len(s) > k:\r\n s[a[l]] -= 1\r\n if s[a[l]] == 0:\r\n del s[a[l]]\r\n l += 1\r\n if r-l+1 > ans:\r\n ans = r-l+1\r\n l_best, r_best = l, r\r\n\r\nprint(l_best+1, r_best+1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nl = r = best_l = best_r = distinct = 0\ndistinct_count = [0] * (10**6 + 1)\n\nfor r in range(n):\n if distinct_count[a[r]] == 0:\n distinct += 1\n distinct_count[a[r]] += 1\n while distinct > k:\n distinct_count[a[l]] -= 1\n if distinct_count[a[l]] == 0:\n distinct -= 1\n l += 1\n if r - l > best_r - best_l:\n best_l, best_r = l, r\n\nprint(best_l + 1, best_r + 1)\n\n \t\t\t \t \t \t\t\t \t \t", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n left = right = -1\r\n p = 0\r\n\r\n for i in range(n):\r\n while p < n:\r\n mas_cnt[mas[p]] += 1\r\n if mas_cnt[mas[p]] == 1:\r\n curr[0] += 1\r\n\r\n if curr[0] > k:\r\n mas_cnt[mas[p]] -= 1\r\n if mas_cnt[mas[p]] == 0:\r\n curr[0] -= 1\r\n break\r\n p += 1\r\n if right-left < p-i:\r\n left = i\r\n right = p\r\n mas_cnt[mas[i]] -= 1\r\n if mas_cnt[mas[i]] == 0:\r\n curr[0] -= 1\r\n\r\n print(left+1, right)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = [int(s) for s in stdin.readline().split()]\r\n mas = [int(s) for s in stdin.readline().split()]\r\n curr = [0]\r\n mas_cnt = [0]*2000000\r\n solve()\r\n", "from collections import defaultdict\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl, r = 0, k\r\nl, r, q, e = 0, 0, 0, 0\r\ndic = defaultdict(int)\r\nfor i in range(n):\r\n dic[a[i]] += 1\r\n if dic[a[i]] == 1:\r\n e += 1\r\n r += 1\r\n while e > k:\r\n dic[a[l]] -= 1\r\n if dic[a[l]] == 0:\r\n e -= 1\r\n l += 1\r\n if q <(r - l):\r\n q = (r - l)\r\n ll , rr = l, r\r\n\r\nprint(ll + 1, rr)", "s = input().split()\r\nn, k = int(s[0]), int(s[1])\r\ns = input().split()\r\na = []\r\nfor i in range(n):\r\n e = int(s[i])\r\n a.append(e)\r\nfreq, add = [], []\r\nfor i in range(10 ** 6 + 1):\r\n freq.append(0)\r\nfor i in range(n):\r\n add.append(1)\r\ni, j = 0, 0\r\nd = 0\r\nm = -1\r\nl, r = -1, -1\r\nwhile i <= j and j < n:\r\n d += (freq[a[j]] == 0)\r\n freq[a[j]] += add[j]\r\n add[j] = 0\r\n if d > k:\r\n freq[a[i]] = max(0, freq[a[i]] - 1)\r\n d -= (freq[a[i]] == 0)\r\n i += 1\r\n else:\r\n temp = j - i\r\n if temp > m:\r\n m = temp\r\n l, r = i + 1, j + 1\r\n j += 1\r\nprint(l, r)", "n, k = map(int, input().split())\na = [*map(int, input().split())]\n \ncnt = [0] * 1000005\nansl = 1\nansr = 1\nmaxl = 1\nl = 0\nr = 1\ncnt[a[0]] = 1\nk -= 1\n \nwhile r < n:\n if cnt[a[r]] == 0:\n k -= 1\n cnt[a[r]] += 1\n while k < 0:\n cnt[a[l]] -= 1\n if cnt[a[l]] == 0:\n k += 1\n l += 1\n if r-l+1 > maxl:\n maxl = r-l+1\n ansl = l+1\n ansr = r+1\n r += 1\n \nprint(ansl, ansr)\n\t\t \t\t \t \t \t \t\t\t\t \t \t\t\t \t", "from collections import Counter\r\n\r\n\r\nn, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nl = 0\r\nr = n + 1\r\nans = (1, 1)\r\n\r\noccs = Counter()\r\noccs[a[0]] = 1\r\nj = 0\r\nfor i in range(n):\r\n while j + 1 < n and (occs[a[j + 1]] > 0 or len(occs) < k):\r\n j += 1\r\n occs[a[j]] += 1\r\n\r\n if ans[1] - ans[0] < j - i:\r\n ans = (i + 1, j + 1)\r\n\r\n occs[a[i]] -= 1\r\n if occs[a[i]] == 0:\r\n del occs[a[i]]\r\n\r\nprint(*ans)", "from collections import defaultdict\n\ndef solve(n, k, a):\n cur = 0\n cnt = defaultdict(int)\n\n al, ar = -1, -1\n p = 0\n for i in range(n):\n while p < n:\n cnt[a[p]] += 1\n if cnt[a[p]] == 1:\n cur += 1\n if cur > k:\n cnt[a[p]] -= 1\n if cnt[a[p]] == 0:\n cur -= 1\n break\n p += 1\n\n if ar - al < p - i:\n al, ar = i, p\n\n cnt[a[i]] -= 1\n if cnt[a[i]] == 0:\n cur -= 1\n\n assert al != -1\n print(al + 1, ar)\n\ndef main():\n while True:\n try:\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n solve(n, k, a)\n except EOFError:\n break\n\nif __name__ == \"__main__\":\n main()\n\n \t \t\t \t\t\t \t \t \t\t \t\t\t\t", "import sys\n\nn, k = map(int, input().split())\nhash = [0]*1000001\nnow =0\na = list(map(int, input().split()))\nans = 0\nl=0\n\nfor r in range(n):\n hash[a[r]]+=1\n if hash[a[r]] == 1: now +=1\n while (now >k):\n hash[a[l]] -=1\n if (hash[a[l]] ==0): now-=1\n l+=1\n \n if r-l+1 > ans:\n al = l\n ar = r\n ans = r-l+1\n \nprint(al+1, ar+1)\n \n \t\t\t \t\t\t\t\t\t\t \t \t \t \t\t \t", "import sys\r\nfrom collections import defaultdict\r\n\r\n\r\ndef get_longest_k_good_segment(numbers, k):\r\n best_l, best_r = 0, 0\r\n l, r = 0, 0\r\n window = defaultdict(int)\r\n while r < len(numbers):\r\n window[numbers[r]] += 1\r\n\r\n while len(window) > k:\r\n window[numbers[l]] -= 1\r\n if window[numbers[l]] == 0:\r\n del window[numbers[l]]\r\n l += 1\r\n\r\n if r - l > best_r - best_l:\r\n best_l, best_r = l, r\r\n r += 1\r\n\r\n return best_l + 1, best_r + 1\r\n\r\n\r\nif __name__ == '__main__':\r\n _, k = map(int, sys.stdin.readline().split())\r\n numbers = list(map(int, sys.stdin.readline().split()))\r\n result = get_longest_k_good_segment(numbers, k)\r\n print(result[0], result[1])\r\n", "n,k = map(int, input().split())\r\nhash = [0]*1000001\r\nnow = 0\r\na = list(map(int, input().split()))\r\nans = 0\r\nl = 0\r\n \r\nfor r in range(n):\r\n\thash[a[r]]+=1\r\n\tif hash[a[r]] == 1: now+=1\r\n\twhile (now>k):\r\n\t\thash[a[l]]-=1\r\n\t\tif (hash[a[l]]==0): now-=1\r\n\t\tl+=1\r\n\tif r-l+1>ans:\r\n\t\tal = l\r\n\t\tar = r\r\n\t\tans = r-l+1\r\nprint(al+1,ar+1)\r\n", "def main():\n n, k = map(int, input().split())\n l, cnt = list(map(int, input().split())), [0] * 1000001\n start = end = j = m = 0\n for i, x in enumerate(l):\n if not cnt[x]:\n k -= 1\n cnt[x] += 1\n if k < 0:\n x = l[j]\n cnt[x] -= 1\n if not cnt[x]:\n k += 1\n j += 1\n if m < i - j:\n m, start, end = i - j, j, i\n print(start + 1, end + 1)\n\n\nif __name__ == '__main__':\n main()\n \t\t \t \t\t \t\t \t\t \t\t\t \t \t\t\t\t\t", "import sys\r\n#import random\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**6)\r\nfrom queue import PriorityQueue\r\nfrom math import *\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\nmod = 10**9 + 7\r\n\r\nn,k = il()\r\na = il()\r\n\r\nb = [0 for i in range (10**6 + 5)]\r\n\r\nans = []\r\n\r\nl = -1\r\nt = 0\r\nj = 0\r\n\r\nfor i in range (n) :\r\n if (b[a[i]] == 0) :\r\n t += 1\r\n b[a[i]] += 1\r\n\r\n if (t > k) :\r\n while t>k :\r\n b[a[j]] -= 1\r\n\r\n if (b[a[j]] == 0) :\r\n t -= 1\r\n j += 1\r\n if (i-j > l) :\r\n ans = [j+1,i+1]\r\n l = i-j\r\n\r\nprint(*ans)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nans = None\r\ncur = 0\r\ncnt = 0\r\nl=0\r\nlib = defaultdict(int)\r\nfor i in range(N):\r\n if lib[A[i]]==0:\r\n cnt+=1\r\n lib[A[i]]+=1\r\n while cnt>K:\r\n lib[A[l]]-=1\r\n if lib[A[l]]==0:\r\n cnt-=1\r\n l+=1\r\n \r\n t = i-l+1\r\n if t>cur:\r\n cur = t\r\n ans = (l+1,i+1)\r\nprint(*ans)\r\n \r\n", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nl = 0\r\nr = n + 1\r\nans = (1, 1)\r\n\r\noccs = [0] * (10 ** 6 + 1)\r\nelems = 1\r\noccs[a[0]] = 1\r\nj = 0\r\nfor i in range(n):\r\n while j + 1 < n and (occs[a[j + 1]] > 0 or elems < k):\r\n j += 1\r\n if occs[a[j]] == 0:\r\n elems += 1\r\n occs[a[j]] += 1\r\n if ans[1] - ans[0] < j - i:\r\n ans = (i + 1, j + 1)\r\n\r\n if occs[a[i]] == 1:\r\n elems -= 1\r\n occs[a[i]] -= 1\r\n\r\nprint(*ans)\r\n", "import math\nfrom collections import deque\n\ndef fastprime(n):\n for i in range(2, int(math.sqrt(n)) + 1):\n if n % i == 0:\n return 0\n return 1\n\ndef power(n, a):\n res = 1\n while n:\n if n % 2:\n res *= n\n a -= 1\n else:\n n *= n\n a //= 2\n return res\n\ndef modpowe(n, a, p):\n res = 1\n while a:\n if a % 2:\n res = (res * n) % p\n a -= 1\n else:\n n = (n * n) % p\n a //= 2\n return res\n\ndef check(x):\n if x:\n print(\"YES\")\n else:\n print(\"NO\")\n\ndef solve():\n n, k = map(int, input().split())\n v = list(map(int, input().split()))\n \n d = deque()\n m = {}\n\n a = -1\n b = -1\n\n maxi = float('-inf')\n cur = 0\n \n for i in range(n):\n d.append(i + 1)\n\n if v[i] in m and len(m) <= k:\n cur += 1\n m[v[i]] += 1\n \n if cur > maxi:\n maxi = cur\n a = d[0]\n b = d[-1]\n else:\n if len(m) + 1 <= k:\n cur += 1\n m[v[i]] = 1\n \n if cur > maxi:\n maxi = cur\n a = d[0]\n b = d[-1]\n else:\n while len(m) >= k:\n val = d.popleft()\n x = v[val - 1]\n \n m[x] -= 1\n cur -= 1\n \n if m[x] == 0:\n del m[x]\n \n cur += 1\n m[v[i]] = 1\n \n if cur > maxi:\n maxi = cur\n a = d[0]\n b = d[-1]\n \n print(a, b)\n\ndef main():\n t = 1\n while t:\n solve()\n t -= 1\n\nif __name__ == \"__main__\":\n main()\n\n \t \t \t\t\t \t\t\t \t \t\t\t \t", "from collections import Counter\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nc=Counter()\r\ncount=0\r\nans=[-1,-1]\r\nl=0\r\nfor r,el in enumerate(arr):\r\n c[el]+=1\r\n if c[el]==1:\r\n count+=1\r\n while count>k:\r\n c[arr[l]]-=1\r\n if c[arr[l]]==0:\r\n count-=1\r\n l+=1\r\n if r-l+1>=ans[-1]-ans[0]+1:\r\n ans=[l+1,r+1]\r\n \r\nprint(*ans)", "def k_subarray(n, k, a):\n s, m, f = 0, 0, {}\n l, r = 0, 0\n ml, mr = 0, 0\n \n for e in range(n):\n c = a[e]\n if c not in f:\n f[c] = 0\n f[c] += 1\n \n while len(f) > k:\n lc = a[s]\n f[lc] -= 1\n if f[lc] == 0:\n del f[lc]\n s += 1\n \n if e - s + 1 > m:\n m = e - s + 1\n ml, mr = s + 1, e + 1\n \n return ml, mr\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nprint(*k_subarray(n, k, a))\n\n\t \t \t\t\t\t \t \t\t \t \t \t \t\t", "from sys import stdin \r\ninput=stdin.readline\r\ndef longestK(arr,k):\r\n cnt=[0]*(10**6+1)\r\n cur=0\r\n l=0\r\n ans=0\r\n al=0\r\n ar=0\r\n for i in range(len(arr)):\r\n cnt[arr[i]]+=1\r\n if cnt[arr[i]]==1:\r\n cur+=1\r\n while cur>k:\r\n cnt[arr[l]]-=1\r\n if cnt[arr[l]]==0:\r\n cur-=1\r\n l+=1\r\n if i-l+1>ans:\r\n al=l\r\n ar=i\r\n ans=i-l+1\r\n print(al+1,ar+1)\r\n return \"\"\r\n\r\na,b=map(int,input().strip().split())\r\nlst=list(map(int,input().strip().split()))\r\nprint(longestK(lst,b))", "import os\r\nimport sys \r\nfrom io import BytesIO, IOBase\r\n \r\nBUFSIZE = 8192\r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno() \r\n self.buffer = BytesIO() \r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break \r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0 \r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE)) \r\n self.newlines = b.count(b\"\\n\") + (not b) \r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1 \r\n return self.buffer.readline()\r\n \r\n def flush(self): \r\n if self.writable: \r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0) \r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.n = n\r\n self.parents = [-1] * n\r\n self.group = n\r\n\r\n def find(self, x):\r\n if self.parents[x] < 0:\r\n return x\r\n else:\r\n self.parents[x] = self.find(self.parents[x])\r\n return self.parents[x]\r\n\r\n def union(self, x, y):\r\n x = self.find(x)\r\n y = self.find(y)\r\n\r\n if x == y:\r\n return\r\n self.group -= 1\r\n if self.parents[x] > self.parents[y]:\r\n x, y = y, x\r\n\r\n self.parents[x] += self.parents[y]\r\n self.parents[y] = x\r\n\r\n def size(self, x):\r\n return -self.parents[self.find(x)]\r\n\r\n def same(self, x, y):\r\n return self.find(x) == self.find(y)\r\n\r\n def members(self, x):\r\n root = self.find(x)\r\n return [i for i in range(self.n) if self.find(i) == root]\r\n\r\n def roots(self):\r\n return [i for i, x in enumerate(self.parents) if x < 0]\r\n\r\n def group_count(self):\r\n return self.group\r\n\r\n def all_group_members(self):\r\n dic = {r:[] for r in self.roots()}\r\n for i in range(self.n):\r\n dic[self.find(i)].append(i)\r\n return dic\r\n\r\n def __str__(self):\r\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n ma = -1\r\n cnt = {}\r\n dif = 0\r\n r = 0\r\n for l in range(n):\r\n while r < n:\r\n if A[r] in cnt:\r\n cnt[A[r]] += 1\r\n elif dif < k:\r\n cnt[A[r]] = 1\r\n dif += 1\r\n else:\r\n break\r\n r += 1 \r\n d = r - l\r\n if d > ma:\r\n ma = d\r\n ans = (l + 1, r)\r\n cnt[A[l]] -= 1\r\n if cnt[A[l]] == 0:\r\n del cnt[A[l]]\r\n dif -= 1\r\n print(*ans)\r\n\r\n\r\n \r\n\r\n \r\n \r\nfor _ in range(1):\r\n solve() ", "import sys\r\nreadline=sys.stdin.readline\r\nwrite=sys.stdout.write\r\n\r\nN,K=map(int,readline().split())\r\nA=list(map(int,readline().split()))\r\nM=10**6+1\r\ncnt=[0]*M\r\nc=0\r\nmax_len=0\r\nL,R=None,None\r\nr=0\r\nfor l in range(N):\r\n while r!=N and (cnt[A[r]] or c<K):\r\n if cnt[A[r]]==0:\r\n c+=1\r\n cnt[A[r]]+=1\r\n r+=1\r\n if max_len<r-l:\r\n max_len=r-l\r\n L,R=l,r\r\n cnt[A[l]]-=1\r\n if cnt[A[l]]==0:\r\n c-=1\r\nL+=1\r\nprint(L,R)", "from collections import defaultdict\r\n\r\nn,k = [int(_) for _ in input().split()]\r\n\r\nnums = [int(_) for _ in input().split()]\r\n\r\ncount = defaultdict(int)\r\nans = 0\r\n\r\nans_l = 0\r\nans_r = 0\r\n\r\nl=0\r\nr = 0\r\nwhile(r <= n-1):\r\n\r\n count[nums[r]] += 1\r\n\r\n while l< n and len(count) > k:\r\n\r\n count[nums[l]] -= 1\r\n if count[nums[l]] <= 0:\r\n del count[nums[l]]\r\n \r\n l += 1\r\n \r\n if r-l+1 > ans:\r\n ans = r-l+1\r\n ans_l = l\r\n ans_r = r\r\n \r\n r += 1\r\n\r\nprint(ans_l+1,ans_r+1)", "n,k=map(int,input().split())\na=list(map(int,input().split()))\n\nl=r=diff=i=j=0\nd={}\n \nwhile i<n:\n if diff<k or a[i] in d:\n \n d[a[i]]=d.get(a[i],0)+1\n if d[a[i]]==1:\n diff+=1\n \n if i-j>r-l:\n l=j\n r=i\n \n i+=1\n \n else:\n if d[a[j]]==1:\n del d[a[j]]\n diff-=1\n else:\n d[a[j]]-=1\n\n j += 1\n \nprint(l+1,r+1)\n\n \t \t\t \t\t \t\t \t\t \t\t\t \t\t\t\t \t\t", "import re\r\nimport sys\r\nexit=sys.exit\r\nfrom bisect import bisect_left as bsl,bisect_right as bsr\r\nfrom collections import Counter,defaultdict as ddict,deque\r\nfrom functools import lru_cache\r\ncache=lru_cache(None)\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom math import inf\r\nfrom pprint import pprint as pp\r\nenum=enumerate\r\nri=lambda:int(rln())\r\nris=lambda:list(map(int,rfs()))\r\nrln=sys.stdin.readline\r\nrl=lambda:rln().rstrip('\\n')\r\nrfs=lambda:rln().split()\r\ncat=''.join\r\ncatn='\\n'.join\r\nmod=1000000007\r\nd4=[(0,-1),(1,0),(0,1),(-1,0)]\r\nd8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\n########################################################################\r\n\r\nn,k=ris()\r\na=ris()\r\nbeg=end=i=0\r\nocc=ddict(int)\r\nfor j in range(n):\r\n occ[a[j]]+=1\r\n while len(occ)>k:\r\n occ[a[i]]-=1\r\n if occ[a[i]]==0:\r\n del occ[a[i]]\r\n i+=1\r\n if end-beg<j-i:\r\n beg,end=i,j\r\n \r\nprint(beg+1,end+1)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncnt=defaultdict(int)\r\ntyp=0\r\nd=0\r\nans=[]\r\nl,r=0,0 # [l,r)\r\nwhile r<n:\r\n if typ<=k:\r\n r+=1\r\n aa=a[r-1]\r\n if cnt[aa]==0:\r\n cnt[aa]=1\r\n typ+=1\r\n else:\r\n cnt[aa]+=1\r\n if typ<=k:\r\n if d<r-l:\r\n d=r-l\r\n ans=[l+1,r]\r\n else:\r\n aa=a[l]\r\n if r-l>1:\r\n l+=1\r\n else:\r\n break\r\n if cnt[aa]==1:\r\n cnt[aa]-=1\r\n typ-=1\r\n else:\r\n cnt[aa]-=1\r\n if typ<=k:\r\n if d<r-l:\r\n d=r-l\r\n ans=[l+1,r]\r\nprint(*ans)", "import sys\r\n\r\nn, k = map(int, sys.stdin.buffer.readline().decode('utf-8').split())\r\na = list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))\r\nans_len, i, j = 0, 0, 0\r\nans_i, ans_j = 0, 0\r\nkind = 0\r\ncnt = [0]*(10**6+10)\r\n\r\nfor i in range(n):\r\n while j < n and kind + (1 if cnt[a[j]] == 0 else 0) <= k:\r\n kind += 1 if cnt[a[j]] == 0 else 0\r\n cnt[a[j]] += 1\r\n j += 1\r\n\r\n if ans_len < j-i:\r\n ans_len = j-i\r\n ans_i, ans_j = i+1, j\r\n\r\n cnt[a[i]] -= 1\r\n kind -= 1 if cnt[a[i]] == 0 else 0\r\n\r\nprint(ans_i, ans_j)\r\n", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nl=0\nans = 0\ncount = dict()\ncount_of_different = 0\nfor r in range(n):\n if arr[r] not in count:\n count[arr[r]] = 0\n count[arr[r]] += 1\n if count[arr[r]] == 1:\n count_of_different += 1\n while count_of_different > k:\n count[arr[l]] -= 1\n if count[arr[l]] == 0:\n count_of_different -= 1\n l += 1\n if ans < r - l + 1:\n ans = r - l + 1\n ans_l = l\n ans_r = r\n\n\nprint(ans_l + 1, ans_r + 1)\n\t \t\t\t\t\t\t \t\t\t \t\t \t \t \t\t \t", "import sys\r\nimport bisect\r\nfrom bisect import bisect_left as lb\r\ninput_=lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nfrom math import log\r\nfrom math import gcd\r\nfrom math import atan2,acos\r\nfrom random import randint\r\nsa=lambda :input_()\r\nsb=lambda:int(input_())\r\nsc=lambda:input_().split()\r\nsd=lambda:list(map(int,input_().split()))\r\nse=lambda:float(input_())\r\nsf=lambda:list(input_())\r\nflsh=lambda: sys.stdout.flush()\r\n#sys.setrecursionlimit(10**6)\r\nmod=10**9+7\r\ngp=[]\r\ncost=[]\r\ndp=[]\r\nmx=[]\r\nans1=[]\r\nans2=[]\r\nspecial=[]\r\nspecnode=[]\r\na=0\r\nkthpar=[]\r\ndef dfs(root,par):\r\n if par!=-1:\r\n dp[root]=dp[par]+1\r\n for i in range(1,20):\r\n if kthpar[root][i-1]!=-1:\r\n kthpar[root][i]=kthpar[kthpar[root][i-1]][i-1]\r\n for child in gp[root]:\r\n if child==par:continue\r\n kthpar[child][0]=root\r\n dfs(child,root)\r\ndef hnbhai():\r\n n,k=sd()\r\n a=sd()\r\n f=[0]*(10**6+1)\r\n ans=[n]*n\r\n i=0\r\n l=0\r\n d=0\r\n up=-1\r\n while(i<n):\r\n if i!=up:\r\n f[a[i]]+=1\r\n if(f[a[i]]==1):\r\n d+=1\r\n up=i \r\n if d>k:\r\n ans[l]=i\r\n f[a[l]]-=1\r\n if f[a[l]]==0:\r\n d-=1\r\n l+=1\r\n continue\r\n i+=1\r\n l,r=0,0\r\n abe=0\r\n for i in range(n):\r\n if ans[i]-i>abe:\r\n l=i+1\r\n r=ans[i]\r\n abe=ans[i]-i\r\n print(l,r)\r\nfor _ in range(1):\r\n hnbhai()\r\n", "a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nl=0\r\nr=-1\r\ndic={}\r\nn,m=0,-1\r\nwhile r+1<a:\r\n if b>=0:\r\n r+=1\r\n if dic.get(x[r],0)==0:\r\n dic[x[r]]=1\r\n b-=1\r\n else:\r\n dic[x[r]]+=1\r\n while b<0:\r\n dic[x[l]]-=1\r\n if dic[x[l]]==0:\r\n b+=1\r\n l+=1\r\n if r-l>m-n:\r\n m=r\r\n n=l\r\nprint(n+1,m+1)\r\n\r\n", "n, k = map(int, input().split())\nl = list(map(int, input().split()))\n\nd = dict()\ncount_of_distinct = 0\nmax_len = 0\n\nleft = 0\nfor right in range(len(l)):\n r_elem = l[right]\n if r_elem not in d:\n d[r_elem] = 0\n \n d[r_elem] += 1\n if d[r_elem] == 1:\n count_of_distinct += 1\n \n while count_of_distinct > k and left < right:\n l_elem = l[left]\n d[l_elem] -= 1\n \n if d[l_elem] == 0:\n count_of_distinct -= 1\n left += 1\n \n if right - left + 1 > max_len:\n left_answ = left\n max_len = right - left + 1\n \nprint(left_answ + 1, left_answ + max_len)\n \t\t \t \t \t\t\t \t \t\t \t \t\t \t\t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nl = 0\ncurrent_size = 0\nmax_l = 0\nmax_r = 0\nmax_size = 0\ncounts = {}\n\nfor r in range(n):\n counts[a[r]] = counts.get(a[r], 0) + 1\n current_size += 1\n while len(counts) > k:\n counts[a[l]] -= 1\n if counts[a[l]] == 0:\n del counts[a[l]]\n l += 1\n current_size -= 1\n\n if current_size > max_size:\n max_size = current_size\n max_l = l\n max_r = r\n\nprint(max_l+1, max_r+1)\n\n \t\t \t\t \t\t\t\t\t \t\t \t\t \t \t \t\t\t \t\t", "n, k = map(int, input().split())\na = [*map(int, input().split())]\n\nfrom collections import defaultdict\n\nd = defaultdict(int)\nl = 0\nr = 1\nans = (0, 0)\n\nfor i in a:\n\td[i] += 1\n\tif len(d) <= k:\n\t\tans = (l, r) if ans[1] - ans[0] < r - l else ans\n\telse:\n\t\twhile len(d) > k:\n\t\t\td[a[l]] -= 1\n\t\t\tif d[a[l]] == 0:\n\t\t\t\tdel d[a[l]]\n\t\t\tl += 1\n\tr += 1\n\nans = (ans[0] + 1, ans[1])\n\nprint(*ans)\n \t\t\t\t\t \t\t\t \t\t \t \t\t \t \t \t", "from collections import defaultdict\r\n\r\nn , k = map(int , input().split())\r\nlists = list(map(int , input().split()))\r\n\r\nl = 0\r\nr = 0\r\nmax_ = 0\r\nres = [1 , 1]\r\nsets = set()\r\ncount= 0\r\ndict_ = defaultdict(int)\r\nwhile r < len(lists):\r\n dict_[lists[r]]+=1\r\n if dict_[lists[r]] == 1:\r\n count+=1\r\n \r\n while count > k:\r\n \r\n dict_[lists[l]]-=1\r\n if not dict_[lists[l]]:\r\n count-=1\r\n l+=1\r\n if r - l + 1 >= max_:\r\n max_ = max(max_ , r - l + 1)\r\n res = [l+1 , r+1]\r\n \r\n \r\n \r\n r+=1\r\n\r\n \r\n\r\n\r\nprint(*res)\r\n \r\n\r\n \r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0] * (pow(10, 6) + 5)\r\nans = [1, 1]\r\nl = -1\r\ncnt = 0\r\nj = 0\r\nfor i in range(n):\r\n if b[a[i]] == 0:\r\n cnt += 1\r\n b[a[i]] += 1\r\n if cnt > k:\r\n while cnt > k:\r\n b[a[j]] -= 1\r\n if b[a[j]] == 0:\r\n cnt -= 1\r\n j += 1\r\n if i - j > l:\r\n ans = [j + 1, i + 1]\r\n l = i - j\r\nprint(*ans)", "from collections import deque\n\ndef find_longest_subarray(n, m, a):\n N = 5 * 10 ** 5 + 1\n freq = [0] * (2 * N)\n q = deque()\n\n un = 0\n res = 0\n l = 0\n r = 0\n\n for i in range(n):\n if freq[a[i]] == 0:\n un += 1\n freq[a[i]] += 1\n q.append(a[i])\n\n while q and un > m:\n freq[q[0]] -= 1\n if freq[q[0]] == 0:\n un -= 1\n q.popleft()\n\n if res < len(q):\n res = len(q)\n l = i - res + 1\n r = i\n\n return l + 1, r + 1\n\ndef main():\n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n l, r = find_longest_subarray(n, m, a)\n print(l, r)\n\nif __name__ == \"__main__\":\n main()\n \t\t\t\t \t\t\t \t\t\t\t\t\t \t\t\t\t\t\t\t\t \t \t\t", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom itertools import accumulate\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log, ceil\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\nmod=1000000007\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n \r\ndef solve():\r\n n, m = get_ints()\r\n arr = get_list()\r\n l = r = 0\r\n maxx = 0\r\n ans = []\r\n dic = defaultdict(int)\r\n while r < len(arr):\r\n if len(dic) <= m:\r\n dic[arr[r]] += 1\r\n if len(dic) <= m and maxx < r-l+1:\r\n ans = [l+1,r+1]\r\n maxx = r-l+1\r\n r+=1\r\n else:\r\n dic[arr[l]] -= 1\r\n if dic[arr[l]] == 0:\r\n del dic[arr[l]]\r\n l +=1\r\n return ans\r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n print(*solve())", "n,k = map(int, input().split())\na = list(map(int, input().split()))\n# sliding window O(n)\nslow,fast = 0,0\ncnt = {}\nmx = -1\nwhile fast < n:\n x = a[fast]\n cnt[x] = cnt.get(x,0)+1\n if len(cnt) <= k and fast-slow > mx:\n mx = fast-slow\n l,r = slow+1,fast+1\n elif len(cnt) > k:\n x = a[slow]\n cnt[x] -= 1\n if cnt[x] == 0:\n del cnt[x]\n slow += 1\n fast += 1\nprint(l,r)\n\n# complete search O(n^2)\n#dif = -1\n#for i in range(n):\n# s = set()\n# for j in range(i,n):\n# s.add(a[j])\n# if len(s) <= k and j-i > dif:\n# dif = j-i\n# l,r = i+1, j+1\n# elif len(s) > k:\n# break;\n#print(l,r)\n \n\n\n\n\n", "from collections import deque\n\nMAX_N = 5 * 10 ** 5 + 1\n\nn, m = map(int, input().split())\nnumbers = list(map(int, input().split()))\nfrequency = [0] * (2 * MAX_N)\nqueue = deque()\n\nunique_numbers = 0\nresult = 0\nleft = 0\nright = 0\n\nfor i in range(n):\n if frequency[numbers[i]] == 0:\n unique_numbers += 1\n frequency[numbers[i]] += 1\n queue.append(numbers[i])\n\n while queue and unique_numbers > m:\n frequency[queue[0]] -= 1\n if frequency[queue[0]] == 0:\n unique_numbers -= 1\n queue.popleft()\n\n if result < len(queue):\n result = len(queue)\n left = i - result + 1\n right = i\n\nprint(left + 1, right + 1)\n\n \t \t \t\t\t \t\t\t \t\t\t\t \t \t", "from collections import defaultdict\r\n\r\nn, k = [int(x) for x in input().split()]\r\nnums = [int(x) for x in input().split()]\r\n\r\nunique_nums = defaultdict(int)\r\nmx_len = 0\r\nl, r = 1, 1\r\n\r\nstart, end = 0, 0\r\nwhile end < n:\r\n unique_nums[nums[end]] += 1\r\n while len(unique_nums) > k:\r\n unique_nums[nums[start]] -= 1\r\n if unique_nums[nums[start]] == 0:\r\n del unique_nums[nums[start]]\r\n start += 1\r\n curr_len = end - start + 1\r\n if mx_len < curr_len:\r\n mx_len = curr_len\r\n l, r = start + 1, end + 1\r\n end += 1\r\n\r\nprint(f'{l} {r}')" ]

[ "import math\r\n\r\ndef rl():\r\n return map(int,input().split())\r\n\r\ndef ri():\r\n return int(input())\r\n\r\nn=ri()\r\n\r\nx=[]\r\ny=[]\r\n\r\nwhile n:\r\n a,b=rl()\r\n x.append(a)\r\n y.append(b)\r\n n-=1\r\n\r\ns=(max(x)-min(x))*(max(y)-min(y))\r\n\r\nif s==0:\r\n print(-1)\r\nelse:\r\n print(s)", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------08.04.2020-------------\r\n\r\nimport math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append([x,y])\r\nif n==1:print(-1)\r\nelse:\r\n S=0\r\n for i in range(n-1):\r\n for j in range(i+1,n):\r\n x1,y1,x2,y2=a[i][0],a[i][1],a[j][0],a[j][1]\r\n if x1!=x2 and y1!=y2:\r\n S=abs(x1-x2)*abs(y1-y2)\r\n \r\n if S!=0:print(S)\r\n else:\r\n print(-1)\r\n ", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n b= list(map(int, input().split()))\r\n a.append(b)\r\nif n==1:print(-1)\r\nelif n==2:\r\n if a[0][0]!=a[1][0] and a[0][1]!=a[1][1]:\r\n print(abs(a[0][0]-a[1][0])*abs(a[0][1]-a[1][1]))\r\n else:print(-1)\r\nelif n==3:\r\n x1,x2,x3,y1,y2,y3=a[0][0],a[1][0],a[2][0],a[0][1],a[1][1],a[2][1]\r\n if x1-x2!=0 and y1-y2!=0:print(abs(x1-x2)*abs(y1-y2))\r\n elif x1-x3!=0 and y1-y3!=0:print(abs(x1-x3)*abs(y1-y3))\r\n else:print(abs(x3-x2)*abs(y3-y2))\r\nelse:\r\n x1,x2,x3,x4,y1,y2,y3,y4=a[0][0],a[1][0],a[2][0],a[3][0],a[0][1],a[1][1],a[2][1],a[3][1]\r\n if x1-x2!=0 and y1-y2!=0:print(abs(x1-x2)*abs(y1-y2))\r\n elif x1-x3!=0 and y1-y3!=0:print(abs(x1-x3)*abs(y1-y3))\r\n else:print(abs(x1-x4)*abs(y1-y4))\r\n", "import math\r\nn = int(input())\r\nif n <= 1:\r\n print(-1)\r\n exit()\r\nelse:\r\n xy = []\r\n for i in range(n):\r\n tmp = tuple(map(int, input().split()))\r\n xy.append(tmp)\r\n if n == 4:\r\n print((max(xy[0][0], xy[1][0], xy[2][0], xy[3][0]) - min(xy[0][0], xy[1][0], xy[2][0], xy[3][0])) * (max(xy[0][1], xy[1][1], xy[2][1], xy[3][1]) - min(xy[0][1], xy[1][1], xy[2][1], xy[3][1]))) \r\n if n == 3:\r\n print((max(xy[0][0], xy[1][0], xy[2][0]) - min(xy[0][0], xy[1][0], xy[2][0])) * (max(xy[0][1], xy[1][1], xy[2][1]) - min(xy[0][1], xy[1][1], xy[2][1]))) \r\n if n == 2:\r\n if xy[1][0] == xy[0][0] or xy[1][1] == xy[0][1]:\r\n print(-1)\r\n else:\r\n print(abs((xy[1][0] - xy[0][0]) * (xy[1][1] - xy[0][1])))\r\n", "x=[]\r\ny=[]\r\nI=lambda:list(map(int,input().split()))\r\nfor _ in '0'*I()[0]:s=I();x+=[s[0]];y+=[s[1]]\r\nt=(max(x)-min(x))*(max(y)-min(y))\r\nprint([t,-1][not t])", "n = int(input())\r\nx = [0] * n\r\ny = [0] * n\r\nfor i in range(n):\r\n x[i], y[i] = map(int, input().split())\r\nans = (max(x) - min(x)) * (max(y) - min(y))\r\nif ans <= 0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "n = int(input())\r\nxset = set()\r\nyset = set()\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n xset.add(x)\r\n yset.add(y)\r\nif len(xset) == 2 and len(yset) == 2:\r\n xset = list(xset)\r\n yset = list(yset)\r\n print(abs(xset[0] - xset[1]) * abs(yset[0] - yset[1]))\r\nelse:\r\n print(-1)\r\n ", "n=int(input())\r\nX=[]\r\nY=[]\r\nA=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n X.append(x)\r\n Y.append(y)\r\n A.append([x,y])\r\n\r\nif n==1:\r\n print(-1)\r\nelif n==2:\r\n if min(Y)==max(Y) or min(X)==max(X):\r\n print(-1)\r\n else:\r\n S=abs(X[0]-X[1])*abs(Y[0]-Y[1])\r\n print(S)\r\nelif n>2:\r\n S=abs(max(X)-min(X))*abs(max(Y)-min(Y))\r\n print(S)", "n=int(input())\r\nmx=[]\r\nmy=[]\r\nfor i in range(n):\r\n\tx,y = map( int, input().split())\r\n\tmx.append(x)\r\n\tmy.append(y)\t\r\nt = ( max(mx) - min(mx) ) * ( max(my) - min(my))\r\n\r\n#because if one point given then -1\r\n#if 2 point given so to uniquely define a recytangle we need diagonal point\r\n#so if we have two rectangle point then we can find all the points of rectangle\r\n#and then the area\r\n#if more than two points then max would work \r\n\r\n\r\n\r\n#if t==0 then repeted point\r\n#so area is zero\r\nif t != 0:\r\n\tprint(t)\r\nelse:\r\n\tprint(-1)", "v = int(input())\r\n\r\ndef pl3(v):\r\n point = []\r\n for i in range(v):\r\n point.append(input().split())\r\n for k in point:\r\n for j in point:\r\n if k[0] != j[0] and k[1] != j[1]:\r\n return abs((int(k[0])-int(j[0]))*(int(k[1])-int(j[1])))\r\n break\r\n return -1\r\n\r\n\r\nif v == 1:\r\n print('-1')\r\nelse:\r\n print(pl3(v))", "N = int(input())\r\n\r\nif N == 1:\r\n x0,y0 = list(map(int,input().split()))\r\n print(-1)\r\nelif N == 2:\r\n x0,y0 = list(map(int,input().split()))\r\n x1,y1 = list(map(int,input().split()))\r\n if x0 == x1 or y0 == y1:\r\n print(-1)\r\n else:\r\n print(abs(x0-x1)*abs(y0-y1))\r\nelif N == 3:\r\n x0,y0 = list(map(int,input().split()))\r\n x1,y1 = list(map(int,input().split()))\r\n x2,y2 = list(map(int,input().split()))\r\n c0 = abs(x0-x1)*abs(y0-y1)\r\n c1 = abs(x1-x2)*abs(y1-y2)\r\n c2 = abs(x2-x0)*abs(y2-y0)\r\n print(max(c0,c1,c2))\r\nelse:\r\n x0,y0 = list(map(int,input().split()))\r\n x1,y1 = list(map(int,input().split()))\r\n x2,y2 = list(map(int,input().split()))\r\n x3,y3 = list(map(int,input().split()))\r\n c0 = abs(x0-x1)*abs(y0-y1)\r\n c1 = abs(x1-x2)*abs(y1-y2)\r\n c2 = abs(x2-x0)*abs(y2-y0)\r\n print(max(c0,c1,c2))", "from sys import stdin\r\nn=int(stdin.readline().strip())\r\ns=[]\r\nfor i in range(n):\r\n \r\n a,b=map(int,stdin.readline().strip().split())\r\n s.append([a,b])\r\nans=-1\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if( s[i][0]!=s[j][0] and s[i][1]!=s[j][1] ):\r\n \r\n ans=abs(s[i][0]-s[j][0] )* abs(s[i][1]-s[j][1] ) \r\nprint(ans)\r\n", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n s.append([a, b])\r\nif n == 1:\r\n print(-1)\r\nelif n == 2:\r\n if s[0][1] != s[1][1] and s[0][0] != s[1][0]:\r\n x1 = min(s[0][0], s[1][0])\r\n y1 = min(s[0][1], s[1][1])\r\n x2 = max(s[0][0], s[1][0])\r\n y2 = max(s[0][1], s[1][1])\r\n print((x2 - x1) * (y2 - y1))\r\n else:\r\n print(-1)\r\nelif n == 3:\r\n x1 = min(s[0][0], s[1][0], s[2][0])\r\n y1 = min(s[0][1], s[1][1], s[2][1])\r\n x2 = max(s[0][0], s[1][0], s[2][0])\r\n y2 = max(s[0][1], s[1][1], s[2][1])\r\n print((x2 - x1) * (y2 - y1))\r\nelse:\r\n x1 = min(s[0][0], s[1][0], s[2][0], s[3][0])\r\n y1 = min(s[0][1], s[1][1], s[2][1], s[3][1])\r\n x2 = max(s[0][0], s[1][0], s[2][0], s[3][0])\r\n y2 = max(s[0][1], s[1][1], s[2][1], s[3][1])\r\n print((x2 - x1) * (y2 - y1))", "from math import fabs\r\n\r\nn = int(input())\r\n\r\nP = []\r\nfor i in range(n):\r\n P.append(list(map(int, input().split())))\r\n\r\n\r\nif n==1: ans = -1\r\nelif n==2:\r\n if P[0][0]==P[1][0] or P[0][1]==P[1][1]:\r\n ans = -1\r\n else:\r\n ans = fabs(P[0][0]-P[1][0])*fabs(P[0][1]-P[1][1])\r\nelif n==3:\r\n for i in range(3):\r\n for j in range(i+1, 3):\r\n if P[i][0]!=P[j][0] and P[i][1]!=P[j][1]:\r\n ans = fabs(P[i][0]-P[j][0])*fabs(P[i][1]-P[j][1])\r\n break\r\nelse:\r\n for i in range(4):\r\n for j in range(i+1, 4):\r\n if P[i][0]!=P[j][0] and P[i][1]!=P[j][1]:\r\n ans = fabs(P[i][0]-P[j][0])*fabs(P[i][1]-P[j][1])\r\n break\r\nprint(int(ans))", "n = int(input())\r\nif n == 1:\r\n a = str(input())\r\n print(-1)\r\nelif n == 2:\r\n a = str(input())\r\n b = str(input())\r\n a = a.split(' ')\r\n b = b.split(' ')\r\n i = 0\r\n for i in range(2):\r\n a[i] = int(a[i])\r\n b[i] = int(b[i])\r\n if a[1] == b[1] or a[0] == b[0]:\r\n print(-1)\r\n else:\r\n print(abs((a[1]-b[1])*(a[0]-b[0])))\r\nelif n == 3:\r\n a = str(input())\r\n b = str(input())\r\n c = str(input())\r\n a = a.split(' ')\r\n b = b.split(' ')\r\n c = c.split(' ')\r\n for i in range(2):\r\n a[i] = int(a[i])\r\n b[i] = int(b[i])\r\n c[i] = int(c[i])\r\n if a[1] != b[1] and a[0] != b[0]:\r\n print(abs((a[1] - b[1]) * (a[0] - b[0])))\r\n elif a[1] != c[1] and a[0] != c[0]:\r\n print(abs((a[1] - c[1]) * (a[0] - c[0])))\r\n else:\r\n print(abs((c[1] - b[1]) * (c[0] - b[0])))\r\nelif n == 4:\r\n a = str(input())\r\n b = str(input())\r\n c = str(input())\r\n d = str(input())\r\n a = a.split(' ')\r\n b = b.split(' ')\r\n c = c.split(' ')\r\n d = d.split(' ')\r\n for i in range(2):\r\n a[i] = int(a[i])\r\n b[i] = int(b[i])\r\n c[i] = int(c[i])\r\n d[i] = int(d[i])\r\n if a[1] != b[1] and a[0] != b[0]:\r\n print(abs((a[1] - b[1]) * (a[0] - b[0])))\r\n elif a[1] != c[1] and a[0] != c[0]:\r\n print(abs((a[1] - c[1]) * (a[0] - c[0])))\r\n elif a[1] != d[1] and a[0] != d[0]:\r\n print(abs((a[1] - d[1]) * (a[0] - d[0])))\r\n elif b[1] != c[1] and b[0] != c[0]:\r\n print(abs((b[1] - c[1]) * (b[0] - c[0])))\r\n elif b[1] != d[1] and b[0] != d[0]:\r\n print(abs((d[1] - b[1]) * (d[0] - b[0])))\r\n elif c[1] != d[1] and c[0] != d[0]:\r\n print(abs((d[1] - c[1]) * (d[0] - c[0])))\r\n", "import sys\r\nn = int(input())\r\narr = []\r\nc = 0\r\nif n == 1:\r\n print(-1)\r\n sys.exit()\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n arr.append((x,y))\r\nfor i in range(n):\r\n for j in range(i+1):\r\n if arr[i][0] != arr[j][0] and arr[i][1] != arr[j][1]:\r\n print(abs(arr[i][0] - arr[j][0]) * abs(abs(arr[i][1] - arr[j][1])))\r\n c = 1\r\n sys.exit()\r\nprint(-1)\r\n", "n = int(input())\nR = lambda : map(int, input().split())\n\nxs = set()\nys = set()\n\nfor _ in range(n):\n x,y = R()\n xs.add(x)\n ys.add(y)\n\nif len(xs)==len(ys)==2:\n y = max(ys)-min(ys)\n x = max(xs)-min(xs)\n print (y*x)\nelse:\n print(-1)", "n=int(input())\r\nx=set()\r\ny=set()\r\nfor i in range(n):\r\n x1,y1 = map(int, input().split())\r\n x.add(x1)\r\n y.add(y1)\r\nif n==1 or len(x)==1 or len(y)==1:\r\n print(-1)\r\nelse:\r\n x=list(x)\r\n y=list(y)\r\n print(abs(x[1]-x[0])*abs(y[1]-y[0]))", "n = int(input())\r\nif n == 1:\r\n print(-1)\r\n exit()\r\nx = [0] * n\r\ny = [0] * n\r\nfor i in range(n):\r\n x[i], y[i] = map(int, input().split())\r\nif n == 2:\r\n if x[0] == x[1] or y[0] == y[1]:\r\n print(-1)\r\n else:\r\n print(abs(x[0]-x[1]) * abs(y[0]-y[1]))\r\nelse:\r\n for i in range(n):\r\n for j in range(n):\r\n if x[i] != x[j] and y[i] != y[j]:\r\n print(abs(x[i]-x[j]) * abs(y[i]-y[j]))\r\n exit()", "def basseyn(lst1, lst2):\r\n result = -1\r\n for i in range(len(lst1)):\r\n for j in range(i, len(lst1)):\r\n if lst1[i] != lst1[j] and lst2[i] != lst2[j]:\r\n result = abs(lst1[i] - lst1[j]) * abs(lst2[i] - lst2[j])\r\n return result\r\n\r\n\r\nn = int(input())\r\nX = list()\r\nY = list()\r\nfor i in range(n):\r\n x, y = [int(i) for i in input().split()]\r\n X.append(x)\r\n Y.append(y)\r\nprint(basseyn(X, Y))\r\n", "def main():\r\n\tn = int(input())\r\n\r\n\tX = []\r\n\tY = []\r\n\r\n\tfor _ in range(n):\r\n\t\tx, y = map(int, input().split())\r\n\t\tX.append(x)\r\n\t\tY.append(y)\r\n\r\n\tif n == 1:\r\n\t\treturn -1\r\n\r\n\txleft = min(X)\r\n\txright = max(X)\r\n\tybot = min(Y)\r\n\tytop = max(Y)\r\n\r\n\tif xleft != xright and ybot != ytop:\r\n\t\treturn (ytop-ybot) * (xright-xleft)\r\n\telse:\r\n\t\treturn -1\r\n\r\nprint(main())\r\n", "li = [list(map(int,input().split())) for i in range(int(input()))]\r\nsx,sy = set(i[0] for i in li),set(i[1] for i in li)\r\nprint ((max(sx)-min(sx))*(max(sy)-min(sy)) or -1)", "def area():\r\n for i in range(len(val)):\r\n for j in range(1, len(val)):\r\n tmp = abs(val[i][0]-val[j][0]) * abs(val[i][1]-val[j][1])\r\n if tmp != 0:\r\n return tmp\r\n return -1\r\n\r\nn = int(input())\r\nval = [list(map(int, input().split())) for _ in range(n)]\r\nprint(area())\r\n", "n = int(input())\r\nif n<2:\r\n print(-1)\r\n quit()\r\na = [[]]*n\r\nfor i in range(n):\r\n a[i]=list(map(int,input().split()))\r\nres = -1\r\nfor i in a:\r\n for j in a:\r\n if i[0] != j[0] and i[1] != j[1]:\r\n res = abs(i[0] - j[0]) * abs(i[1] - j[1])\r\nprint(res)", "def main():\n n = int(input())\n\n\n for i in range(n):\n entrada = input().split()\n x = int(entrada[0])\n y = int(entrada[1])\n\n if(i == 0):\n xmax = x \n ymax = y \n xmin = x\n ymin = y\n else:\n if(x > xmax):\n xmax = x\n if(y > ymax):\n ymax = y\n if(x < xmin):\n xmin = x\n if(y < ymin):\n ymin = y\n\n if(n == 1):\n print(-1)\n else:\n if(abs((xmax-xmin)*(ymax-ymin)) == 0):\n print(-1)\n else:\n print(abs((xmax-xmin)*(ymax-ymin)))\n\nif __name__ == '__main__':\n main()\n \t \t\t \t \t\t\t\t \t\t\t\t \t \t\t \t\t\t \t", "def Area(a, b):\n return abs(a[0][0] - b[0][0]) * abs(a[0][1] - b[1][1])\n\n\nn = int(input())\nif n == 1:\n _, _ = map(int, input().split())\n print(-1)\nelse:\n points = []\n for _ in range(n):\n x, y = map(int, input().split())\n points.append((x, y))\n\n if len(points) == 2:\n if points[0][0] == points[1][0] or points[0][1] == points[1][1]:\n print(-1)\n else:\n print(abs(points[0][0] - points[1][0])\n * abs(points[0][1] - points[1][1]))\n else:\n print(abs(points[0][0] * points[1][1] + points[1][0] * points[2][1] + points[2][0] * points[0]\n [1] - points[0][0] * points[2][1] - points[1][0] * points[0][1] - points[2][0] * points[1][1]))\n\n\t \t\t\t\t\t \t \t\t\t \t \t\t\t \t\t \t\t \t", "n = int(input())\r\nl=[]\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n l.append([a,b])\r\n\r\nl.sort()\r\n\r\nfor i in range(len(l)):\r\n \r\n for j in range(i+1,len(l)):\r\n \r\n if l[i][0]!=l[j][0] and l[i][1]!=l[j][1]:\r\n \r\n print(abs(l[i][0]-l[j][0])*abs(l[i][1]-l[j][1]))\r\n exit()\r\nprint(-1)\r\n\r\n", "\n\nn=int(input())\nif n==1:print(-1)\nelif n==2:\n x,y=map(int,input().split())\n x2,y2=map(int,input().split())\n if x2==x or y2==y:print(-1)\n else:print(abs((x2-x)*(y2-y)))\nelse:\n x,y=list(),list()\n for _ in range(n):\n a,b=map(int,input().split())\n x.append(a)\n y.append(b)\n print((max(x)-min(x))*(max(y)-min(y)))\n", "def mp(): return map(int,input().split())\r\ndef lt(): return list(map(int,input().split()))\r\ndef pt(x): print(x)\r\ndef ip(): return input()\r\ndef it(): return int(input())\r\ndef sl(x): return [t for t in x]\r\ndef spl(x): return x.split()\r\ndef aj(liste, item): liste.append(item)\r\ndef bin(x): return \"{0:b}\".format(x)\r\n\r\nn = it()\r\nP = []\r\nfor i in range(n):\r\n a,b = mp()\r\n P.append((a,b))\r\nP.sort(key = lambda x: x[0])\r\nif len(P) == 1:\r\n print(-1)\r\nelif len(P) == 4:\r\n print(abs(P[0][1]-P[1][1])*abs(P[2][0]-P[1][0]))\r\nelif len(P) == 3:\r\n if P[0][0] == P[1][0]:\r\n print(abs(P[0][1]-P[1][1])*abs(P[2][0]-P[1][0]))\r\n else: \r\n print(abs(P[1][1]-P[2][1])*abs(P[1][0]-P[0][0]))\r\nelse:\r\n if P[0][0] != P[1][0] and P[0][1] != P[1][1]:\r\n print(abs(P[1][0]-P[0][0])*abs(P[1][1]-P[0][1]))\r\n else:\r\n print(-1)\r\n\r\n \r\n ", "n=int(input())\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n x1,y1=map(int,input().split())\r\n x.append(x1)\r\n y.append(y1)\r\nif n==1:\r\n print('-1')\r\nelif n == 2:\r\n if x[0]==x[1] or y[0]==y[1]:\r\n print('-1')\r\n else: \r\n print(abs(x[0]-x[1])*abs(y[0]-y[1]))\r\nelse:\r\n print((max(x)-min(x))*(max(y)-min(y)))\r\n\r\n ", "def main():\n l = []\n for _ in range(int(input())):\n x1, y1 = map(int, input().split())\n for x2, y2 in l:\n s = (x1 - x2) * (y1 - y2)\n if s:\n print(abs(s))\n return\n l.append((x1, y1))\n print(-1)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n b=list(map(int,input().split()))\r\n a.append(b)\r\nfor i in range(n):\r\n for j in range(n):\r\n if(a[i][0]!=a[j][0] and a[i][1]!=a[j][1]):\r\n print(abs(a[i][0]-a[j][0])*abs(a[i][1]-a[j][1]))\r\n exit()\r\nprint('-1')", "def isDiagonal(a, b):\r\n\tax, ay = a[0], a[1]\r\n\tbx, by = b[0], b[1]\r\n\treturn ax != bx and ay != by\r\n\r\ndef area(a, b):\r\n\tax, ay = a[0], a[1]\r\n\tbx, by = b[0], b[1]\r\n\treturn abs(ax - bx) * abs(ay - by)\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tif n <= 1:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tpoints = []\r\n\t\tfor _ in range(n):\r\n\t\t\tx, y = map(int, input().split())\r\n\t\t\tpoints.append((x,y))\r\n\r\n\r\n\t\tif n == 2:\r\n\t\t\tif isDiagonal(points[0], points[1]):\r\n\t\t\t\tprint(area(points[0], points[1]))\r\n\t\t\telse:\r\n\t\t\t\tprint(-1)\r\n\t\telse:\r\n\t\t\tfor i in range(n):\r\n\t\t\t\tfor j in range(i, n):\r\n\t\t\t\t\tif isDiagonal(points[i], points[j]):\r\n\t\t\t\t\t\tprint(area(points[i], points[j]))\r\n\t\t\t\t\t\treturn\r\nmain()", "i = int(input())\r\nla = []\r\nlb = []\r\nfor x in range(i):\r\n a,b = map(int,input().split())\r\n la.append(a)\r\n lb.append(b)\r\nif len(set(la)) > 1 and len(set(lb)) > 1:\r\n print(abs((min(la)-max(la))*(min(lb)-max(lb))))\r\nelse: print(-1)", "n = int(input())\n\nif n == 1 or n == 0:\n print(-1)\nelif n == 2:\n x1, y1 = [int(x) for x in input().split()]\n x2, y2 = [int(x) for x in input().split()]\n \n if x1 == x2 or y1 == y2:\n print(-1)\n else:\n print(abs((x1 - x2) * (y1 - y2)))\nelif n == 3:\n x1, y1 = [int(x) for x in input().split()]\n x2, y2 = [int(x) for x in input().split()]\n x3, y3 = [int(x) for x in input().split()]\n \n print(abs((max(x1, max(x2, x3)) - min(x1, min(x2, x3))) * (max(y1, max(y2, y3)) - min(y1, min(y2, y3)))))\nelse:\n x1, y1 = [int(x) for x in input().split()]\n x2, y2 = [int(x) for x in input().split()]\n x3, y3 = [int(x) for x in input().split()]\n x4, y4 = [int(x) for x in input().split()]\n \n print(abs((max(x1, max(x2, x3)) - min(x1, min(x2, x3))) * (max(y1, max(y2, y3)) - min(y1, min(y2, y3)))))", "n = int(input())\r\np = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n p.append([x, y])\r\n\r\nif n == 1:\r\n print(-1)\r\nelif n == 2:\r\n if p[0][0] != p[1][0] and p[0][1] != p[1][1]:\r\n print(abs(p[0][0] - p[1][0]) * abs(p[0][1] - p[1][1]))\r\n else:\r\n print(-1)\r\nelse:\r\n x1 = p[0][0]\r\n x2 = 0\r\n for i in range(1, n):\r\n if x1 != p[i][0]:\r\n x2 = p[i][0]\r\n break\r\n y1 = p[0][1]\r\n y2 = 0\r\n for i in range(1, n):\r\n if y1 != p[i][1]:\r\n y2 = p[i][1]\r\n break\r\n print(abs(x2 - x1) * abs(y2 - y1))\r\n", "g = int(input())\r\nlst = []\r\nfor i in range(g):\r\n\th = list(map(int, input().split()))\r\n\tlst.append(h)\r\n\r\nif g == 3:\r\n\tif lst[0][0] != lst[1][0] and lst[0][1] != lst[1][1]:\r\n\t\tprint(abs(lst[0][0] - lst[1][0]) * abs(lst[0][1] - lst[1][1]))\r\n\telif lst[1][0] != lst[2][0] and lst[1][1] != lst[2][1]:\r\n\t\tprint(abs(lst[1][0] - lst[2][0]) * abs(lst[2][1] - lst[1][1]))\r\n\telif lst[0][0] != lst[2][0] and lst[0][1] != lst[2][1]:\r\n\t\tprint(abs(lst[0][0] - lst[2][0]) * abs(lst[0][1] - lst[2][1]))\r\nelif g == 4:\r\n\tif lst[0][0] != lst[1][0] and lst[0][1] != lst[1][1]:\r\n\t\tprint(abs(lst[0][0] - lst[1][0]) * abs(lst[0][1] - lst[1][1]))\r\n\telif lst[1][0] != lst[2][0] and lst[1][1] != lst[2][1]:\r\n\t\tprint(abs(lst[1][0] - lst[2][0]) * abs(lst[2][1] - lst[1][1]))\r\n\telif lst[0][0] != lst[2][0] and lst[0][1] != lst[2][1]:\r\n\t\tprint(abs(lst[0][0] - lst[2][0]) * abs(lst[0][1] - lst[2][1]))\r\n\telse:\r\n\t\tfor i in range(4):\r\n\t\t\tif lst[0][0] not in lst[i] and lst[0][1] not in lst[i]:\r\n\t\t\t\tprint(abs(lst[0][0] - lst[i][0]) * abs(lst[0][1] - lst[i][1]))\r\n\t\t\t\tbreak \r\n\t\r\nelif g == 2:\r\n\tif lst[0][0] != lst[1][0] and lst[0][1] != lst[1][1]:\r\n\t\tprint(abs(lst[0][0] - lst[1][0]) *abs(lst[0][1] - lst[1][1]))\r\n\telse:\r\n\t\tprint(-1)\r\nelif g == 1:\r\n\tprint(-1)\r\n ", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2015 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn = int(input())\n\ndef calc(a, n):\n for i in range(n):\n for j in range(i, n):\n if a[i][0] != a[j][0] and a[i][1] != a[j][1]:\n return abs(a[i][0] - a[j][0])*abs(a[i][1] - a[j][1])\n return -1\n\nif n == 1:\n print(-1)\nelse:\n a = []\n for i in range(n):\n a.append(list(map(int, input().split())))\n\n print(calc(a, n)) \n \n", "#596A\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n s.append(a)\r\nif n < 2:\r\n print(-1)\r\nelse:\r\n fir = [s[0][0]]\r\n sec = [s[0][1]]\r\n for j in range(1,n):\r\n if not(s[j][0] == fir[len(fir)-2]):\r\n fir.append(s[j][0])\r\n if not(s[j][1] == sec[len(sec)-2]):\r\n sec.append(s[j][1])\r\n if len(fir)>1 and len(sec)>1:\r\n print(abs(fir[1]-fir[0])*abs(sec[1]-sec[0]))\r\n else:\r\n print(-1)\r\n ", "n = int(input())\r\na = []\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n a.append((x,y))\r\n\r\n#print(a)\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][0]!=a[j][0] and a[i][1] != a[j][1]:\r\n print(abs(a[i][0]-a[j][0]) * abs(a[i][1] - a[j][1]))\r\n exit()\r\nprint(-1)\r\n", "n = int(input())\r\npoints = []\r\nfor i in range(n):\r\n points.append([int(a) for a in input().split(' ')])\r\n\r\nlength = len(points)\r\nif length == 1:\r\n print(-1)\r\nelse:\r\n w = 0\r\n h = 0\r\n\r\n for i in range(length):\r\n for j in range(i+1, length):\r\n lw = abs(points[i][0] - points[j][0])\r\n lh = abs(points[i][1] - points[j][1])\r\n if lw:\r\n w = lw\r\n if lh:\r\n h = lh\r\n if w and h:\r\n break\r\n if w and h:\r\n break\r\n\r\n s = w*h\r\n print(s if s else -1)\r\n", "__author__ = 'sandeepmellacheruvu'\r\nN = int(input())\r\nl = []\r\nfor n in range(N):\r\n x, y = map(int, input().split())\r\n l.append((x,y))\r\nif N == 1:\r\n print(-1)\r\nelse:\r\n\r\n if N == 2:\r\n x1, y1 = l[0]\r\n x2, y2 = l[1]\r\n if x1 == x2 or y1 == y2:\r\n print(-1)\r\n else:\r\n s1 = abs(y2 - y1)\r\n s2 = abs(x2 - x1)\r\n print(s1*s2)\r\n else:\r\n s1 = -1\r\n s2 = -1\r\n for i in range(N):\r\n for j in range(i + 1, N):\r\n ele1 = l[i]\r\n ele2 = l[j]\r\n x1, y1 = ele1\r\n x2, y2 = ele2\r\n if x1 == x2:\r\n s1 = abs(y2 - y1)\r\n elif y1 == y2:\r\n s2 = abs(x2 - x1)\r\n if s1 == -1 or s2 == -1:\r\n print(-1)\r\n else:\r\n print(s1 * s2)\r\n", "n = int(input())\r\np = [0] * n\r\nfor i in range(n):\r\n p[i] = tuple(map(int, input().split()))\r\n \r\nif n == 4:\r\n for i in range(1, 4):\r\n if p[0][0] != p[i][0] and p[0][1] != p[i][1]:\r\n res = abs(p[0][0] - p[i][0]) * abs(p[0][1] - p[i][1])\r\nelif n == 3:\r\n for i in range(1, 3):\r\n if p[0][0] != p[i][0] and p[0][1] != p[i][1]:\r\n res = abs(p[0][0] - p[i][0]) * abs(p[0][1] - p[i][1])\r\n for i in [0, 2]:\r\n if p[1][0] != p[i][0] and p[1][1] != p[i][1]:\r\n res = abs(p[1][0] - p[i][0]) * abs(p[1][1] - p[i][1])\r\nelif n == 2:\r\n if p[0][0] != p[1][0] and p[0][1] != p[1][1]:\r\n res = abs(p[0][0] - p[1][0]) * abs(p[0][1] - p[1][1])\r\n else: res = -1\r\n\r\nelse:\r\n res = -1\r\n \r\nprint(res)", "n=int(input())\r\nx=set()\r\ny=set()\r\nfor i in range(n):\r\n a=input().split()\r\n x.add(int(a[0]))\r\n y.add(int(a[1]))\r\nb=(max(y)-min(y))*(max(x)-min(x))\r\nif b:\r\n print(b)\r\nelse:\r\n print(-1)", "N=int(input())\r\nif N<2:\r\n print(-1)\r\nelif N==2:\r\n a=tuple(map(int,input().split()))\r\n b=tuple(map(int,input().split()))\r\n if a[0]!=b[0] and a[1]!=b[1]:\r\n print(abs(b[0]-a[0])*abs(b[1]-a[1]))\r\n else:\r\n print(-1)\r\nelif N==3:\r\n a=tuple(map(int,input().split()))\r\n b=tuple(map(int,input().split()))\r\n c=tuple(map(int,input().split()))\r\n print(abs((max(a[0],b[0],c[0])-min(a[0],b[0],c[0]))*(max(a[1],b[1],c[1])-min(a[1],b[1],c[1]))))\r\nelse:\r\n a=tuple(map(int,input().split()))\r\n b=tuple(map(int,input().split()))\r\n c=tuple(map(int,input().split()))\r\n d=tuple(map(int,input().split()))\r\n print(abs((max(a[0],b[0],c[0])-min(a[0],b[0],c[0]))*(max(a[1],b[1],c[1])-min(a[1],b[1],c[1]))))\r\n", "'''\n# https://www.jdoodle.com/python3-programming-online/\n#\n# 22.07.2021\n#\n# CF 331 A\n#\n''' \nn = int (input ())\nx = [0]*4\ny = [0]*4\nfor i in range (n) :\n x [i], y [i] = map (int, input ().split ())\n\nif n == 1 :\n print ('-1')\nelif n == 2 :\n if x [0] == x [1] or y [0] == y [1] :\n print ('-1')\n else :\n print (abs ((x [0] - x [1])*(y [0] - y [1])));\nelif n == 3 :\n if x [0] != x [1] and y [0] != y [1] :\n print (abs ((x [0] - x [1])*(y [0] - y [1])))\n elif x [0] != x [2] and y [0] != y [2] :\n print (abs ((x [0] - x [2])*(y [0] - y [2])))\n elif x [2] != x [1] and y [2] != y [1] :\n print (abs ((x [2] - x [1])*(y [2] - y [1])))\nelse :\n if x [0] != x [1] and y [0] != y [1] :\n print (abs ((x [0] - x [1])*(y [0] - y [1])))\n elif x [0] != x [2] and y [0] != y [2] :\n print (abs ((x [0] - x [2])*(y [0] - y [2])))\n elif x [0] != x [3] and y [0] != y [3] :\n print (abs ((x [0] - x [3])*(y [0] - y [3])))\n", "from sys import stdin\r\n\r\nax = []\r\nay = []\r\nn = int(stdin.readline())\r\n\r\nfor i in range(0, n):\r\n x, y = map(int, stdin.readline().split())\r\n ax.append(x)\r\n ay.append(y)\r\n\r\nif n == 1:\r\n print(-1)\r\nelif n == 2:\r\n if ax[0] != ax[1] and ay[0] != ay[1]:\r\n print(abs(ax[0] - ax[1]) * abs(ay[0] - ay[1]))\r\n else:\r\n print(-1)\r\nelse:\r\n print((max(ax) - min(ax)) * (max(ay) - min(ay)))\r\n \r\n", "n = int(input())\r\nx = []\r\ny = []\r\narea = 0\r\nfor i in range(n):\r\n li = list(map(int, input().strip().split(\" \")))\r\n x.append(li[0])\r\n y.append(li[1])\r\nresult = ((max(x)-min(x))*(max(y)-min(y)))\r\nprint(result if result > 0 else -1)", "n=int(input())\r\nif(n<2):print(-1)\r\nelif(n==2):\r\n a,b=map(int,input().split())\r\n c,d=map(int,input().split())\r\n if(a==c or b==d):print(-1)\r\n else:print(abs(a-c)*abs(b-d))\r\nelif(n>2):\r\n a,b=map(int,input().split())\r\n c,d=map(int,input().split())\r\n e,f=map(int,input().split())\r\n x,y=0,0\r\n if(a==c):\r\n x=abs(b-d)\r\n if(b==f):y=abs(a-e)\r\n else:y=abs(c-e)\r\n else:\r\n x=abs(a-c)\r\n if(e==a):y=abs(b-f)\r\n else:y=abs(d-f)\r\n print(x*y)", "mas = list(map(int, input().split()))\r\n\r\nokey = False\r\nt = mas[0]\r\nlst = []\r\nfor i in range(t):\r\n mas = list(map(int, input().split()))\r\n xi = mas[0]; yi = mas[1]\r\n lst = lst + [[xi, yi]]\r\nfor i in range(t):\r\n for j in range(t):\r\n a = abs(lst[i][0] - lst[j][0])\r\n b = abs(lst[i][1] - lst[j][1])\r\n if (a != 0 and b != 0):\r\n okey = True\r\n res = a * b\r\nif (okey):\r\n print(res)\r\nelse:\r\n print(-1)", "n=int(input())\r\nli=[]\r\nfor z in range(n):\r\n temp=list(map(int,input().split()))\r\n li.append(temp)\r\nif(n==1):\r\n print(-1)\r\nelif(n==2):\r\n if li[0][0]!=li[1][0] and li[0][1]!=li[1][1]:\r\n print(abs(li[0][0]-li[1][0])*abs(li[0][1]-li[1][1]))\r\n else:\r\n print(-1)\r\nelif(n==3):\r\n if li[0][0]!=li[1][0] and li[0][1]!=li[1][1]:\r\n print(abs(li[0][0]-li[1][0])*abs(li[0][1]-li[1][1]))\r\n elif li[1][0]!=li[2][0] and li[1][1]!=li[2][1]:\r\n print(abs(li[1][0]-li[2][0])*abs(li[1][1]-li[2][1]))\r\n else:\r\n print(abs(li[0][0]-li[2][0])*abs(li[0][1]-li[2][1]))\r\nelse:\r\n if li[0][0]!=li[1][0] and li[0][1]!=li[1][1]:\r\n print(abs(li[0][0]-li[1][0])*abs(li[0][1]-li[1][1]))\r\n elif li[0][0]!=li[2][0] and li[0][1]!=li[2][1]:\r\n print(abs(li[0][0]-li[2][0])*abs(li[0][1]-li[2][1]))\r\n elif li[0][0]!=li[3][0] and li[0][1]!=li[3][1]:\r\n print(abs(li[0][0]-li[3][0])*abs(li[0][1]-li[3][1]))\r\n elif li[1][0]!=li[2][0] and li[1][1]!=li[2][1]:\r\n print(abs(li[1][0]-li[2][0])*abs(li[1][1]-li[2][1]))\r\n elif li[1][0]!=li[3][0] and li[1][1]!=li[3][1]:\r\n print(abs(li[1][0]-li[3][0])*abs(li[1][1]-li[3][1]))\r\n else:\r\n print(abs(li[3][0]-li[2][0])*abs(li[3][1]-li[2][1]))", "n = int(input())\r\ndata = []\r\nfor i in range(n):\r\n data.append([int(i) for i in input().split()])\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n x.append(data[i][0])\r\n y.append(data[i][1])\r\n\r\nx = set(x)\r\ny = set(y)\r\n\r\nif len(x) < 2 or len(y) < 2:\r\n print(-1)\r\nelse:\r\n print((max(x) - min(x)) * (max(y) - min(y)))", "x , y = [] , []\r\nfor i in range(int(input())):\r\n a , b = map(int , input().split())\r\n x.append(a)\r\n y.append(b)\r\nans = (max(x)-min(x))*(max(y)-min(y))\r\nprint(ans if ans else -1)", "n = int(input())\r\na = []\r\nS = 0\r\n\r\nfor i in range(n):\r\n a.append(tuple(map(int, input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n S = max(S, abs((a[i][0] - a[j][0])*(a[i][1] - a[j][1])))\r\n\r\nif S == 0:\r\n print(-1)\r\nelse:\r\n print(S)\r\n \r\n", "n=int(input())\r\nif n<2:\r\n print(-1)\r\nelse:\r\n x=set()\r\n y=set()\r\n for i in range(n):\r\n a=tuple(map(int,input().split()))\r\n x.add(a[0])\r\n y.add(a[1])\r\n if len(y)>1 and len(x)>1:\r\n print((max(y)-min(y))*(max(x)-min(x)))\r\n else:\r\n print(-1)", "n=int(input())\r\npos=[]\r\nfor i in range(n):\r\n x,y=input().split()\r\n pos.append([int(x),int(y)])\r\nif n==1:\r\n print('-1')\r\nif n==2:\r\n if pos[0][0]==pos[1][0] or pos[0][1]==pos[1][1]:\r\n print('-1')\r\n else:\r\n print(abs(pos[0][0]-pos[1][0])*abs(pos[0][1]-pos[1][1]))\r\nif n==3:\r\n judge=0\r\n for i in range(3):\r\n if pos[i][0]==pos[i-1][0]:\r\n if pos[i-2][1]==pos[i][1] or pos[i-2][1]==pos[i-1][1]:\r\n judge=1\r\n break\r\n if judge==1:\r\n s=[]\r\n for i in range(3):\r\n S=abs(pos[i][0]-pos[i-1][0])*abs(pos[i][1]-pos[i-1][1])\r\n s.append(S)\r\n if max(s)!=0:\r\n print(max(s))\r\n else:\r\n print('-1')\r\n if judge==0:\r\n print('-1')\r\nif n==4:\r\n judge=0\r\n s=[]\r\n for i in range(4):\r\n for j in range(4):\r\n S=abs(pos[i][0]-pos[j][0])*abs(pos[i][1]-pos[j][1])\r\n s.append(S)\r\n print(max(s))\r\n \r\n", "n = int(input())\na = []\nflag = 0\nfor i in range(n):\n x = list(map(int, input().split()))\n a.append(x)\nif n == 1:\n print(-1)\nelif n == 2:\n if a[0][0] == a[1][0] or a[0][1] == a[1][1]:\n print(-1)\n else:\n print(abs(a[0][0] - a[1][0]) * abs(a[0][1] - a[1][1]))\nelse:\n for j in range(n - 1):\n for k in range(j + 1, n):\n if abs(a[j][0] - a[k][0]) * abs(a[j][1] - a[k][1]) != 0:\n print(abs(a[j][0] - a[k][0]) * abs(a[j][1] - a[k][1]))\n flag = 1\n break\n if flag == 1:\n break\n", "a = set()\r\nb = set()\r\ndef solve(s):\r\n\treturn max(s)-min(s)\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n\tx,y = list(map(int,input().split()))\r\n\ta.add(x)\r\n\tb.add(y)\r\n\r\nif len(a)!=2 or len(b)!=2:\r\n\tprint(-1)\r\nelse:\r\n\tprint(solve(a)*solve(b))", "def wrap():\n inp = input()\n n= int(inp)\n\n ver= list()\n for i in range(n):\n inp= input().split(' ')\n ver.append([int(inp[0]),int(inp[1])])\n\n for i in range(len(ver)):\n for j in range(i+1,len(ver)):\n if ver[i][0] != ver[j][0] and ver[i][1] != ver[j][1]:\n print(abs(ver[i][0]-ver[j][0])*abs(ver[i][1]-ver[j][1]))\n return\n else: \n print(-1)\n return\n\nwrap()\n", "def main():\n\tn = int(input())\n\tp = [[int(__) for __ in input().split()] for _ in range(n)]\n\tif n == 1:\n\t\treturn -1\n\tans = -1\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif p[i][0] != p[j][0] and p[i][1] != p[j][1]:\n\t\t\t\tans = abs((p[i][0] - p[j][0]) * (p[i][1] - p[j][1]))\n\treturn ans\n\nprint(main())\n\t", "import sys\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(-1)\r\n sys.exit()\r\nif n == 2:\r\n x_1, y_1 = map(int, input().split())\r\n x_2, y_2 = map(int, input().split())\r\n if x_1 == x_2 or y_1 == y_2:\r\n print(-1)\r\n sys.exit()\r\n else:\r\n print((max(x_1, x_2) - min(x_1, x_2)) * (max(y_1, y_2) - min(y_1, y_2)))\r\n sys.exit()\r\nif n == 3:\r\n x_1, y_1 = map(int, input().split())\r\n x_2, y_2 = map(int, input().split())\r\n x_3, y_3 = map(int, input().split())\r\nif n == 4:\r\n x_1, y_1 = map(int, input().split())\r\n x_2, y_2 = map(int, input().split())\r\n x_3, y_3 = map(int, input().split())\r\n x_4, y_4 = map(int, input().split())\r\nif x_1 != x_2 and y_1 != y_2:\r\n print((max(x_1, x_2) - min(x_1, x_2)) * (max(y_1, y_2) - min(y_1, y_2)))\r\n sys.exit()\r\nelif x_1 != x_3 and y_1 != y_3:\r\n print((max(x_1, x_3) - min(x_1, x_3)) * (max(y_1, y_3) - min(y_1, y_3)))\r\n sys.exit()\r\nelse:\r\n print((max(x_2, x_3) - min(x_2, x_3)) * (max(y_2, y_3) - min(y_2, y_3)))\r\n sys.exit()", "if __name__ == '__main__':\n n = int(input())\n x = set()\n y = set()\n\n for i in range(n):\n a, b = map(int, input().split())\n x.add(a)\n y.add(b)\n\n if len(x) < 2:\n print(-1)\n elif len(y) < 2:\n print(-1)\n else:\n print((max(x) - min(x)) * (max(y) - min(y)))\n\n\t\t \t \t\t\t\t \t\t\t \t\t \t \t\t \t \t", "I = lambda: map(int,input().split())\r\n\r\nX, Y = set(), set()\r\n\r\nfor _ in range(int(input())):\r\n x, y = I()\r\n X.add(x)\r\n Y.add(y)\r\n\r\nS = (max(X)-min(X)) * (max(Y)-min(Y))\r\n\r\nprint(S if S else -1)", "n=int(input())\r\nif n==1:\r\n x1,y1 = map(int, input().strip().split(' '))\r\n print(-1)\r\nelif n==2:\r\n x1,y1 = map(int, input().strip().split(' '))\r\n x2,y2 = map(int, input().strip().split(' '))\r\n if x1==x2 or y1==y2:\r\n print(-1)\r\n else:\r\n print(abs(x1-x2)*abs(y1-y2))\r\nelif n==3:\r\n x1,y1 = map(int, input().strip().split(' '))\r\n x2,y2 = map(int, input().strip().split(' '))\r\n x3,y3 = map(int, input().strip().split(' '))\r\n if x1!=x2 and y1!=y2:\r\n print(abs(x1-x2)*abs(y1-y2))\r\n elif x1!=x3 and y1!=y3:\r\n print(abs(x1-x3)*abs(y1-y3))\r\n else:\r\n print(abs(x2-x3)*abs(y2-y3))\r\nelse:\r\n x1,y1 = map(int, input().strip().split(' '))\r\n x2,y2 = map(int, input().strip().split(' '))\r\n x3,y3 = map(int, input().strip().split(' '))\r\n x4,y4 = map(int, input().strip().split(' '))\r\n if x1!=x2 and y1!=y2:\r\n print(abs(x1-x2)*abs(y1-y2))\r\n elif x1!=x3 and y1!=y3:\r\n print(abs(x1-x3)*abs(y1-y3))\r\n else:\r\n print(abs(x1-x4)*abs(y1-y4))\r\n \r\n \r\n#lst = list(map(int, input().strip().split(' ')))\r\n", "pl = [list(map(int, input().split())) for i in range(int(input()))]\r\nsx, sy = set(p[0] for p in pl), set(p[1] for p in pl)\r\nprint((max(sx) - min(sx)) * (max(sy) - min(sy)) or -1)", "def dlina(x,y,x1,y1):\r\n a=x-x1\r\n b=y-y1\r\n return (a**2+b**2)**0.5\r\nn=int(input())\r\nx2,y2=0,0\r\nif n==1:\r\n x,y=map(int,input().split())\r\n print(-1)\r\nelif n==2:\r\n x,y=map(int,input().split())\r\n x1,y1=map(int,input().split())\r\n if x==x1 or y==y1:\r\n print(-1)\r\n else:\r\n x2,y2=x1,y\r\n h=dlina(x2,y2,x1,y1)\r\n a=dlina(x2,y2,x,y)\r\n print(int(h*a))\r\nelif n==3:\r\n x,y=map(int,input().split())\r\n x1,y1=map(int,input().split()) \r\n x2,y2=map(int,input().split())\r\n h=dlina(min(x,x1,x2),min(y,y1,y2),max(x,x1,x2),min(y,y1,y2))\r\n a=dlina(min(x,x1,x2),min(y,y1,y2),min(x,x1,x2),max(y,y1,y2))\r\n print(int(a*h))\r\nelif n==4:\r\n k=0\r\n x,y=map(int,input().split())\r\n x1,y1=map(int,input().split()) \r\n x2,y2=map(int,input().split())\r\n x3,y3=map(int,input().split())\r\n xp,yp=min(x,x1,x2,x3),min(y,y1,y2,y3)\r\n xp1,yp1=max(x,x1,x2,x3),max(y,y1,y2,y3)\r\n x2,y2=xp1,yp\r\n h=dlina(x2,y2,xp1,yp1)\r\n a=dlina(x2,y2,xp,yp)\r\n print(int(h*a)) ", "n = int(input())\nv = []\na = 0\n\nfor i in range(n):\n v.append(list(map(int, input().split())))\n\nif n <= 1:\n print(-1)\nelse:\n if n == 2:\n if v[0][0] == v[1][0] or v[0][1] == v[1][1]:\n print(-1)\n else:\n a = abs(v[0][0] - v[1][0])*abs(v[0][1] - v[1][1])\n print(a)\n elif n == 3:\n if v[0][0] != v[1][0] and v[0][1] != v[1][1]:\n # Vertices de referência 0 e 1\n a = abs(v[0][0] - v[1][0])*abs(v[0][1] - v[1][1])\n print(a)\n elif v[0][0] != v[2][0] and v[0][1] != v[2][1]:\n # Vertices de referência 0 e 2\n a = abs(v[0][0] - v[2][0])*abs(v[0][1] - v[2][1])\n print(a)\n else:\n # Vertices de referência 1 e 2\n a = abs(v[2][0] - v[1][0])*abs(v[2][1] - v[1][1])\n print(a)\n else:\n if v[0][0] != v[1][0] and v[0][1] != v[1][1]:\n # Vertices de referência 0 e 1\n a = abs(v[0][0] - v[1][0])*abs(v[0][1] - v[1][1])\n print(a)\n elif v[0][0] != v[2][0] and v[0][1] != v[2][1]:\n # Vertices de referência 0 e 2\n a = abs(v[0][0] - v[2][0])*abs(v[0][1] - v[2][1])\n print(a)\n else:\n # Vertices de referência 0 e 3\n a = abs(v[0][0] - v[3][0])*abs(v[0][1] - v[3][1])\n print(a)\n\n \t \t\t\t \t \t\t \t \t\t \t\t \t", "def solve():\n N = int(input())\n X = [0] * N\n Y = [0] * N\n\n for i in range(N):\n X[i], Y[i] = map(int, input().split())\n\n xs = list(set(X))\n ys = list(set(Y))\n\n if len(xs) == 1 or len(ys) == 1:\n print(-1)\n return\n\n print(abs(xs[1] - xs[0]) * abs(ys[1] - ys[0]))\n\n\nif __name__ == '__main__':\n solve()\n", "#!/usr/bin/python3.5\r\nn=int(input())\r\nif n==1:\r\n print(-1)\r\n quit()\r\nif n==2:\r\n a,b=[int(x) for x in input().split()]\r\n c,d=[int(x) for x in input().split()]\r\n if a!=c and b!=d:\r\n print(abs(a-c)*abs(b-d))\r\n quit()\r\n else:\r\n print(-1)\r\n quit()\r\nif n==3:\r\n a,b=[int(x) for x in input().split()]\r\n c,d=[int(x) for x in input().split()]\r\n e,f=[int(x) for x in input().split()]\r\n k=[abs(a-c),abs(a-e)]\r\n l=[abs(b-d),abs(b-f)]\r\n print(max(k)*max(l))\r\n quit()\r\na,b=[int(x) for x in input().split()]\r\nc,d=[int(x) for x in input().split()]\r\ne,f=[int(x) for x in input().split()]\r\ng,h=[int(x) for x in input().split()]\r\nk=[abs(a-c),abs(a-e)]\r\nl=[abs(b-d),abs(b-f)]\r\nprint(max(k)*max(l))", "# import sys\r\n# sys.stdin = open('cf596a.in')\r\n\r\nfrom collections import namedtuple\r\n\r\nn = int(input())\r\n\r\nPoint = namedtuple(\"Point\", \"x y\")\r\n\r\npts = [Point(*map(int, input().split())) for _ in range(n)]\r\n\r\nif n == 1:\r\n\tprint(-1)\r\nelif n == 2:\r\n\tif pts[0].x == pts[1].x or pts[0].y == pts[1].y:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(abs((pts[1].x - pts[0].x) * (pts[0].y - pts[1].y)))\r\nelse:\r\n\tdiffs_x = set()\r\n\tdiffs_y = set()\r\n\tfor i in range(n - 1):\r\n\t\tfor j in range(i + 1, n):\r\n\t\t\tdiffs_x.add(abs(pts[i].x - pts[j].x))\r\n\t\t\tdiffs_y.add(abs(pts[i].y - pts[j].y))\r\n\tdiffs_x -= set([0])\r\n\tdiffs_y -= set([0])\r\n\tprint(diffs_x.pop() * diffs_y.pop())\r\n", "# print(\"Input n\")\nn = int(input())\n\na = [[0 for i in range(2)] for j in range(n)]\n\nfor i in range(n):\n # print(\"Input the next pair of vertices\")\n x,y = [int(t) for t in input().split()]\n a[i][0] = x\n a[i][1] = y\n\nif n == 1:\n print(-1)\nelif n == 2: # Can do it if they form a diagonal\n if a[0][0] == a[1][0] or a[0][1] == a[1][1]:\n print(-1)\n else:\n print(abs(a[0][0] - a[1][0]) * abs(a[0][1] - a[1][1]))\nelse: # n == 3 or n == 4\n # Find the two that are on a diag--then same logic as before\n # Just compute three and take the positive one\n one = abs(a[0][0] - a[1][0]) * abs(a[0][1] - a[1][1])\n two = abs(a[0][0] - a[2][0]) * abs(a[0][1] - a[2][1])\n three = abs(a[1][0] - a[2][0]) * abs(a[1][1] - a[2][1])\n print(max(one, two, three))\n\n \n \n", "n = int(input())\r\nif n==1:\r\n x,y = map(int, input().split())\r\n print(-1)\r\nelif n==4:\r\n x1,y1 = map(int, input().split())\r\n x2,y2 = map(int, input().split())\r\n x3,y3 = map(int, input().split())\r\n x4,y4 = map(int, input().split())\r\n h = w = 0\r\n if x1==x2:\r\n h = abs(y2-y1)\r\n w = abs(x3-x1)\r\n elif x1==x3:\r\n h = abs(y3-y1)\r\n w = abs(x2-x1)\r\n else:\r\n h = abs(y4-y1)\r\n w = abs(x3-x1)\r\n print(h*w)\r\nelif n==2:\r\n x1,y1 = map(int, input().split())\r\n x2,y2 = map(int, input().split())\r\n if x1==x2 or y1==y2:\r\n print(-1)\r\n else:\r\n print(abs((x1-x2)*(y1-y2)))\r\nelif n==3:\r\n x1,y1 = map(int, input().split())\r\n x2,y2 = map(int, input().split())\r\n x3,y3 = map(int, input().split())\r\n if x1==x2:\r\n print(abs((y2-y1)*(x3-x1)))\r\n elif x1==x3:\r\n print(abs((y3-y1)*(x2-x1)))\r\n else:\r\n print(abs((y2-y3)*(x2-x1)))\r\n", "n = int(input())\n\na, b = [], []\n\nfor i in range(n):\n x,y=map(int,input().split())\n a.append(x)\n b.append(y)\n\nans = (max(a)-min(a))*(max(b)-min(b))\n\nif ans==0:\n print(-1)\nelse:\n print(ans)\n\t\t \t \t\t \t\t \t \t\t \t \t \t\t \t \t \t", "def main():\r\n\tn = int(input())\r\n\r\n\tif n >= 2:\r\n\t\tx_val = []\r\n\t\ty_val = []\r\n\t\tx_set = set()\r\n\t\ty_set = set()\r\n\t\tfor _ in range(n):\r\n\t\t\tx, y = map(int, input().split())\r\n\t\t\tif x not in x_set:\r\n\t\t\t\tx_set.add(x)\r\n\t\t\t\tx_val.append(x)\r\n\t\t\tif y not in y_set:\r\n\t\t\t\ty_set.add(y)\r\n\t\t\t\ty_val.append(y)\r\n\r\n\t\tif len(x_set) == 2 and len(y_set) == 2:\r\n\t\t\tprint(abs(x_val[0] - x_val[1]) * abs(y_val[0] - y_val[1]))\r\n\t\t\treturn\r\n\tprint(-1)\r\nmain()", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n# = input()\nn = int(input())\nx = []\ny = []\n\nfor i in range(n):\n (X, Y) = (int(i) for i in input().split())\n x.append(X)\n y.append(Y)\n\nstart = time.time()\n\nx = list(set(x))\ny = list(set(y))\n\nif len(x) < 2 or len(y) <2:\n print(-1)\nelse:\n ans = (x[1] - x[0])*(y[1] - y[0])\n if ans < 0:\n ans = -ans\n print(ans)\n\nfinish = time.time()\n#print(finish - start)\n", "n = int(input())\r\n\r\nif n == -1:\r\n print(\"-1\")\r\nelse:\r\n a = set()\r\n b = set()\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n a.add(x)\r\n b.add(y)\r\n\r\n if len(a) != 2 or len(b) != 2:\r\n print(\"-1\")\r\n else:\r\n a = list(a)\r\n b = list(b)\r\n print(abs(a[1]-a[0])*abs(b[1]-b[0]))\r\n \r\n", "read = lambda: map(int, input().split())\r\nn = int(input())\r\nmaxx = maxy = -1001\r\nminx = miny = 1001\r\nfor i in range(n):\r\n x, y = read()\r\n maxx = max(maxx, x)\r\n minx = min(minx, x)\r\n maxy = max(maxy, y)\r\n miny = min(miny, y)\r\nS = (maxx - minx) * (maxy - miny)\r\nprint(S or -1)\r\n", "\"\"\"\r\nCodeforces Contest 596 Problem A\r\nWilbur and Swimming Pool\r\n\r\nTags:\r\nImplementation\r\n\r\nTsFreddie - wyffaddy\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\ndata = []\r\n\r\nfor i in range(n):\r\n line = input()\r\n line = line.split(\" \")\r\n data.append((int(line[0]), int(line[1])))\r\n\r\nif n == 1:\r\n print(-1)\r\n quit()\r\n\r\nif n == 2:\r\n if data[1][0] == data[0][0] or data[1][1] == data[0][1]:\r\n print(-1)\r\n quit()\r\n print(abs((data[1][0]-data[0][0])*(data[1][1]-data[0][1])))\r\n quit()\r\n\r\nif n > 2:\r\n area = -1\r\n for i in range(n):\r\n for j in range(i,n):\r\n this_area = abs((data[i][0]-data[j][0])*(data[i][1]-data[j][1]))\r\n if this_area != 0:\r\n if (this_area == area or area == -1):\r\n area = this_area\r\n else:\r\n print(-1)\r\n quit()\r\n print(area)\r\n", "n = int(input())\r\na = [tuple(map(int, input().split())) for i in range(n)]\r\n\r\nxmin = 100000\r\nxmax = -100000\r\nymin = 100000\r\nymax = -100000\r\n\r\nfor b in a:\r\n xmin = min(xmin, b[0])\r\n xmax = max(xmax, b[0])\r\n ymin = min(ymin, b[1])\r\n ymax = max(ymax, b[1])\r\n\r\nr = (xmax-xmin) * (ymax-ymin)\r\nif r == 0:\r\n print(-1)\r\nelse:\r\n print(r)\r\n", "import sys\n\n\ndef solve(n, vs):\n if n <= 1: return -1\n\n xs = set()\n ys = set()\n for v in vs:\n xs.add(v[0])\n ys.add(v[1])\n \n if len(xs) < 2 or len(ys) < 2:\n return -1\n else:\n xs = list(xs)\n ys = list(ys)\n dx = abs(xs[0] - xs[1])\n dy = abs(ys[0] - ys[1])\n return dx * dy\n\n\nif __name__ == \"__main__\":\n inputs = []\n for line in sys.stdin:\n inputs.append(line.strip())\n\n n = int(inputs[0])\n vs = []\n for i in range(n):\n x, y = map(int, inputs[i+1].split())\n vs.append((x, y))\n\n r = solve(n, vs)\n sys.stdout.write(\"{}\\n\".format(r))\n", "import sys\r\nn = int(input())\r\nxi =[]\r\nyi = []\r\nw = h = 0\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n xi.append(x)\r\n yi.append(y)\r\nif(n == 1):\r\n print('-1')\r\nelif(n == 2):\r\n \"\"\"not diagonal\"\"\"\r\n if(xi[0] == xi[1] or yi[0] == yi[1]):\r\n print('-1')\r\n else:\r\n print(abs((xi[0]-xi[1])*(yi[0]-yi[1])))\r\nelse:\r\n if(xi[0] == xi[1]):\r\n w = abs(xi[0] - xi[2])\r\n else:\r\n w = abs(xi[0] - xi[1])\r\n if(yi[0] == yi[1]):\r\n h = abs(yi[0]-yi[2])\r\n else:\r\n h = abs(yi[0] - yi[1])\r\n print(w*h)\r\n\r\n", "vertices=[]\r\nn=int(input())\r\nfor i in range(n):\r\n in1=input().split()\r\n vertices.append([int(in1[0]),int(in1[1])])\r\nif n>1:\r\n x1,y1=vertices[0][0],vertices[0][1]\r\n for i in vertices[1: ]:\r\n if i[0]!=x1:\r\n x2=i[0]\r\n if i[1]!=y1:\r\n y2=i[1]\r\n try:\r\n print(abs(x1-x2)*abs(y1-y2))\r\n except:\r\n print(-1)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "n = int(input())\nv = []\nfor i in range(n):\n v.append(list(map(int, input().split())))\n\nans = False\nfor xi, yi in v:\n if ans:\n break\n\n for xj, yj in v:\n if xi != xj and yi != yj:\n print(abs(xi - xj) * abs(yi - yj))\n ans = True\n break\n\nif not ans:\n print(-1)\n", "n = int(input())\r\nxpos, ypos = [], []\r\nfor x in range(n):\r\n string = input()\r\n numbers = string.split()\r\n xpos.append(int(numbers[0]))\r\n ypos.append(int(numbers[1]))\r\na = -1\r\nif n > 1:\r\n x = xpos[0]\r\n b = 1\r\n while xpos[b] == x:\r\n b += 1\r\n if b == n:\r\n break\r\n if b != n:\r\n m = abs(x - xpos[b])\r\n y = ypos[0]\r\n b = 1\r\n while ypos[b] == y:\r\n b += 1\r\n if b == n:\r\n break\r\n if b != n:\r\n n = abs(y - ypos[b])\r\n a = m * n\r\nprint(a)", "n=int(input())\r\nxfound=[]\r\nyfound=[]\r\nfor i in range(n):\r\n x0,y0=map(int,input().split())\r\n if x0 not in xfound:\r\n xfound.append(x0)\r\n if y0 not in yfound:\r\n yfound.append(y0)\r\nprint(abs((xfound[0]-xfound[1])*(yfound[0]-yfound[1])) if(len(xfound)==2 and len(yfound)==2) else -1)", "\"\"\"\nCodeforces Round #331 (Div. 2)\n\nProblem 596 A\n\n@author yamaton\n@date 2015-11-15\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef solve(pairs, n):\n if n <= 1:\n return -1\n elif n == 2:\n (a, b) = pairs[0]\n (c, d) = pairs[1]\n if a == c or b == d:\n return -1\n else:\n return abs(a-c) * abs(b-d)\n elif n >= 3:\n xmin = min(x for (x, _) in pairs)\n xmax = max(x for (x, _) in pairs)\n ymin = min(y for (_, y) in pairs)\n ymax = max(y for (_, y) in pairs)\n return (xmax - xmin) * (ymax - ymin)\n\n\n# def p(*args, **kwargs):\n# return print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n n = int(input())\n pairs = [tuple(int(_c) for _c in input().strip().split()) for _ in range(n)]\n assert len(pairs[0]) == 2\n\n result = solve(pairs, n)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "\nfrom math import sqrt\n\ninp = lambda : list(map(int, input().split()))\n\ndef dist(a, b):\n return int(sqrt((a[0] - b[0])**2 + (a[1] - b[1])**2))\n\ndef f(v):\n if len(v) in (3, 4):\n v.sort(key=lambda x:x[0])\n a, b, c = dist(v[0], v[1]), dist(v[1], v[2]), dist(v[0], v[2])\n return a*b*c // max(a, b, c)\n elif len(v) == 1:\n return -1\n elif len(v) == 2:\n if v[0][0] != v[1][0] and v[0][1] != v[1][1]:\n return abs((v[0][0] - v[1][0])*(v[0][1] - v[1][1]))\n else:\n return -1\n\nn = int(input())\nverts = []\nfor _ in range(n):\n verts.append(inp())\n\nprint(f(verts))\n\n", "import sys\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nif n <= 1:\r\n print(-1)\r\n sys.exit()\r\nfor i in range(n):\r\n for o in range(i+1, n):\r\n if a[i][0] != a[o][0] and a[i][1] != a[o][1]:\r\n print(abs(a[i][0] - a[o][0]) * abs(a[i][1] - a[o][1]))\r\n sys.exit()\r\nprint(-1)", "\r\nn = int(input())\r\nxs = list()\r\nys = list()\r\nfor x in range(n):\r\n x = input().split()\r\n xs.append(int(x[0]))\r\n ys.append(int(x[1]))\r\n\r\nif n == 1:\r\n print(-1)\r\nelse:\r\n l = (max(xs) - min(xs)) * (max(ys) - min(ys))\r\n if l == 0:\r\n print(-1)\r\n else:\r\n print(l)", "n = int(input())\nmin_x, min_y, max_x, max_y = 1001, 1001, -1001, -1001\nfor _ in range(n):\n x, y = map(int, input().split())\n min_x = min(min_x, x)\n max_x = max(max_x, x)\n min_y = min(min_y, y)\n max_y = max(max_y, y)\nif min_x != max_x and min_y != max_y:\n print((max_x - min_x) * (max_y - min_y))\nelse:\n print(-1)\n \n", "a = int(input())\r\nb = set()\r\nc = set()\r\nfor i in range(a):\r\n x, y = map(int, input().split())\r\n b.add(x)\r\n c.add(y)\r\nif len(b) == 2 and len(c) == 2:\r\n x1, x2 = b\r\n y1, y2 = c\r\n print(abs((x1 - x2)*(y1 - y2)))\r\nelse:\r\n print(-1)\r\n ", "def area(x, y, x1, y1):\r\n h = abs(y1 - y)\r\n w = abs(x1 - x)\r\n print(w * h)\r\n\r\nn = int(input())\r\ncoords = []\r\n\r\nfor i in range(n):\r\n x, y = [int(i) for i in input().split()]\r\n coords.append(x)\r\n coords.append(y)\r\n\r\nif n < 2:\r\n print(-1)\r\nelif n == 2:\r\n if coords[0] != coords[2] and coords[1] != coords[3]:\r\n area(coords[0], coords[1], coords[2], coords[3])\r\n else:\r\n print(-1)\r\nelif n >= 3:\r\n if coords[0] != coords[2] and coords[1] != coords[3]:\r\n area(coords[0], coords[1], coords[2], coords[3])\r\n elif coords[0] != coords[4] and coords[1] != coords[5]:\r\n area(coords[0], coords[1], coords[4], coords[5])\r\n else:\r\n area(coords[2], coords[3], coords[4], coords[5])", "n = int(input().split()[0])\r\npoints = []\r\nfor i in range(n):\r\n pt = []\r\n line = input().split()\r\n pt.append(int(line[0]))\r\n pt.append(int(line[1]))\r\n points.append(pt)\r\n \r\nres = -1\r\nfor vec in points:\r\n for vec2 in points:\r\n if vec[0] != vec2[0] and vec[1] != vec2[1]:\r\n res = abs(vec[0] - vec2[0]) * abs(vec[1] - vec2[1])\r\nprint(res)", "sx, sy = set(), set()\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n sx.add(x)\r\n sy.add(y)\r\nif min(len(sx), len(sy)) == 1:\r\n print(-1)\r\nelse:\r\n sx, sy = list(sx), list(sy)\r\n print(abs(sx[0] - sx[1]) * abs(sy[0] - sy[1]))", "n = int(input())\r\nv = []\r\n\r\nfor i in range(n):\r\n v.append([int(i) for i in input().split()])\r\n\r\nv.sort()\r\n\r\nif n == 1:\r\n print(-1)\r\nelif n == 2:\r\n if v[0][1] == v[1][1] or v[1][0] == v[0][0]:\r\n print(-1)\r\n else:\r\n print(abs(v[0][0]-v[1][0]) * abs(v[0][1]-v[1][1]))\r\nelif n == 3:\r\n if v[0][0] == v[1][0] != v[2][0]:\r\n if v[0][1] == v[2][1] != v[1][1]:\r\n print(abs(v[0][0]-v[2][0]) * abs(v[2][1]-v[1][1]))\r\n elif v[1][1] == v[2][1] != v[0][1]:\r\n print(abs(v[0][0]-v[2][0]) * abs(v[2][1]-v[0][1]))\r\n else:\r\n print(-1)\r\n elif v[1][0] == v[2][0] != v[0][0]:\r\n if v[1][1] == v[0][1] != v[2][1]:\r\n print(abs(v[0][0]-v[2][0]) * abs(v[2][1]-v[1][1]))\r\n elif v[2][1] == v[0][1] != v[1][1]:\r\n print(abs(v[0][0]-v[2][0]) * abs(v[2][1]-v[1][1]))\r\n else:\r\n print(-1)\r\n else:\r\n print(-1)\r\nelse:\r\n if v[0][0] == v[1][0] != v[2][0] and v[2][0] == v[3][0] and v[0][1] == v[2][1] and v[1][1] == v[3][1] != v[2][1]:\r\n print(abs(v[3][1]-v[2][1]) * abs(v[3][0] - v[1][0]))\r\n else:\r\n print(-1)\r\n", "n = int(input())\r\na = {}\r\nb = {}\r\nfor i in range(n):\r\n t1, t2 = map(int, input().split())\r\n a[t1] = t1\r\n b[t2] = t2\r\nif (len(a) < 2 or len(b) < 2):\r\n print(-1)\r\nelse:\r\n r1 = 0\r\n flag = 0\r\n for i in a:\r\n if (flag == 1):\r\n r1 -= i\r\n else:\r\n r1 += i\r\n flag = 1\r\n r2 = 0\r\n flag = 0\r\n for i in b:\r\n if (flag == 1):\r\n r2 -= i\r\n else:\r\n r2 += i\r\n flag = 1\r\n r = r1 * r2\r\n if (r < 0):\r\n r *= -1\r\n print(r)", "def find_distinct_coordinate(coordinates):\n for i, coordinate in enumerate(coordinates):\n for c2 in coordinates[i + 1:]:\n if coordinate[0] != c2[0] and coordinate[1] != c2[1]:\n return [coordinate, c2]\n\n return None\n\n\ndef swimming_pool():\n num_of_coordinates = int(input())\n\n coordinates = []\n for i in range(num_of_coordinates):\n coordinates.append([int(x) for x in input().split(' ')])\n\n if num_of_coordinates == 1:\n return -1\n\n distinct = find_distinct_coordinate(coordinates)\n\n if not distinct:\n return -1\n\n x1, y1 = distinct[0][0], distinct[0][1]\n x2, y2 = distinct[1][0], distinct[1][1]\n \n Xd = abs(x1 - x2)\n Yd = abs(y1 - y2)\n\n area = Xd * Yd\n return area if area else -1\n\n\nif __name__ == \"__main__\":\n print(swimming_pool())\n\n \t \t \t\t \t \t \t\t\t \t \t\t \t \t\t", "n = int(input())\nx, y = [], []\nfor i in range(n):\n _x, _y = map(int, input().split())\n x.append(_x)\n y.append(_y)\nx = sorted(set(x))\ny = sorted(set(y))\nif len(x) == 2 and len(y) == 2:\n print((x[1] - x[0]) * (y[1] - y[0]))\nelse:\n print(-1)\n", "n = int(input())\nlista_x = []\nlista_y = []\n\nfor i in range(n):\n\n xy = input()\n xy = xy.split()\n x = int(xy[0])\n y = int(xy[1])\n\n lista_x.append(x)\n lista_y.append(y)\n\nif n <= 1:\n print(-1)\n\nelse:\n\n maior_x = max(lista_x)\n maior_y = max(lista_y)\n menor_x = min(lista_x)\n menor_y = min(lista_y)\n\n res = abs(maior_x - menor_x) * abs(maior_y - menor_y)\n\n if res <= 0:\n print(-1)\n else:\n print(res)\n\n \t\t \t\t\t\t \t \t \t\t\t\t \t \t \t\t", "def solve(n):\r\n if n == 1:\r\n return -1\r\n x, y, = set(), set()\r\n for _ in range(n):\r\n xi, yi = map(int, input().split())\r\n x.add(xi)\r\n y.add(yi)\r\n if len(x) == 1 or len(y) == 1:\r\n return -1\r\n x, y = list(x), list(y)\r\n return abs((x[0] - x[1]) * (y[0] - y[1]))\r\n\r\n\r\nprint(solve(int(input())))", "def resolve(x, y):\n return (max(x) - min(x)) * (max(y) - min(y))\n\n\nn = int(input())\nx = []\ny = []\n\nfor i in range(n):\n xi, yi = [int(i) for i in input().split()]\n x.append(xi)\n y.append(yi)\n\naux = resolve(x, y)\nif aux != 0:\n print(aux)\nelse:\n print(\"-1\")\n\n\n\n\n\t\t\t \t\t \t \t\t \t \t\t \t\t \t \t", "n = int(input())\r\nif n == 1:\r\n print(-1)\r\n exit()\r\nif n == 2:\r\n x1, y1 = map(int, input().split())\r\n x2, y2 = map(int, input().split())\r\n if x1 == x2 or y1 == y2:\r\n print(-1)\r\n exit()\r\n print(abs(y1-y2)*abs(x1-x2))\r\nif n >= 3:\r\n a = []\r\n for i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n if a[i][0] != a[j][0] and a[i][1] != a[j][1]:\r\n x1, y1 = a[i][0], a[i][1]\r\n x2, y2 = a[j][0], a[j][1]\r\n print(abs(y1-y2)*abs(x1-x2))\r\n exit()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Apr 14 09:40:02 2021\r\n\r\n@author: MridulSachdeva\r\n\"\"\"\r\n\r\n\r\nn = int(input())\r\ns = []\r\nfor _ in range(n):\r\n s.append(list(map(int, input().split())))\r\n\r\nif n == 1:\r\n print(-1)\r\nelif n == 2:\r\n a = s[0]\r\n b = s[1]\r\n if a[0] != b[0] and a[1] != b[1]:\r\n a1 = a[0] - b[0]\r\n b1 = a[1] - b[1]\r\n print(abs(a1 * b1))\r\n else:\r\n print(-1)\r\nelse:\r\n s.sort(key=lambda x: x[0])\r\n a = s[0]\r\n b = s[1]\r\n c = s[2]\r\n s1 = a[0] - b[0] if a[0] != b[0] else a[1] - b[1]\r\n s2 = b[0] - c[0] if b[0] != c[0] else b[1] - c[1]\r\n print(abs(s1 * s2))", "def area(vs):\n w = max(x1 - x2 for (x1, _) in vs for (x2, _) in vs)\n h = max(y1 - y2 for (_, y1) in vs for (_, y2) in vs)\n return w * h or None\n\n\ndef pair(x, y):\n return x, y\n\n\nif __name__ == '__main__':\n n = int(input())\n vs = [pair(*map(int, input().split())) for _ in range(n)]\n a = area(vs)\n print(-1 if a is None else a)\n", "n = int(input())\r\na = [[0] * 2 for i in range(n)]\r\nfor i in range(n):\r\n a[i][0], a[i][1] = map(int, input().split())\r\n\r\n\r\nif n < 2:\r\n print(-1)\r\nelif n == 2:\r\n if a[0][0] == a[1][0] or a[0][1] == a[1][1]:\r\n print(-1)\r\n else:\r\n print(abs(a[0][0] - a[1][0]) * abs(a[0][1] - a[1][1]))\r\nelse:\r\n if a[0][0] == a[1][0] or a[0][1] == a[1][1]:\r\n if a[0][0] == a[2][0] or a[0][1] == a[2][1]:\r\n print(abs(a[2][0] - a[1][0]) * abs(a[2][1] - a[1][1]))\r\n else:\r\n print(abs(a[2][0] - a[0][0]) * abs(a[2][1] - a[0][1]))\r\n else:\r\n print(abs(a[0][0] - a[1][0]) * abs(a[0][1] - a[1][1]))\r\n\r\n", "#!/usr/bin/env python3\n# 596A_pool.py - Codeforces.com/problemset/problem/596/A by Sergey 2015\n\nimport unittest\nimport sys\n\n###############################################################################\n# Pool Class (Main Program)\n###############################################################################\n\n\nclass Pool:\n \"\"\" Pool representation \"\"\"\n\n def __init__(self, test_inputs=None):\n \"\"\" Default constructor \"\"\"\n\n it = iter(test_inputs.split(\"\\n\")) if test_inputs else None\n\n def uinput():\n return next(it) if it else sys.stdin.readline().rstrip()\n\n # Reading single elements\n [self.n] = map(int, uinput().split())\n\n # Reading multiple number of lines of the same number of elements each\n l, s = self.n, 2\n inp = (\" \".join(uinput() for i in range(l))).split()\n self.numm = [[int(inp[i]) for i in range(j, l*s, s)] for j in range(s)]\n self.numa, self.numb = self.numm\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n result = 0\n m = min(3, len(self.numa))\n\n for i in range(m):\n for j in range(i+1, m):\n result += abs(\n (self.numa[i] - self.numa[j]) *\n (self.numb[i] - self.numb[j]))\n if result == 0:\n result = -1\n\n return str(result)\n\n###############################################################################\n# Unit Tests\n###############################################################################\n\n\nclass unitTests(unittest.TestCase):\n\n def test_single_test(self):\n \"\"\" Pool class testing \"\"\"\n\n # Constructor test\n test = \"2\\n0 0\\n1 1\"\n d = Pool(test)\n self.assertEqual(d.n, 2)\n self.assertEqual(d.numa, [0, 1])\n self.assertEqual(d.numb, [0, 1])\n\n # Sample test\n self.assertEqual(Pool(test).calculate(), \"1\")\n\n # Sample test\n test = \"1\\n1 1\"\n self.assertEqual(Pool(test).calculate(), \"-1\")\n\n # Sample test\n test = \"4\\n2 2\\n3 3\\n2 3\\n3 2\"\n self.assertEqual(Pool(test).calculate(), \"1\")\n\n # My tests\n test = \"2\\n100 100\\n0 0\"\n self.assertEqual(Pool(test).calculate(), \"10000\")\n\n # Time limit test\n # self.time_limit_test(5000)\n\n def time_limit_test(self, nmax):\n \"\"\" Timelimit testing \"\"\"\n import random\n import timeit\n\n # Random inputs\n test = str(nmax) + \" \" + str(nmax) + \"\\n\"\n numnums = [str(i) + \" \" + str(i+1) for i in range(nmax)]\n test += \"\\n\".join(numnums) + \"\\n\"\n nums = [random.randint(1, 10000) for i in range(nmax)]\n test += \" \".join(map(str, nums)) + \"\\n\"\n\n # Run the test\n start = timeit.default_timer()\n d = Pool(test)\n calc = timeit.default_timer()\n d.calculate()\n stop = timeit.default_timer()\n print(\"\\nTimelimit Test: \" +\n \"{0:.3f}s (init {1:.3f}s calc {2:.3f}s)\".\n format(stop-start, calc-start, stop-calc))\n\nif __name__ == \"__main__\":\n\n # Avoiding recursion limitaions\n sys.setrecursionlimit(100000)\n\n if sys.argv[-1] == \"-ut\":\n unittest.main(argv=[\" \"])\n\n # Print the result string\n sys.stdout.write(Pool().calculate())\n", "n=int(input())\r\na,b=[],[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append(x)\r\n b.append(y)\r\ncheck=(max(a)-min(a))*(max(b)-min(b))\r\nif check==0:\r\n print(-1)\r\nelse:\r\n print(check)", "n=int(input())\r\na,b=[],[]\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n if x not in a:\r\n a.append(x)\r\n if y not in b:\r\n b.append(y)\r\nif len(a) == 2 and len(b) == 2:\r\n a.sort()\r\n b.sort()\r\n print((a[1]-a[0])*(b[1]-b[0]))\r\nelse:\r\n print('-1')", "n = int(input())\na = []\nb = []\n\nfor i in range(n):\n p, o = list(map(int, input().split()))\n a.append(p)\n b.append(o)\n\nif n == 1:\n print('-1')\n exit(0)\n\nelif n == 2:\n if a[0] == a[1] or b[0] == b[1]:\n print('-1')\n exit(0)\n\n else:\n x = abs(a[0] - a[1])\n y = abs(b[0] - b[1])\n\nelse:\n if a[0] != a[1]:\n x = abs(a[1] - a[0])\n \n elif a[0] != a[2]:\n x = abs(a[2] - a[0])\n\n if b[0] != b[1]:\n y = abs(b[1] - b[0])\n \n elif b[0] != b[2]:\n y = abs(b[2] - b[0])\n\nprint(x * y)\n\t\t \t \t \t\t\t \t\t \t\t\t\t\t \t \t\t\t", "left=int(input())\nX=list()\nY=list()\nout=False\nfor i in range(left):\n x, y=map(int, input().split())\n X.append(x)\n Y.append(y)\n\nif left<=1:\n print(-1)\n \nelif left==2:\n if X[0]!=X[1] and Y[0]!=Y[1]:\n print(abs(X[0]-X[1])*abs(Y[0]-Y[1]))\n else:\n print(-1)\n\nelif left==3:\n for i in range(3):\n for j in range(3):\n if X[j]!=X[i] and Y[j]!=Y[i]:\n x1=X[i]\n y1=Y[i]\n x2=X[j]\n y2=Y[j]\n out=True\n break\n if out==True:\n break\n print(abs(x1-x2)*abs(y1-y2))\n\nelif left==4:\n for i in range(4):\n for j in range(4):\n if X[j]!=X[i] and Y[j]!=Y[i]:\n x1=X[i]\n y1=Y[i]\n x2=X[j]\n y2=Y[j]\n out=True\n break\n if out==True:\n break\n print(abs(x1-x2)*abs(y1-y2))\n \n \n \n \n \n \n \n", "n = int(input())\r\nread = lambda : map(int,input().split())\r\nx1,y1 = read()\r\nx2=x1\r\ny2=y1\r\nfor _ in range(n-1):\r\n x,y = read()\r\n x1 = min(x1,x)\r\n x2 = max(x2,x)\r\n y1 = min(y1,y)\r\n y2 = max(y2,y)\r\nif x1==x2 or y1==y2:\r\n print(-1)\r\nelse:\r\n print((x2-x1)*(y2-y1))", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\ndef dist(x,y,c,d):\n return mt.sqrt((x-c)**2+(y-d)**2)\ndef circle(x1, y1, x2,y2, r1, r2): \n \n distSq = (((x1 - x2)* (x1 - x2))+ ((y1 - y2)* (y1 - y2)))**(.5) \n \n if (distSq + r2 <= r1): \n return True\n else: \n return False\n\nn=I()\nif(n==1):\n c,d=M()\n print(-1)\nelif(n==2):\n a,b=M()\n c,d=M()\n x=abs(a-c)*abs(b-d)\n if(x):\n print(x)\n else:\n print(-1)\nelse:\n sx=set([])\n sy=set([])\n for i in range(n):\n a,b=M()\n sx.add(a)\n sy.add(b)\n sx=list(sx)\n sy=list(sy)\n print(abs(sx[0]-sx[1])*abs(sy[0]-sy[1]))\n \n", "n = int(input())\n\nmax_y = -1001\nmax_x = -1001\nmin_y = 1001\nmin_x = 1001\n\npoints = []\n\nfor _ in range(0, n):\n x, y = [int(i) for i in input().split()]\n max_x = max(max_x, x)\n max_y = max(max_y, y)\n\n min_x = min(min_x, x)\n min_y = min(min_y, y)\n\n points.append([x, y])\n\n\nif n == 1:\n ans = -1;\nelif n == 2:\n if (points[0][0] == points[1][0]) or (points[0][1] == points[1][1]):\n ans = -1;\n else:\n ans = abs(points[0][0] - points[1][0]) * abs(points[0][1] - points[1][1])\n\nelse:\n ans = abs(max_x - min_x) * abs(max_y - min_y)\n\n\nif ans == 0:\n print(\"-1\")\nelse:\n print(ans)\n\n \t\t \t \t \t \t \t\t\t \t\t \t\t", "#!/usr/bin/env python3\n\nimport itertools\n\ndef main():\n n = int(input())\n a = [ ]\n for i in range(n):\n a.append(tuple(map(int, input().split())))\n for a, b in itertools.combinations(a, 2):\n if a[0] != b[0] and a[1] != b[1]:\n print(abs((a[0] - b[0]) * (a[1] - b[1])))\n break\n else:\n print(-1)\n\ntry:\n while True:\n main()\nexcept EOFError:\n pass\n", "n = int(input())\na = []\nfor i in range(n):\n\ta.append(tuple(map(int, input().split())))\n\nx1, y1, x2, y2 = float('inf'), float('inf'), float('inf'), float('inf')\nfor i in a:\n\tif x1 == float('inf'):\n\t\tx1 = i[0]\n\telif x2 == float('inf') and x1 != i[0]:\n\t\tx2 = i[0]\n\t\n\tif y1 == float('inf'):\n\t\ty1 = i[1]\n\telif y2 == float('inf') and y1 != i[1]:\n\t\ty2 = i[1]\n\nif y2 == float('inf') or x2 == float('inf'):\n\tprint('-1')\nelse:\n\tprint(abs(x1 - x2) * abs(y1 - y2))\n", "import math\r\nfrom decimal import *\r\nimport sys\r\nfrom fractions import Fraction\r\n\r\nn=int(input())\r\nx=[]\r\ny=[]\r\n\r\nfor i in range(0,n):\r\n inp=list(map(int,input().split()))\r\n x.append(inp[0])\r\n y.append(inp[1])\r\n\r\nif n==1:\r\n print(-1)\r\nif n==2:\r\n if y[0] == y[1] or x[0] == x[1]:\r\n print(-1)\r\n else:\r\n print(abs(x[0]-x[1]) * abs(y[0]-y[1]))\r\nif n>=3:\r\n\r\n ans=0\r\n for a in range(0,n):\r\n for i in range(0,n):\r\n if abs(x[a]-x[i]) * abs(y[a]-y[i]) != 0:\r\n ans = abs(x[a]-x[i]) * abs(y[a]-y[i])\r\n print(ans)\r\n \r\n", "import sys\r\n\r\nn = int(input())\r\nx = []\r\ny = []\r\nweight = height = 0\r\nfor i in range(n):\r\n xx,yy = map(int,input().split())\r\n x.append(xx)\r\n y.append(yy)\r\nif n == 1:\r\n print('-1')\r\nelif n == 2:\r\n if x[0] == x[1] or y[0] == y[1]:\r\n print('-1')\r\n else:\r\n print(abs((x[0]-x[1])*(y[0]-y[1])))\r\nelse:\r\n if x[0] == x[1]:\r\n weight = abs(x[2] - x[1])\r\n else:\r\n weight = abs(x[1] - x[0])\r\n\r\n if y[0] == y[1]:\r\n height = abs(y[2] - y[1])\r\n else:\r\n height = abs(y[1] - y[0])\r\n print(weight*height)\r\n\r\n\r\n", "#!/usr/bin/env python3\ndef f(a, b):\n return abs((a[0] - b[0]) * (a[1] - b[1]))\nn = int(input())\nx = [list(map(int,input().split())) for i in range(n)]\ny = 0\nfor i in range(n):\n for j in range(i+1, n):\n if not y:\n y = f(x[i], x[j])\nprint(y or -1)\n", "if __name__ == '__main__':\r\n n = int(input())\r\n lines = list()\r\n for i in range(n):\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n lines.append(line)\r\n if n == 1 or n == 2 and (lines[0][0] == lines[1][0] or lines[0][1] == lines[1][1]):\r\n print(-1)\r\n elif n == 2:\r\n print(abs((lines[1][0] - lines[0][0]) * (lines[1][1] - lines[0][1])))\r\n else:\r\n zones = list()\r\n if lines[1][0] == lines[0][0] or lines[1][1] == lines[0][1]:\r\n zones.append(abs(lines[1][0] - lines[0][0]) + abs(lines[1][1] - lines[0][1]))\r\n if lines[1][0] == lines[2][0] or lines[1][1] == lines[2][1]:\r\n zones.append(abs(lines[1][0] - lines[2][0]) + abs(lines[1][1] - lines[2][1]))\r\n if lines[0][0] == lines[2][0] or lines[0][1] == lines[2][1]:\r\n zones.append(abs(lines[0][0] - lines[2][0]) + abs(lines[0][1] - lines[2][1]))\r\n print(zones[0] * zones[1])\r\n", "def area(ps):\r\n xl = [p[0] for p in ps]\r\n yl = [p[1] for p in ps]\r\n lx = max(xl)-min(xl)\r\n ly = max(yl)-min(yl)\r\n return lx*ly if lx*ly>0 else -1\r\n\r\nps = [list(map(int,input().split())) for _ in range(int(input()))]\r\nprint(area(ps))\r\n\r\n", "import sys\r\n\r\n\r\n\r\nclass A:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\n def __lt__(self, other):\r\n return self.x<other.x\r\n \r\n \r\n\r\nn = int(input())\r\nar = []\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n ar.append(A(x,y))\r\n\r\n'''\r\nar.sort()\r\nfor i in range(n):\r\n print(ar[i].x, ar[i].y)\r\nsys.exit(0)\r\n''' \r\n\r\nif n==1:\r\n print(-1)\r\nelif n==2:\r\n if ar[0].x==ar[1].x or ar[0].y==ar[1].y:\r\n print(-1)\r\n else:\r\n print(abs(ar[0].x-ar[1].x)*abs(ar[0].y-ar[1].y))\r\nelse:\r\n #ar.sort()\r\n #disX = ar[n-1].x-ar[0].x\r\n x1,x2,y1,y2=1000000, 1000000,1000000,1000000\r\n setY = set()\r\n setX = set()\r\n for i in range(n):\r\n if x1==1000000:\r\n x1=ar[i].x\r\n elif x2==1000000 and ar[i].x!=x1:\r\n x2=ar[i].x\r\n\r\n if y1==1000000:\r\n y1=ar[i].y\r\n elif y2==1000000 and ar[i].y!=y1:\r\n y2=ar[i].y\r\n print(abs(x1-x2)*abs(y1-y2))\r\n\r\n\r\n\r\n \r\n", "\nclass test3:\n def demo(self, input_list):\n if len(input_list) == 1:\n print(-1)\n elif len(input_list) == 2:\n a = input_list[0]\n b = input_list[1]\n size = (b[0] - a[0]) * (b[1] - a[1])\n if size == 0:\n print(-1)\n else:\n print(abs(size))\n else:\n a = input_list[0]\n b = input_list[1]\n c = input_list[2]\n size = []\n size.append((b[0] - a[0]) * (b[1] - a[1]))\n size.append((c[0] - a[0]) * (c[1] - a[1]))\n size.append((c[0] - b[0]) * (c[1] - b[1]))\n # print(size)\n for i in size:\n if i != 0:\n print(abs(i))\n break\n\n\n\ndef test():\n test_lists = [\n [[0, 0], [1, 1]],\n [[1, 1], [0, 0]],\n [[1, 1]],\n [[0, 0], [1, 1], [1, 0]],\n [[0, 0], [1, 0]],\n [[0, 0], [2, 0], [2, 2], [0, 2]]\n ]\n for line in test_lists:\n print(line)\n test3().demo(line)\n\n\ndef main():\n input_list1 = input().strip().split()\n num = int(input_list1[0])\n input_list = []\n for i in range(num):\n input_list.append(list(map(int,input().strip().split())))\n # print(num, init)\n # print(input_list)\n test3().demo(input_list)\n\n\nif __name__ == '__main__':\n main()\n # test()\n\t \t \t\t \t \t\t\t \t\t \t \t\t\t\t \t\t", "n = int(input())\r\n\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n xi, yi = map(int, input().split())\r\n x.append(xi)\r\n y.append(yi)\r\nif n==1:\r\n print(-1)\r\n\r\nif n>=2:\r\n s = (max(x) - min(x)) * (max(y) - min(y))\r\n if s == 0: s = -1\r\n print(s)\r\n \r\n", "n = int(input())\r\na = [[int(i) for i in input().split()] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if a[i][0] != a[j][0] and a[i][1] != a[j][1]:\r\n print(abs(a[i][0] - a[j][0]) * abs(a[i][1] - a[j][1]))\r\n exit(0)\r\nprint(-1)", "n = int(input())\npoints = [ tuple(map(int, input().split())) for i in range(n) ]\nfor i, a in enumerate(points):\n for j in range(i + 1, n):\n b = points[j]\n if a[0] != b[0] and a[1] != b[1]:\n print(abs((a[0] - b[0]) * (a[1] - b[1])))\n import sys; sys.exit()\nprint(-1)\n", "n = int(input())\r\ninf = 1<<30\r\nx1 = inf\r\ny1 = inf\r\nx2 = -inf\r\ny2 = -inf\r\nfor i in range(n):\r\n x, y = map(int, input().split(\" \"))\r\n x2 = max(x2, x)\r\n y2 = max(y2, y)\r\n x1 = min(x1, x)\r\n y1 = min(y1, y)\r\nif n == 1 or (n == 2 and (x1 == x2 or y1 == y2)):\r\n print(\"-1\")\r\nelse:\r\n print(abs(x1-x2)*abs(y1-y2))\r\n", "n=int(input())\r\nif n==1:\r\n\tprint(-1)\r\nelif n==2:\r\n\ta,b=map(int,input().split())\r\n\tc,d=map(int,input().split())\r\n\tif a==c or b==d:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(abs(a-c)*abs(b-d))\r\nelse:\r\n\tX=[]\r\n\tY=[]\r\n\tfor i in range(n):\r\n\t\tx,y=map(int,input().split())\r\n\t\tif x not in X:\r\n\t\t\tX.append(x)\r\n\t\tif y not in Y:\r\n\t\t\tY.append(y)\r\n\tprint(abs(X[0]-X[1])*abs(Y[0]-Y[1]))", "from sys import stdin\n\ndef main():\n case = stdin.readline() # ignorado\n case = stdin.readline().strip()\n cases = []\n while len(case) != 0:\n cases.append(tuple([int(c) for c in case.split()]))\n case = stdin.readline().strip()\n\n area = -1\n i, j, terminado = 0, 0, False\n while i < len(cases) and not terminado:\n j = i+1\n while j < len(cases) and not terminado:\n if (cases[i][0] != cases[j][0] and cases[i][1] != cases[j][1]):\n terminado = True\n area = (cases[i][0] - cases[j][0]) * (cases[i][1] - cases[j][1])\n area = area if area >= 0 else -area\n j += 1\n i += 1\n\n print(area)\n\nmain()\n", "n=int(input())\r\nmx=[]\r\nmy=[]\r\nfor i in range(n):\r\n\tx,y = map( int, input().split())\r\n\tmx.append(x)\r\n\tmy.append(y)\t\r\nt = ( max(mx) - min(mx) ) * ( max(my) - min(my))\r\nif t != 0:\r\n\tprint(t)\r\nelse:\r\n\tprint(-1)", "n=int(input())\r\nl=[list(map(int,input().split())) for _ in range(n)]\r\nx=set()\r\ny=set()\r\nfor xx,yy in l:\r\n x|={xx}\r\n y|={yy}\r\nx=list(x)\r\ny=list(y) \r\nif len(x)==1 or len(y)==1: print(-1)\r\nelse: print(abs(x[0]-x[1])*abs(y[0]-y[1]))" ]

[ "import sys\r\nimport math \r\n\r\nn, m = list(map(int, input().split()))\r\n\r\nc = []\r\nz = [0] * 1000\r\nk = [0] * 1000\r\nfor i in range(1000):\r\n c.append([0] * 1000)\r\n\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n c[x - 1][y - 1] += 1\r\n z[y - 1] += 1\r\n\r\nca = 0\r\ncb = 0\r\nfor i in range(m):\r\n a, b = list(map(int, input().split()))\r\n if(c[a - 1][b - 1] > 0):\r\n ca += 1\r\n cb += 1\r\n c[a - 1][b - 1] -= 1\r\n z[b - 1] -= 1\r\n else:\r\n k[b - 1] += 1\r\n\r\nfor i in range(1000):\r\n ca += min(z[i], k[i])\r\n \r\nprint(ca, cb)\r\n\r\n", "\"\"\"\nhttps://codeforces.com/problemset/problem/159/B\n\"\"\"\nclosedbeautifully, closed = 0, 0\n\nn, m = [int(x) for x in input().split()]\nmarkers, caps = dict(), dict()\nfor _ in range(n):\n zz = tuple(int(x) for x in input().split())\n markers[zz] = markers.get(zz, 0) + 1\n\nfor _ in range(m):\n (x, y) = [int(x) for x in input().split()]\n if markers.get((x, y), 0) > 0:\n closedbeautifully += 1\n markers[(x, y)] -= 1\n else:\n caps[y] = caps.get(y, 0) + 1\n\nmarks = dict()\n\nfor (u, v), k in markers.items():\n marks[v] = marks.get(v, 0) + k\n\nfor k, v in caps.items():\n if k in marks:\n closed += min(v, marks[k])\n\nprint(closedbeautifully + closed, closedbeautifully)\n", "def readln(): return tuple(map(int, input().split()))\n\nn, m = readln()\ncnt = {}\nall1 = [0]*1001\nfor _ in range(n):\n x, y = readln()\n if y not in cnt:\n cnt[y] = {x: 1}\n else:\n cnt[y][x] = cnt[y].get(x, 0) + 1\n all1[y] += 1\ngoodly = 0\nall2 = [0]*1001\nfor _ in range(m):\n a, b = readln()\n if b in cnt:\n if cnt[b].get(a, 0) > 0:\n goodly += 1\n cnt[b][a] -= 1\n all1[b] -= 1\n else:\n all2[b] += 1\nclosed = 0\nfor i, j in zip(all1, all2):\n closed += min(i, j)\nprint(closed + goodly, goodly)\n", "from collections import Counter\r\n\r\ndef parseToTpl(x): \r\n return tuple(map(int, x.split()))\r\n\r\nlines = [w.rstrip() for w in open(0).readlines()]\r\nn, m = map(int, lines[0].split())\r\n\r\nmarkers = [parseToTpl(x) for x in lines[1:n+1]]\r\ncaps = [parseToTpl(x) for x in lines[n+1:]]\r\n\r\nmRaw = [m[1] for m in markers]\r\ncRaw = [c[1] for c in caps]\r\nmRawCounter = Counter(mRaw)\r\ncRawCounter = Counter(cRaw)\r\n\r\nclosed = 0\r\nfor k, v in mRawCounter.items():\r\n if k in cRawCounter:\r\n closed += min(v, cRawCounter[k])\r\n\r\nmc = Counter(markers)\r\ncc = Counter(caps)\r\nbeauty = 0\r\nfor k,v in mc.items():\r\n if k in cc:\r\n beauty += min(v, cc[k])\r\n\r\nprint(f'{closed} {beauty}')", "def main():\n from sys import stdin\n l = list(map(int, stdin.read().split()))\n n, yx = l[0] * 2, [[0] * 1001 for _ in range(1001)]\n cnt = yx[0]\n u = v = 0\n for y, x in zip(l[3:n + 3:2], l[2:n + 2:2]):\n cnt[y] += 1\n yx[y][x] += 1\n ba, l = list(zip(l[n + 3::2], l[n + 2::2])), []\n for y, x in ba:\n if yx[y][x]:\n yx[y][x] -= 1\n cnt[y] -= 1\n v += 1\n else:\n l.append(y)\n for y in l:\n if cnt[y]:\n cnt[y] -= 1\n u += 1\n print(u + v, v)\n\n\nif __name__ == '__main__':\n main()\n", "n,m = map(int,input().split());\r\n\r\nKl2 = {}\r\nFl2 = {}\r\nFl1 = {};\r\nKl1 = {};\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split());\r\n temp = a*1000+b;\r\n try:\r\n Fl2[temp]+=1;\r\n except:\r\n Fl2[temp]=1;\r\n try:\r\n Fl1[b]+=1;\r\n except:\r\n Fl1[b]=1;\r\nr2 = 0\r\nfor i in range(m):\r\n a,b = map(int,input().split());\r\n temp = a*1000+b;\r\n try:\r\n Kl2[temp]+=1;\r\n except:\r\n Kl2[temp]=1;\r\n try:\r\n Kl1[b]+=1;\r\n except:\r\n Kl1[b]=1;\r\nr1 = 0;\r\nfor i in Kl1:\r\n try:\r\n r1 += min(Kl1[i],Fl1[i])\r\n except:\r\n pass;\r\nfor i in Kl2:\r\n try:\r\n r2+=min(Kl2[i],Fl2[i]);\r\n except:\r\n pass;\r\nprint(r1, r2)\r\n", "n,m = list(map(int,input().split()))\r\nbuck1,buck2,cb,c = {},{}, 0, 0\r\n\r\nfor i in range(n):\r\n k1,k2 = list(map(int,input().split()))\r\n if k2 in buck1: buck1[k2][k1] = buck1[k2].get(k1,0) + 1 # get - The method get() returns a value for the given key\r\n else: buck1[k2] = {k1:1}\r\n\r\nfor i in range(m):\r\n k1,k2 = list(map(int,input().split()))\r\n if k2 in buck2: buck2[k2][k1] = buck2[k2].get(k1,0) + 1\r\n elif k2 in buck1: buck2[k2] = {k1:1}\r\nfor i in buck1.keys() & buck2.keys():\r\n c += min(sum(buck1[i].values()), sum(buck2[i].values()))\r\n cb += sum(min(buck1[i][k], buck2[i][k]) for k in buck1[i].keys() & buck2[i].keys())\r\n\r\nprint(c,cb)", "n, m = map(int, input().split())\r\na = dict()\r\nl = list()\r\nu = 0\r\nv = 0\r\nfor i in range(n):\r\n c, d = map(int, input().split())\r\n if a.get(d, -1) == -1:\r\n a[d] = dict()\r\n a[d][c] = 1\r\n elif a[d].get(c, -1) == -1:\r\n a[d][c] = 1\r\n else:\r\n a[d][c] += 1\r\nfor i in range(m):\r\n c, d = map(int, input().split())\r\n if a.get(d, -1) != -1:\r\n if a[d].get(c, -1) == -1:\r\n l.append((c, d))\r\n else:\r\n a[d][c] -= 1\r\n u += 1\r\n if a[d][c] == 0:\r\n del a[d][c]\r\n if a[d] == {}:\r\n del a[d]\r\nfor c, d in l:\r\n if a.get(d, -1) != -1:\r\n for i in a[d]:\r\n c = i\r\n break\r\n a[d][i] -= 1\r\n v += 1\r\n if a[d][i] == 0:\r\n del a[d][i]\r\n if a[d] == {}:\r\n del a[d]\r\nprint(u + v, u)\r\n", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn, m = list(map(int, input().split()))\r\ndc = dict()\r\nfor _ in range(n):\r\n x, y = list(map(int, input().split()))\r\n xx = x * 10000 + y\r\n dc[xx] = dc.get(xx, 0) + 1\r\nr1 = r2 = 0\r\ndc2 = dict()\r\nfor _ in range(m):\r\n a, b = list(map(int, input().split()))\r\n if dc.get(ab := a * 10000 + b):\r\n r1 += 1\r\n r2 += 1\r\n dc[ab] -= 1\r\n else:\r\n dc2[b] = dc2.get(b, 0) + 1\r\nfor k, v in dc.items():\r\n if dc2.get(kk := k % 10000):\r\n r1 += min(dc2[kk], v)\r\n dc2[kk] = 0 if dc2[kk] < v else dc2[kk] - v\r\nprint(r1, r2)", "n, m = map(int, input().split())\r\na = []\r\nb = []\r\nx = []\r\ny = []\r\n\r\narr_open = [0] * 1001\r\narr_close = [0] * 1001\r\nmatrix = [[0] * 1001 for _ in range(1001)]\r\nans2 = 0\r\nfor _ in range(n):\r\n x_i, y_i = map(int, input().split())\r\n x.append(x_i)\r\n y.append(y_i)\r\n arr_open[y_i] += 1\r\n matrix[x_i][y_i] += 1\r\n\r\nfor _ in range(m):\r\n a_i, b_i = map(int, input().split())\r\n a.append(a_i)\r\n b.append(b_i)\r\n arr_close[b_i] += 1\r\n if matrix[a_i][b_i] != 0:\r\n matrix[a_i][b_i] -= 1\r\n ans2 += 1\r\n\r\nans = 0\r\nfor i in range(1001):\r\n ans += min(arr_close[i], arr_open[i])\r\n\r\nprint(f'{ans} {ans2}')", "from operator import itemgetter\r\nline = input().split()\r\nn, m = int(line[0]), int(line[1])\r\nmk,c=[],[]\r\nfor i in range(n):\r\n line = input().split()\r\n mk.append((int(line[1]), int(line[0])))\r\nfor i in range(m):\r\n line = input().split()\r\n c.append([int(line[1]), int(line[0])])\r\nmk = sorted(mk,key=itemgetter(0,1))\r\nc = sorted(c,key=itemgetter(0,1))\r\ni, j, nrm, nrc, count, countp = 0, 0, 0, 0, 0, 0\r\nwhile i < n and j < m:\r\n if mk[i][0] < c[j][0]:\r\n i += 1\r\n elif mk[i][0] > c[j][0]:\r\n j +=1\r\n else:\r\n iaux = i\r\n nrm, nrc, nre = 0, 0, 0\r\n while i < n and j <m and mk[i][0] == c[j][0] and mk[i][0] == mk[iaux][0]:\r\n if mk[i][1] < c[j][1]:\r\n nrm += 1\r\n i += 1\r\n elif mk[i][1] > c[j][1]:\r\n nrc += 1\r\n j += 1\r\n else:\r\n nrm += 1\r\n nrc += 1\r\n nre += 1\r\n i += 1\r\n j += 1\r\n while i < n and mk[i][0] == mk[iaux][0]:\r\n nrm += 1\r\n i += 1\r\n while j < m and c[j][0] == mk[iaux][0]:\r\n nrc += 1\r\n j += 1\r\n count += min(nrm, nrc)\r\n countp += nre\r\nprint(count,countp)", "n,m=map(int,input().split())\r\n\r\ninp=[list(map(int,input().split())) for i in range(n)]\r\ndict1={}\r\ndict2={}\r\ncount1=0\r\ncount2=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n dict1[(a,b)]=dict1.get((a,b),0)+1\r\n dict2[b]=dict2.get(b,0)+1\r\n\r\nfor i in inp:\r\n if dict2.get(i[1]):\r\n count1=count1+1\r\n dict2[i[1]]=dict2[i[1]]-1\r\n if dict1.get((i[0],i[1])):\r\n count2=count2+1\r\n dict1[(i[0],i[1])]=dict1[(i[0],i[1])]-1\r\n \r\nprint(count1,count2)", "import sys\n\ninput=sys.stdin.readline()\nn,m = map(int, input.split())\n\nmarkers_dia = [[0 for i in range(1000)] for i in range(1000)]\ncaps_dia = [[0 for i in range(1000)] for i in range(1000)]\n\nfor i in range(n):\n\tinput=sys.stdin.readline()\n\tx,y = map(int, input.split())\n\tmarkers_dia[y-1][x-1]+=1\n\nfor i in range(m):\n\tinput=sys.stdin.readline()\n\tx,y = map(int, input.split())\n\tcaps_dia[y-1][x-1]+=1\n\nclosed = 0\nbeaut = 0\nfor i in range(1000):\n\tclosed+=min(sum(caps_dia[i]), sum(markers_dia[i]))\n\tfor j in range(1000):\n\t\tbeaut+=min(markers_dia[i][j], caps_dia[i][j])\n\nprint(closed, beaut)\n\n\n", "from collections import defaultdict\r\n\r\n\r\ndef intersection(a, b):\r\n fc = 0\r\n ai = 0\r\n bi = 0\r\n\r\n while ai < len(a) and bi < len(b):\r\n if a[ai] < b[bi]:\r\n ai += 1\r\n elif a[ai] > b[bi]:\r\n bi += 1\r\n else:\r\n fc += 1\r\n ai += 1\r\n bi += 1\r\n\r\n return min(len(a), len(b)), fc\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n\r\n fl = defaultdict(list)\r\n\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n fl[y].append(x)\r\n\r\n co = defaultdict(list)\r\n\r\n for _ in range(m):\r\n a, b = map(int, input().split())\r\n co[b].append(a)\r\n\r\n total_count = 0\r\n fancy_count = 0\r\n\r\n for key, value in fl.items():\r\n if key not in co:\r\n continue\r\n value.sort()\r\n co_list = co[key]\r\n co_list.sort()\r\n tc, fc = intersection(value, co_list)\r\n total_count += tc\r\n fancy_count += fc\r\n\r\n print(total_count, fancy_count)\r\n\r\n\r\nmain()\r\n", "n,m=tuple(map(int,input().split()))\r\n \r\ncap1=[0]*1001\r\ncap2=[0]*1001\r\ncnt=[[0]*1001 for y in range(1001)]\r\nfor k in range(n):\r\n x,y=tuple(map(int,input().split()))\r\n cap1[y]+=1\r\n cnt[x][y]+=1\r\nans=0\r\nfor k in range(m):\r\n x,y=tuple(map(int,input().split()))\r\n cap2[y]+=1\r\n if cnt[x][y] > 0:\r\n cnt[x][y]-=1\r\n ans +=1\r\n \r\nprint(sum(min(cap1[y],cap2[y]) for y in range(1001)),ans)", "n,m=map(int,input().split())\r\np=[list(map(int,input().split())) for i in range(n)]\r\ndic1={}\r\ndic2={}\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n dic1[(x,y)]=dic1.get((x,y),0)+1\r\n dic2[y]=dic2.get(y,0)+1\r\nc1=0\r\nc2=0\r\nfor x in p:\r\n if dic1.get((x[0],x[1])):\r\n c1=c1+1\r\n dic1[(x[0],x[1])]=dic1[(x[0],x[1])]-1\r\n if dic2.get(x[1]):\r\n c2=c2+1\r\n dic2[x[1]]=dic2[x[1]]-1\r\nprint(c2,c1)\r\n", "n, m = map(int, input().split())\n\nx, y, u, v = {}, {}, 0, 0\n\nfor i in range(n):\n\n a, b = input().split()\n\n if b in x: x[b][a] = x[b].get(a, 0) + 1\n\n else: x[b] = {a: 1}\n\nfor i in range(m):\n\n a, b = input().split()\n\n if b in y: y[b][a] = y[b].get(a, 0) + 1\n\n else: y[b] = {a: 1}\n\nfor b in x.keys() & y.keys():\n\n u += min(sum(x[b].values()), sum(y[b].values()))\n\n v += sum(min(x[b][a], y[b][a]) for a in x[b].keys() & y[b].keys())\n\nprint(u, v)\n\n\n\n# Made By Mostafa_Khaled", "import sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\nn, m = map(int, input().split())\r\ncaps, dia, beautiful, closed = {}, {}, 0, 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n try:\r\n caps[(x, y)] += 1\r\n except:\r\n caps[(x, y)] = 1\r\n try:\r\n dia[y] += 1\r\n except:\r\n dia[y] = 1\r\nmarkers= []\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n try:\r\n t = caps[(a, b)]\r\n if t > 0:\r\n caps[(a, b)] -= 1\r\n beautiful += 1\r\n dia[b] -= 1\r\n else:\r\n markers.append(b)\r\n except:\r\n markers.append(b)\r\nfor i in markers:\r\n try:\r\n t = dia[i]\r\n if t > 0:\r\n dia[i] -= 1\r\n closed += 1\r\n except:\r\n pass\r\nprint(str(closed+beautiful)+' '+str(beautiful))\r\n\r\n", "from collections import Counter\r\n\r\ndef read_ints():\r\n return tuple(int(x) for x in input().split())\r\n\r\ndef parse_input(size):\r\n data = [read_ints() for _ in range(size)]\r\n by_diam = Counter(size for diam, size in data)\r\n by_color = Counter(data)\r\n return by_diam, by_color\r\n\r\nn, m = read_ints()\r\npens_by_diam, pens_by_color = parse_input(n)\r\ncaps_by_diam, caps_by_color = parse_input(m)\r\nclosed = sum((pens_by_diam & caps_by_diam).values()) \r\nbeautiful = sum((pens_by_color & caps_by_color).values()) \r\nprint(closed, beautiful)", "n,m=map(int,input().split())\r\ndict1,dict2=dict(),dict()\r\nu,v=0,0\r\ndict3=dict()\r\nfor _ in range(n):\r\n x,y=input().split()\r\n if y in dict1:\r\n dict1[y]+=1\r\n else:\r\n dict1[y]=1\r\n if x in dict3:\r\n if y in dict3[x]:\r\n dict3[x][y]+=1\r\n else:\r\n dict3[x][y]=1\r\n else:\r\n dict3[x]={y:1}\r\nfor _ in range(m):\r\n x,y=input().split()\r\n if y in dict1:\r\n if dict1[y]>0:\r\n u+=1\r\n dict1[y]-=1\r\n if x in dict3:\r\n if y in dict3[x]:\r\n if dict3[x][y]>0:\r\n v+=1\r\n dict3[x][y]-=1\r\nprint(u,v)\r\n", "\r\n\r\ndef solve():\r\n n,m=map(int,input().split())\r\n\r\n kolpack = {}\r\n flomaster = {}\r\n kolpack1 = {}\r\n flomaster1 = {}\r\n\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n if y not in flomaster1:\r\n flomaster1[y] = 1\r\n else:\r\n flomaster1[y] += 1\r\n\r\n if (x, y) not in flomaster:\r\n flomaster[(x, y)] = 1\r\n else:\r\n flomaster[(x, y)] += 1\r\n\r\n for _ in range(m):\r\n a, b = map(int, input().split())\r\n if (a, b) not in kolpack:\r\n kolpack[(a, b)] = 1\r\n else:\r\n kolpack[(a, b)] += 1\r\n\r\n if b not in kolpack1:\r\n kolpack1[b] = 1\r\n else:\r\n kolpack1[b] += 1\r\n\r\n v = 0\r\n for key in flomaster.keys():\r\n if key in kolpack:\r\n v += min(kolpack[key], flomaster[key])\r\n\r\n u = 0\r\n for key in flomaster1.keys():\r\n if key in kolpack1:\r\n u += min(kolpack1[key], flomaster1[key])\r\n\r\n print(u, v)\r\n\r\n\r\ndef main():\r\n solve()\r\n\r\n\r\nmain()\r\n" ]

[ " \r\nfrom functools import reduce\r\n\r\n#Este BFS se utiliza identificar que celdas se alcanzan desde first y por tanto alcanzarán a first si se coloca una granada en ellas.\r\ndef bfs(first, d,mat,n,m):\r\n queue = []\r\n mv = [(0, -1), (0, 1), (-1, 0), (1, 0)]\r\n levels = {first:0}\r\n queue.append(first)\r\n covered_nodes = set()\r\n while len(queue) > 0 and levels[queue[0]] <= d: \r\n dequeue_node = queue[0]\r\n covered_nodes.add(dequeue_node)\r\n del(queue[0])\r\n for x in mv:\r\n neighbour = (dequeue_node[0] + x[0], dequeue_node[1] + x[1])\r\n if neighbour[0] > 0 and neighbour[0] < n-1 and neighbour[1] > 0 and neighbour[1] < m-1:\r\n if(mat[neighbour[0]][neighbour[1]]!= 'X'):\r\n if neighbour not in levels:\r\n queue.append(neighbour)\r\n levels[neighbour] = levels[dequeue_node]+1\r\n return covered_nodes\r\n\r\n\r\n#Devuelve la posición de las dos celdas de la matriz donde se colocarán las granadas, o -1 en caso de que no tenga solución.\r\ndef Get_cells(firsts, candidates,mat,n,m):\r\n for f in firsts:\r\n Not_reached = []\r\n for candidate in candidates:\r\n if f not in candidate: \r\n Not_reached.append(candidate)\r\n if len(Not_reached) == 0:\r\n ans = [(f[0]+1,f[1]+1)]\r\n for i in range(n):\r\n for j in range(m):\r\n if (i, j) != f:\r\n if mat[i][j] != 'X':\r\n ans.append((i+1, j+1))\r\n return ans\r\n return -1\r\n second_candidates = reduce(lambda x, y: x & y, Not_reached)\r\n for second in second_candidates:\r\n if second != f:\r\n return ((f[0] + 1,f[1] + 1),(second[0] + 1, second[1] + 1))\r\n return -1\r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n \r\n inFile = open(\"input.txt\", 'r')\r\n outFile = open(\"output.txt\", 'w')\r\n \r\n\r\n store_map = []\r\n input = inFile.read().split('\\n')\r\n n, m, d = map(int, input[0].split())\r\n\r\n for i in range(1, n + 1):\r\n store_map.append(input[i])\r\n\r\n rats_pos = []\r\n rats_number = 0\r\n\r\n for i in range(1,n-1):\r\n for j in range(1,m-1): \r\n if store_map[i][j] == 'R':\r\n rats_number += 1\r\n rats_pos.append((i, j))\r\n\r\n #Verificando la condición necesaria para encontrar una solución al problema.\r\n if rats_number > 2 * (2* d **2 + 2*d +1):\r\n outFile.write('-1\\n') \r\n return\r\n \r\n\r\n candidates = []\r\n \r\n for rat in rats_pos:\r\n candidates.append(bfs(rat,d,store_map,n,m))\r\n\r\n answer = Get_cells(candidates[0],candidates[1:],store_map,n,m)\r\n \r\n if answer==-1:\r\n outFile.write('-1\\n')\r\n else:\r\n outFile.write(\"{:d} {:d} {:d} {:d}\". \\\r\n format(answer[0][0],\r\n answer[0][1],\r\n answer[1][0], \r\n answer[1][1]))\r\n \r\n\r\n\r\nmain()\r\n\r\n\r\n" ]

[ "n,m,k = map(int,input().split())\r\nmat = []\r\nfor _ in range(n):\r\n arr = list(map(int,input().split()))\r\n mat.append(arr)\r\nfrom collections import defaultdict\r\nmemo = defaultdict(lambda:0)\r\ndef forw(i,j,cnt,val):\r\n val = val^mat[i][j]\r\n if cnt == half:\r\n memo[i,j,val]+=1\r\n return\r\n if i+1<n:\r\n forw(i+1,j,cnt+1,val)\r\n if j+1<m:\r\n forw(i,j+1,cnt+1,val)\r\n\r\ndef back(i,j,val,cnt):\r\n \r\n if cnt == ohalf:\r\n ans[0]+=memo[i,j,val^k]\r\n return\r\n if i-1>=0:\r\n back(i-1,j,val^mat[i][j],cnt+1)\r\n if j-1>=0:\r\n back(i,j-1,val^mat[i][j],cnt+1)\r\n \r\n\r\n\r\nans =[0]\r\n\r\ntotal= n+m-2\r\nhalf = total//2\r\nohalf = total-half\r\n\r\nforw(0,0,0,0)\r\n\r\nback(n-1,m-1,0,0)\r\nprint(ans[0])\r\n\r\n", "# import sys\r\n# sys.stdout=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\output.txt','w')\r\n# sys.stdin=open('C:\\Program Files (x86)\\Sublime Text 3\\cp_setup\\input.txt','r')\r\n\r\n\r\nimport heapq\r\nimport math\r\nimport collections\r\nimport bisect\r\nfrom collections import deque\r\nmod=10**9+7\r\nans=0\r\nd=[[None for i in range(20)] for j in range(20)]\r\nfor i in range(20):\r\n for j in range(20):\r\n d[i][j]=collections.defaultdict(int)\r\ndef solve(n,m,mat,k,mid):\r\n \r\n def firsthalf(i,j,val,count):\r\n val=val^mat[i][j]\r\n if count==mid:\r\n d[i][j][val]+=1\r\n return\r\n\r\n if i+1<n:\r\n firsthalf(i+1,j,val,count+1)\r\n if j+1<m:\r\n firsthalf(i,j+1,val,count+1) \r\n \r\n def secondhalf(i,j,val,count):\r\n if count==n+m-2-mid:\r\n # print(val^k)\r\n if val^k in d[i][j]:\r\n return d[i][j][val^k]\r\n return 0\r\n res=0\r\n if i-1>=0:\r\n res+=secondhalf(i-1,j,val^mat[i][j],count+1)\r\n if j-1>=0:\r\n res+=secondhalf(i,j-1,val^mat[i][j],count+1) \r\n return res\r\n firsthalf(0,0,0,0)\r\n # print(d)\r\n return secondhalf(n-1,m-1,0,0)\r\n \r\n\r\n# t=int(input())\r\n# for _ in range(t):\r\nn,m,k=map(int,input().split(\" \"))\r\nmat=[]\r\nmid=(n+m-2)//2\r\n\r\nfor i in range(n):\r\n mat.append(list(map(int,input().split(\" \"))))\r\nprint(solve(n,m,mat,k,mid)) \r\n", "def first(x, y, val, count):\r\n val ^= A[x][y]\r\n \r\n if count == half:\r\n if (x, y, val) not in dp:\r\n dp[(x, y, val)] = 0\r\n dp[(x, y, val)] += 1 \r\n return\r\n \r\n if x+1 < n:\r\n first(x+1, y, val, count+1)\r\n if y+1 < m:\r\n first(x, y+1, val, count+1)\r\n \r\ndef second(x, y, val, count):\r\n global ans\r\n if count == n+m-2-half:\r\n if (x, y, val^k) in dp:\r\n ans += dp[(x, y, val^k)]\r\n return\r\n \r\n val = val^A[x][y]\r\n if x > 0:\r\n second(x-1, y, val, count+1)\r\n if y > 0:\r\n second(x, y-1, val, count+1)\r\n \r\nn, m, k = map(int, input().split())\r\nA = []\r\nfor _ in range(n):\r\n A.append(list(map(int, input().split())))\r\n\r\ndp = dict()\r\nhalf = (n+m-2) // 2\r\nans = 0\r\n\r\nfirst(0, 0, 0, 0)\r\nsecond(n-1, m-1, 0, 0)\r\n\r\nprint(ans)", "m,n,k=map(int,input().split())\r\nmatrix=[]\r\nfor i in range(m):\r\n matrix.append(list(map(int,input().split())))\r\npath=[[{} for i in range(n) ] for j in range(m)]\r\nhalf=(m+n-2)//2\r\nans=0\r\ndef uptodow(val,x,y,step):\r\n global path\r\n val=val^matrix[x][y]\r\n if step<half:\r\n if x+1<m:\r\n uptodow(val,x+1,y,step+1)\r\n if y+1<n:\r\n uptodow(val,x,y+1,step+1)\r\n else:\r\n path[x][y][val]=path[x][y].get(val,0)+1\r\ndef downtoup(val,x,y,step):\r\n global ans\r\n if step<m+n-2-half:\r\n val=val^matrix[x][y]\r\n if x-1>=0:\r\n downtoup(val,x-1,y,step+1)\r\n if y-1>=0:\r\n downtoup(val,x,y-1,step+1)\r\n else:\r\n if val^k in path[x][y]:\r\n ans+=path[x][y][val^k]\r\nuptodow(0,0,0,0)\r\ndowntoup(0,m-1,n-1,0)\r\nprint(ans)", "from collections import defaultdict, Counter,deque\r\nfrom math import sqrt, log10, log, floor, factorial,gcd,ceil,log2\r\nfrom bisect import bisect_left, bisect_right,insort\r\nfrom itertools import permutations,combinations\r\nfrom heapq import heapify,heappop,heappush\r\nimport sys, io, os\r\ninput = sys.stdin.readline\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# sys.setrecursionlimit(10000)\r\ninf = float('inf')\r\nmod = 10 ** 9 + 7\r\ndef yn(a): print(\"YES\" if a else \"NO\")\r\ncl = lambda a, b: (a + b - 1) // b\r\n\r\nfor i in range(1):\r\n n,m,k=[int(i) for i in input().split()]\r\n l=[]\r\n for i in range(n):\r\n l.append([int(i) for i in input().split()])\r\n arr=[]\r\n start=(n+m-1)//2\r\n if n>=m:\r\n left=start\r\n right=0\r\n while 0<=left<n and 0<=right<m:\r\n arr.append([left,right])\r\n left-=1\r\n right+=1\r\n else:\r\n left=0\r\n right=start\r\n while 0<=left<n and 0<=right<m:\r\n arr.append([left,right])\r\n left+=1\r\n right-=1\r\n # left=[[defaultdict(int) for i in range(m+1)] for j in range(n+1)]\r\n # right=[[defaultdict(int) for i in range(m+1)] for j in range(n+1)]\r\n # left=defaultdict(lambda : defaultdict(lambda :defaultdict(int)))\r\n # right=defaultdict(lambda : defaultdict(lambda :defaultdict(int)))\r\n left=defaultdict(lambda :defaultdict(int))\r\n right=defaultdict(lambda :defaultdict(int))\r\n arrset=set()\r\n for i in arr:\r\n arrset.add(tuple(i))\r\n def fun(i,j,val):\r\n # print(i,j,val)\r\n if (i,j) in arrset:\r\n # left[i][j][val^l[i][j]]+=1\r\n left[(i,j)][val^l[i][j]]+=1\r\n return 0\r\n if j+1<m:\r\n fun(i,j+1,val^l[i][j])\r\n if i+1<n:\r\n fun(i+1,j,val^l[i][j])\r\n fun(0,0,0)\r\n def funright(i,j,val):\r\n if (i,j) in arrset:\r\n # right[i][j][val]+=1\r\n right[(i,j)][val]+=1\r\n return 0\r\n if j-1>=0:\r\n funright(i,j-1,val^l[i][j])\r\n if i-1>=0:\r\n funright(i-1,j,val^l[i][j])\r\n funright(n-1,m-1,0)\r\n\r\n counter=0\r\n for i,j in arr:\r\n for t in left[(i,j)]:\r\n\r\n counter+=right[(i,j)][k^t]*left[(i,j)][t]\r\n\r\n print(counter)", "# https://codeforces.com/contest/1006\n\nimport sys\nfrom collections import Counter, deque\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\n\ndef solve_case():\n n, m, k = map(int, input().split())\n a = [list(map(int, input().split())) for _ in range(n)]\n\n # half-way from start forwards\n s1 = (n + m - 2) // 2\n cnt1 = [[Counter() for _ in range(m)] for _ in range(n)]\n stack = deque([(0, 0, a[0][0])])\n while stack:\n r, c, xor = stack.pop()\n if r + c == s1:\n cnt1[r][c][xor] += 1\n continue\n if r + 1 < n:\n stack.append((r + 1, c, xor ^ a[r + 1][c]))\n if c + 1 < m:\n stack.append((r, c + 1, xor ^ a[r][c + 1]))\n\n # half-way from end backwards\n s2 = (n + m - 2) - s1\n cnt2 = [[Counter() for _ in range(m)] for _ in range(n)]\n stack = deque([(n - 1, m - 1, k ^ a[n - 1][m - 1])])\n while stack:\n r, c, xor = stack.pop()\n if (n - 1 - r) + (m - 1 - c) == s2:\n cnt2[r][c][xor ^ a[r][c]] += 1\n continue\n if r - 1 >= 0:\n stack.append((r - 1, c, xor ^ a[r - 1][c]))\n if c - 1 >= 0:\n stack.append((r, c - 1, xor ^ a[r][c - 1]))\n\n # count how often we meet with correct xor results in the middle\n ans = 0\n for r in range(n):\n c = s1 - r\n if 0 <= c < m:\n for xor, cnt in cnt1[r][c].items():\n ans += cnt * cnt2[r][c][xor]\n print(ans)\n\n\nsolve_case()\n", "from collections import defaultdict\r\nimport itertools\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\nl = n + m - 2\r\nl0 = l // 2\r\nl1 = (l + 1) // 2\r\np = [i for i in range(l0)]\r\nxx = defaultdict(lambda : defaultdict(lambda : 0))\r\nfor i in range(l0 + 1):\r\n ok = 1\r\n for p0 in itertools.combinations(p, i):\r\n s = set(p0)\r\n now = 0\r\n x, y = 0, 0\r\n for j in range(l0):\r\n now ^= a[x][y]\r\n if j in s:\r\n x += 1\r\n else:\r\n y += 1\r\n if not 0 <= x < n or not 0 <= y < m:\r\n ok = 0\r\n break\r\n if not ok:\r\n break\r\n now ^= a[x][y]\r\n xx[(x, y)][now] += 1\r\np = [i for i in range(l1)]\r\nans = 0\r\nfor i in range(l1 + 1):\r\n ok = 1\r\n for p0 in itertools.combinations(p, i):\r\n s = set(p0)\r\n now = 0\r\n x, y = n - 1, m - 1\r\n for j in range(l1):\r\n now ^= a[x][y]\r\n if j in s:\r\n x -= 1\r\n else:\r\n y -= 1\r\n if not 0 <= x < n or not 0 <= y < m:\r\n ok = 0\r\n break\r\n if not ok:\r\n break\r\n ans += xx[(x, y)][now ^ k]\r\nprint(ans)", "# https://codeforces.com/contest/1006\n\nimport sys\nfrom collections import Counter, deque\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\n\ndef solve_case():\n n, m, k = map(int, input().split())\n a = [list(map(int, input().split())) for _ in range(n)]\n\n ans = 0\n\n # half-way from start forwards\n half = (n + m - 2) // 2\n cnt = [[Counter() for _ in range(m)] for _ in range(n)]\n stack = deque([(0, 0, 0)])\n while stack:\n r, c, xor = stack.pop()\n if r + c == half:\n cnt[r][c][xor ^ a[r][c]] += 1\n continue\n if r + 1 < n:\n stack.append((r + 1, c, xor ^ a[r][c]))\n if c + 1 < m:\n stack.append((r, c + 1, xor ^ a[r][c]))\n\n # half-way from end backwards\n stack = deque([(n - 1, m - 1, k)])\n while stack:\n r, c, xor = stack.pop()\n if r + c == half:\n ans += cnt[r][c][xor]\n continue\n if r - 1 >= 0:\n stack.append((r - 1, c, xor ^ a[r][c]))\n if c - 1 >= 0:\n stack.append((r, c - 1, xor ^ a[r][c]))\n\n print(ans)\n\n\nsolve_case()\n", "\r\nfrom collections import defaultdict\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\ndef II():\r\n return int(input())\r\n\r\ndef MI():\r\n return map(int, input().split())\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\nn, m, k = MI()\r\nh = []\r\nfor _ in range(n):\r\n h.append(LII())\r\nd = defaultdict(int)\r\ndef p1(i, j, c):\r\n if i+j == (n+m-2) // 2:\r\n d[i, j, c] += 1\r\n return\r\n if i+1 < n:\r\n p1(i+1, j, c ^ h[i+1][j])\r\n if j+1 < m:\r\n p1(i, j+1, c ^ h[i][j+1])\r\np1(0, 0, h[0][0])\r\nans = 0\r\ndef p2(i, j, c):\r\n global ans\r\n if i+j == (n+m-2) // 2:\r\n ans += d[i, j, c ^ k]\r\n return\r\n if i-1 >= 0:\r\n p2(i-1, j, c ^ h[i][j])\r\n if j-1 >= 0:\r\n p2(i, j-1, c ^ h[i][j])\r\np2(n-1, m-1, 0)\r\nprint(ans)" ]

[ "# for I/O for local system\nimport sys\nfrom os import path\nif(path.exists('Input.txt')):\n sys.stdin = open('Input.txt','r')\n sys.stdout = open('Output.txt','w')\n \n# For fast I/O\ninput = sys.stdin.buffer.readline\n# input = sys.stdin.readline\nprint = sys.stdout.write\n \n# Import libraries here whenever required\nfrom math import *\nfrom collections import *\nfrom random import randint\n \n# Use this because normal dict can sometimes give TLE\nclass mydict:\n def __init__(self, func=lambda: 0):\n self.random = randint(0, 1 << 32)\n self.default = func\n self.dict = {}\n def __getitem__(self, key):\n mykey = self.random ^ key\n if mykey not in self.dict:\n self.dict[mykey] = self.default()\n return self.dict[mykey]\n def get(self, key, default):\n mykey = self.random ^ key\n if mykey not in self.dict:\n return default\n return self.dict[mykey]\n def __setitem__(self, key, item):\n mykey = self.random ^ key\n self.dict[mykey] = item\n def getkeys(self):\n return [self.random ^ i for i in self.dict]\n def __str__(self):\n return f'{[(self.random ^ i, self.dict[i]) for i in self.dict]}'\n \n\"\"\" \n Since, we want can either take all or erase only one\n either erase the root or the answer will be one of the divisors of root\n\"\"\"\n\n# Solver function\ndef solve():\n n = int(input())\n a = [int(x) for x in input().split()]\n adj = [[] for i in range(n + 1)]\n for i in range(n - 1):\n u, v = map(int, input().split())\n adj[u].append(v)\n adj[v].append(u)\n ans = [0 for i in range(n)]\n q = deque()\n q.append(1)\n vis = [False for i in range(n + 1)]\n vis[1] = True\n while q:\n node = q.popleft()\n for nbr in adj[node]:\n if(vis[nbr]):\n continue\n ans[nbr - 1] = gcd(a[nbr - 1], ans[node - 1])\n vis[nbr] = True\n q.append(nbr)\n divs = []\n val = a[0]\n i = 1\n while i * i <= val:\n if(val % i == 0):\n divs.append(i)\n divs.append(val // i)\n i += 1\n ans[0] = a[0]\n q = deque()\n vis = [False for i in range(n + 1)]\n helper = [1 for i in range(len(divs))]\n times = 1\n q.append([1, helper.copy(), times])\n vis[1] = True\n while q:\n node, helpp, times = q.popleft()\n for nbr in adj[node]:\n if(vis[nbr]):\n continue\n help = helpp.copy()\n for i in range(len(divs)):\n if(a[nbr - 1] % divs[i] == 0):\n help[i] += 1\n if(help[i] >= times):\n ans[nbr - 1] = max(ans[nbr - 1], divs[i])\n vis[nbr] = True\n q.append([nbr, help.copy(), times + 1])\n print(' '.join(map(str, ans)) + \"\\n\")\n \n# Main \nfor _ in range(1):\n solve()" ]

[ "n = int(input())\nif n == 0:\n print(0, 0, 0)\nelif n == 1:\n print(0, 0, 1)\nelif n == 2:\n print(0, 1, 1)\nelse:\n arr = [0, 1]\n i = 1\n while True:\n m = arr[i]+arr[i-1]\n if m <= n:\n arr.append(m)\n i += 1\n else:\n break\n\n\n print(arr[-2], arr[-4], arr[-5])\n\n", "n=int(input())\r\n'''l=list(map(int, input().split()))\r\nif(l.count(min(l))>1):\r\n print(\"Still Rozdil\")\r\nelse: \r\n print(l.index(min(l))+1)'''\r\nprint('0 0',str(n)) ", "# Nome: Matheus de Souza Oliveira RA: 203407\n\nfibonacciNumber = int(input())\n\nprint(f\"0 0 {fibonacciNumber}\")\n\t\t\t\t \t\t\t \t \t \t\t\t \t\t\t \t \t\t", "print(0,0,int(input()))", "n=int(input())\r\ndef fn(n):\r\n if n==0:\r\n print('0 0 0')\r\n return\r\n if n==1:\r\n print('1 0 0')\r\n return\r\n f1,f2=0,1\r\n f=0\r\n while f<n:\r\n f=f1+f2\r\n f1=f2\r\n f2=f \r\n print(f1,f-f1,0)\r\nfn(n)\r\n", "n = int(input())\r\nif n==1:\r\n print(0,0,1)\r\nelif n==0:\r\n print(0,0,0)\r\nelse:\r\n sec=1\r\n fir = 0\r\n for i in range(10**9):\r\n fir,sec = sec,sec+fir\r\n if sec==n:\r\n break\r\n print(0,sec-fir,fir)\r\n", "number = int(input())\r\nfibo = [0,1]\r\nlist=[]\r\nfor i in range(2, 1000) :\r\n fibo.append(fibo[i-2]+fibo[i-1])\r\nindex = int(fibo.index(number))\r\nfor No_1 in fibo[1:index] :\r\n for No_2 in fibo[1:index] :\r\n for No_3 in fibo[1:index] :\r\n if (No_1+No_2+No_3)==number :\r\n list=[No_1, No_2, No_3]\r\n break\r\n\r\nif number == 0 :\r\n list=[0,0,0]\r\nelif number == 1 :\r\n list=[0,0,1]\r\nelif number == 2 :\r\n list=[0,1,1]\r\n\r\nif len(list)==0 :\r\n print(\"I'm too stupid to solve this problem\")\r\nelse:\r\n list.sort()\r\n print(*list)\r\n", "n = input()\r\n\r\nprint(\"0 0 \" + n)", "n = int(input())\r\nfib = [0, 1]\r\nwhile n > fib[-1]:\r\n\tfib.append(fib[-2] + fib[-1])\r\n\r\nif n <= 3:\r\n\tprint((\"0 \"*(3-n) + \"1 \"*n).strip())\r\nelse:\r\n\tprint(f\"{fib[-5]} {fib[-4]} {fib[-2]}\")", "print(int(input()), 0, 0)", "n = int(input())\nprint(f\"0 0 {n}\")\n# Source code should be longer than 50 characters\n\n \t\t\t\t \t \t\t\t\t\t\t\t \t \t\t", "n = int(input())\r\nfib = [0,1]\r\nt1 = 0\r\nif n==0:\r\n\tfib = [0] + fib\r\nwhile t1 != n:\r\n\tt1 = fib[-1] + fib[-2]\r\n\tfib.append(t1)\r\nprint(0, fib[-3], fib[-2])", "n=int(input())\r\nif(n==0):\r\n print(0,0,0)\r\nelse:\r\n a,b=0,1\r\n while(a+b!=n):\r\n a,b=b,a+b\r\n print(0,a,b)", "import math\r\nfrom collections import defaultdict\r\nml=lambda:map(int,input().split())\r\nll=lambda:list(map(int,input().split()))\r\nii=lambda:int(input())\r\nip=lambda:(input())\r\n\r\n\"\"\"========main code===============\"\"\"\r\nfib=[]\r\na=0\r\nb=1\r\ni=0\r\nwhile(i<50):\r\n fib.append(a)\r\n a,b=b,a+b\r\n i+=1\r\nt=ii() \r\nf=0 \r\nans=[\"I'm too stupid to solve this problem\"]\r\nx=0\r\ny=0\r\nz=0\r\nfor i in fib:\r\n for j in fib:\r\n for k in fib:\r\n if(i+j+k==t):\r\n ans=[i,j,k]\r\n break\r\n\r\nprint(*ans)\r\n", "def fib(n):\r\n if n==0:\r\n print(\"0 0 0\")\r\n elif(n==1):\r\n print(\"0 0 1\")\r\n else:\r\n a=0\r\n b=1\r\n for i in range(1,n+1):\r\n c=a+b\r\n if (c!=n):\r\n a=b\r\n b=c\r\n else:\r\n break\r\n print(b,end=\" \")\r\n print(b-a,end=\" \")\r\n print((2*a)-b,end=\" \")\r\nn=int(input())\r\nfib(n)", "print(0, 0, input())\n\n#IUEWFHNCDKSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS\n \t \t\t \t\t\t\t \t \t\t\t\t\t \t\t \t\t", "n=int(input())\r\nprint(0,0,n)", "n = int(input())\r\nif n == 0:\r\n\tprint(0,0,0)\r\nelse:\r\n\ta , b = 0 , 1\r\n\twhile a + b != n:\r\n\t\ta , b = b , a+b\r\n\tprint(0 , a, b)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 20 10:39:53 2020\r\n\r\n@author: Tanmay\r\n\"\"\"\r\n\r\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 20 08:41:18 2020\r\n\r\n@author: Tanmay\r\n\"\"\"\r\n\r\nn=int(input())\r\nprint(0,0,n)", "l=[0,1,1]\r\ndef fib():\r\n for k in range(3,1000):\r\n a=l[k-1]\r\n b=l[k-2]\r\n l.append(a+b)\r\n if(a+b>1000000000):\r\n break\r\nfib()\r\nn=int(input())\r\nne=l.index(n)\r\nif(n>3):\r\n print(l[ne-4],l[ne-3],l[ne-1])\r\nelif(n==3):\r\n print(1,1,1)\r\nelif(n==2):\r\n print(0,1,1)\r\nelif(n==1):\r\n print(0,0,1)\r\nelif(n==0):\r\n print(0,0,0)", "#######################################\n#######################################\nn = int(input())\n\nprint(\"0 0 \" + str(n))\n\n\n\t \t\t \t\t \t\t \t\t\t \t\t \t \t\t \t\t \t", "n=int(input())\r\nprint(str(n)+\" 0 0\")", "fib1 = 0\r\nfib2 = 1\r\nfib0 = 0\r\n\r\nfibx = int(input())\r\n\r\nwhile fib2 < fibx:\r\n fib_sum = fib1 + fib2\r\n fib0 = fib1\r\n fib1 = fib2\r\n fib2 = fib_sum\r\n\r\n \r\nprint(0, fibx - fib1, fib1)\r\n", "\r\n\r\n\r\np=[0,1]\r\na= int(input())\r\n\r\nif a==0:\r\n print(0,0,0)\r\nelse:\r\n for i in range(1,100000000):\r\n d=p[-1]+p[-2]\r\n p.append(d)\r\n\r\n if a==d:\r\n print(0,p[-2],p[-3])\r\n break\r\n\r\n\r\n", "n = int(input())\r\nif n==0:\r\n print(0, 0, 0)\r\nelse:\r\n a, b = 0, 1\r\n while b<n:\r\n a, b = b, a+b\r\n print(0, b-a, a)\r\n", "from sys import *\n'''sys.stdin = open('input.txt', 'r') \nsys.stdout = open('output.txt', 'w') '''\nfrom collections import defaultdict as dd\nfrom math import *\nfrom bisect import *\n#sys.setrecursionlimit(10 ** 8)\ndef sinp():\n return input()\ndef inp():\n return int(sinp())\ndef minp():\n return map(int, sinp().split())\ndef linp():\n return list(minp())\ndef strl():\n return list(sinp())\ndef pr(x):\n print(x)\nmod = int(1e9+7)\ndef fibonacci(n):\n arr = [0] * (n + 1)\n arr[1] = 1\n for i in range(2, n + 1):\n arr[i] = arr[i - 1] + arr[i - 2]\n return arr\narr = fibonacci(50)\nidx = bisect_left(arr, inp())\nif idx == 0:\n print(arr[0], arr[0], arr[0])\nelif idx == 1 or idx == 2:\n print(arr[0], arr[0], arr[1])\nelif idx == 3:\n print(arr[0], arr[1], arr[2])\nelse:\n print(arr[idx - 4], arr[idx - 3], arr[idx - 1])", "print('0 0 '+ input())", "p=int(input())\r\nfib=0\r\nwhile(p!=fib and fib<=p):\r\n if(fib==0):\r\n fib=2\r\n prev1=1\r\n prev2=1\r\n temp2=prev2\r\n prev2=prev1\r\n temp=fib\r\n fib=fib+prev1\r\n prev1=temp\r\n #print(fib)\r\nif(p==2):\r\n prev2=1\r\n temp2=0\r\nif(p<=1):\r\n print(0,0,p)\r\nelse:\r\n print(prev2,prev2,temp2)", "# LUOGU_RID: 113853159\nn = int(input())\nprint(n,0,0)\n#Dfd", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nf = [0, 1]\r\nfor _ in range(70):\r\n f.append(f[-1] + f[-2])\r\nans = \"I'm too stupid to solve this problem\"\r\nfor i in f:\r\n for j in f:\r\n for k in f:\r\n if i + j + k == n:\r\n ans = \" \".join(map(str, [i, j, k]))\r\nprint(ans)", "targetNum = int(input())\r\nnextFibNum = 0\r\nlastFibNum = 1\r\nsecondLastFibNum = 1\r\nnumFound = False\r\n\r\nif targetNum == 1:\r\n print(1, 0, 0)\r\n numFound = True\r\nelif targetNum == 0:\r\n print(0, 0, 0)\r\n numFound = True\r\n\r\nif not numFound:\r\n while nextFibNum != targetNum:\r\n nextFibNum = secondLastFibNum + lastFibNum\r\n if nextFibNum == targetNum:\r\n break\r\n secondLastFibNum = lastFibNum\r\n lastFibNum = nextFibNum\r\n \r\n print(lastFibNum, secondLastFibNum, 0)\r\n", "n = int(input())\r\n\r\na = 0\r\nb = 1\r\n\r\n# while a != n:\r\n# a, b = b, a + b\r\n\r\nprint(f\"{0} {0} {n}\")", "x=int(input())\na=0\nb=1\nch=0\nfib=[0,1]\nif(x==0):\n print(\"0 0 0\")\nelif(x==1):\n print(\"1 0 0\")\nelse:\n while(b<x):\n y=a+b\n fib.append(a+b)\n a=b\n b=y\n fib.remove(x)\n for i in fib:\n for j in fib:\n for k in fib:\n if(i+j+k==x):\n print(i,j,k)\n ch=1\n break\n if(ch==1):\n break\n if(ch==1):\n break\n if(ch==0):\n print(\"IMPOSSIBLE\")\n\t\t \t\t\t \t\t\t\t\t\t \t\t\t \t \t\t\t \t\t \t\t", "from sys import stdin, stdout\r\nimport math\r\n\r\nfrom collections import *\r\nfrom itertools import permutations\r\nfrom heapq import *\r\nimport random\r\n\r\nmod = 1000000007\r\nmod9 = 998244353\r\nfact = []\r\n\r\n\r\ndef solve(test):\r\n # print(\"Case #\" + str(test) + \": \", end='')\r\n n = int(stdin.readline())\r\n # a = input()\r\n # b = input()\r\n # x, y, n = map(int, stdin.readline().split())\r\n # a = list(map(int, stdin.readline().split()))\r\n # n = len(a)\r\n print(0, 0, n)\r\n\r\n return\r\n\r\ndef findAllSubsequences(s):\r\n n = len(s)\r\n subsequences = []\r\n for i in range(0, (2<<n)-1): #(2^n)-1\r\n sub = \"\"\r\n for j in range(0, n):\r\n if 1<<j & i: #to check jth bit is set or not\r\n sub+=s[j]\r\n subsequences.append(sub)\r\n return subsequences\r\n\r\ndef bitAtGivenPosSetOrUnset(n, k): # k starting from 1 ie 1st bit\r\n New_num = 1 << (k - 1)\r\n return (New_num & n)\r\n\r\n\r\ndef power(x, y, p):\r\n res = 1\r\n x = x % p\r\n while y > 0:\r\n if y & 1:\r\n res = (res * x) % p\r\n y = y >> 1 # y = y/2\r\n x = (x * x) % p\r\n\r\n return res\r\n\r\n\r\ndef largePower(a, b, MOD):\r\n b = str(b)\r\n remainderB = 0\r\n for i in range(len(b)):\r\n remainderB = ((remainderB * 10 + ord(b[i]) - 48) % (MOD - 1))\r\n\r\n return power(a, remainderB, MOD)\r\n\r\n\r\ndef decimalToBinary(n):\r\n return bin(n).replace(\"0b\", \"\")\r\n\r\n\r\ndef binaryToDecimal(n):\r\n return int(n, 2)\r\n\r\n\r\ndef buildFact(n, m):\r\n # buildFact(n, mod)\r\n fact.append(1)\r\n for i in range(1, n + 1):\r\n fact.append(fact[-1] * i)\r\n fact[-1] %= m\r\n\r\n return fact\r\n\r\n\r\ndef buildSieve(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while p * p <= n:\r\n if prime[p]:\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n\r\n return prime\r\n\r\n\r\ndef findDivisors(n):\r\n i = 1\r\n arr = []\r\n while i * i < n:\r\n if n % i == 0:\r\n arr.append(i)\r\n i += 1\r\n m = int(math.sqrt(n))\r\n for i in range(m, 0, -1):\r\n if n % i == 0:\r\n arr.append(n // i)\r\n\r\n return arr\r\n\r\n\r\ndef binSearch(l, r, arr, x):\r\n ans = -1\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if arr[mid] > x:\r\n r = mid - 1\r\n else:\r\n ans = mid\r\n l = mid + 1\r\n return ans\r\n\r\n\r\ndef bfs(matrix, entrance):\r\n rowLength, colLength, c = len(matrix), len(matrix[0]), 0\r\n directions = [[0, 1], [1, 0], [-1, 0], [0, -1]]\r\n queue = deque()\r\n queue.append(entrance)\r\n visited = set()\r\n visited.add(tuple(entrance))\r\n\r\n while (queue):\r\n l = len(queue)\r\n for _ in range(l):\r\n currRow, currCol = queue.popleft()\r\n\r\n if (0 == currRow or currRow == rowLength - 1 or 0 == currCol or currCol == colLength - 1) and (\r\n [currRow, currCol] != entrance):\r\n return c\r\n\r\n for d in directions:\r\n newRow, newCol = currRow + d[0], currCol + d[1]\r\n if 0 <= newRow < rowLength and 0 <= newCol < colLength and matrix[newRow][newCol] == '.' and (\r\n newRow, newCol) not in visited:\r\n queue.append((newRow, newCol))\r\n visited.add((newRow, newCol))\r\n c += 1\r\n return -1\r\n\r\n\r\n# checks pattern present in string or not (returns True or False) in O(n+m) time\r\ndef KMP(string, pattern):\r\n def LPS():\r\n table = [0] * len(pattern)\r\n i, j = 1, 0\r\n while i < len(pattern):\r\n if pattern[i] != pattern[j]:\r\n if j == 0:\r\n i += 1\r\n j = table[j - 1]\r\n\r\n else:\r\n table[i] = j + 1\r\n i += 1\r\n j += 1\r\n\r\n # print(table)\r\n return table\r\n\r\n i, j = 0, 0\r\n table = LPS()\r\n while i < len(string) and j < len(pattern):\r\n if string[i] == pattern[j]:\r\n i += 1\r\n j += 1\r\n\r\n else:\r\n if j == 0:\r\n i += 1\r\n\r\n j = table[j - 1]\r\n if j == len(pattern):\r\n return True\r\n return False\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n # tests = int(stdin.readline())\r\n\r\n tests = 1\r\n for _ in range(tests):\r\n solve(_ + 1)", "n = int(input())\nl =[0,1]\ni=2\nk =0\nwhile(k<n):\n k = l[i-1]+l[i-2]\n l.append(k)\n i = i+1\nif(k<3):\n if(k==2):\n print(\"0 1 1\")\n if(k==1):\n print(\"0 0 1\")\n if(k==0):\n print(\"0 0 0\")\nelif(k==n):\n print(l[i-5],l[i-4],l[i-2])\nelse:\n print(\"IMPOSSIBLE\")\n \t\t \t\t \t \t\t\t \t\t\t\t\t \t\t \t\t \t \t", "n = int(input())\ni,j=0,1\nmat = [0]\nwhile j <= n:\n\ti,j = j,j+i\n\tmat.append(i)\nres = []\nk = len(mat)-1\nwhile k > -1:\n\n\tif n-mat[k]>=0:\n\t\tres.append(mat[k])\n\t\tn-=mat[k]\n\t\tif len(res) >= 3:\n\t\t\tbreak\n\telse:\n\t\tk-=1\n\tif n<0:\n\t\tbreak\n\nif n==0 and len(res)==3:\n\tprint(*res)\nelse:\n\tprint(\"I'm too stupid to solve this problem\")", "n = int(input())\n\na1 = 0\na2 = 0\na3 = 1\na4 = 1\nprev = 2\nfib = 0\nwhile fib < n:\n fib = a4 + prev\n a1 = a2\n a2 = a3\n a3 = a4\n a4 = prev\n prev = fib\n\nif n < 2:\n print(0,0,n)\nelif n == 2:\n print(0,1,1)\nelif n == 3:\n print(1,1,1)\nelse:\n print(a1,a2,a4)\n \t\t \t \t \t \t\t \t \t\t \t\t\t\t", "n=int(input())\r\nprint(0,n,0)", "def func(n):\r\n if n==0:\r\n print(0,0,0)\r\n return\r\n elif n==1:\r\n print(1,0,0)\r\n return\r\n elif n==2:\r\n print(1,1,0)\r\n return\r\n x=[0,1,1,2]\r\n a=0\r\n i=4\r\n while a<n:\r\n a=x[i-1]+x[i-3]+x[i-4]\r\n x.append(a)\r\n i+=1\r\n i-=1\r\n if x[i]==n:\r\n print(x[i-1],x[i-3],x[i-4])\r\n return\r\n else:\r\n print(\"I'm too stupid to solve this problem\")\r\n return\r\nn=int(input())\r\nfunc(n)", "#lol it has a simple trick\r\nprint(0,0,int(input()))", "import sys\r\n\r\ninpt = sys.stdin.readline()\r\nn = int(inpt)\r\nt = 1\r\na = b = 0\r\nif n <= 1:\r\n print(0, 0, n)\r\nelse:\r\n while True:\r\n if t == n:\r\n print(0, a, b)\r\n break\r\n else:\r\n a = b\r\n b = t\r\n t = a + b\r\n", "arr=[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733, 1134903170]\r\n\r\n\r\nn=int(input())\r\nif n==0:\r\n print(\"0 0 0\")\r\nelif n==1:\r\n print(\"1 0 0\")\r\nelif n==2:\r\n print(\"1 1 0\")\r\nelse:\r\n cord=arr.index(n)\r\n print(f\"{arr[cord-1]} {arr[cord-3]} {arr[cord-4]}\")\r\n\r\n\r\n", "n = int(input())\r\n'''We are asked to find three numbers \r\nwe know the last two of a fibonnaci number\r\ngives the current fibonacci number so we can\r\ntake the last two numbers and make the third one\r\nto be always zero.'''\r\nif n < 2:\r\n print(0, 0, n)\r\nelse:\r\n a,b = 0,1\r\n while a+b != n:\r\n a, b = b, a + b\r\n print(0, a, b)", "from functools import lru_cache\r\n\r\n@lru_cache(maxsize=50)\r\ndef fib(n):\r\n if (n <= 1):\r\n return 0\r\n if (n in (2, 3)):\r\n return 1\r\n return fib(n-1) + fib(n-2)\r\n\r\nfib_nums = set()\r\n\r\nfor i in range(1, 47):\r\n fib_nums.add(fib(i))\r\n\r\ninp = int(input())\r\n\r\nif (inp in fib_nums):\r\n print(0, 0, inp)\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")", "print(int(input()),'0','0')", "def process():\r\n n = int(input())\r\n \r\n if n == 0:\r\n print('0 0 0')\r\n elif n == 1:\r\n print('0 0 1')\r\n else:\r\n a, b, c = 0, 1, 1\r\n \r\n while c != n:\r\n a, b, c = b, c, b + c\r\n \r\n print(f'0 {a} {b}')\r\n \r\nprocess()", "print('0',input(),'0')", "f = [None] * 1001\r\nf[0] = 0\r\nf[1] = 1\r\nfor i in range(2, 1001):\r\n f[i] = f[i - 1] + f[i - 2]\r\na = input()\r\na = int(a)\r\nif a == 1:\r\n print('0 0 1')\r\nelif a == 0:\r\n print('0 0 0')\r\nelse:\r\n ans = '0'\r\n for i in range(1001):\r\n if f[i] == a:\r\n break\r\n ans = ans + ' ' + str(f[i - 1]) + ' ' + str(f[i - 2])\r\n print(ans)\r\n", "n = int(input())\r\na = 0\r\n\r\nprint(a,a,n)", "n = int(input())\r\nif n == 0:\r\n print(0,0,0,sep=\" \")\r\nelif n == 1:\r\n print(0,0,1,sep=\" \")\r\nelif n == 2:\r\n print(0,1,1,sep=\" \")\r\nelse:\r\n a,b,c = 0,1,1\r\n total = 2\r\n while total != n:\r\n a,b,c = c,a+b,a+c\r\n total = a+b+c\r\n print(a,b,c,sep=\" \")", "print(\" \".join([str(x) for x in [0,0,int(input())]]))", "import itertools\r\nfrom math import sqrt\r\nfrom collections import *\r\nimport bisect \r\nfrom itertools import *\r\nfrom functools import *\r\n\r\ndef dic(l):\r\n d = {}\r\n d[i] = d.get(i,0)+1\r\n return d\r\ndef d2b(n):\r\n return \"{0:b}\".format(int(n))\r\ndef isp(n):\r\n x = int(n)\r\n s = sqrt(int(x))\r\n i=2\r\n while i<=int(s):\r\n if x%i!=0:\r\n i=i+1 \r\n else:\r\n return False\r\n break\r\n while i>int(s):\r\n return True \r\n break \r\ndef gcd(a,b):\r\n while(b):\r\n a, b = b, a % b\r\n return a\r\ndef ispal(n):\r\n l = len(str(n))\r\n n = int(n)\r\n for i in range(1,l//2 +1):\r\n l = len(str(n))\r\n if n%(10**(1))==n//(10**(l-1)):\r\n n= n- (n//(10**(l-i)))*10**(l-i)\r\n n = n//10\r\n else:\r\n return False\r\n break\r\n if n<10:\r\n return True\r\ndef sub(arr):\r\n a = [[]]\r\n for i in sorted(arr):\r\n a += [j+[i] for j in a]\r\n return a\r\nmod = 1000000007\r\n\r\n\r\ndef fn(n,arr):\r\n pass\r\n\r\nt = int(input())\r\ndef break_fibonacci(n):\r\n # Base cases\r\n if n == 0:\r\n return [0, 0, 0]\r\n if n == 1:\r\n return [0, 0, 1]\r\n\r\n # Find the closest Fibonacci number less than or equal to n\r\n fib_list = [0, 1]\r\n while fib_list[-1] < n:\r\n fib_list.append(fib_list[-1] + fib_list[-2])\r\n\r\n # Try all possible combinations of Fibonacci numbers\r\n for i in range(len(fib_list)):\r\n for j in range(i, len(fib_list)):\r\n for k in range(j, len(fib_list)):\r\n if fib_list[i] + fib_list[j] + fib_list[k] == n:\r\n return [fib_list[i], fib_list[j], fib_list[k]]\r\n\r\n # If no combination found, return None\r\n return None\r\n\r\n# Example usage\r\nn = 13\r\nresult = break_fibonacci(t)\r\nprint(*result)\r\n", "x=int(input());print(0,0,x)", "def generate_fibonacci(limit):\r\n fibonacci = [0, 1]\r\n while fibonacci[-1] <= limit:\r\n next_fib = fibonacci[-1] + fibonacci[-2]\r\n fibonacci.append(next_fib)\r\n return fibonacci\r\n\r\ndef find_fibonacci_sum(n):\r\n fibonacci = generate_fibonacci(n)\r\n \r\n for i in range(len(fibonacci) - 1, -1, -1):\r\n for j in range(i, -1, -1):\r\n for k in range(j, -1, -1):\r\n if fibonacci[i] + fibonacci[j] + fibonacci[k] == n:\r\n return fibonacci[i], fibonacci[j], fibonacci[k]\r\n\r\nn = int(input())\r\na, a2, a3 = find_fibonacci_sum(n)\r\nprint(a, a2, a3)\r\n", "n=int(input())\r\nif n==1:print(0,0,1)\r\nelif n==0:print(0,0,0)\r\nelse:\r\n\ta,b=0,1\r\n\tc=1\r\n\twhile c!=n:\r\n\t\td=b+c\r\n\t\ta=b\r\n\t\tb=c\r\n\t\tc=d\r\n\tprint(0,a,b)\r\n", "def find_fibonacci_numbers(n):\n fib_numbers = [0, 1]\n \n while fib_numbers[-1] < n:\n next_fib = fib_numbers[-1] + fib_numbers[-2]\n fib_numbers.append(next_fib)\n\n for i in range(len(fib_numbers) - 1, -1, -1):\n a = fib_numbers[i]\n for j in range(i, -1, -1):\n b = fib_numbers[j]\n c = n - a - b\n if c >= 0 and c in fib_numbers:\n return (a, b, c)\n\nn = int(input())\nresult = find_fibonacci_numbers(n)\n\nif result:\n print(\" \".join(map(str, result)))\nelse:\n print(\"I'm too stupid to solve this problem\")\n\n \t \t \t\t \t\t \t \t \t \t \t\t \t\t\t", "def get_sum(d, n):\r\n for i in d:\r\n if d[i] == n:\r\n print(d[i-1], d[i-2])\r\n\r\ndef main():\r\n n = int(input())\r\n if n == 0:\r\n print(0, 0, 0)\r\n return\r\n if n == 1:\r\n print(0, 0, 1)\r\n return\r\n if n == 2:\r\n print(0, 1, 1)\r\n return\r\n \r\n d = {}\r\n d[0] = 0\r\n d[1] = 1\r\n\r\n for i in range(2, 51):\r\n d[i] = d[i-1] + d[i-2]\r\n\r\n for i in d:\r\n if d[i] == n:\r\n print(d[i-2], end =\" \")\r\n get_sum(d, d[i-1])\r\n\r\nmain()", "n=input()\nk='0 0'\nprint(k + ' ' + n)\n\t\t \t\t \t \t \t\t\t \t \t \t\t", "fibo = input()\r\nprint(\"0 0 \"+fibo)", "from sys import stdin,stdout\r\n\r\nn=int(input())\r\na,b,c=0,1,1\r\nd=[0,1]\r\nwhile c<n:\r\n c=a+b \r\n d.append(c)\r\n a=b \r\n b=c \r\n#print(len(d))\r\nfor i in d:\r\n x=i \r\n f=0\r\n for j in d:\r\n y=j \r\n for z in d:\r\n if x+y+z==n:\r\n f=1 \r\n break\r\n if f==1:\r\n break\r\n if f==1:\r\n break\r\nif(f==1):\r\n print(x,y,z)\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")\r\n ", "n=int(input())\r\nif n==1:print(0,0,1)\r\nelif n==0:print(0,0,0)\r\nelse:\r\n u,v=0,1\r\n while v!=n:\r\n u,v=v,u+v\r\n print(2*u-v ,v-u ,v-u)\r\n\r\n", "print(input(), 0, 0)\r\n", "fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733]\r\na, b, c = -1, -1, -1\r\ntarget = int(input())\r\nfor i in range(len(fib)):\r\n for j in range(len(fib)):\r\n for k in range(len(fib)):\r\n if fib[i] + fib[j] + fib[k] == target:\r\n a, b, c = fib[i], fib[j], fib[k]\r\n break\r\n if a != -1: break\r\n if a != -1: break\r\nprint(f\"{a} {b} {c}\" if a != -1 else \"I'm too stupid to solve this problem\")", "n=int(input())\r\nl=[0,1]\r\nwhile l[-1]+l[-2]<=n:\r\n l.append(l[-1]+l[-2])\r\n\r\ntry:\r\n print(l[-2],l[-4],l[-5])\r\nexcept:\r\n print(n,0,0)", "n=int(input())\r\nf=[0,1]\r\ni=2\r\nwhile f[-1]<n:\r\n f=f+[f[i-1]+f[i-2]]\r\n i+=1\r\ni-=1\r\na=f[i-1]\r\nr=n-a\r\nc=b=-1\r\nj=i-1\r\nwhile b==-1:\r\n if f[j]<=r:\r\n b=f[j]\r\n j-=1\r\nr-=b\r\nj=i-1\r\nwhile c==-1:\r\n if f[j]<=r:\r\n c=f[j]\r\n j-=1\r\nif a+b+c==n:\r\n print(a,b,c)\r\nelif n==1:\r\n print(\"1 0 0\")\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")\r\n", "n = int(input())\r\ndef fibo(n):\r\n if n ==0:\r\n print(0,0,0)\r\n else:\r\n a = 0\r\n b = 1\r\n while a+b!= n:\r\n o = a+b\r\n a = b\r\n b = o\r\n print(0,a,b)\r\n return\r\nfibo(n)\r\n", "n = int(input())\r\n#f(n) = f(n-1)+f(n-2) => f(n-2)+f(n-3)+f(n-2)\r\nprint(0,0,n)", "arr=[0,0,int(input())]\r\nprint(*arr)\r\n", "print(int(input()),0,0)", "\nfibonacci_cache = {}\n\n\ndef fibonacci_memo(input_value):\n if input_value in fibonacci_cache:\n return fibonacci_cache[input_value]\n if input_value == 0:\n value = 0\n elif input_value == 1:\n value = 1\n elif input_value > 1:\n value = fibonacci_memo(input_value - 1) + \\\n fibonacci_memo(input_value - 2)\n fibonacci_cache[input_value] = value\n return value\n\n\nn = 0\n# p = 1000000000\np = int(input())\nprint(0, 0, p)\n", "print(input()+\" 0 0\")\r\n'''\r\n#include <bits/stdc++.h>\r\nusing namespace std;\r\n\r\nint main() {\r\n int n, f0 = 0, f1 = 0, f2 = 0, f3 = 1; cin >> n;\r\n while(f3<n) f0 = f1, f1 = f2, f2 = f3, f3 += f1;\r\n cout << f0 << \" \" << f1 << \" \" << f1;\r\n}\r\n'''", "n = int(input())\r\nif n == 0:\r\n print(0, 0, 0)\r\nelif n == 1:\r\n print(0, 0, 1)\r\nelif n == 2:\r\n print(0, 1, 1)\r\nelse:\r\n f = [0]\r\n i = 1\r\n while i <= n:\r\n f.append(i)\r\n i = f[-1] + f[-2]\r\n print(f[-4], f[-3], f[-3])", "k=[0,0]\r\nk.append(int(input()))\r\nprint(*k)", "lst=[0,1,1,2,3,5,8]\r\nfor i in range(38):\r\n lst.append(lst[-1]+lst[-2])\r\nn=int(input())\r\nif n==0:\r\n print(0,0,0)\r\nelif n==1:\r\n print(0,0,1)\r\nelif n==2:\r\n print(0,1,1)\r\nelse:\r\n k=lst.index(n)\r\n print(lst[k-4],lst[k-3],lst[k-1])", "n = int(input())\r\nprint(n//1,0,0)", "n = int(input())\r\nif n == 0:\r\n\tprint(0,0,0)\r\n\texit()\r\nif n == 1:\r\n\tprint(0,0,1)\r\n\texit()\r\narr = [0,1]\r\nwhile arr[-1] != n:\r\n\tarr.append(arr[-1] + arr[-2])\r\n\r\nprint(arr[-4], arr[-3], arr[-3])", "n=int(input())\r\nprint(\"{} 0 0\".format(n))", "n=int(input())\r\na=0\r\nb=1\r\nc=1\r\ns=2\r\nwhile s<n:\r\n a=b\r\n b=c\r\n c=s\r\n s=c+b\r\nif s==n:\r\n print(a,b,b)\r\nelif n==0:\r\n print(\"0 0 0\")\r\nelif n==1:\r\n print(\"0 0 1\")\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")", "p=int(input())\r\nprint(0,0,p)", "number = int(input())\r\nif number == 0:\r\n print(0, 0, 0)\r\nelse:\r\n fibonacci = [0, 1]\r\n\r\n for i in range(2, number + 2):\r\n fib = (fibonacci[0] + fibonacci[1])\r\n if fib == number:\r\n print(0, fibonacci[0], fibonacci[1])\r\n break\r\n else:\r\n\r\n if i % 2 == 0:\r\n fibonacci[0] = fib\r\n else:\r\n fibonacci[1] = fib\r\n", "from functools import lru_cache;\r\narray = set()\r\n\r\n\r\nn = int(input())\r\n\r\n\r\n@lru_cache(maxsize=None)\r\ndef fib(n):\r\n if n <= 1:\r\n array.add(n)\r\n return n\r\n\r\n ans = fib(n - 1) + fib(n - 2)\r\n array.add(ans)\r\n return ans\r\n\r\n\r\nfib(50)\r\n\r\n\r\ndef solve(target):\r\n for firstNum in array:\r\n for secondNum in array:\r\n if (target - (firstNum + secondNum)) in array:\r\n return (firstNum, secondNum, (target - (firstNum + secondNum)))\r\n return (-1, -1, -1)\r\n\r\n\r\nfirstNum, secondNum, thirdNum = solve(n)\r\n\r\nif firstNum == -1:\r\n print(\"I'm too stupid to solve this problem\")\r\nelse:\r\n print(firstNum, secondNum, thirdNum)\r\n", "def fibonacci(n):\r\n l = [0, 1];\r\n i = 2;\r\n while(l[-1]<n):\r\n l.append(l[i-2]+l[i-1])\r\n i+=1\r\n return l;\r\n \r\n \r\nn = int(input())\r\nif(n==0): print(\"0 0 0\")\r\nelif(n==1): print(\"0 0 1\")\r\nelif(n==2): print(\"0 1 1\")\r\nelse:\r\n l = fibonacci(n)\r\n print(f'{l[-5]} {l[-4]} {l[-2]}')\r\n", "x = int(input())\na = 0\na = 0\na = 0\na = 0\na = 0\na = 0\na = 0\na = 0\na = 0\na = 0\na = 0\na = 0\na = 0\na = 0\na = 0\nprint(\"0 0\", x)\n\t\t\t\t \t\t\t \t \t\t\t\t\t \t \t", "# fino = [0,1]\r\n# while fino[-1]\r\n# fino.append(finp[-1]+fino[-2])\r\n\r\nprint('0 0 {}'.format(input()))", "print(f'0 0 {input()}')", "num=int(input())\r\nprint('0'+\" \"+'0'+\" \"+str(num))", "n=int(input())\n\nn1,n2,n3,n4,n5=0,1,1,2,3\nif n==0:\n print(0,0,0)\nelif n==1:\n print(0,0,1)\nelif n==2:\n print(0,1,1)\nelse:\n while n5!=n:\n n1,n2,n3,n4=n2,n3,n4,n5\n n5=n4+n3\n \n print(n1,n2,n4)\n \t\t\t\t\t \t \t \t\t\t\t\t\t\t\t \t", "n = int(input())\nprint(n, 0, 0)\n", "n=int(input())\r\nprint(str(n)+' '+'0'+' '+'0')", "# import sys\n# sys.stdout = open('CP/output.txt', 'w')\n# sys.stdin = open('CP/input.txt', 'r')\n\nif __name__=='__main__':\n N = int(input())\n print(f\"0 0 {N}\")\n", "A=[]\r\nf=0\r\ns=1\r\nA.append(f)\r\nn=0\r\nwhile n<10**9:\r\n n=f+s\r\n A.append(n)\r\n s=f\r\n f=n\r\nInp=int(input())\r\nif Inp==0:\r\n print(0,0,0)\r\nelif Inp==1:\r\n print(0,0,1)\r\nelse:\r\n Index=A.index(Inp)\r\n print(A[Index-2],A[Index-2],A[Index-3])\r\n ", "n=int(input())\nif n==0:\n\tprint(0,0,0)\n\nelif n==1:\n\tprint(0,0,1)\nelse:\n\ti,j,k,l=0,1,1,2\n\twhile l<n:\n\n\t\tf_i = l+k\n\t\ti,j,k,l=j,k,l,f_i\n\n\t\tif f_i==n:\n\t\t\tbreak\n\n\tif i+j+j!=n:\n\t\tprint(\"I'm too stupid to solve this problem\")\n\telse:\n\t\tprint(i,j,j)", "n = int(input())\na = 0\nb = 0\nc = n\nstring = \"I'm too stupid to solve this problem\"\n\nif True:\n print(a, b, c)\nelse:\n print(string)\n \t \t\t \t\t \t\t\t \t \t \t\t \t \t\t", "# problem solving base file\r\n# the following lines are reserved for imports\r\n#\r\n#\r\n\r\n# main declaration\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n if n == 0:\r\n print(\"0 0 0\")\r\n else:\r\n a, b = 0, 1\r\n while a + b != n:\r\n a, b = b, a + b\r\n print(0, a, b)\r\n", "n= int(input())\r\nx=[1 ,0,0,1]\r\nif n==0: print(0,0,0)\r\nelse:\r\n while x[-1]!=n :\r\n x.append(x[-1]+x[-2])\r\n print(*[x[-3],x[-3],x[-4]])", "k= int(input())\nif k== 0:\n print(0, 0, 0)\nelse:\n a, b = 0, 1\n while a + b != k:\n a, b = b, a + b\n print(0, a, b)\n\n \t \t\t \t\t \t\t\t\t \t \t \t", "#\r\n# fibs = [0, 0]\r\n#\r\n# fibs[0] = x= 0\r\n# fibs[1] = y = 1\r\n#\r\n# while y < 10**9:\r\n# x, y = y, x+y\r\n# fibs.append(y)\r\n\r\nnum = int(input())\r\nprint(0, 0, num)\r\n\r\n", "n = int(input())\r\n\r\nprint(0 , 0 , n)\r\n\r\n\r\n\r\n\r\n", "#Davidson Lisboa Della Piazza, 169786\n\nn = str(input())\n\nprint(\"0 0 \"+n)\n\t\t \t\t \t \t \t\t\t\t \t\t", "num = int(input())\r\nprint(f\"0 0 {num}\")", "n = int(input())\r\nphi = 1.6180339\r\ncount = 5\r\narr = [0, 1, 1, 2, 3, 5]\r\nfn = 5\r\ndef round_int(x):\r\n if x == float(\"inf\") or x == float(\"-inf\"):\r\n return float('nan') # or x or return whatever makes sense\r\n return int(round(x))\r\nif n == 0:\r\n print(0, 0, 0)\r\nelif n == 1:\r\n print(0, 0, 1)\r\nelif n == 2:\r\n print(0, 1, 1)\r\nelif n == 3:\r\n print(0, 1, 2)\r\nelif n == 5:\r\n print(0, 2, 3)\r\nelse:\r\n while fn != n:\r\n count += 1\r\n fn = arr[count - 1] + arr[count - 2] #round_int(phi * fn)\r\n arr.append(fn)\r\n else:\r\n print(arr[count - 1], arr[count - 3], arr[count - 4])\r\n exit()\r\n", "import sys\r\n\r\ndef main():\r\n n = int(sys.stdin.read().strip())\r\n if n == 1: return '0 0 1'\r\n if n == 0: return '0 0 0'\r\n if n == 2: return '0 1 1'\r\n l = []\r\n x, y = 0, 1\r\n while x != n:\r\n l.append(x)\r\n x, y = y, y + x\r\n return l[-1], l[-3], l[-4]\r\n \r\n\r\nprint(*main())", "def fibo(n):\r\n fibo_list = [0]\r\n a,b = 0,1\r\n while b < n:\r\n a,b = b,a+b\r\n fibo_list.append(a)\r\n return fibo_list\r\n\r\nn=int(input())\r\nif n==0:\r\n\tprint(0,0,0)\r\nelif n==1:\r\n\tprint(1,0,0)\r\nelif n==2:\r\n\tprint(2,0,0)\r\nelse:\r\n\tmain = fibo(n)\r\n\tif n==main[len(main)-1]+main[len(main)-3]+main[len(main)-4]:\r\n\t\tprint(main[len(main)-1],main[len(main)-3],main[len(main)-4])\r\n\telse:\r\n\t\tprint(\"I'm too stupid to solve this problem\")", "#JAJAJAJAJAJAJAJAJAJAJAJAJAJAJAJJAJAJAJAJA\nx =input()\nprint(\"0 0 \"+x)", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline().strip())\r\n\r\nvals = [0, 1]\r\nif n == 0:\r\n stdout.write(f\"{0} {0} {0}\")\r\n exit()\r\nelif n == 1:\r\n stdout.write(f\"{0} {0} {1}\")\r\n exit()\r\nelif n == 2:\r\n stdout.write(f\"{0} {1} {1}\")\r\n exit()\r\nelse:\r\n while vals[-1] != n:\r\n vals.append(vals[-1]+vals[-2])\r\nstdout.write(f\"{vals[-5]} {vals[-4]} {vals[-2]}\")\r\n", "n = int(input())\r\n\r\nfibonacci = [0, 1]\r\nwhile fibonacci[-1] < n:\r\n fibonacci.append(fibonacci[-1] + fibonacci[-2])\r\n \r\nif n == 0:\r\n n1, n2, n3 = 0, 0, 0\r\nelif n == 1:\r\n n1, n2, n3 = 1, 0, 0\r\nelif n == 2:\r\n n1, n2, n3 = 1, 1, 0\r\nelse:\r\n n1, n2, n3 = fibonacci[-2], fibonacci[-4], fibonacci[-5]\r\n \r\nprint(n1, n2, n3, sep=' ')", "\"\"\"\r\n ____ _ _____\r\n / ___|___ __| | ___| ___|__ _ __ ___ ___ ___\r\n| | / _ \\ / _` |/ _ \\ |_ / _ \\| '__/ __/ _ \\/ __|\r\n| |__| (_) | (_| | __/ _| (_) | | | (_| __/\\__ \\\r\n \\____\\___/ \\__,_|\\___|_| \\___/|_| \\___\\___||___/\r\n\r\n\"\"\"\r\n\"\"\"\r\n░░██▄░░░░░░░░░░░▄██\r\n░▄▀░█▄░░░░░░░░▄█░░█░\r\n░█░▄░█▄░░░░░░▄█░▄░█░\r\n░█░██████████████▄█░\r\n░█████▀▀████▀▀█████░\r\n▄█▀█▀░░░████░░░▀▀███\r\n██░░▀████▀▀████▀░░██\r\n██░░░░█▀░░░░▀█░░░░██\r\n███▄░░░░░░░░░░░░▄███\r\n░▀███▄░░████░░▄███▀░\r\n░░░▀██▄░▀██▀░▄██▀░░░\r\n░░░░░░▀██████▀░░░░░░\r\n░░░░░░░░░░░░░░░░░░░░\r\n\"\"\"\r\n\r\nimport sys\r\nimport math\r\nimport collections\r\nfrom collections import deque\r\n\r\n#sys.stdin = open('input.txt', 'r')\r\n#sys.stdout = open('output.txt', 'w')\r\n\r\nfrom functools import reduce\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nsetrecursionlimit(2**20)\r\n\r\n\r\ndef factors(n):\r\n return list(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))\r\n\r\nT = 1\r\n#T = int(stdin.readline())\r\nfor _ in range(T):\r\n # b = str(stdin.readline().strip('\\n'))\r\n # n, x = list(map(int, stdin.readline().split()))\r\n # s = list(stdin.readline().strip('\\n'))\r\n # b = list(stdin.readline().strip('\\n'))\r\n # a = list(map(int, stdin.readline().split()))\r\n # a = str(stdin.readline().strip('\\n'))\r\n #s = list(stdin.readline().strip('\\n'))\r\n n = int(stdin.readline())\r\n print(*[0, 0, n])\r\n", "n=input()\r\nprint(n,0,0)", "#A. Hexadecimal's theorem\r\nn = int(input())\r\nprint(0,0,n)", "n=int(input())\r\na=[]\r\na.append(0)\r\na.append(1)\r\na.append(1)\r\ni=2\r\nwhile a[i]<=n:\r\n b=a[i]+a[i-1]\r\n a.append(b)\r\n i=i+1\r\nif n==0:\r\n print(\"0 0 0\")\r\nelif n==1:\r\n print(\"0 0 1\")\r\nelif n==2:\r\n print(\"0 1 1\")\r\nelif n==3:\r\n print(\"1 1 1\")\r\nelif a[i-1]==n:\r\n print(a[i-5],a[i-4],a[i-2])\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")", "n=int(input())\r\ni=0;k=1\r\nif n==0:exit(print(0,0,0))\r\nwhile 1:\r\n\tp=i+k\r\n\tif p==n:exit(print(0,0,p))\r\n\telif p>n:exit(print(0,k,n-k))\r\n\ti=k\r\n\tk=p", "numerin=input()\r\nprint(\"0 0 \"+numerin)\r\n", "n=int(input())\r\nif n== 0:\r\n print(0,0,0)\r\nelse:\r\n a, b = 0, 1\r\n while (a+b)!=n:\r\n a,b= b,a+b\r\n print(0,a,b) ", "num = int(input())\r\nstop = \"I'm too stupid to solve this problem\"\r\n# Python program to display the Fibonacci sequence\r\nfibos = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733, 1134903170, 1836311903, 2971215073, 4807526976, 7778742049, 12586269025, 20365011074, 32951280099, 53316291173, 86267571272, 139583862445, 225851433717, 365435296162, 591286729879, 956722026041, 1548008755920, 2504730781961, 4052739537881, 6557470319842, 10610209857723, 17167680177565, 27777890035288, 44945570212853, 72723460248141, 117669030460994]\r\n\r\n\r\nif num ==3:\r\n print(1,1,1)\r\n quit()\r\nelif num == 0:\r\n print(0,0,0)\r\n quit()\r\nelif num == 1:\r\n print(1,0,0)\r\n quit()\r\nelif num == 2:\r\n print(1,1,0)\r\n quit()\r\ntry:\r\n start = fibos.index(num) - 2\r\n print(fibos[start],fibos[start],fibos[start-1])\r\nexcept:\r\n print(stop)\r\n", "fn = int(input())\r\ns = {0: [0, 0, 0], 1: [0, 0, 1], 2: [0, 1, 1]}\r\nn1 = 1\r\nn2 = 2\r\ni = 0\r\nwhile n1+n2 <= fn:\r\n i = n1+n2\r\n s[i] = [0, n1, n2]\r\n n1 = n2\r\n n2 = i\r\nprint(\" \".join(str(x) for x in s[fn]))\r\n", "_1 = 'Weird Algorithm'\r\nl = []\r\n# n = int(input())\r\n# l.append(n)\r\n# while n != 1:\r\n# if n %2 == 0:\r\n# n = n // 2\r\n# l.append(n)\r\n# else:\r\n# n = n * 3 + 1\r\n# l.append(n)\r\n# l = map(str,l)\r\n# print(' '.join(l))\r\n_2 = 'Missing Number'\r\n# n = int(input())\r\n# l = list(map(int,input().split()))\r\n# l.sort()\r\n# s = 0\r\n# for i in range(1,n+1):\r\n# s+=i\r\n# print(s-sum(l))\r\n\r\n########\r\n\r\nFORMULA_SUM_0_TO_N = 'n * (n+1) / 2'\r\n# 1+2+3+4+5+...n\r\n\r\n\r\n########\r\n\r\n_3 = 'Repetitions'\r\n# l = list(str(input()))\r\n# o = [0] * len(l)\r\n# for i in range(1,len(l)):\r\n# if l[i] == l[i-1]:\r\n# o[i] = o[i-1] + 1\r\n# else:\r\n# o[i] = 0\r\n# print(max(o)+1)\r\n_4 = 'Increasing Array'\r\n# n = int(input())\r\n# l = list(map(int,input().split()))\r\n# k = 0\r\n# for i in range(1,len(l)):\r\n# if l[i] < l[i-1]:\r\n# k+=l[i-1] - l[i]\r\n# l[i] = l[i-1]\r\n# print(k)\r\n_5 = 'Permutations'\r\n# n = int(input())\r\n# o = []\r\n# if n == 1:\r\n# print(1)\r\n# if n == 2 or n == 3:\r\n# print('NO SOLUTION')\r\n# if n % 2==0:\r\n# for i in range(2,n+1,2):\r\n# o.append(i)\r\n# for i in range(1,n,2):\r\n# o.append(i)\r\n# else:\r\n# for i in range(2,n,2):\r\n# o.append(i)\r\n# for i in range(1,n+1,2):\r\n# o.append(i)\r\n# o = map(str,o)\r\n# print(' '.join(o))\r\n_6 = 'Number Spiral'\r\n# n = int(input())\r\n# for i in range(n):\r\n# x,y = map(int,input().split())\r\n# z = max(x,y)\r\n# if z == x:\r\n# if z % 2==0:\r\n# print(z*z-(y-1))\r\n# else:\r\n# print(((z-1)**2) + y)\r\n# else:\r\n# if z % 2!= 0:\r\n# print(z*z-(x-1))\r\n# else:\r\n# print((z-1)**2+x)\r\n_7 = 'Two Knights'\r\n# n = int(input())\r\n# for i in range(1,n+1):\r\n# a1 = i*i\r\n# a2 = a1* (a1-1)/2\r\n# if i > 2:\r\n# a2-=4*(i-1)*(i-2)\r\n# print(int(a2))\r\n_8 = 'Two Sets'\r\n# n = int(input())\r\n# if n*(n+1)%4 != 0:\r\n# print('NO')\r\n# else:\r\n# l1,l2 = [],[]\r\n# j = 0\r\n# if n%4:\r\n# j = 3\r\n# else:\r\n# j = 4\r\n# for i in range((n-1)//4):\r\n# l1.append(4*i+1+j)\r\n# l1.append(4*i+4+j)\r\n# l2.append(4*i+2+j)\r\n# l2.append(4*i+3+j)\r\n# if n % 4:\r\n# l1.append(1)\r\n# l1.append(2)\r\n# l2.append(3)\r\n# else:\r\n# l1.append(1)\r\n# l1.append(4)\r\n# l2.append(2)\r\n# l2.append(3)\r\n# ll1 = len(l1)\r\n# ll2 = len(l2)\r\n# l1 = map(str,l1)\r\n# l2 = map(str,l2)\r\n#\r\n# print('YES')\r\n# print(ll1)\r\n# print(' '.join(l1))\r\n# print(ll2)\r\n# print(' '.join(l2))\r\n_9 = 'Bit Strings'\r\n# n = int(input())\r\n# s = 1\r\n# for i in range(n):\r\n# s=2*s%(1e9+7)\r\n# print(int(s))\r\n_10 = 'Trailing Zeros'\r\n# n = int(input())\r\n# a = 0\r\n# i = 5\r\n# while i <= n:\r\n# a += n//i\r\n# i*=5\r\n# print(a)\r\n_11 = 'Coin Piles'\r\n# n = int(input())\r\n# for i in range(n):\r\n# a,b = map(int,input().split())\r\n# if (a+b)%3==0 and a*2>=b and b*2>=a:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n_12 = 'Palindrome Reorder'\r\n# s = list(str(input()))\r\n\r\n\r\nn = int(input())\r\nprint(0,0,n)\r\n", "n=int(input())\r\nfib=[0,1,1]\r\nif n==0:\r\n print(0,0,0)\r\nelif n==1:\r\n print(0,0,1)\r\nelif n==2:\r\n print(0,1,1)\r\nelse:\r\n while fib[-1]<n:\r\n fib+=[fib[-1]+fib[-2]]\r\n print(fib[-2],fib[-4],fib[-5])", "n = int(input())\r\nprint(0 , 0, n)", "\r\n\r\nn=int(input())\r\nif n==0:\r\n print(0,0,0)\r\nelif n==1:\r\n print(1,0,0)\r\nelse:\r\n a=1\r\n b=1\r\n l=[]\r\n l.append(0)\r\n l.append(a)\r\n l.append(b)\r\n c=0\r\n while c!=n:\r\n c=a+b\r\n a=b\r\n b=c\r\n l.append(c)\r\n l.pop()\r\n n=len(l)\r\n print(l[n-1],l[n-3],l[n-4])\r\n", "n = int(input())\r\nif n == 0:\r\n print(0, 0, 0)\r\nelse:\r\n a, b = 0, 1\r\n while a + b != n:\r\n a, b = b, a + b\r\n print(0, a, b)", "print(input(),0,0)", "def fibo(x):\n\tc = 0\n\tatual = d[0]\n\twhile atual <= x:\n\t\ttry:\n\t\t\tatual = d[c+1]\n\t\texcept:\n\t\t\td[c+1] = d[c] + d[c-1]\n\t\t\tatual = d[c+1]\n\t\tc += 1\n\treturn d[c-1]\n\nn = int(input())\n\nd = {0: 0, 1: 1, 2: 1}\nl = []\n\nfor i in range(3, 0, -1):\n\tx = n // i\n\tf = fibo(x)\n\tl.append(f)\n\tn -= f\n\nif n != 0:\n\tprint(\"I'm too stupid to solve this problem\")\nelse:\n\tprint(l[0], l[1], l[2])\n \t \t \t\t \t \t\t \t \t \t \t", "n = int(input())\na = [0, 1]\nwhile a[-1] < n:\n a.append(a[-1] + a[-2])\nif n >= 8:\n print(a[-2], a[-4], a[-5])\nelif n == 5 :\n print(2, 2, 1)\nelif n == 0:\n print(0, 0, 0)\nelif n == 1:\n print(0, 0, 1)\nelif n == 2:\n print(0, 1, 1)\nelif n == 3:\n print(1, 1, 1)", "n = int(input()) \r\nprint(f'{n} 0 0') ", "x=int(input())\r\nprint(x,0,0)", "print(int(input()), 0, 0)\n\n \t \t \t \t\t\t\t\t\t\t\t\t \t\t \t\t\t", "a=input()\r\nprint(0,0,a)", "from sys import stdin\r\nfrom itertools import cycle\r\ninput = stdin.readline\r\ndef instr():\r\n return input()[:-1]\r\nn = int(input())\r\nprint(n, 0, 0)", "print(input() + \" 0 0\")", "print('0 0 {}' .format(input()))", "x = int(input())\r\nf0 = 0\r\nf1 = 1\r\nif x == 0:\r\n print(\"0 0 0\")\r\nelif x == 1:\r\n print(\"0 0 1\")\r\nelse:\r\n while True:\r\n fx = f0+f1\r\n f0 = f1\r\n f1 = fx\r\n if fx == x:\r\n print((f0 - (f0 - (f1-f0))) - (f0 - (f1 - f0)), f0 - (f1-f0), f0)\r\n break\r\n", "a=int(input())\r\nd={}\r\np,q=0,1\r\nif a==0:\r\n\tprint(0,0,0)\r\nelif a==1:\r\n\tprint(0,0,1)\r\nelse:\r\n\twhile(q!=a):\r\n\t\tc=p+q\r\n\t\td[c]=[p,q]\r\n\t\tp=q\r\n\t\tq=c\r\n\tprint(d[c][0],d[d[c][1]][0],d[d[c][1]][1])", "# A. Hexadecimal's theorem\r\nprint(0,0,int(input()))", "n=int(input())\r\na=0\r\nb=1\r\nc=1\r\nx=2\r\nwhile x<n:\r\n x=x+c\r\n a=b\r\n b=c\r\n c=x-b\r\nif n==0:\r\n print(0,0,0)\r\nelif n==1:\r\n print(0,0,1)\r\nelse: \r\n print(a,b,b)", "a=input()\r\nans=\"0 0 \"+a\r\nprint(ans)\r\n", "fib = [0, 1]\r\nwhile fib[len(fib) - 1] <= 1e9:\r\n\tfib.append(fib[len(fib) - 2] + fib[len(fib) - 1])\r\n\r\nN = int(input())\r\nfor i in range(len(fib)):\r\n\tfor j in range(i, len(fib)):\r\n\t\tfor k in range(j, len(fib)):\r\n\t\t\tif N == fib[i] + fib[j] + fib[k]:\r\n\t\t\t\tprint(f'{fib[i]} {fib[j]} {fib[k]}')\r\n\t\t\t\texit(0)\r\nprint(\"I'm too stupid to solve this problem\")\r\n\r\n\r\n", "def creating_fibo_sequence(n):\r\n f = [0, 1]\r\n while f[-1] <= n:\r\n next_felement = f[-2] + f[-1]\r\n f.append(next_felement)\r\n return f\r\n\r\ndef possible_numbers_if_any(n):\r\n fibonacci = creating_fibo_sequence(n)\r\n\r\n for i in range(len(fibonacci)):\r\n for j in range(len(fibonacci)):\r\n for k in range(len(fibonacci)):\r\n if fibonacci[i] + fibonacci[j] + fibonacci[k] == n:\r\n return True, fibonacci[i], fibonacci[j], fibonacci[k]\r\n\r\n return False, 0, 0, 0\r\n\r\n\r\nn = int(input())\r\n\r\n\r\nfound, a, b, c = possible_numbers_if_any(n)\r\n\r\n\r\nif found:\r\n print(a, b, c)\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")", "\r\nfibs = [0, 0]\r\n\r\nfibs[0] = x= 0\r\nfibs[1] = y = 1\r\n\r\nwhile y < 10**9:\r\n x, y = y, x+y\r\n fibs.append(y)\r\n\r\nnum = int(input())\r\n\r\nif num == 0:\r\n print(0, 0, 0)\r\nelif num == 1:\r\n print(0, 0, 1)\r\nelse:\r\n ind = fibs.index(num)\r\n print(0, fibs[ind-2], fibs[ind-1])\r\n\r\n", "n = int(input())\r\na = [0,0,n]\r\nprint(*a)", "print(0, 0, int(input()))", "inp=input()\r\nprint('0 0',inp)\r\n", "n=int(input())\nfibo=[0,1]\nfor i in range(50):\n fibo.append(fibo[i+1]+fibo[i])\ni=fibo.index(n)\nif i>2:\n print(fibo[i-2],fibo[i-2],fibo[i-3])\nelif n==1:\n print('0 0 1')\nelif n==0:\n print(\"0 0 0\")\n ", "num = int(input())\r\nprint(num, 0, 0)\r\n", "a=input()\r\nprint(a+\" 0 0\")\r\n", "n=int(input())\r\nfibo=[0,1]\r\nc=2\r\nif n==0:\r\n print(0,0,0)\r\nelse:\r\n while(True):\r\n num=fibo[c-1]+fibo[c-2]\r\n fibo.append(num)\r\n c+=1\r\n if num==n:\r\n break\r\n if c==3:\r\n print(0,0,1)\r\n elif c==4:\r\n print(0,1,1)\r\n else:\r\n print(fibo[c-5],fibo[c-4],fibo[c-2])", "n= int(input())\r\n#arr = [int(i) for i in input().split()]\r\n\r\nfib_arr = [0, 1]\r\nfib = 1\r\nfib_dict = {0:(0, 0)}\r\nwhile fib <= n:\r\n fib = fib_arr[-1]+fib_arr[-2]\r\n if fib>n:\r\n break\r\n fib_dict[fib] = (fib_arr[-1], fib_arr[-2])\r\n fib_arr.append(fib_arr[-1]+fib_arr[-2])\r\n\r\nfound = False\r\n\r\nfor fib in fib_arr[::-1]:\r\n if n-fib in fib_dict:\r\n print(*fib_dict[fib], n-fib)\r\n found = True\r\n break\r\n \r\nif not found:\r\n print(\"I'm too stupid to solve this problem\")\r\n ", "n = int(input())\r\nprint(0, ' ', 0, ' ', n, sep='')\r\n", "import itertools\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n print(input(), 0, 0)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n=int(input())\r\nprint(\"0 0 \"+str(n))\r\n\r\n ", "import sys\r\nSUM = int(input())\r\nfibonacci = [0, 1, 1]\r\nfor i in range(3,1000):\r\n fibonacci.append(fibonacci[i-1]+fibonacci[i-2])\r\n if (1000000000 < fibonacci[-1]): break\r\n\r\nN = len(fibonacci)\r\nfor i in range(N):\r\n for j in range(N):\r\n for k in range(N):\r\n if (fibonacci[i] + fibonacci[j] + fibonacci[k] == SUM):\r\n print(fibonacci[i], fibonacci[j], fibonacci[k])\r\n sys.exit()\r\nprint('I\\'m too stupid to solve this problem')", "\n\nn = int(input())\nprint(0,0,n)\n\n", "def prev_fibonacci(prev_fibonacci_list, n):\r\n if len(prev_fibonacci_list) < 4:\r\n a = n / ((1 + (5 ** 0.5)) / 2.0)\r\n # print(round(a))\r\n prev_fibonacci_list.append(round(a))\r\n return prev_fibonacci(prev_fibonacci_list, round(a))\r\n\r\n return prev_fibonacci_list\r\n\r\n\r\nn = int(input())\r\n\r\nif n == 3:\r\n a, b, c = 0, 1, 2\r\nelif n == 2:\r\n a, b, c = 0, 1, 1\r\nelif n == 1:\r\n a, b, c = 0, 0, 1\r\nelif n == 0:\r\n a, b, c = 0, 0, 0\r\nelse:\r\n prev_fibonacci_numbers = prev_fibonacci([], n)\r\n # print(prev_fibonacci_numbers)\r\n a, b, c = prev_fibonacci_numbers[3], prev_fibonacci_numbers[2], prev_fibonacci_numbers[0]\r\n\r\nprint(a, b, c)", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n\tn = int(input())\n\tif n==0:\n\t\tprint(0,0,0)\n\telif n==1:\n\t\tprint(1,0,0)\n\telse:\n\t\ta = 0\n\t\tb = 1\n\t\tc = 1\n\t\td = 2\n\t\twhile d != n:\n\t\t\td = c + d\n\t\t\tc = b + c\n\t\t\ttemp = b\n\t\t\tb = a + b\n\t\t\ta = temp\n\t\tprint(a,b,b)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 23 12:00:49 2021\r\n\r\n@author: Karl\r\n\"\"\"\r\n# Get input\r\nn = int(input())\r\n\r\n# Generate fib numbers\r\nfib = {0:0, 1:1}\r\n\r\ndef get_fib(n):\r\n if n in fib:\r\n return fib[n]\r\n else:\r\n ans = get_fib(n-1) + get_fib(n-2)\r\n fib[n] = ans\r\n return ans\r\ni = 0 \r\nwhile get_fib(i) <= n:\r\n i += 1\r\n \r\n# find 3 numbers that add up\r\ndef get_sum(n, fib):\r\n for x in fib.values():\r\n for y in fib.values():\r\n for z in fib.values():\r\n if (x + y + z) == n:\r\n return (x, y, z)\r\n return None\r\n\r\nans = get_sum(n, fib)\r\nif ans == None:\r\n print(\"I'm too stupid to solve this problem\")\r\nelse:\r\n print(ans[0], ans[1], ans[2])\r\n ", "s=int(input())\r\nprint(0,s,0)", "n= int(input())\r\n\r\n# 0, 1, 1, 2, 3, 5, 8, 13, ...\r\n\r\nif n==0:\r\n print(*[0,0,0])\r\nelif n==1:\r\n print(*[1,0,0])\r\nelif n==2:\r\n print(*[1,1,0])\r\nelse:\r\n \r\n p1=0;p2=1;p3=1;p4=2\r\n x=3\r\n while x<n:\r\n p1=p2\r\n p2=p3\r\n p3=p4\r\n p4=x\r\n x=p3+p4\r\n \r\n print(*[p1,p2,p4])\r\n ", "import math\ndef isPerfectSquare(x):\n s = int(math.sqrt(x))\n return s*s == x\ndef isFibonacci(n):\n return isPerfectSquare(5*n*n + 4) or isPerfectSquare(5*n*n - 4)\nn=int(input())\nif (isFibonacci(n) == True):\n print(0,0,n)\nelse:\n print('IMPOSSIBLE')\n\t\t\t \t\t\t\t\t \t \t \t\t\t\t \t \t\t \t\t\t", "def hexadecimals_theorem_a():\r\n n = int(input())\r\n fib = [0,1]\r\n while(fib[-1] <= n):\r\n fib.append(fib[-1] + fib[-2])\r\n ans = [0,0]\r\n for v in fib[::-1]:\r\n if(n >= v):\r\n n -= v\r\n ans.append(v)\r\n if(n == 0):\r\n print(*sorted(ans[-3:]))\r\n else:\r\n print(\"I'm too stupid to solve this problem\")\r\n\r\nif __name__ == '__main__':\r\n import math\r\n from collections import defaultdict\r\n mod = 10**9 + 7\r\n hexadecimals_theorem_a()", "n = int(input())\n\n\ndef fib(n):\n a = [0,1]\n if n==1 or n==1:\n return a\n i =0\n while i<=n:\n i = a[-1]+a[-2]\n a.append(i)\n return a\n\nif n == 0:\n print(\"0 0 0\")\nelif n == 1:\n print(\"1 0 0 \")\nelif n == 2:\n print(\"1 1 0\")\nelif n==3:\n print(\"1 1 1\")\nelse:\n a = fib(n)\n print(str(a[-3])+\" \"+str(a[-5])+\" \" +str(a[-6]))\n\n\n", "import math\r\ndef ps(a):\r\n s=int(math.sqrt(a))\r\n return s*s==a\r\ndef check(a):\r\n return ps(5*a*a+4) or ps(5*a*a-4)\r\n\r\nt=int(input())\r\nif(check(t)==True):\r\n print(0,0,t)\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")\r\n", "n=int(input())\nl=[0,1]\nfor i in range(2,46):\n l.append(l[i-2]+l[i-1])\nif n==0:print(0,0,0)\nelif n==1:print(0,0,1)\nelif n==2:print(0,1,1)\nelif n not in l:print(\"I'm too stupid to solve this problem\")\nelse:\n a=l.index(n)\n b=l[a-4]\n c=l[a-3]\n d=l[a-1]\n print(b,c,d)\n \t \t \t \t \t\t\t\t\t\t\t\t \t \t \t\t", "a = int(input())\r\nprint(0,0,a)", "print('0 0 {}'.format(int(input())))", "q = int(input())\r\nif q == 0:\r\n print(0, 0, 0)\r\nelse:\r\n x, b = 0, 1\r\n while x+ b != q:\r\n x, b = b, x + b\r\n print(0, x, b)", "k= int(input())\nif k== 0:\n print(0, 0, 0)\nelse:\n z, b = 0, 1\n while z + b != k:\n z, b = b, z + b\n print(0, z, b)\n\n\t \t\t\t\t\t\t\t \t \t \t \t", "# A. Hexadecimal's theorem\n\n# Editorial - https://codeforces.com/blog/entry/4764\nprint(0, 0, input())\n", "t = int(input())\r\n\r\nprint(\"0 0 %d\" % t)\r\n \r\n\r\n", "n = int(input())\n\nfib = [0,1]\n\nwhile fib[-1] < n :\n fib.append(fib[-1]+fib[-2])\n\nif fib[-1] > n :\n tar = fib[-2]\n left = n - tar\n\nelse :\n tar = fib[-1]\n left = n - tar\n\n\ndup = list(set(fib))\ni = 0\na = \"\"\nb = \"\"\n\nwhile dup[i] <= left :\n if left - dup[i] in dup:\n a = dup[i]\n b = left - dup[i]\n break\n else :\n i += 1\n\nif a == \"\" :\n print (\"I'm too stupid to solve this problem\")\nelse :\n print (tar,a,b)\n\n\n", "n=int(input())\r\nf=1\r\nif n==0:\r\n print(0,0,0)\r\nelif n==1:\r\n print(0,0,1)\r\nelif n==2:\r\n print(0,1,1)\r\nelse:\r\n arr=[0,1]\r\n i=2\r\n while arr[-1]!=n:\r\n x=arr[i-1]+arr[i-2]\r\n arr.append(x)\r\n i+=1\r\n if arr[-1]>n:\r\n f=0\r\n break\r\n if f:\r\n print(arr[-5],arr[-4],arr[-2])\r\n else:\r\n print(\"I'm too stupid to solve this problem\")", "val = int(input())\r\na, b, c, d, e = 0, 1, 1, 2, 3\r\nif val == 1:\r\n print(0,0,1)\r\nelif val == 0:\r\n print(0,0,0)\r\nelif val == 2:\r\n print(1,0,1)\r\nelse:\r\n while e != val:\r\n a, b, c, d = b, c, d, e\r\n e = d + c\r\n\r\n print(a, b, d)\r\n", "if __name__==\"__main__\":\r\n x=int(input())\r\n print(\"0 0 {}\".format(x))", "print(f'0 {input()} 0')", "n=int(input())\r\nif(n==0):\r\n print(0,0,0)\r\nelif(n==1):\r\n print(1,0,0)\r\nelif(n==2):\r\n print(1,1,0)\r\nelse:\r\n l=[0,1]\r\n last=1\r\n index=1\r\n while(last<n):\r\n last=l[index]+l[index-1]\r\n l.append(last)\r\n index+=1\r\n if(last==n):\r\n break\r\n print(l[index-1],l[index-3],l[index-4])\r\n", "#!/usr/bin/env python3\n\nfibs = [0, 1]\n\nwhile fibs[-1] < 10**9:\n fibs += [fibs[-1] + fibs[-2]]\n\ndef ans(N):\n if N == 0:\n return '0 0 0'\n if N == 1:\n return '1 0 0'\n \n i = fibs.index(N)\n return f\"{fibs[i-2]} {fibs[i-2]} {fibs[i-3]}\"\n\nN = int(input())\nprint(ans(N))\n", "# fib = [0]*1000\r\n# fib[0] = 0\r\n# fib[1] = 1\r\n\r\n# for i in range(2,50):\r\n# fib[i] = fib[i-1] + fib[i-2]\r\n\r\nn = int(input())\r\n\r\nprint('{} {} {}'.format(n,0,0))\r\n\r\n\r\n", "if __name__ == '__main__':\n n = int(input())\n\n print(\"0 0 \" + str(n))\n\n\t\t\t\t \t\t \t \t\t\t\t \t\t\t\t", "print(0, 0, input())", "n = int(input())\r\nprint(n,0,0)\r\n", "N=int(input())\r\nA=[]\r\na=0\r\nb=1\r\nans=0\r\nA.append(0)\r\nA.append(1)\r\nwhile(ans<N):\r\n ans=a+b\r\n A.append(ans)\r\n a,b=b,ans\r\nflag=0\r\nA.pop()\r\nL=len(A)\r\nres=[]\r\nfor i in range(L):\r\n if A[i]==N:\r\n res.append(A[i])\r\n res.append(A[i])\r\n res.append(A[i])\r\n flag=1\r\n break\r\n for j in range(L):\r\n if A[i]+A[j]==N:\r\n res.append(A[i])\r\n res.append(A[j])\r\n res.append(0)\r\n flag=1\r\n break\r\n for k in range(L):\r\n if A[i]+A[j]+A[k]==N:\r\n res.append(A[i])\r\n res.append(A[j])\r\n res.append(A[k])\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"Nah I am too stupid to solve this\")\r\nelse:\r\n print(res[0],res[1],res[2])\r\n", "n = int(input())\r\n\r\nprint(0, 0, n, sep = \" \")", "n = int(input())\r\nif n==0:\r\n print(\"0 0 0\")\r\nelif n==1:\r\n print(\"1 0 0\")\r\nelse:\r\n l = []\r\n\r\n l.append(0)\r\n l.append(1)\r\n a=0\r\n b=1\r\n while b<n:\r\n l.append(a+b)\r\n t=a\r\n a=b\r\n b=t+b\r\n if b==n:\r\n \r\n print(str(l[-3]) + \" \" +str(l[-3])+ \" \" +str(l[-4]))\r\n else:\r\n print(\"I'm too stupid to solve this problem\")\r\n", "n=int(input())\r\na=0\r\nb=1\r\nc=1\r\nd=2\r\ne=0\r\nwhile e<n:\r\n e=d+c\r\n a=b\r\n b=c\r\n c=d\r\n d=e\r\nif n==0:\r\n print(0,\"\",0,\"\",0)\r\nelif n==1:\r\n print(0,\"\",0,\"\",1)\r\nelif n==2:\r\n print(0,\"\",1,\"\",1)\r\nelif n==3:\r\n print(1,\"\",1,\"\",1)\r\nelse:\r\n print(b-a,\"\",a,\"\",c)\r\n\r\n", "number = int(input())\nprint(str(number) + \" 0 0\")\n#######################################################################################################################################\n\t\t\t\t\t\t \t \t\t \t\t \t\t\t\t \t\t", "n = int(input())\r\nif n == 0:\r\n print(0, 0, 0)\r\nelse:\r\n x, y = 0, 1\r\n while x + y != n:\r\n x, y = y, x + y\r\n print(0, x, y)\r\n", "x=int(input())\r\nprint (x,0,0)", "n = input()\r\nprint(0, 0, n)\r\n", "print(0,0,input())", "n = input()\r\nprint(0,0,n)", "__author__ = 'Esfandiar'\nn = int(input())\nans = [0,0,0]\nif n==0:\n print(*[0,0,0])\n exit()\na = 0\nb = 1\nc = 0\naa = 0\nwhile c != n:\n c = a+b\n aa = a\n a = b\n b = c\n \nprint(*[0,aa,a])\n\n\n\n", "print(int(input()),'0 0') ", "\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn = int(input()) \r\nprint(0, 0, n)\r\n\r\n# CodeForcesian\r\n# ♥\r\n# Library\r\n", "N=int(input())\r\nprint(0 ,0 ,N)", "phi = (1 + 5 ** 0.5) / 2\r\nn = int(input())\r\nif not n == 1:\r\n print(round(n / (phi ** 2)), round(n / (phi ** 2)), round(n / (phi ** 3)))\r\nelse:\r\n print(1, 0, 0)\r\n", "import functools\r\n\r\nn: int = int(input())\r\nprint(\"0 0 \" + str(n))\r\n", "\r\nn = int(input())\r\nl = [0,1]\r\nk = 0\r\nwhile k != n:\r\n\tk = l[len(l)-1] + l[len(l)-2]\r\n\tl.append(k)\r\nl.pop()\r\nfor i in l:\r\n\tfor j in l:\r\n\t\tfor k in l:\r\n\t\t\tif i + j + k == n:\r\n\t\t\t\tprint(i,j,k)\r\n\t\t\t\texit()", "n=int(input())\r\nif n==0:\r\n print(0,0,0)\r\nelse:\r\n A,B=0,1\r\n while( A+B !=n):\r\n A,B=B,A+B\r\n print(0,A,B) ", "# LUOGU_RID: 111045864\nn = int(input())\nif n == 0:\n print(\"0 0 0\")\nelif n == 1:\n print(\"0 0 1\")\nelif n == 2:\n print(\"0 1 1\")\nelif n == 3:\n print(\"1 1 1\")\nelse:\n all = [0, 1, 1, 2, 3]\n while all[-1] + all[-2] < 10 ** 9:\n all.append(all[-1] + all[-2])\n if all[-1] == n:\n print(f\"{all[-5]} {all[-4]} {all[-2]}\")", "# https://codeforces.com/problemset/problem/199/A\r\n\r\n\r\n# def fibonacci(n):\r\n# if n == 0:\r\n# return 0\r\n# elif n == 1:\r\n# return 1\r\n# else:\r\n# return fibonacci(n-1) + fibonacci(n-2)\r\n\r\n\r\nn = int(input())\r\n\r\n# fib_numbers = []\r\n# find_var = True\r\n\r\n# for num in range(n):\r\n# fib_numbers.append(fibonacci(num))\r\n\r\n\r\n# print(fib_numbers)\r\n\r\n# if n == 0:\r\n# print(0, 0, 0)\r\n# else:\r\n# print(0, 0, n)\r\n\r\nprint(0, 0, n)\r\n\r\n# for a in fib_numbers:\r\n# for b in fib_numbers:\r\n# for c in fib_numbers:\r\n# if find_var:\r\n# if a + b + c == n:\r\n# print(a, b, c)\r\n# find_var = False\r\n# break\r\n\r\n", "number = int(input())\n\n\nfibo = [0]\n\na, b = 0, 1\n\nwhile a != number:\n a, b = a + b, a\n fibo.append(a)\n\nif a > 2:\n print(fibo[-5], fibo[-4], fibo[-2])\nelse:\n for i in fibo:\n for j in fibo:\n for k in fibo:\n if i + j + k == number:\n print(i, j, k)\n exit()\n", "def hexadecimalTheorem():\r\n n=int(input())\r\n if n==0:\r\n print(0,0,0)\r\n if n==1:\r\n print(0,0,1)\r\n if n>1:\r\n f=0\r\n s=1\r\n while True:\r\n t=f+s\r\n if t==n:\r\n print(0,f,s)\r\n return\r\n f=s\r\n s=t\r\n\r\nhexadecimalTheorem()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s = [0,1]\ni = int(input())\nwhile(s[len(s)-1]<i):\n x = len(s)\n s.append(s[x-1]+s[x-2])\nidx = 0\nif(i<=2):\n print(0,0,i)\nelse:\n for v in s:\n if(v==i):\n break\n idx+=1\n print(s[idx-4],s[idx-3],s[idx-1])\n\n\t\t\t\t\t \t\t\t \t\t\t\t\t\t\t \t\t \t \t\t\t", "import sys\r\n\r\ndef fib_series(n:int):\r\n fib_list = [0,1]\r\n for _ in range(n):\r\n fib_list.append(fib_list[-1] + fib_list[-2])\r\n if fib_list[-1]==n:\r\n break\r\n return fib_list\r\n\r\n\r\nif __name__==\"__main__\":\r\n n = int(sys.stdin.readline())\r\n fib_list = fib_series(n)\r\n # sys.stdout.write(\" \".join(str(x) for x in fib_list))\r\n # print(\"\\n\")\r\n\r\n if n == 0:\r\n sys.stdout.write(f\"0 0 {n}\\n\")\r\n elif n == 1:\r\n sys.stdout.write(f\"0 0 {n}\\n\")\r\n elif n == 2:\r\n sys.stdout.write(f\"0 1 1\\n\")\r\n else:\r\n for f in fib_list:\r\n if f + fib_list[-2] + fib_list[-3] == n:\r\n sys.stdout.write(f\"{f} {fib_list[-2]} {fib_list[-3]}\")", "n = int(input())\r\nfibo = [0,1]\r\n\r\nwhile(fibo[-1]<n):\r\n fibo.append(fibo[-1]+fibo[-2])\r\nt = fibo.index(fibo[-1])\r\nif n>2:\r\n print(fibo[t-4],fibo[t-3],fibo[t-1])\r\nelif n==2:\r\n print(0,1,1)\r\nelif n==1:\r\n print(0,0,1)\r\nelse:\r\n print(0,0,0)\r\n", "n=int(input())\r\ndef fib(n):\r\n\ta=0\r\n\tb=1\r\n\tc=0\r\n\ti=0\r\n\twhile c<=n:\r\n\t\tc=a+b\r\n\t\ta=b\r\n\t\tb=c\r\n\t\ti+=1\r\n\treturn b-a\r\na=fib(n)\r\nc=fib(n-a)\r\nd=n-a-c\r\nif(n==0):\r\n\tprint(str(0)+\" \"+str(0)+\" \" + str(0))\r\nif(n==1):\r\n\tprint(str(0)+\" \"+str(0)+\" \"+str(1))\r\nif(n==2):\r\n\tprint(str(0)+\" \"+str(1)+\" \" +str(1))\r\nif(n>=3):\r\n\tprint(str(d)+\" \"+str(c)+\" \"+str(a))", "\nfib = [0]*50\nfib[0] = 0\nfib[1] = 1\n\nn = int(input())\n\nif(n == 0):\n print(\"0 0 0\")\nelif(n == 1):\n print(\"0 0 1\")\nelif(n == 2):\n print(\"0 1 1\")\nelse:\n for i in range(2, 50):\n fib[i] = fib[i-1] + fib[i-2]\n if(fib[i] == n):\n print('{} {} {}'.format(fib[i-4], fib[i-3], fib[i-1]))\n break\n \t\t\t \t \t\t \t \t \t\t\t \t\t\t \t", "# cf 199A\r\n\r\nx = int(input())\r\n\r\nprint(\"0 0 \",x)\r\n", "# LUOGU_RID: 113852383\nn = int(input())\nprint(n , 0 , 0)", "n=int(input())\r\nif n>=2:\r\n a,b,value=0,1,0\r\n while a+b<n:\r\n value=a\r\n a,b=b,a+b\r\n print(str(value),str(a),str(a))\r\nelse:\r\n if n==1 or n==0:\r\n print(\"0\",\"0\",str(n))", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nprint(0, 0, n)\n", "from sys import *\r\nfrom math import *\r\n#from collections import Counter \r\ninput = lambda:stdin.readline()\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\n\r\nn = int(input())\r\nprint('0' + ' ' + '0' + ' ' + str(n))\r\n", "import sys\r\nn = int(input())\r\nif n < 4:\r\n print(\"0 0 \" + str(n))\r\n sys.exit()\r\nmem = [1,1,2,3]\r\nwhile mem[-1] < n:\r\n mem = mem[1:]\r\n mem.append(mem[-1]+mem[-2])\r\nprint(mem[0],mem[1],mem[1])\r\n", "n=int(input())\r\nif n>2:\r\n fiboList=[0,1,1]\r\n fibo=1\r\n for i in range(1,n):\r\n fibo+=fiboList[i-2]+fiboList[i-1]\r\n fiboList.append(fibo)\r\n if fibo==n:\r\n break\r\n a=fiboList[-5]\r\n b=fiboList[-4]\r\n c=fiboList[-2]\r\nelif n<=2:\r\n a=n\r\n b=0\r\n c=0\r\nprint(a,b,c)", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\na = [0, 1]\nwhile a[-1] < 1e9:\n a += [sum(a[-2:])]\nn = a.index(get(int))\nprint(a[n-3], a[n-2], a[n-2]) if n > 2 else print(0, 0, n)\n", "\r\n\r\na = -1\r\nb = 1\r\n\r\narr = []\r\n\r\nhashVal = {}\r\nn = int(input())\r\n\r\nwhile True:\r\n c = a+b\r\n arr.append(c)\r\n a = b\r\n b = c\r\n '''\r\n print(\"########################\")\r\n print(c)\r\n print(n)\r\n print(\"########################\")\r\n '''\r\n if c==n:\r\n #print(\"{} and {} are equal\".format(c,n))\r\n break\r\n\r\n\r\n\r\n'''\r\nfor fibNum in arr:\r\n if fibNum in hashVal:\r\n''' \r\n\r\n\r\n#print(arr)\r\n\r\ni = len(arr) - 1\r\n\r\nif n>=3:\r\n print(\"{} {} {}\".format(arr[i-1],arr[i-3],arr[i-4]))\r\n\r\nelse:\r\n a = 0\r\n b = 0\r\n c = 0\r\n\r\n if n==1:\r\n a = 1\r\n\r\n elif n==2:\r\n a = 1\r\n b = 1\r\n\r\n print(\"{} {} {}\".format(a,b,c))\r\n\r\n \r\n \r\n", "def main():\r\n n = int(input())\r\n\r\n fibonacci_series = [0, 1]\r\n while fibonacci_series[-1] <= n:\r\n fibonacci_series.append(fibonacci_series[-1] + fibonacci_series[-2])\r\n\r\n for i in range(len(fibonacci_series)):\r\n for j in range(i + 1):\r\n if fibonacci_series[i] + fibonacci_series[j] == n:\r\n print(0, fibonacci_series[j], fibonacci_series[i])\r\n return\r\n print(\"I'm too stupid to solve this problem\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nprint(str(n)+' 0 0')", "n=int(input())\nif n==0:\n\tprint(0,0,0)\nelif n==1:\n\tprint(0,0,1)\nelif n==2:\n\tprint(0,1,1)\nelse:\n\tfibs=[0,1]\n\twhile(fibs[-1]!=n):\n\t\tfibs.append(fibs[-1]+fibs[-2])\n\tind=fibs.index(n)\n\tprint(fibs[ind-1],fibs[ind-3],fibs[ind-4])", "n = int(input())\r\n\r\nfib = [0,1]\r\n\r\nwhile fib[-1] + fib[-2] <= n:\r\n fib.append( fib[-1] + fib[-2] )\r\n\r\ndef solve():\r\n for i in fib:\r\n for j in fib:\r\n for k in fib:\r\n if i+j+k == n:\r\n return (i,j,k)\r\n if i+j+k > n:\r\n break\r\n if i+j+k > n:\r\n break\r\n if i+j+k > n:\r\n break\r\nprint(*solve())", "x = input()\r\nprint(x + \" 0\"+ \" 0\")", "def fib(n):\r\n\tif n == 0:\r\n\t\treturn 0\r\n\telif n ==1:\r\n\t\treturn 1\r\n\telse:\r\n\t\ti = 1\r\n\t\tfirst = 0\r\n\t\tsecond = 1\r\n\t\twhile i!=n:\r\n\t\t\tthird = first + second\r\n\t\t\tfirst = second\r\n\t\t\tsecond = third\r\n\t\t\ti+=1\r\n\t\treturn second\r\n\r\nn = int(input())\r\n\r\narr = []\r\nfor i in range(46):\r\n\tarr.append(fib(i))\r\nind = arr.index(n)\r\nif n<=1:\r\n\tprint(n,0,0)\r\nelse:\r\n\tprint(arr[ind-1],arr[ind-2],0)\r\n# print(arr)\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[204]:\n\n\n# # n = int(input())\n# # line = list(map(int, input().split()))\n# # line = list(str(input()))\n\n\n# In[112]:\n\n\n# 514229\nn = int(input())\n\n\n# In[128]:\n\n\nmemo = {}\ndef fibonacci(n):\n if n < 2:\n memo[n] = n\n return n\n if n in memo:\n return memo[n]\n \n memo[n] = fibonacci(n-1) + fibonacci(n-2)\n return fibonacci(n-1) + fibonacci(n-2)\n\n\n# In[129]:\n\n\nvalid = True\n\nif n == 2:\n res = [0, 1, 1]\nelif n == 1:\n res = [0, 0, 1]\nelif n == 0:\n res = [0, 0, 0]\nelse:\n i = 4\n found = False\n \n while not found:\n p_ans = fibonacci(i - 4) + fibonacci(i - 3) + fibonacci(i - 1)\n if p_ans == n:\n res = [fibonacci(i - 4), fibonacci(i - 3), fibonacci(i - 1)]\n found = True\n else:\n i += 1\n \n\n\n# In[130]:\n\n\nif valid:\n print(\" \".join(list(map(str, res))))\nelse:\n print(\"I'm too stupid to solve this problem\")\n\n\n# In[ ]:\n\n\n\n\n", "n = int(input())\r\na = 0\r\nb = 1\r\nfibonacci = [a, b]\r\nwhile b <= 10**9:\r\n fibonacci.append(a+b)\r\n a = fibonacci[-2]\r\n b = fibonacci[-1]\r\nif n >= 3:\r\n k = fibonacci.index(n)\r\n print(fibonacci[k-4], fibonacci[k-3], fibonacci[k-1])\r\nelif n == 2:\r\n print(0, 1, 1)\r\nelif n == 1:\r\n print(0, 0, 1)\r\nelse:\r\n print(0, 0, 0)", "n=int(input())\r\nentry=[0,1]\r\nif n==0:\r\n print(str(0) + \" \" + str(0) + \" \" + str(0) )\r\nelif n==1 :\r\n print(str(0) + \" \" + str(0) + \" \" + str(1))\r\nelif n==2 :\r\n print(str(0) + \" \" + str(1) + \" \" + str(1))\r\nelif n==3 :\r\n print(str(1) + \" \" + str(1) + \" \" + str(1))\r\n\r\nelse:\r\n a=0\r\n b=1\r\n c=1\r\n while c<=n:\r\n entry.append(c)\r\n a=b\r\n b=c\r\n c=a+b\r\n print(str(entry[-2])+\" \"+str(entry[-4])+\" \"+ str(entry[-5]))\r\n\r\n", "number = int(input()) \r\nprint(0,0,number) ", "# with open(\"input.txt\",'r') as f:\r\n# \tt = int(f.readline().rstrip())\r\n# \t# n = int(f.readline().rstrip())\r\n\t# n ,a,b = int(f.readline().rstrip().split())\r\n# \t# arr = list(map(int,f.readline().rstrip().split()))\r\n\r\n\r\ndef main(N):\r\n\tprint(0,0,N)\r\n\r\n\r\ndef text():\r\n\twith open(\"input.txt\",\"r\") as f:\r\n\t\tt = int(f.readline().rstrip())\r\n\t\twhile t:\r\n\t\t\tN = int(f.readline().rstrip())\r\n\t\t\tarr = list(map(int,f.readline().rstrip().split()))\r\n\t\t\tmain(N,arr)\r\n\t\t\tt-=1\r\n\r\ndef normal():\r\n\tN = int(input())\r\n\t# arr = list(map(int,input().split()))\r\n\tmain(N)\r\n\r\n\r\n\r\n\r\n# text()\r\nnormal()\r\n\r\n", "from math import *\r\ndef previousFibonacci(n):\r\n\ta = n/((1 + sqrt(5))/2.0)\r\n\treturn round(a)\r\n\r\nn = int(input())\r\nif n==0:\r\n print(0,0,0)\r\nif n==1:\r\n print(1,0,0)\r\nif n>1:\r\n x = previousFibonacci(n)\r\n p = previousFibonacci(x)\r\n print(p,x,0)\r\n\r\n", "n=int(input())\r\nf=-1\r\ns=1\r\nt=0\r\na=[]\r\nwhile(t<n):\r\n t=f+s\r\n a.append(t)\r\n f=s\r\n s=t\r\nif(len(a)>=5):\r\n print(a[-2],a[-4],a[-5])\r\nelif(n==2):\r\n print(\"0 1 1\")\r\nelif(n==1):\r\n print(\"0 0 1\")\r\nelif(n==0):\r\n print(\"0 0 0\")\r\n\r\n", "n = int(input())\r\nif n == 0:\r\n print(0,0,0)\r\nelif n == 1:\r\n print(0,0,1)\r\nelif n == 2:\r\n print(0,1,1)\r\nelse:\r\n f = [0,1]\r\n a = -1\r\n i = 1\r\n while a != n:\r\n a = f[i] + f[i-1]\r\n f.append(a)\r\n i = i+1\r\n print(f[-5],f[-4],f[-2])\r\n", "a=int(input())\r\nprint(a,0,0)", "from collections import Counter\nn = int(input())\narr = []\narr.append(0)\narr.append(1)\nres = []\ni = 2\n\nwhile arr[i-1] < n:\n arr.append(arr[i-1]+arr[i-2])\n \n i += 1\n \narr = list(set(arr))\nmapp = Counter(arr)\n\n\nif n in mapp:\n res.append(n)\n res.append(0)\n res.append(0)\nif n not in mapp: \n for i in arr: \n if (n - i) in mapp:\n res.append(i)\n res.append(n-i)\n res.append(0)\n break\n\nif res:\n print(*res)\nelse:\n print(\"I'm too stupid to solve this problem\")\n \n", "givennum = int(input())\r\nfib_list = [0,1,1,2]\r\nfor i in range(3,48):\r\n new_var = fib_list[i] + fib_list[i-1]\r\n fib_list.append(new_var)\r\nif givennum == 2:\r\n print(1, \" \", 1, \" \", 0)\r\nelif givennum == 1:\r\n print(1, \" \", 0, \" \", 0)\r\nelif givennum == 0:\r\n print(0, \" \", 0, \" \", 0)\r\nelif not givennum in fib_list:\r\n print(\"I'm too stupid to solve this problem\")\r\nelse:\r\n index = fib_list.index(givennum)\r\n var1 = fib_list[index-1]\r\n var2 = fib_list[index-3]\r\n var3 = fib_list[index-4]\r\n print(int(var1), \" \", int(var2), \" \", int(var3))\r\n\r\n", "\ndef f(n):\n if n == 0:\n return [0, 0, 0]\n if n == 1:\n return [0, 0, 1]\n if n == 2:\n return [0, 1, 1]\n if n == 3:\n return [0, 1, 2]\n r = [0, 1, 1, 2, 3]\n while r[-1] != n:\n r.append(r[-1] + r[-2])\n r.pop(0)\n return [r[-2], r[-4], r[-5]]\n\nprint(*f(int(input())))", "n=int(input())\r\nb=[0,0,n]\r\nprint(*b)", "print(str(0) + ' ' + str(0) + ' ' + str(int(input())))", "k = int(input())\r\nx = 0\r\ny = 1\r\nif k == 0:\r\n print(0,0,0)\r\nelse:\r\n while x + y != k:\r\n x,y = y,x+y\r\n print(0,x,y)", "n =input()\r\nprint('0 ' + '0 ' + n)", "n = int(input())\r\nif n==0:\r\n print(0,0,0)\r\nelse:\r\n a=0 \r\n b=0\r\n c=1\r\n dop=0\r\n for i in range(n):\r\n if a+b+c==n:\r\n print(a, b, c)\r\n break\r\n #a=b\r\n dop=c\r\n c+=b\r\n b=dop\r\n #a=b\r\n ", "from math import ceil\r\narr=[]\r\narr.append(0)\r\narr.append(1)\r\nfor i in range(43):\r\n arr.append(arr[-1]+arr[-2])\r\nn=int(input())\r\nif(n==0):\r\n print(\"0 0 0\")\r\nelif(n==1):\r\n print(\"0 0 1\")\r\nelif(n==2):\r\n print(\"0 1 1\")\r\nelse:\r\n idx=arr.index(n)\r\n print(arr[idx-4],arr[idx-3],arr[idx-1])\r\n", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\nn=int(input())\r\nprint('0 0',n)\r\n", "x = int(input())\r\n\r\n\r\nprint(x , 0 ,0)", "n=int(input())\r\nif n==0:\r\n print(0 ,0 ,0 )\r\nelse:\r\n a,b=0,1\r\n while(a+b!=n):\r\n a,b=b,a+b\r\n print(0 ,a ,b )", "n = int(input())\r\nif n == 0:\r\n print(0,0,0)\r\nelif n == 1 :\r\n print(0,0,1)\r\nelif n == 2:\r\n print(0,1,1)\r\nelse:\r\n l = [0,1,1]\r\n k = 2\r\n while n > k:\r\n l.append(k)\r\n k = l[-1]+l[-2]\r\n print(l[-2],l[-2],l[-3])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n#l = list(map(int,input().split()))\r\n", "n=int(input())\r\nprint(\"0 \"+\"0 \"+str(n))", "from itertools import combinations_with_replacement\r\nn=int(input())\r\nl=[0,1]\r\nc=0\r\nfor i in range(n):\r\n l.append(l[i]+l[i+1])\r\n if l[i+2]>=n:\r\n break\r\nl.pop(len(l)-1)\r\nlf = list(combinations_with_replacement(l, 3))\r\nfor i in range(len(lf)):\r\n if sum(lf[i])==n:\r\n c+=1\r\n s=' '.join(map(str,(lf[i])))\r\n print(s)\r\n break\r\nif c==0:\r\n print(\" I'm too stupid to solve this problem \")\r\n \r\n\r\n", "n = input()\r\nprint(n,0,0)", "n=int(input())\nprint(0,\"\",0,\"\",n)", "q = int(input())\r\nif q == 0:\r\n print(0,0,0)\r\nelse:\r\n m,n = 0,1\r\n while m+n != q:\r\n m,n = n,m+n\r\n print(0,m,n) \r\n \r\n ", "n = input().strip()\r\nprint(n, 0, 0)\r\n", "import sys,math,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nprint(0,0,input()) \n", "l=[0,1,1]\r\nn=int(input())\r\na=1\r\nb=1\r\nc=0\r\nwhile c<=n:\r\n c=a+b\r\n a=b\r\n b=c\r\n l.append(c)\r\n\r\nif n==3:\r\n print(1,1,1)\r\nelif n==2:\r\n print(0,1,1)\r\nelif n==1:\r\n print(0,0,1)\r\nelif n==0:\r\n print(0,0,0)\r\nelse:\r\n print(l[len(l)-6],l[len(l)-5],l[len(l)-3])", "n=int(input())\r\nprint('0','0',n)", "import math\r\ndef previousFibonacci(n):\r\n a = n/((1 + math.sqrt(5))/2.0)\r\n return round(a)\r\nn = int(input())\r\nk = previousFibonacci(n)\r\np = previousFibonacci(k)\r\nprint(n-k,p,k-p)", "x = input()\r\nprint(x,0,0)", "from sys import stdin, setrecursionlimit, stdout\r\n#setrecursionlimit(1000000) #use \"python\" instead of \"pypy\" to avoid MLE\r\nfrom collections import deque\r\nfrom math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin\r\nfrom heapq import heapify, heappop, heappush, heapreplace, heappushpop\r\ndef ii(): return int(stdin.readline())\r\ndef fi(): return float(stdin.readline())\r\ndef mi(): return map(int, stdin.readline().split())\r\ndef fmi(): return map(float, stdin.readline().split())\r\ndef li(): return list(mi())\r\ndef si(): return stdin.readline().rstrip()\r\ndef lsi(): return list(si())\r\n#mod=1000000007\r\n#res=['YES', 'NO']\r\n\r\nfib=[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733, 1134903170]\r\n\r\n\r\n\r\ntest_case=1\r\nwhile test_case:\r\n test_case-=1\r\n\r\n\r\n\r\n n=ii()\r\n if not n:\r\n ans=[0, 0, 0]\r\n elif n==1:\r\n ans=[0, 0, 1]\r\n else:\r\n x=fib.index(n)\r\n ans=[0, fib[x-2], fib[x-1]]\r\n print(*ans)", "n=int(input())\r\nif n==0:\r\n print(0,0,0)\r\nelif n==1:\r\n print(0,0,1)\r\nelse: \r\n a=0\r\n b=1\r\n while b<n:\r\n c=a+b\r\n a=b\r\n b=c \r\n if b!=n:\r\n print( \"I'm too stupid to solve this problem\") \r\n else:\r\n\r\n d=b-a\r\n e=a-d\r\n f=d-e\r\n print(f,e,a) \r\n ", "n=int(input())\r\nif(n):\r\n a, b, c = 0, 1, 1\r\n while(c!=n):\r\n a=b\r\n b=c\r\n c=a+b\r\n print('0 '+str(a)+' '+str(b))\r\nelse:\r\n print('0 0 0')", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n A = [0, 1]\r\n while A[-1] < 10 ** 9:\r\n A.append(A[-2] + A[-1])\r\n n = int(input())\r\n p = -1\r\n for i in range(len(A)):\r\n if A[i] == n:\r\n p = i\r\n break\r\n if p == 0:\r\n ans = [0, 0, 0]\r\n elif p == 1:\r\n ans = [0, 0, 1]\r\n elif p == 2:\r\n ans = [0, 0, 1]\r\n else:\r\n ans = [A[p-3], A[p-2], A[p-2]]\r\n print(' '.join(list(str(a) for a in ans)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\n\nif n == 0:\n\tprint(0,0,0)\nelse:\n\ta, b = 0, 1\n\twhile a+b != n:\n\t\ta, b = b, a+b\n\tprint(0, a, b)", "n=int(input())\n\nprint(n,'0 0') ", "def fb(num_fb, n):\n x=0\n while(x < n):\n x = num_fb[2] + num_fb[3]\n num_fb.pop(0)\n num_fb.append(x)\n\nn = int(input())\n\nif n <= 3:\n print(f\"0 0 {n}\")\nelse:\n num_fb = [1, 1, 2, 3]\n j=-1\n fb(num_fb, n)\n if num_fb[3] == n:\n print(f\"{num_fb[0]} {num_fb[1]} {num_fb[1]}\")\n else:\n print(\"I'm too stupid to solve this problem\")\n\n\t \t \t \t \t\t \t \t\t\t \t\t \t", "n = int(input())\r\nif n == 0:\r\n print(0,0,0)\r\nelif n == 1:\r\n print(0,0,1)\r\nelse:\r\n lis = [0,1]\r\n i = 0\r\n while True:\r\n s = lis[i]+lis[i+1]\r\n lis.append(s)\r\n if s == n:\r\n break\r\n i += 1\r\n a = len(lis)-1\r\n print(0,lis[a-2],lis[a-1])\r\n", "def findIndex(n):\r\n if (n <= 1):\r\n return n\r\n a = 0\r\n b = 1\r\n c = 1\r\n res = 1\r\n while (c < n):\r\n c = a + b\r\n res = res + 1\r\n d=a\r\n a = b\r\n b = c\r\n return d,a\r\nn=int(input())\r\nif n==0:\r\n print(0,0,0)\r\nelif n==1:\r\n print(0,0,1)\r\nelse:\r\n a,b=findIndex(n)\r\n print(0,a,b)\r\n", "from collections import Counter\r\narr = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811]\r\n\r\nfor i in range(20):\r\n arr.append(arr[-1]+arr[-2])\r\n\r\nn = int(input())\r\nx = n\r\nlis = []\r\nc = Counter(arr)\r\n\r\nfor i in range(3):\r\n while True:\r\n if x in c:\r\n lis.append(x)\r\n x = n-x if (n-x)>0 else 0\r\n n = x\r\n break\r\n \r\n x-=1\r\n \r\nprint(' '.join(map(str,lis)))\r\n", "x=int(input())\r\nprint(0,0,x)", "n=int(input())\r\nprint(n,0,0)", "k = int(input())\r\nx = 0\r\ny = 1\r\nz = x+y\r\nif k == 0:\r\n print(0,0,0)\r\nelse:\r\n while z != k:\r\n x = y\r\n y = z\r\n z = x+y\r\n print(0,x,y)", "n = int(input())\r\n\r\nprint(0, 0, n)\r\n", "print(input(),'0','0')", "n = int(input())\r\na, b, c = 0, 1, 1\r\nif n < 4:\r\n print(n, 0, 0)\r\nelse:\r\n while(c+b != n):\r\n a, b, c = b, c, b+c\r\n print(b, b, a)\r\n", "n = int(input())\r\nif n < 3:\r\n print(\"0 \"*(3-n) + \"1 \"*(n))\r\nelse:\r\n f = 0\r\n f1 = 1\r\n f2 = 1\r\n f3 = 2\r\n f4 = 3\r\n while f4 != n:\r\n f4 += f3\r\n f3 += f2\r\n f2 += f1\r\n f,f1 = f1,f1 + f\r\n print(f,f1,f3)\r\n", "def solution(n):\r\n dp=[0]*46\r\n dp[0] = 0\r\n dp[1] = 1\r\n for i in range(2,46):\r\n dp[i] = dp[i-2] + dp[i-1]\r\n #print(dp)\r\n if n == 0:\r\n return print(0,\" \",0,\" \",0)\r\n if n == 1:\r\n return print(0,\" \",0,\" \",1)\r\n if n == 2:\r\n return print(0,\" \",1,\" \",1)\r\n\r\n for i in range(46):\r\n if n == dp[i]:\r\n print(dp[i-4],\" \",dp[i-3],\" \",dp[i-1])\r\n break\r\n\r\n return 0\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n solution(n)\r\nmain()", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn = iinput()\r\n\r\nif(n==0):\r\n print(0,0,0)\r\nelif(n==1):\r\n print(0,0,1)\r\nelif n==2:\r\n print(0, 1, 1)\r\nelif n==3:\r\n print(0, 1, 2) \r\nelse:\r\n f = 0\r\n s = 1\r\n\r\n while(f+s != n):\r\n f, s = s, f+s\r\n \r\n print(0, f, s) ", "fib = [0, 1]\r\nwhile fib[-1] < 10**9:\r\n fib.append(fib[-1]+fib[-2])\r\n\r\nn = int(input())\r\nans = -1\r\nfor a in range(len(fib)):\r\n for b in range(len(fib)):\r\n for c in range(len(fib)):\r\n if fib[a] + fib[b] + fib[c] == n:\r\n ans = (fib[a], fib[b], fib[c])\r\n break\r\n \r\nif ans == -1:\r\n print(\"I'm too stupid to solve this problem\")\r\nelse:\r\n print(*ans)", "n=int(input())\r\na=0;b=1;c=0;d=0\r\nliste=[]\r\nwhile True:\r\n if(c>n):\r\n break\r\n c=a+b\r\n a=b\r\n b=c\r\n liste.append([a,b,c])\r\nflag=1\r\nfor q in range(len(liste)):\r\n if(sum(liste[q])==n):\r\n flag=0\r\n for w in range(3):\r\n print(liste[q][w],end=\" \")\r\nif(n==0):\r\n print(\"0 0 0\")\r\nelif(n==1):\r\n print(\"0 0 1\")\r\nelif(n==2):\r\n print(\"0 1 1\")\r\nelif(flag==1):\r\n print(\"I'm too stupid to solve this problem\")", "print(0 , 0 , input())", "n = int(input())\r\narr = [0,1]\r\n\r\nwhile arr[-1]<n:\r\n arr.append(arr[-1]+arr[-2])\r\nif n==0:\r\n print(0,0,0)\r\nelif n==1:\r\n print(0,0,1)\r\nelif n==2:\r\n print(0,1,1)\r\nelse:\r\n print(arr[-2], arr[-4], arr[-5])\r\n", "def fibonacci(n):\r\n if n == 0: return '0 0 0'\r\n if n == 1: return '0 0 1'\r\n if n == 2: return '0 1 1'\r\n tab = [1, 1]\r\n while tab[-1] != n:\r\n tab.append(tab[-1] + tab[-2])\r\n\r\n res = [str(tab[-3]), str(tab[-3]), str(tab[-4])]\r\n ans = ' '.join(res)\r\n\r\n return ans\r\n\r\n\r\nn = int(input())\r\n\r\nprint(fibonacci(n))", "n=int(input())\r\nl=[0,1]\r\ni=0\r\nk=1\r\nj=0\r\nif n>3:\r\n while(j<=n):\r\n j=i+k\r\n l.append(k)\r\n i=k\r\n k=j\r\n#print(l) \r\n c=len(l)\r\n print(l[c-2],l[c-5],l[c-4])\r\nelif n==0:\r\n print(0,0,0)\r\nelif n==1:\r\n print(0,0,1)\r\nelif n==2:\r\n print(1,1,0)\r\nelif n==3:\r\n print(1,1,1)", "R = lambda:map(int,input().split())\r\n\r\n\r\nprint(input(), 0, 0)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\nprint(0, 0, n)", "n = int(input())\r\na = 0\r\nb = 1\r\nprint(0, 0, n)\r\n", "n=int(input())\nif n==0:\n\tprint(0,0,0)\nelif n==1:\n\tprint(0,0,1)\nelse:\n\tl=[]\n\ta,b=0,1\n\twhile b<n:\n\t\ta,b=b,a+b\n\t\tl.append(a)\n\tprint(0,l[-2],l[-1])\n\n\t\n\n\n\n\n\n\n\t\n\n\n\n\n\t\n\n\n\n\n\n", "def find_previous_fibonacci_numbers(n):\n if n == 0:\n print(0,0,0)\n return 0\n a = 0\n b = 1\n while b < n:\n temp = b\n b = a + b\n a = temp\n if b == n:\n print(0,b-a,a)\n return 0\n else:\n print(\"himself stupid <3\")\n return 1\n\nx = int(input())\nfind_previous_fibonacci_numbers(x)", "n = int(input())\r\nprint(\"0 \",\"0 \",n)", "n = int(input())\n\nif n == 0:\n print(0, 0, 0)\n\nelif n == 1:\n print(1, 0, 0)\n\nelif n == 2:\n print(1, 1, 0)\n\nelse:\n f1 = 0\n f2 = 1\n f3 = 1\n f4 = 2\n\n while n != (f1 + f2 + f4):\n f1 = f2\n f2 = f3\n f3 = f4\n f4 = f3 + f2\n print(f1, f2, f4)\n \t \t \t\t\t\t\t\t \t\t \t \t \t\t", "n=int(input())\r\nl = [0,0,n]\r\nprint(*l)", "n = int(input())\r\n\r\nprint(f'0 0 {n}')", "n = int(input())\r\nprint('0','0',n)", "def solve(l,p,q):\n t = l / (p+q)\n return round(t*p,4)\n \n \n \n\ndef main() :\n n = int(input())\n print(0,0,n)\nmain()\n", "n = int(input())\r\nprint(str(0) + ' ' + str(0) + ' ' + str(n))", "n = int(input())\r\nl = [0, 0, n]\r\nfor i in range(3):\r\n print(l[i], end=\" \")", "n=int(input())\r\nif n!=2:\r\n a=n/((1 + (5**0.5))/2.0)\r\n b=a/((1 + (5**0.5))/2.0)\r\n c=b/((1 + (5**0.5))/2.0)\r\n d=c/((1 + (5**0.5))/2.0)\r\nelse:\r\n d=1\r\n c=1\r\n a=0\r\nprint(round(d),round(c),round(a))\r\n\r\n", "if __name__ == \"__main__\":\n n = input()\n print(f\"0 0 {n}\")\n \t \t\t \t\t\t\t\t\t \t\t\t \t\t", "print(\"0 0\",input())", "n=int(input())\nx=[0,1]\ny={0,1}\nsize=2\nwhile x[-1]<n-3:\n\tx.append(x[-1]+x[-2])\n\ty.add(x[-1])\n\tsize+=1\nfor i in range(size):\n\tfor j in range(i,size):\n\t\tif n-x[i]-x[j] in y:\n\t\t\tprint(x[i],x[j],n-x[i]-x[j])\n\t\t\texit()\n\t\t\t \t\t \t\t \t\t\t\t \t \t \t \t\t", "n=int(input())\r\na=[0,1]\r\nwhile n>=a[-1]:\r\n a.append(a[-1]+a[-2])\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n for k in range(len(a)):\r\n if(a[i]+a[j]+a[k]==n):\r\n print(a[i],a[j],a[k])\r\n exit()\r\nprint(\"I'm too stupid to solve this problem\")\r\n \r\n", "def main():\r\n s = input()\r\n \r\n print(f'0 0 {s}')\r\n \r\nif __name__ == '__main__':\r\n main()", "fibbo = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733]\r\nn = int(input())\r\nstatus = 0\r\nif n in fibbo:\r\n print(0,0,n)\r\nelif n/3 in fibbo:\r\n print(n//3,n//3,n//3)\r\nelse:\r\n for i in range(n,0,-1):\r\n if i in fibbo:\r\n print(i,end=\" \")\r\n break\r\n #print(n-i)\r\n for j in range(n-i,0,-1):\r\n if j in fibbo:\r\n print(j,end=\" \")\r\n break\r\n #print(n-i-j)\r\n for k in range(n-i-j,0,-1):\r\n if k in fibbo:\r\n print(k)\r\n break\r\n \r\n\r\n\r\n", "n=int(input())\r\nprint(\"0 0 {}\".format(n))", "n=int(input())\r\nprint(0, end=\" \")\r\nprint(0, end=\" \")\r\nprint(n)", "n=int(input())\r\nlist1=[0,1]\r\nfor i in range(1,n):\r\n if list1[-1]+list1[-2]==n:\r\n break\r\n list1.append(list1[-1]+list1[-2])\r\nseen=set()\r\nfor i in list1:\r\n seen.add(i)\r\n\r\ni=0\r\nj=len(list1)-1\r\nresult=[]\r\nfor i in range(len(list1)):\r\n k=n-(2*list1[i])\r\n if k in seen:\r\n flag=1\r\n result.append(list1[i])\r\n result.append(list1[i])\r\n result.append(k)\r\n print(*result)\r\n break\r\ni=0\r\nj=len(list1)-1\r\nwhile i<=j:\r\n sum1=list1[i]+list1[j]\r\n if sum1>n:\r\n j-=1\r\n else:\r\n for k in range(i+1,j-1):\r\n sum1+=list1[k]\r\n if sum1==n:\r\n break\r\n result.append(list1[i])\r\n result.append(list1[j])\r\n result.append(list1[k])\r\n\r\n i+=1\r\nif flag==0:\r\n print(*result)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#https://codeforces.com/problemset/problem/199/A\nn=int(input())\nprint(0,0,n)\n", "n=int(input())\r\nprint(n,n-n,n-n)", "input_fib_nummber = int(input())\nfib = [0, 1, 1, 2]\nif input_fib_nummber == 0:\n print(0,0,0)\nelif input_fib_nummber == 1:\n print(0,0,1)\nelse:\n while True:\n if fib[3] == input_fib_nummber:\n print(fib[0],fib[1], fib[1])\n break\n fib = [fib[1],fib[2],fib[3],fib[2]+fib[3]]\n\n", "def main():\n # fibonacci = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711,\n # 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887,\n # 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141, 267914296, 433494437, 701408733]\n # n = int(input())\n #\n # if n == 0:\n # print(0, 0, 0)\n # elif n == 1:\n # print(0, 0, 1)\n # elif n == 2:\n # print(0, 0, 2)\n # index = fibonacci.index(n)\n n = input()\n print(0, 0, n)\n\n\nif __name__ == '__main__':\n main()\n", "def resposta(n):\n if(n == 0):\n print(0, 0, 0)\n elif(n == 1):\n print(0, 0, 1)\n else:\n numeros = achaNumeros(n)\n print(0, numeros[0], numeros[1])\n\ndef achaNumeros(n):\n x = 1\n y = 1\n z = 1\n while z != n:\n x = y\n y = z\n z = x + y\n return([x,y])\n\nentrada = int(input())\n\nresposta(entrada)\n\t \t \t \t\t\t\t\t \t\t\t \t \t \t \t", "##############################################\nn = int(input())\nprint(0, 0, n)\n\t \t\t\t\t\t \t \t \t\t \t \t \t", "def solve(n):\r\n a, b, a1 = 0, 1, 0\r\n if n == 1:\r\n return \"0 0 1\"\r\n if n == 0:\r\n return \"0 0 0\"\r\n if n == 2:\r\n return \"0 1 1\"\r\n total = 0\r\n while True:\r\n total = a + b\r\n if total == n:\r\n break\r\n a1 = a\r\n a = b\r\n b = total\r\n return f\"{a1} {a} {a}\"\r\n\r\ndef main():\r\n n = int(input())\r\n print(solve(n))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\ndef main():\n print ('0 0', input())\n\nmain()\n", "def findIndex(n):\r\n if (n <= 1):\r\n return n\r\n a = 0\r\n b = 1\r\n c = 1\r\n res = 1\r\n while (c < n):\r\n c = a + b\r\n res = res + 1\r\n a = b\r\n b = c\r\n return res\r\ndef fibo(n):\r\n if n < 0:\r\n raise ValueError(\"Negative arguments not implemented\")\r\n return fcci(n)[0]\r\ndef fcci(n):\r\n if n == 0:\r\n return (0, 1)\r\n else:\r\n a, b = fcci(n // 2)\r\n c = a * (b * 2 - a)\r\n d = a * a + b * b\r\n if n % 2 == 0:\r\n return (c, d)\r\n else:\r\n return (d, c + d)\r\nfb = int(input())\r\nif findIndex(fb)<4:\r\n if findIndex(fb)==3:\r\n print(0,1,1)\r\n elif findIndex(fb)==2 or findIndex(fb)==1:\r\n print(0,0,1)\r\n else:\r\n print(0,0,0)\r\nelse:\r\n print(fibo(findIndex(fb)-4),fibo(findIndex(fb)-3),fibo(findIndex(fb)-1))\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nif n == 0:\r\n print(\"0 0 0\")\r\nelif n == 1:\r\n print(\"0 0 1\")\r\nelif n == 2:\r\n print(\"0 1 1\")\r\nelif n == 3:\r\n print(\"1 1 1\")\r\nelse:\r\n fib = []\r\n a, b, c = 0, 1, 0\r\n for i in range(47):\r\n c = a + b\r\n fib.append(b)\r\n a = b\r\n b = c\r\n\r\n for j in range(47):\r\n if fib[j] == n:\r\n print(fib[j - 4], fib[j - 3], fib[j - 1])", "arr=[0,1]\r\nn=int(input())\r\nans=()\r\nif(n==0):\r\n ans=(0,0,0)\r\nelif(n==1):\r\n ans=(0,0,1)\r\nelse:\r\n while(True):\r\n l=len(arr)\r\n ne=arr[l-1]+arr[l-2]\r\n if(ne==n):\r\n ans=(0,arr[l-2],arr[l-1])\r\n break\r\n else:\r\n arr.append(ne)\r\nprint(ans[0],ans[1],ans[2])\r\n", "n = int(input())\r\nif n > 2:\r\n fib = [0, 1]\r\n while fib[-1] < n:\r\n fib.append(fib[-1] + fib[-2])\r\n print(fib[-2], fib[-4], fib[-5])\r\nelif n == 2:\r\n print(1, 1, 0)\r\nelif n == 1:\r\n print(1, 0, 0)\r\nelse:\r\n print(0, 0, 0)\r\n", "n=int(input())\r\ndef Fib(n):\r\n if n==3:\r\n return '1 1 1'\r\n if n==0:\r\n return '0 0 0'\r\n if n==1:\r\n return '0 0 1'\r\n if n==2:\r\n return '0 1 1'\r\n else:\r\n d={}\r\n d[1]=0\r\n d[2]=1\r\n i=3\r\n while d[i-1]!=n:\r\n if i not in d:\r\n d[i]=d[i-1]+d[i-2]\r\n i=i+1\r\n \r\n return ' '.join(list(map(str, [d[i-5],d[i-4],d[i-2]])))\r\n \r\nprint(Fib(n))", "n = int(input())\r\n\r\nif n == 0:\r\n print(0, 0, 0)\r\nelif n == 1:\r\n print(0, 0, 1)\r\nelse:\r\n a, b = 1, 1\r\n k = 0\r\n while a+b < n:\r\n a, b = b, a+b\r\n\r\n c = b - a\r\n d = a - c\r\n print(d, c, b)", "def Sol(n):\r\n if n==0: print(0,0,0) ; return None\r\n F0,F1 = 0,1\r\n while F0+F1!=n:\r\n res=F1\r\n F1=F1+F0\r\n F0=res\r\n print(F0,F0,F1-F0)\r\n return None\r\n\r\nSol(int(input()))", "import math\r\n\r\ndef checkPerfectSquare(n):\r\n sqrt = int(math.sqrt(n))\r\n if pow(sqrt, 2) == n:\r\n return True\r\n else:\r\n return False\r\n\r\ndef isFibonacciNumber(n):\r\n res1 = 5 * n * n + 4\r\n res2 = 5 * n * n - 4\r\n if checkPerfectSquare(res1) or checkPerfectSquare(res2):\r\n return True\r\n else:\r\n return False\r\n\r\nnum = int(input())\r\n\r\nif isFibonacciNumber(num):\r\n M=[0,0,num]\r\n print (*M)\r\nelse:\r\n n1, n2 = 0, 1\r\n count = 0\r\n L=[]\r\n if nterms == 0:\r\n L.append(n1)\r\n else:\r\n while count < nterms+1:\r\n L.append(n1)\r\n nth = n1 + n2\r\n n1 = n2\r\n n2 = nth\r\n count += 1\r\n print(L)\r\n def func(L):\r\n \tfor i in L:\r\n \t\tfor j in L:\r\n \t\t\tfor k in L:\r\n \t\t\t\tif i+j+k==nterms:\r\n \t\t\t\t\treturn[i,j,k]\r\n n=func(L)\r\n if n:\r\n print(*n)\r\n else:\r\n print(\"I'm too stupid to solve this problem\")\r\n", "n = int(input())\r\nfib = [0]*50\r\nfib[1]=1\r\nfor i in range(2,len(fib)):\r\n fib[i]=fib[i-1]+fib[i-2]\r\na = fib.index(n)\r\nif n <= 1:\r\n print(0,0,n)\r\nelse:\r\n print(0, fib[a-1],fib[a-2])", "import sys,os,io,time,copy\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nimport math\r\n\r\ndef main():\r\n # start=time.time()\r\n n=int(input())\r\n print(0,0,n)\r\n\r\n # end=time.time()\r\nmain()", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nrelativne = [0, 1]\n\nwhile relativne[-1] < 10 ** 9:\n relativne.append(relativne[-1] + relativne[-2])\n\nfor x in relativne:\n for y in relativne:\n for z in relativne:\n if x + y + z == n:\n print(x, y, z)\n sys.exit()\nprint(\"I'm too stupid to solve this problem\")\n", "s = input()\r\nprint('0 0 ' + s)", "a = 0\r\nb = 1\r\nans = [a,b]\r\nwhile True:\r\n c = ans[-1]+ans[-2]\r\n if c<=10**9:\r\n ans.append(c)\r\n else:\r\n break\r\nn = int(input())\r\nfor i in ans:\r\n for j in ans:\r\n for k in ans:\r\n if i+j+k==n:\r\n print(i,j,k)\r\n exit()\r\nprint(\"I'm too stupid to solve this problem\")", "nnn=int(input())\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nprint(0,0,nnn)\n\t \t \t \t \t\t\t\t \t \t\t \t\t \t \t\t", "\r\n\r\ndef main_function():\r\n f_n_1 = 1\r\n f_n_2 = 0\r\n f_n_3 = f_n_2 + f_n_1\r\n target_n = int(input())\r\n if not target_n == 0:\r\n while f_n_3 != target_n:\r\n f_n_3, f_n_2, f_n_1 = f_n_2 + f_n_3, f_n_3, f_n_2\r\n return f\"{f_n_1} {f_n_2} {0}\"\r\n else:\r\n return f\"{0} {0} {0}\"\r\n\r\nprint(main_function())\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def fib(k):\r\n a = 0\r\n b=1\r\n l = [0,1]\r\n c=0\r\n while c!=k:\r\n c = b + a\r\n l.append(c)\r\n a = b\r\n b = c\r\n return l\r\nn = int(input())\r\nl = fib(n)\r\nif n > 1:\r\n print(l[-3] , l[-3] , l[-4])\r\nelif n==1:\r\n print(1, 0, 0)\r\nelse:\r\n print(0,0,0)\r\n", "n = int(input())\nif n == 0:\n print(0, 0, 0)\nelse:\n a, f = 0, 1\n while a + f != n:\n a, f = f, a + f\n print(0, a, f)\n\n \t\t \t \t \t\t \t\t \t \t \t\t \t\t\t", "# Teste para ver se funcionao ao inves de ficar calculando o fibonacci de 1zilhao\nn = input()\nprint(f'0 0 {n}')\n \t\t \t\t\t\t \t \t \t\t\t\t \t \t\t\t \t\t", "n = int(input())\r\nif n ==0:\r\n print(0, 0, 0)\r\nelse:\r\n a,b = 0,1\r\n while a+b != n:\r\n a,b = b, a+b\r\n print(0,a,b)", "n=int(input())\r\nl=[0,1,1,2]\r\nif(n==0):\r\n print(0,0,0)\r\nelif(n==1):\r\n print(1,0,0)\r\nelif(n==2):\r\n print(2,0,0)\r\nelif(n==3):\r\n print(1,1,1)\r\nelse:\r\n while n not in l:\r\n l.append(l[-1]+l[-2])\r\n print(l[-4],l[-3],l[-3])", "n=int(input())\r\nl=[0,1]\r\na=0\r\nb=1\r\nwhile b<1000000001:\r\n c=a+b\r\n l.append(c)\r\n a=b\r\n b=c\r\nx=l.count(n)\r\nif x==0:\r\n print(\"I'm too stupid to solve this problem\")\r\nelse:\r\n if n==0:\r\n print(0,0,0)\r\n elif n==1:\r\n print(0,0,1)\r\n elif n==2:\r\n print(0,1,1)\r\n elif n==3:\r\n print(0,1,2)\r\n else:\r\n y=l.index(n)\r\n print(l[y-1],l[y-3],l[y-4])\r\n\r\n \r\n", "#Har har mahadev\r\n#author : @harsh kanani\r\n\r\nn = int(input())\r\nif n==0:\r\n print(0, 0, 0)\r\nelif n==1:\r\n print(0, 0, 1)\r\nelif n==2:\r\n print(0, 1, 1)\r\nelif n==3:\r\n print(1, 1, 1)\r\nelse:\r\n l = []\r\n l.append(0)\r\n l.append(1)\r\n s = 0\r\n while s!=n:\r\n s = l[-1] + l[-2]\r\n l.append(s)\r\n print(l[-5], l[-4], l[-2])\r\n", "\r\nn = int(input())\r\n\r\n#print(0 , 0 , n)\r\n\r\nif n == 0 :\r\n print(0 , 0 , 0 )\r\n\r\nelse:\r\n a , b = 0 , 1\r\n while a + b != n :\r\n a , b = b , a + b\r\n\r\n print(0 , a , b)", "n=int(input())\r\n\r\nif n == 1 :\r\n print(0,0,1)\r\nelif n == 0 :\r\n print(0,0,0)\r\nelif n == 2 :\r\n print(0,1,1)\r\nelif n == 3 :\r\n print(1,1,1)\r\nelse:\r\n lis=[1,1]\r\n i=0\r\n while lis[-1] != n :\r\n lis.append(lis[-1]+lis[-2])\r\n\r\n if lis[-1]==n :\r\n print(lis[-5],lis[-4],lis[-2])", "number = input()\n\ndef my_function():\n pass\ndef your_function():\n pass\ndef his_function():\n pass\ndef her_function():\n pass\n\nprint(0,0,number)\n \t\t \t \t \t\t\t \t\t\t \t\t \t \t\t", "n = int(input())\r\nif n == 0:\r\n print(0, 0, 0)\r\nelif n == 1:\r\n print(0, 0, 1)\r\nelse:\r\n a, b = 0, 1\r\n while True:\r\n if 2 * b + a == n:\r\n print(a, b, b)\r\n break\r\n c = a + b\r\n a, b = b, c", "# Bismillah\r\n# In the name of GOD\r\n\r\nprint(0, 0, input())\r\n", "\r\n\r\ndef main():\r\n n = int(input())\r\n print(0, 0, n)\r\n\r\nmain()\r\n", "s = [0,0,0,0,0,0,1]\nwhile(s[len(s)-1]<(10**9)):\n x = len(s)\n s.append(s[x-1]+s[x-2])\ni = int(input())\nidx = 0\nif(i<=2):\n print(0,0,i)\nelse:\n for v in s:\n if(v==i):\n break\n idx+=1\n print(s[idx-4],s[idx-3],s[idx-1])\n\n \t\t\t \t \t\t\t\t\t\t \t\t \t\t \t", "n=int(input())\r\nprint(0 , n, 0)", "numerin=input()\nfibonacci=int(numerin)\nprint(\"0 0 \"+numerin)", "num = int(input())\r\nprint(0,0,num)", "import math\nx = int(input())\nif x==1:\n\tprint (0,0,1)\nelif x==2:\n\tprint (0,1,1)\nelse:\n\tg = (1+math.sqrt(5))/2\n\tp = round(x/g)\n\tp2 = round(p/g)\n\tp3 = round(p2/g)\n\tprint(p2,p2,p3)\n \t \t \t\t \t \t \t \t \t\t \t \t\t\t\t\t\t\t\t", "def solve():\n N = int(input())\n if (N < 4):\n print(*(['0'] * (3 - N) + ['1'] * N), sep = ' ')\n return\n s = [n - int(n > 1) for n in range(5)]\n while s[-1] < N: s = s[1:] + [s[-2] + s[-1]]\n print(s[-2], s[-4], s[-5])\n\nsolve()\n", "inp = int(input())\r\n\r\ndef fibo(n):\r\n if n == 0:\r\n return [0,0,0]\r\n elif n == 1:\r\n return [0,0,1] \r\n a = -1\r\n b = 1\r\n c = 0\r\n temp1 = 0\r\n temp2 = 0\r\n while c != n:\r\n temp1 = a\r\n temp2 = b\r\n c = a + b\r\n a = b\r\n b = c\r\n\r\n return [0] + [temp1, temp2]\r\n\r\nprint(\" \".join(map(str, fibo(inp))))", "n = input()\r\nprint(f'0 0 {n}')", "print(\"0 0 \",input())", "val = int(input())\r\nprint(\"0 0\"+\" \"+str(val))", "n=int(input())\r\ndef fun(n):\r\n i=0\r\n j=1\r\n k=1\r\n t=2\r\n while(t!=n):\r\n i,j,k,t=j,k,t,t+k\r\n print(j,i,j)\r\nif(n==0):\r\n print(0,0,0)\r\nelif(n==1):\r\n print(1,0,0) \r\nelse:\r\n fun(n) ", "n = eval(input())\r\n\r\n# v = list(map(int,input().split()))\r\n\r\nprint(0,0,n)\r\n\r\n# ma,mi = max(v),min(v)\r\n\r\n# cnt = 0\r\n\r\n# for i in v:\r\n# if i > mi and i < ma:\r\n# cnt += 1\r\n# print(cnt)\r\n", "def fib(x):\r\n kk=[0,1]\r\n a=0\r\n b=1\r\n c=0\r\n while c!=x:\r\n c=a+b\r\n a=b\r\n b=c\r\n kk.append(c)\r\n return print(kk[-5],kk[-4],kk[-2])\r\nn=int(input())\r\nif n>3:\r\n fib(n)\r\nelse:\r\n print((3-n)*\"0 \" +n*\"1 \")", "import sys\r\nimport os\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom math import gcd\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef __perform_setup__():\r\n INPUT_FILE_PATH = \"/Users/osama/Desktop/Competitive Programming/input.txt\"\r\n OUTPUT_FILE_PATH = \"/Users/osama/Desktop/Competitive Programming/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\nMX = 10**9 + 10\r\n\r\n\r\ndef solve(num):\r\n prev, curr = 0, 1\r\n next = prev + curr\r\n\r\n fib_numbers = [prev, curr]\r\n\r\n while next < MX:\r\n fib_numbers.append(next)\r\n prev, curr = curr, next\r\n next = prev+curr\r\n\r\n possible_ans = []\r\n N = len(fib_numbers)\r\n\r\n def dp(i, s, arr):\r\n nonlocal possible_ans\r\n if len(arr) > 3 or possible_ans or s < 0:\r\n return\r\n\r\n if i >= N:\r\n if s == 0 and len(arr) == 3:\r\n possible_ans = [v for v in arr]\r\n return\r\n\r\n dp(i, s-fib_numbers[i], arr + [fib_numbers[i]])\r\n dp(i+1, s, arr)\r\n\r\n dp(0, num, [])\r\n\r\n if possible_ans:\r\n return \" \".join(map(str, possible_ans))\r\n\r\n return \"I'm too stupid to solve this problem\"\r\n\r\n\r\nN = read_int()\r\nprint(solve(N))\r\n", "def find_fibonacci_numbers(n):\n fib = [0, 1] # Starting Fibonacci sequence\n while fib[-1] < n:\n fib.append(fib[-2] + fib[-1]) # Generating the next Fibonacci number\n\n for i in range(len(fib)):\n for j in range(len(fib)):\n for k in range(len(fib)):\n if fib[i] + fib[j] + fib[k] == n:\n return fib[i], fib[j], fib[k]\n\n return None # No valid combination found\n\n\n# Read input\nn = int(input())\n\n# Find the Fibonacci numbers\nresult = find_fibonacci_numbers(n)\n\n# Print the output\nif result is None:\n print(\"I'm too stupid to solve this problem\")\nelse:\n print(*result)\n\t\t\t \t \t\t\t \t \t\t \t \t\t \t", "print(\"0 0\" , int(input()))", "i=int(input())\r\nprint(i,0,0)", "print(0,' ',0,' ',input())\n \t \t \t\t\t \t\t\t\t \t\t\t\t \t\t \t\t", "def fab(n):\r\n n1,n2,n3=0,1,2\r\n while n3<n:\r\n n3=n2+n1\r\n n1=n2\r\n n2=n3\r\n return n1,2*n1-n,2*n-3*n1\r\nn=int(input())\r\nif n==1:\r\n print(0,0,1)\r\nelif n==2:\r\n print(0,1,1)\r\nelse:\r\n print(*fab(n))", "a=[0,0,0]\r\nn=int(input())\r\nif n<5:\r\n for i in range(n):\r\n a[i]=1\r\n print(*a)\r\nelse:\r\n print(0,0,n) \r\n", "n=int(input())\r\na,c=0,0\r\nb=1\r\nl=[0,1]\r\nwhile(c<n):\r\n\tc=a+b\r\n\tif c<=n:\r\n\t\tl.append(c)\r\n\ta=b\r\n\tb=c\r\nif n in l:\r\n\tprint(0,0,n)\r\nelse:\r\n\tprint(\" I'm too stupid to solve this problem \")", "class Code:\r\n def __init__(self):\r\n self.n = int(input())\r\n\r\n def process(self):\r\n print(0, 0, self.n)\r\n\r\n\r\nif __name__ == '__main__':\r\n code = Code()\r\n code.process()\r\n", "import random\r\nt = 1\r\nfor ___________ in range(t):\r\n n = int(input())\r\n if(n==0):\r\n print(0, 0, 0)\r\n exit(0)\r\n a = [0, 1, 1]\r\n d = dict()\r\n d[0]=1\r\n d[1]=1\r\n while(a[-1]+a[-2]<=n):\r\n a.append(a[-1]+a[-2])\r\n d[a[-1]]=1\r\n while(1):\r\n i = random.randint(0, len(a)-1)\r\n j = random.randint(i, len(a)-1)\r\n if(d.get(n-a[i]-a[j], -1)!=-1):\r\n print(a[i], a[j], n-a[i]-a[j])\r\n exit(0)\r\n", "# https://codeforces.com/problemset/problem/199/A\r\n\r\nn = int(input())\r\nprint(f\"0 0 {n}\")\r\n", "x = int(input())\r\nprint(0,0,x)", "n = input()\nprint(0, 0, n)\n", "n = int(input())\r\n\r\ndef fibo(n):\r\n fibo_list = [0, 1]\r\n i = 1\r\n while fibo_list[i] < n:\r\n fibo_list.append(fibo_list[i]+fibo_list[i-1])\r\n i += 1\r\n return fibo_list\r\n\r\nfib = fibo(n)\r\nlength = len(fib)\r\npossible = False\r\nfor i in range(length-1, -1, -1):\r\n if fib[i] < n/2:\r\n break\r\n c = fib[i]\r\n for j in range(i, -1, -1):\r\n if fib[i] < c-n/2:\r\n break\r\n b = fib[j]\r\n for k in range(j, -1, -1):\r\n a = fib[k]\r\n if a + b + c == n:\r\n possible = True\r\n break\r\n if possible:\r\n break\r\n if possible:\r\n break\r\nif possible:\r\n print(a, b, c)\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")\r\n", "fab = int(input())\r\nprint(0,0,fab)", "def find_three_fibonacci_numbers(n):\r\n a, b, c = n, 0, 0\r\n return a, b, c\r\n\r\ndef generate_fibonacci_sequence(n):\r\n fibonacci = [0, 1]\r\n while fibonacci[-1] <= n:\r\n next_fib = fibonacci[-2] + fibonacci[-1]\r\n fibonacci.append(next_fib)\r\n return fibonacci\r\n\r\ndef is_possible_sum_of_three_fibs(n):\r\n fibonacci = generate_fibonacci_sequence(n)\r\n\r\n for i in range(len(fibonacci)):\r\n for j in range(len(fibonacci)):\r\n for k in range(len(fibonacci)):\r\n if fibonacci[i] + fibonacci[j] + fibonacci[k] == n:\r\n return True, fibonacci[i], fibonacci[j], fibonacci[k]\r\n\r\n return False, 0, 0, 0\r\n\r\n# Input\r\nn = int(input())\r\n\r\n# Check if three Fibonacci numbers can be found\r\nfound, a, b, c = is_possible_sum_of_three_fibs(n)\r\n\r\n# Output the result\r\nif found:\r\n print(a, b, c)\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")\r\n", "n = int(input())\r\nf1, f2 = 0, 1\r\ni = 0\r\nwhile i < n:\r\n f1 = f2\r\n f2 = i\r\n i = f1 + f2\r\nif n != 0:\r\n print(0, f1, f2)\r\nelse:\r\n print(0, 0, 0)\r\n", "def fibonacci():\r\n global f\r\n f = [0, 1]\r\n while f[-1] <= int(1e9):\r\n f.append(f[-1] + f[-2])\r\nif __name__ == '__main__':\r\n n = int(input())\r\n fibonacci()\r\n if n>2:\r\n ind = f.index(n)\r\n ind -= 1\r\n print(f[ind],f[ind-2],f[ind-3])\r\n else:\r\n print(n//1,0,0)", "#Hexadecimal's Theorum\r\nn = int(input())\r\nprint(n,'0','0')", "n = int(input())\nfib = [0, 1]\nwhile fib[-1] < n:\n fib.append(fib[-1] + fib[-2])\na = next(x for x in reversed(fib) if x <= n // 3)\nb = next(x for x in reversed(fib) if x <= (n - a) // 2)\nc = n - a - b\nif c in fib:\n print(a, b, c)\nelse:\n print(\"I'm too stupid to solve this problem\")\n\n\t \t \t\t\t\t \t\t \t\t\t \t\t\t", "#dfsjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjuvyhskjbvkfchakdchfvbs vsmbckfksfbhsnfajfhgisbhvkjdfrsfskfhF\n#FDMNVLKDHNVJVOFJVN,NV,VNFMLS;JFKDFI9RTJ08FHJNF897RFDJFHNLSF\nprint(0,0,input())\n \t \t \t \t \t \t \t\t\t \t \t\t \t", "n=int(input())\r\nprint()\r\nprint(\"0 0\",n)\r\n\r\n", "\r\nprint(0,0,input())", "n=int(input())\r\nl=[0,0,n]\r\nfor i in l:\r\n print(i,end=\" \")", "n=int(input())\nfibonacci=[0,1,1]\nwhile fibonacci[2]<n:\n fibonacci[0]=fibonacci[1]\n fibonacci[1]=fibonacci[2]\n fibonacci[2]=fibonacci[0]+fibonacci[1]\n\nif n==0:\n print(0, 0, 0)\nelse:\n print(fibonacci[0],fibonacci[1],0)\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nprint(input(),0,0)\r\n", "n = int(input())\nx = [0,1]\ni = 0\nif n == 0:\n print(0, 0, 0)\n\nelse:\n if n == 1:\n print(1, 0, 0)\n else:\n if n == 2:\n print(1,1,0)\n else:\n while x[i + 1] < n:\n x.append(x[i] + x[i + 1])\n i += 1\n print(x[i - 3], x[i - 2], x[i])\n", "import math as m\r\nfrom collections import defaultdict,deque\r\nfrom bisect import bisect_left as b_l\r\nfrom bisect import bisect_right as b_r\r\n\r\n# def is\r\n\r\n# def isfibonacci(n):\r\n\r\n# for _ in range(int(input())):\r\n # n=int(input())\r\n # a=[int(x) for x in input().split()]\r\nn=int(input())\r\nans=[0,1]\r\nfor i in range(2,50):\r\n ans.append(ans[i-1]+ans[i-2])\r\nif(n in ans):\r\n print(n,0,0)\r\nelse:\r\n sol=[]\r\n for i in range(3):\r\n sol.append(ans[b_l(ans,n,0,len(ans))-1])\r\n n-=sol[-1]\r\n if(n in ans):\r\n sol.append(n)\r\n if i==0:sol.append(0)\r\n break\r\n print(*sol)", "def main():\n n = int(input())\n\n if n == 0:\n print(\"0 0 0\")\n return\n\n if n == 1:\n print(\"0 0 1\")\n return\n\n m2 = 2\n m = -1\n z = 1\n f = 0\n s = 1\n\n while 1:\n a = f\n b = s\n\n m2 = m\n m = z\n z = f\n f = s\n s = a + b\n\n if s == n:\n print(f, m, m2)\n return\nmain()\n \n \n", "x = int(input())\r\nif x == 2:\r\n print('0 1 1')\r\nelif x == 1:\r\n print('0 0 1')\r\nelif x == 0:\r\n print('0 0 0')\r\nelif x == 3:\r\n print('1 1 1')\r\nelif x == 5:\r\n print('1 1 3')\r\nelif x == 8:\r\n print('1 2 5')\r\nelse:\r\n a = 1\r\n b = 1\r\n c = 2\r\n d = 3\r\n e = 5\r\n while e < x:\r\n a = b\r\n b = c\r\n c = d\r\n d = e\r\n e = c+d\r\n if e == x:\r\n print(a, b, d)\r\n else:\r\n print(\"I'm too stupid to solve this problem\")\r\n\r\n\r\n", "n = int(input())\n\nif n == 0:\n print(\"0 0 0\")\nelif n == 1:\n print(\"1 0 0\")\n\nelse:\n fib = [0, 1, 1]\n num = -10\n i = 2\n while num != n:\n num = fib[i] + fib[i-1]\n fib.append(num)\n i += 1\n\n\n print(str(fib[i-2]) + \" \" + str(fib[i-2]) + \" \" + str(fib[i-3]))\n\t\t\t \t \t\t \t\t\t \t\t \t\t\t \t\t \t \t", "x= int(input())\r\na= 0\r\nb= 1\r\nif x== 0: print(0,0,0)\r\nelse:\r\n for i in range(x):\r\n if i== a+b:\r\n a, b= b, i\r\n\r\n print(0, a, b)", "m = {}\r\nfibo = [0]*47\r\nfibo[1] = 1\r\nm[0] = 0\r\nfor i in range(2,47):\r\n fibo[i] = fibo[i-2] + fibo[i-1]\r\n m[fibo[i]] = i\r\nn = int(input())\r\nif n == 0:\r\n print(0,0,0)\r\n exit(0)\r\nprint(fibo[m[n]-1],fibo[m[n]-2],0)\r\n", "def search(n,f,m):\r\n l = []\r\n if n == 0:\r\n for i in range(m):\r\n l = [0 for i in range(m)]\r\n return(l)\r\n else:\r\n for i in range(len(f)-1):\r\n if f[i]<=n and f[i+1]>n:\r\n break\r\n return([f[i]]+search(n-f[i],f,m-1))\r\nn = int(input())\r\nif n == 0:\r\n f = [0]\r\nif n>0:\r\n f = [1,2]\r\n a = 1\r\n b = 2\r\n c = 3\r\n while(c<=n):\r\n f.append(c)\r\n a = b\r\n b = c\r\n c = a+b\r\nfor i in search(n,f,3):\r\n print(i,end=\" \")\r\nprint()\r\n ", "n = int(input())\r\nfib = [0, 0, 0, 1]\r\nwhile fib[len(fib) - 1] + fib[len(fib) - 3] + fib[len(fib) - 4] < n:\r\n\tfib.append(fib[-1] + fib[-2])\r\nif n == 0:\r\n\tprint(0, 0, 0)\r\nelif n == 2:\r\n\tprint(0, 1, 1)\r\nelse:\r\n\tif fib[len(fib) - 1] + fib[len(fib) - 3] + fib[len(fib) - 4] != n:\r\n\t\tprint(\"I'm too stupid to solve this problem\")\r\n\telse:\r\n\t\tprint(fib[len(fib) - 4], fib[len(fib) - 3], fib[len(fib) - 1])", "k=int(input())\r\nprint(\"0 0 \"+str(k))", "n = int(input())\r\nif n == 0:\r\n print(\"0 0 0\")\r\nelif n == 1:\r\n print(\"1 0 0\")\r\nelif n == 2:\r\n print(\"1 1 0\")\r\nelif n == 3:\r\n print(\"1 1 1\")\r\nelse:\r\n s = [0, 1];c = 1;i = 2\r\n while (c != n):\r\n s.append(c)\r\n c = s[i - 1] + s[i]\r\n i += 1\r\n print(s[i - 1], s[i - 3], s[i - 4])", "def main():\r\n N=int(input())\r\n print(0,0,N)\r\nif __name__=='__main__':\r\n main()", "#https://codeforces.com/contest/199/problem/A\r\nn=int(input())\r\ne=5**(0.5)\r\ndef fib(i):\r\n\treturn round((1/e)*( ((1+e)/2)**(i) ))\r\na=[]\r\ni=0\r\nwhile fib(i)<=n:\r\n\ta.append(fib(i))\r\n\ti+=1\r\n#print(a)\r\nk=len(a)\r\nif k==1:\r\n\tprint('0 0 0')\r\nelif k==2:\r\n\tprint('1 0 0')\r\nelif k==3:\r\n\tprint('1 0 0')\r\nelif k==4:\r\n\tprint('1 1 0')\r\nelif k>=5:\r\n\ts=''\r\n\ts+=str(a[k-3])\r\n\ts+=' '\r\n\ts+=str(a[k-3])\r\n\ts+=' '\r\n\ts+=str(a[k-4])\r\n\tprint(s)\r\n", "def Hexadecimals_theorem():\r\n def create_fibonacci(max_element):\r\n prev = 0\r\n cur = 1\r\n fibonacci_sequence = []\r\n fibonacci_sequence.append(prev)\r\n fibonacci_sequence.append(cur)\r\n\r\n while cur < max_element:\r\n new = prev + cur\r\n fibonacci_sequence.append(new)\r\n prev = cur\r\n cur = new\r\n\r\n return fibonacci_sequence\r\n\r\n fibonacci_number = int(input())\r\n fibonacci_sequence = create_fibonacci(fibonacci_number)\r\n length = len(fibonacci_sequence)\r\n #print(fibonacci_sequence)\r\n if len(fibonacci_sequence) >= 5:\r\n print(\"{} {} {}\".format(fibonacci_sequence[length-5],fibonacci_sequence[length-4], fibonacci_sequence[length-2]))\r\n else:\r\n required_numbers = []\r\n for i in range(fibonacci_number):\r\n required_numbers.append(1)\r\n while len(required_numbers) != 3:\r\n required_numbers.append(0)\r\n print(\"{} {} {}\".format(required_numbers[0],required_numbers[1], required_numbers[2]))\r\n\r\n\r\n\r\nHexadecimals_theorem()", "n = int(input())\nif n <= 3:\n print(0, 0, n)\nelse:\n a, b, c = 2, 3, 5\n while c != n:\n a, b, c = b, c, b + c\n print(0, a, b)\n", "t = int(input())\r\nprint(0, end = \" \")\r\nprint(0, end = \" \")\r\nprint(t, end = \" \")", "n=input()\r\nprint(\"0 0 \"+n)", "def solution():\r\n n = int(input())\r\n print(0,0,n)\r\n\r\nsolution()", "\r\n\r\nn = int(input())\r\n\r\nprint(n , 0 , 0)", "n = int(input())\r\n\r\nf = [0,1]\r\n\r\nfor i in range(2, n):\r\n var = f[i-2] + f[i-1]\r\n if var == n or var > n:\r\n break\r\n else:\r\n f.append(var)\r\n\r\nlen_f = len(f) -1\r\nflag = False\r\n\r\nfor i in range(len_f, -1, -1):\r\n for j in range(len_f, -1, -1):\r\n for k in range(len_f, -1, -1):\r\n if f[i] + f[j] + f[k] == n:\r\n x, y, z = f[i], f[j], f[k]\r\n flag =True\r\n break\r\n\r\nif flag:\r\n print(x, y, z)\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")", "integer=int(input())\r\nprint(\"0\",\"0\",integer)", "val = input()\r\nprint(0)\r\nprint(0) \r\nprint(val) ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jun 20 15:44:53 2021\r\n\r\n@author: hp\r\n\"\"\"\r\n\r\nimport math\r\n\r\ndef Square(x):\r\n\ts = int(math.sqrt(x))\r\n\treturn s*s == x\r\n\r\ndef isFibonacci(n):\r\n\treturn Square(5*n*n + 4) or Square(5*n*n - 4)\r\n\r\nn = int(input())\r\nif isFibonacci(n):\r\n print(0,0,n)\r\nelse:\r\n print(\"I'm too stupid to solve this problem\")\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n ", "n=int(input())\r\n\r\nprint( '0 0 ',n)", "numb=int(input())\r\nprint(0,0,numb)", " \r\n# 0, 1, 1, 2, 3, 5, 8, 13, 21,34,55...\r\nprint(input(),0,0)\r\n# 3\r\n# 1 1 1\r\n\r\n# 13\r\n# 2 3 8 \r\n\r\n# def nearestFibonacci(num):\r\n\t\r\n# \t# Base Case\r\n# \tif (num == 0):\r\n# \t\tprint(0)\r\n# \t\treturn\r\n\r\n# \t# Initialize the first & second\r\n# \t# terms of the Fibonacci series\r\n# \tfirst = 0\r\n# \tsecond = 1\r\n\r\n# \t# Store the third term\r\n# \tthird = first + second\r\n\r\n# \t# Iterate until the third term\r\n# \t# is less than or equal to num\r\n# \twhile (third <= num):\r\n\t\t\r\n# \t\t# Update the first\r\n# \t\tfirst = second\r\n\r\n# \t\t# Update the second\r\n# \t\tsecond = third\r\n\r\n# \t\t# Update the third\r\n# \t\tthird = first + second\r\n\r\n# \t# Store the Fibonacci number\r\n# \t# having smaller difference with N\r\n# \tif (abs(third - num) >=\r\n# \t\tabs(second - num)):\r\n# \t\tans = second\r\n# \telse:\r\n# \t\tans = third\r\n\r\n# \t# Print the result\r\n# \treturn ans \r\n\r\n\r\n# def checkfibonacci(n):\r\n# a = 0\r\n# b = 1\r\n# if (n==a or n==b) : return 1\r\n# c = a+b\r\n# while(c<=n):\r\n# if(c == n) : return 1\r\n# a = b\r\n# b = c\r\n# c = a + b\r\n# return 0\r\n\r\n# x=int(input())\r\n# if checkfibonacci(x): print(0,0,x)\r\n# else:\r\n# pass\r\n# print(checkfibonacci(x))\r\n\r\n# --------------\r\n# 2\r\n# 7 4\r\n# 2\r\n\r\n# 7\r\n# 7 4 47 100 4 9 12\r\n# Still Rozdil\r\n# x=int(input())\r\n# arr=list(map(int,input().split()))\r\n# min=min(arr)\r\n# ind=arr.index(min)\r\n# if arr.count(min)==1:\r\n# print(ind+1)\r\n# else:\r\n# print(\"Still Rozdil\")\r\n# # print(arr)\r\n\r\n\r\n# x,y,\r\n# m=map(int,input().split())\r\n# if x>=m or y>=m :\r\n# print(0) \r\n# elif (x+y)<0 :\r\n# print(-1)\r\n# else:\r\n# sum = x+y\r\n# max=max(x,y)\r\n# count = 1 \r\n# while sum<m:\r\n# count+=1\r\n# sum = sum + max\r\n # print(count)\r\n\r\n# s=input()\r\n# sub1='heavy'\r\n# sub2='metal'\r\n# heavymetalisheavymetal\r\n# heavymetalismetal\r\n# trueheavymetalissotruewellitisalsosoheavythatyoucanalmostfeeltheweightofmetalonyou\r\n\r\n# s = input()\r\n# l = s.split('heavy')\r\n# print(l)\r\n# ans = 0\r\n# for i in range(len(l)):\r\n# \tans += i * l[i].count('metal')\r\n# print(ans)\r\n\r\n# ans=0\r\n# i=0\r\n# while i<=len(s)-5:\r\n# # print(s[i:i+5])\r\n# if s[i:i+5]==sub1:\r\n# ans+=s[i:].count(sub2)\r\n# i+=4\r\n# i+=1\r\n# print(ans)\r\n\r\n\r\n# ans=0\r\n# for i in range(len(s)) :\r\n# if s[i:i+5]==sub1:\r\n# ans+=s[i:].count(sub2)\r\n# print(ans)", "# benzene_ <>\r\n\r\nn=int(input())\r\ns=0\r\nlst=[0]\r\na=0\r\nb=1\r\nwhile s<=n-1:\r\n s=a+b\r\n lst.append(s)\r\n a=b\r\n b=s\r\nk=0\r\nl=len(lst)\r\nfor i in range(l):\r\n y=n-lst[i]\r\n for j in range(l):\r\n x=y-lst[j]\r\n for _ in range(l):\r\n \r\n if x==lst[_]:\r\n print(lst[i],lst[j],lst[_])\r\n k=1\r\n break\r\n if k==1:\r\n break\r\n if k==1:\r\n break\r\n \r\nif k==0:\r\n print(\"I'm too stupid to solve this problem\")", "n = int(input())\r\nprint(\"0 0\",n)\r\n", "\r\n\r\nn=int(input())\r\nf=[0 ,1]\r\ni=-1\r\nfor k in range(2,90):\r\n f.append(f[k-2]+f[k-1])\r\n if(f[k]==n):\r\n i=k\r\n break\r\na=f\r\nif(n>=1):\r\n if((n in a )and (i>=4)):\r\n print(str(a[i-4])+\" \"+str(a[i-3])+\" \"+str(a[i-1]))\r\n elif(n==2):\r\n print(\"0 1 1\")\r\n elif(n==1):\r\n print(\"0 0 1\")\r\n else:\r\n print(\"I'm too stupid to solve this problem\")\r\nelif(n==0):\r\n print(\"0 0 0\")\r\n\r\n", "n = int(input())\r\npibo = [0,1]\r\nwhile True:\r\n pibo.append(pibo[-1]+pibo[-2])\r\n if pibo[-1]>1000000000:\r\n break\r\n\r\nif n==0:\r\n print(0,0,0)\r\nelif n==1:\r\n print(1,0,0)\r\nelse:\r\n tmp = pibo.index(n)\r\n print(pibo[tmp-2],pibo[tmp-2],pibo[tmp-3])", "p=1000\r\nfib=[0]*p \r\nfib[1]=1 \r\nfor i in range(2,p):\r\n fib[i]=fib[i-1]+fib[i-2]\r\nn=int(input())\r\nif n==1:\r\n print('1 0 0')\r\nelif n==0:\r\n print('0 0 0')\r\nelse:\r\n ind=fib.index(n)\r\n print(fib[ind-1],fib[ind-2],end=' ')\r\n print(0)\r\n ", "def find_nums():\r\n n = int(input())\r\n nums = [0, 1]\r\n \r\n while nums[-1] <= n:\r\n nums.append(nums[-2] + nums[-1])\r\n \r\n for i, el1 in enumerate(nums):\r\n for j, el2 in enumerate(nums[i:]):\r\n for k, el3 in enumerate(nums[i+j:]):\r\n if el1 + el2 + el3 == n:\r\n return ' '.join([str(el1), str(el2), str(el3)])\r\n \r\nprint(find_nums())", "print(input()+\" 0 0\")\r\n", "print(0,0,input())\r\n", "print(f'0 0 {int(input())}')", "numero=input()\r\nprint('0 0 '+ numero)", "import math as m\r\nfrom collections import defaultdict,deque\r\nfrom bisect import bisect_left as b_l\r\nfrom bisect import bisect_right as b_r\r\n\r\n# for _ in range(int(input())):\r\n # n=int(input())\r\n # a=[int(x) for x in input().split()]\r\nn=int(input())\r\nprint(n,0,0)", "t = int(input())\r\nprint(\"0 0\",t)", "n = int(input())\n\n\nre_list = [0]\na, b = 0, 1\nwhile b < n:\n re_list.append(b)\n a, b = b, a+b\n\nif n == 0:\n print(\"0 0 0\")\nelif n == 1:\n print(\"0 0 1\")\nelse:\n print(0, re_list[-2], re_list[-1])\n\n\t\t \t \t\t\t \t\t \t\t \t \t \t \t", "t=int(input())\r\nprint(0 ,0 ,t)", "n = int(input())\r\nanswer = [0, 0, n]\r\nfor i in answer: print(i, end=' ')", "n= int(input())\r\nprint (0,0,n)", "a = int(input())\r\nprint(0, 0, a)", "def solve(n):\r\n fib = [0,1]\r\n while fib[-1] <= n:\r\n fib.append(fib[-1]+fib[-2])\r\n\r\n if n in fib: \r\n return f'0 0 {n}'\r\n\r\n t = max(f for f in fib if f <= n)\r\n s = t\r\n zd = [t]\r\n while s < n:\r\n x = max(f for f in fib if f <= n-s)\r\n zd.append(x)\r\n s += x\r\n if len(zd) == 4: \r\n break\r\n if len(zd) <= 3:\r\n zd += [0, 0, 0]\r\n zd = zd[:3]\r\n zd.sort()\r\n return \" \".join(str(z) for z in zd) \r\n \r\n return \"I'm too stupid to solve this problem\"\r\n\r\nn = int(input())\r\nprint(solve(n))", "def main():\n\n n = int(input())\n print('0 0',n)\n\n\n return\n\n\nmain()\n", "n = int(input())\r\nprint(0, 0, n) # n is a fibonacci number in itself\r\n", "#https://codeforces.com/problemset/problem/199/A\r\n\r\n\r\nfibo=int(input())\r\n\r\na=0\r\nb=1\r\nres=1\r\nres1=[0,1,1]\r\n\r\nwhile(res<fibo):\r\n a=b\r\n b=res\r\n res=a+b\r\n res1.append(res)\r\n\r\nres1.reverse()\r\nres2=[]\r\nlen=0\r\ni=0\r\nwhile(fibo>=0 and len<3):\r\n current=res1[i]\r\n if(current<=fibo and len<3):\r\n fibo-=current\r\n res2.append(current)\r\n len+=1\r\n if (current <= fibo and len<3):\r\n fibo -= current\r\n res2.append(current)\r\n len+=1\r\n if (current <= fibo and len<3):\r\n fibo -= current\r\n res2.append(current)\r\n len+=1\r\n i+=1\r\n\r\nres3=''\r\nfor each in res2:\r\n res3+=str(each)\r\n res3+=' '\r\nprint(res3[:-1])\r\n\r\n", "n = int(input())\r\nif n==0:\r\n print(*[0,0,0])\r\nelif n==1:\r\n print(*[0,0,1])\r\nelse:\r\n prev2 = 0\r\n prev1 = 1\r\n prev = 1\r\n while prev!=n:\r\n curr = prev+prev1\r\n prev2 = prev1\r\n prev1 = prev\r\n prev = curr\r\n print(*[0,prev2,prev1])\r\n", "print(\"0 0\", int(input()))", "n = int(input())\r\nprint(0, 0, n)\r\n# nums = {}\r\n# a = 0\r\n# b = 1\r\n\r\n# while b < n:\r\n# nums[a + b] = (a, b)\r\n# a, b = b, a + b\r\n# print(nums)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat May 16 01:18:30 2020\r\n\r\n@author: Kashem Pagla\r\n\"\"\"\r\n\r\n\r\nprint(int(input()),0,0)", "fib = [0,1]\r\nwhile True:\r\n c = fib[-1]+fib[-2]\r\n if c<=10**9:\r\n fib.append(c)\r\n else:\r\n break\r\nn = int(input())\r\nfor i in fib:\r\n for j in fib:\r\n for k in fib:\r\n if i+j+k==n:\r\n print(i,j,k)\r\n exit()\r\nprint(\"I'm too stupid to solve this problem\")", "#agr koi bhi soln h to print any of that-ques m likha h\r\nprint(input(),0,0)", "n=int(input())\r\na=0\r\nb=1\r\nc=0\r\np=0\r\nif n==0:\r\n print(0,0,0)\r\nelse:\r\n while True:\r\n c=a+b\r\n if c==n:\r\n break\r\n a=b \r\n b=c\r\n print(a,b,p)\r\n ", "a=input()\r\nprint(a, '0', '0')\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n F = [0,1]\r\n for i in range(2,102):\r\n F.append(F[i-1]+F[i-2])\r\n z = F.index(n)\r\n if z > 2:\r\n print(f'0 {F[z-1]} {F[z-2]}')\r\n elif z == 2:\r\n print('0 1 1')\r\n elif z == 1:\r\n print('0 0 1')\r\n else:\r\n print('0 0 0')\r\n", "\nn = int(input())\n\nprint(0, 0, n)\n\n#zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzdfbaksfisayvdfisayigdasyugdiasgiygsad\n \t \t\t\t \t \t \t\t\t\t\t\t \t \t \t", "n=int(input())\r\nl=[0,1,1]\r\nfor i in range(60):l.append(l[-1]+l[-2])\r\nfor i in range(62):\r\n for x in range(62):\r\n for z in range(62):\r\n if l[i]+l[x]+l[z]==n:\r\n print(l[i],l[x],l[z])\r\n exit()\r\nprint(\"I'm too stupid to solve this problem\")\r\n", "print(f\"{input('')} 0 0\")\r\n", "def three_fib(n):\r\n if(n==0):\r\n return (0,0,0)\r\n elif(n==1):\r\n return (0,0,1)\r\n else:\r\n a,b,c = 0,0,1\r\n while((b+c)<n):\r\n a,b,c = b,c,b+c\r\n return (b-a,a,c)\r\n\r\nn = int(input())\r\nnums = three_fib(n)\r\nprint(*nums)", "n=int(input())\r\nif n==0:print(0,0,0);exit()\r\nif n==1:print(0,0,1);exit()\r\na=list();a.append(0);a.append(1);c,b=0,1\r\nfor i in range(55):d=c+b;a.append(d);c,b=b,d\r\nd=a.index(n);print(0,a[d-2],a[d-1])" ]

[ "a,b = input().split(':')\r\na = a.lstrip('0')\r\nb = b.lstrip('0')\r\nif len(a) == 0:\r\n a = '0'\r\nif len(b) == 0:\r\n b = '0'\r\nif len(a) == 1 and len(b) == 1:\r\n ok = True\r\n if ord(a[0])-ord('A') > 13:\r\n ok = False\r\n if ord(b[0])-ord('A') > 49:\r\n ok = False\r\n if ok:\r\n print(-1)\r\n else:\r\n print(0)\r\nelse:\r\n i = max(max(a),max(b))\r\n if ord(i) <= ord('9'): i = ord(i)-ord('0')\r\n else: i = ord(i)-ord('A') + 10\r\n i += 1\r\n printedOne = False\r\n while True:\r\n ok = True\r\n su, d = 0, 1\r\n for j in range(len(a)-1, -1, -1):\r\n c = a[j]\r\n if c <= '9':\r\n su += d * (ord(c) - ord('0'))\r\n else:\r\n su += d * (ord(c) - ord('A')+10)\r\n d *= i\r\n if su > 23: ok = False\r\n su, d = 0, 1\r\n for j in range(len(b)-1, -1, -1):\r\n c = b[j]\r\n if c <= '9':\r\n su += d * (ord(c) - ord('0'))\r\n else:\r\n su += d * (ord(c) - ord('A')+10)\r\n d *= i\r\n if su > 59: ok = False\r\n if not ok: break\r\n printedOne = True\r\n print(i, end=' ')\r\n i += 1\r\n if not printedOne: print(0)\r\n else: print()\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(x, o):\r\n c = 0\r\n t = 0\r\n for i in x:\r\n if s[i] >= o:\r\n return 100\r\n t += s[i] * o**c\r\n c += 1\r\n return t\r\n\r\n\r\na, b = input()[:-1].split(':')\r\ns = dict()\r\nfor i in range(10):\r\n s[str(i)] = i\r\nfor i in range(65, 91):\r\n s[chr(i)] = i-55\r\nd = []\r\nfor i in range(1, 61):\r\n u, v = f(a[::-1], i), f(b[::-1], i)\r\n if u < 24 and v < 60:\r\n d.append(i)\r\nif not d:\r\n print(0)\r\nelif d[-1] == 60:\r\n print(-1)\r\nelse:\r\n print(' '.join(map(str, d)))", "\r\ndef conv(a, i):\r\n x = 0\r\n for c in a:\r\n x = x * i + int(c, 36)\r\n return x\r\n\r\ndef valid(a, b, i):\r\n A, B = conv(a, i), conv(b, i)\r\n return 24 > A >= 0 <= B < 60\r\n\r\na, b = input().split(':')\r\nans = [i for i in range(int(max(*a, *b), 36) + 1, 99) if valid(a, b, i)]\r\nif 98 in ans:\r\n ans = [-1]\r\nelif not ans:\r\n ans = [0]\r\nprint(*ans)", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n def p(x, base, a):\r\n res = 0\r\n for i in range(len(x)):\r\n if a.index(x[-1 - i]) >= base:\r\n return -1\r\n res += base ** i * a.index(x[-1 - i])\r\n return res\r\n\r\n alph = \"\".join(sorted(list('qwertyuiopasdfghjklzxcvbnm'.upper())))\r\n a = \"0123456789\" + alph + \"#\"\r\n\r\n h, m = map(str, input().split(\":\"))\r\n\r\n res = []\r\n for i in range(2, 61):\r\n if 0 <= p(h, i, a) <= 23 and 0 <= p(m, i, a) <= 59:\r\n res.append(i)\r\n\r\n if len(res) == 0:\r\n print(0)\r\n else:\r\n if 60 in res:\r\n print(-1)\r\n else:\r\n print(*res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n" ]

[ "n=int(input())\r\nk=0\r\ns=0\r\nb=input().split()\r\nfor i in range(n):\r\n\tif b[i]=='4' or b[i] == '5':\r\n\t\tk+=1\r\n\telse:\r\n\t\ts+=k//3\r\n\t\tk=0\r\ns+=k//3\r\nprint(s)\r\n", "n = int(input())\r\ns = input().split()\r\na = [0]*n\r\nx = 0\r\nz = 0\r\nfor i in range(n):\r\n a[i] = s[i]\r\nfor i in range(n):\r\n if int(a[i]) >= 4:\r\n x+=1\r\n else:\r\n if x < 3:\r\n x = 0\r\n if x == 3:\r\n z += 1\r\n x = 0\r\nprint(z)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = 0\r\nc = 0\r\nfor i in range(n):\r\n if a[i] > 3:\r\n k += 1\r\n if k == 3:\r\n c += 1\r\n k = 0\r\n if a[i] < 4:\r\n k = 0\r\nprint(c)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nx=0\r\np=0\r\nfor i in range(n):\r\n if a[i]>=4:\r\n x+=1\r\n if x==3:\r\n p+=1\r\n x=0\r\n else:x=0\r\nprint(p)", "#A\r\ns = input()\r\nif s.isnumeric():\r\n k = int(s)\r\n if k >= 3 and k <= 1000:\r\n s = input().split(' ')\r\n gifts = 0\r\n i = 0\r\n while i < len(s):\r\n if (i == len(s) - 2) or (i == len(s) - 1):\r\n break\r\n if s[i].isnumeric():\r\n t = int(s[i])\r\n if (t >= 1) and (t <= 5):\r\n if ((s[i] == '4') or (s[i] == '5')) and ((s[i + 1] == '4') or (s[i + 1] == '5')) and ((s[i + 2] == '4') or (s[i + 2] == '5')):\r\n gifts += 1\r\n i += 2\r\n i += 1\r\n print(gifts)", "c=int(input())\r\nA = list(map(int, input().split()))\r\ni=0\r\nr=0\r\nm=0\r\nfor i in range(c):\r\n if r==3:\r\n m+=1\r\n r=0\r\n \r\n if A[i]>=4:\r\n r+=1\r\n else:\r\n r=0\r\nif r==3:\r\n m+=1\r\nprint(m)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\ni = 0\r\nwhile (i + 2 < n):\r\n if (a[i] >= 4 and a[i + 1] >= 4 and a[i + 2] >= 4):\r\n ans += 1\r\n i += 2\r\n i += 1\r\nprint(ans)", "n=int(input())\r\na=input()\r\nb=a.split()\r\nch=0\r\nk=0\r\n\r\nfor i in range(len(b)):\r\n\tif b[i]==\"4\"or b[i]==\"5\":\r\n\t\tch+=1\r\n\t\tif ch==3:\r\n\t\t\tk+=1\r\n\t\t\tch=0\r\n\telse:\r\n\t\tch=0\r\n\r\nprint(k)", "n = int(input())\r\na = input().split()\r\nb = []\r\nfor i in range(n):\r\n b.append(int(a[i]))\r\npol = 0\r\npresent = 0\r\nfor i in range(n):\r\n chislo = b[i]\r\n if chislo > 3 :\r\n pol +=1\r\n else:\r\n pol = 0\r\n if pol == 3:\r\n present += 1\r\n pol = 0\r\nprint(present)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nk=0\r\nfor i in range(n):\r\n if a[i]>=4:\r\n k+=1\r\n else:\r\n k=0\r\n if k==3:\r\n k=0\r\n s+=1\r\nprint(s)\r\n", "occount = input();\r\noc = [int(i) for i in input().split()]\r\npodar = 0;\r\nwhile len(oc)>=3:\r\n if ((oc[0] == 5 or oc[0] == 4) and (oc[1] == 5 or oc[1] == 4) and (oc[2] == 5 or oc[2] == 4)):\r\n podar = podar + 1;\r\n# print(oc);\r\n# print('(----------------------------------------)');\r\n del oc[0]; del oc[0]; del oc[0];\r\n# print(oc);\r\n else:\r\n del oc[0];\r\nprint(podar);\r\n", "n=int(input())\r\nz=list(map(int,input().split()))\r\nans=0\r\nnow=0\r\nfor i in range(n):\r\n if z[i]==4 or z[i]==5:\r\n now+=1\r\n ans+=now//3\r\n now%=3\r\n else:\r\n now=0\r\nprint(ans)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.append(-1)\r\ncount = 0\r\nans = 0\r\nfor i in range(n + 1):\r\n if l[i] >= 4:\r\n count += 1\r\n else:\r\n ans += count // 3\r\n count = 0\r\nprint(ans)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nc = 0\r\np = 0\r\nfor i in range(n):\r\n if A[i] in [4, 5]:\r\n c+=1\r\n else:\r\n c=0\r\n if c==3:\r\n p+=1\r\n c=0\r\nprint(p)", "n = int(input())\r\na = list(map(int,input().split()))\r\nx = 0\r\nk = 0\r\nfor i in range(n):\r\n if a[i] in [4,5]:\r\n k += 1\r\n else:\r\n x += k // 3\r\n k = 0\r\nx += k // 3\r\nprint(x)", "n = int(input())\r\nm = str(input())\r\nm += ' '\r\nk = 0\r\nx = []\r\nstri = ''\r\nfor i in m:\r\n if i != ' ':\r\n stri += i\r\n elif i == ' ':\r\n x.append(stri)\r\n stri = ''\r\nk = 0\r\nb = 0\r\nfor i in range(n):\r\n x[i] = int(x[i], 10)\r\n if x[i] > 3:\r\n k += 1\r\n else:\r\n k = 0\r\n if k == 3:\r\n k = 0\r\n b += 1\r\nprint(b)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ncnt = 0\r\ncur = 0\r\nfor x in lst:\r\n if x in {4, 5}:\r\n cur += 1\r\n if cur == 3:\r\n cur = 0\r\n cnt += 1\r\n else:\r\n cur = 0\r\nprint(cnt)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nd = 0\r\nfor i in a:\r\n if i in {4, 5}:\r\n d += 1\r\n if d == 3:\r\n cnt += 1\r\n d = 0\r\n else:\r\n d = 0\r\nprint(cnt)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount = 0\r\ni = 1\r\nwhile i < len(a) - 1:\r\n if a[i - 1] > 3 and a[i] > 3 and a[i + 1] > 3:\r\n count += 1\r\n i += 3\r\n else:\r\n i += 1\r\nprint(count)", "n = int(input())\r\ncnt = 0\r\nans = 0\r\nfor i in list(map(int, input().split()))+[1]:\r\n if (i < 4):\r\n ans += cnt // 3\r\n cnt = 0\r\n else:\r\n cnt += 1\r\nprint(ans)", "input()\r\nx=y=0\r\nfor i in input()[::2]:\r\n y+=1\r\n if i<'4':y=0\r\n elif y%3==0:x+=1\r\nprint(x)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt, good = 0, 0\r\nfor i in range(0, n):\r\n if a[i] == 4 or a[i] == 5:\r\n good = good + 1\r\n else:\r\n good = 0\r\n if good == 3:\r\n cnt = cnt + 1\r\n good = 0\r\nprint(cnt)" ]

[ "k=0\r\nc=0\r\ns=''\r\nss=''\r\nn=int(input())\r\nfor i in range(n):\r\n if k%2==0:\r\n s+='C'\r\n ss+='.'\r\n else:\r\n s+='.'\r\n ss+='C'\r\n k+=1\r\nk=0\r\nfor i in range(n):\r\n if k%2==0:\r\n c+=s.count('C')\r\n else:\r\n c+=ss.count('C')\r\n k+=1\r\nk=0\r\nprint(c)\r\nfor i in range(n):\r\n if k%2==0:\r\n print(s)\r\n else:\r\n print(ss)\r\n k+=1", "n = int(input())\r\ns = []\r\nsum = 0\r\nfor i in range(n):\r\n\ts1 = ''\r\n\tif i%2 != 0:\r\n\t\tfor j in range(n):\r\n\t\t\tif j%2 != 0:\r\n\t\t\t\ts1 += 'C'\r\n\t\t\t\tsum += 1\r\n\t\t\telse:\r\n\t\t\t\ts1 += '.'\r\n\t\ts.append(s1)\r\n\telse:\r\n\t\tfor j in range(n):\r\n\t\t\tif j%2 == 0:\r\n\t\t\t\ts1 += 'C'\r\n\t\t\t\tsum += 1\r\n\t\t\telse:\r\n\t\t\t\ts1 += '.'\r\n\t\ts.append(s1)\r\n\t\t\r\nprint(sum)\r\nfor i in range(n):\r\n\tprint(s[i])", "def ve_bang(n):\r\n if(n%2):\r\n print(int(n*n/2)+1)\r\n for i in range(n):\r\n if(i%2):\r\n print(\".C\"*round((n-1)/2)+'.')\r\n else:\r\n print(\"C.\"*round((n-1)/2)+'C')\r\n else:\r\n print(round(n*n/2))\r\n for i in range(n):\r\n if(i%2):\r\n print(\"C.\"*round(n/2))\r\n else:\r\n print(\".C\"*round(n/2))\r\n pass\r\nn=int(input())\r\nve_bang(n)", "from math import ceil\r\nn=int(input())\r\nl=[\"C.\",\".C\"]\r\nprint(ceil((n*n)/2))\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\tprint(l[0]*(n//2)+\"C\"*(n%2))\r\n\telse:\r\n\t\tprint(l[1]*(n//2)+\".\"*(n%2))", "# Danny Garcia\r\n# 5/8/2019\r\n\r\nfrom math import ceil\r\n\r\nx = int(input())\r\n\r\nprint(ceil(x * x / 2))\r\n\r\nfor row in range(x):\r\n\t\r\n\trowCurrent = \"\"\r\n\r\n\tfor column in range(x):\r\n\t\tif (row % 2 == 0 and column % 2 == 0) or (row % 2 == 1 and column % 2 == 1):\r\n\t\t\trowCurrent += \"C\"\r\n\t\telse:\r\n\t\t\trowCurrent += \".\"\r\n\r\n\tprint(rowCurrent)", "import sys\r\n\r\ndef solution():\r\n number = int(input())\r\n if number % 2 == 0:\r\n print(number*number//2)\r\n else:\r\n print(number*number//2 + 1)\r\n for i in range(number):\r\n row = \"\"\r\n if i % 2 == 0:\r\n first = 'C'\r\n second = '.'\r\n else:\r\n first = '.'\r\n second = 'C'\r\n for j in range(number):\r\n if j % 2 == 0:\r\n row += first\r\n else:\r\n row += second\r\n print(row)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()", "\r\nn=int(input())\r\nif(n%2==0):\r\n\ta=n//2\r\n\tprint(n**2//2)\r\n\tfor i in range(1,n+1):\r\n\t\tif(i%2!=0):\r\n\t\t\tprint(\"C.\"*a)\r\n\t\telse:\r\n\t\t\tprint(\".C\"*a)\r\n\t\r\nelse:\r\n\ta=n//2\r\n\tprint((a+1)*(a+1)+a*a)\r\n\tfor i in range(1,n+1):\r\n\t\tif(i%2!=0):\r\n\t\t\tprint(\"C.\"*a+\"C\")\r\n\t\telse:\r\n\t\t\tprint(\".C\"*a+\".\")\r\n\r\n", "ans = 0\r\nn = int(input())\r\nv = [ ['.'] * n for i in range(n)]\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif (i+j) % 2 == 0:\r\n\t\t\tv[i][j] = \"C\"\r\n\t\t\tans += 1\r\n\r\nprint(ans)\r\nfor i in v:\r\n\ts = \"\".join(i)\r\n\tprint(s)\r\n\r\n", "n = int(input())\r\nb = False\r\nr = n % 2 == 0\r\nif n == 1:\r\n print('1\\nC')\r\n exit(0)\r\nprint((n * n) // 2 + (not r))\r\nfor i in range(n):\r\n print(('C.' * 600)[i % 2:i % 2 + n])", "import sys\r\nfrom math import ceil\r\n\r\ndef main():\r\n n = int(sys.stdin.read().strip())\r\n t = int(ceil(n/2))\r\n return t*n - n%t, '\\n'.join(''.join('.C'[not (i+j)%2] for j in range(n)) for i in range(n))\r\n \r\nprint(*main(), sep='\\n')\r\n", "n1 = int(input())\r\nif n1==1:\r\n print(1)\r\n print(\"C\")\r\nelse:\r\n count1 = 0\r\n count2 = 0\r\n str1 = [\".\"]*n1\r\n str2 = [\".\"]*n1\r\n for i in range(len(str1)):\r\n if i % 2 == 0:\r\n str1[i] = \"C\"\r\n count1 += 1\r\n for i in range(len(str2)):\r\n if i % 2 != 0:\r\n str2[i] = \"C\"\r\n count2 += 1\r\n final = 0\r\n for i in range(n1):\r\n if i % 2 == 0:\r\n final += count1\r\n else:\r\n final += count2\r\n print(final)\r\n for i in range(n1):\r\n if i % 2 ==0:\r\n print(''.join(str1))\r\n else:\r\n print(''.join(str2))\r\n \r\n \r\n \r\n \r\n ", "n=(int)(input())\r\ns=\"\"\r\nfor i in range(n+1):\r\n\tif(i%2==0):\r\n\t\ts+='C'\r\n\telse:\r\n\t\ts+='.'\r\nss=[]\r\nans=0\r\nfor i in range(n):\r\n\tif(i%2==0):\r\n\t\tss.append(s[0:n])\r\n\t\tans+=s[0:n].count('C')\r\n\telse:\r\n\t\tss.append(s[1:n+1])\r\n\t\tans+=s[1:n+1].count('C')\r\nprint(ans)\r\nfor i in ss:\r\n\tprint(i)", "n = int(input())\nanswer = \"\"\nanswer2 = \"\"\nif n % 2 == 0:\n answer = answer + str(int((n ** 2) / 2)) + \"\\n\"\nelse:\n answer = answer + str(int((n ** 2) / 2) + 1) + \"\\n\"\nfor i in range(0, n):\n answer2 = \"\"\n for j in range(0, n):\n if i % 2 == 0:\n if j % 2 == 0:\n answer2 = answer2 + \"C\"\n else:\n answer2 = answer2 + \".\"\n else:\n if j % 2 == 1:\n answer2 = answer2 + \"C\"\n else:\n answer2 = answer2 + \".\"\n answer = answer + answer2 + \"\\n\"\nprint(answer)", "n=int(input())\r\na='C.'\r\nif n%2==0:\r\n\tprint(int(n*n/2))\r\n\tfor i in range(n):\r\n\t\tif i%2==0:\r\n\t\t\tprint(a*int(n/2))\r\n\t\telse:\r\n\t\t\tk=a[::-1]\r\n\t\t\tprint(k*int(n/2))\r\nelse:\r\n\tprint(int(n*n/2)+1)\r\n\tfor i in range(n):\r\n\t\tif i%2==0:\r\n\t\t\tprint(a*int(n/2)+a[0])\r\n\t\telse:\r\n\t\t\tk=a[::-1]\r\n\t\t\tprint(k*int(n/2)+k[0])", "a = int(input())\r\nif (a * a) % 2 == 0:\r\n print(a * a // 2)\r\n for i in range(a):\r\n if i % 2 == 0:\r\n for i in range(a // 2):\r\n print(\"C.\",end=\"\")\r\n else:\r\n for i in range(a // 2):\r\n print(\".C\",end=\"\")\r\n print()\r\nelse:\r\n print(a * a // 2 + 1)\r\n for i in range(a):\r\n if i % 2 == 0:\r\n for i in range(a // 2):\r\n print(\"C.\",end=\"\")\r\n print(\"C\",end=\"\")\r\n else:\r\n for i in range(a // 2):\r\n print(\".C\",end=\"\")\r\n print(\".\",end=\"\")\r\n print()", "def main():\r\n n = int(input())\r\n if n%2 == 1:\r\n print((n//2+1)**2+(n//2)**2)\r\n for i in range(n):\r\n if i%2 == 0:\r\n print('C.'*(n//2)+'C')\r\n else:\r\n print('.C'*(n//2)+'.')\r\n \r\n else:\r\n print(n//2*n)\r\n for i in range(n):\r\n if i%2 == 0:\r\n print('C.'*(n//2))\r\n else:\r\n print('.C'*(n//2))\r\nmain()\r\n\r\n", "n = int(input())\r\n# 1 2 3 4 5 6 7 8\r\n# 1 2 5 8 13 18\r\nprint(n * n // 2 + n % 2)\r\na = ['C' if i % 2 == 0 else '.' for i in range(n)]\r\n\r\n\r\ndef swap(a):\r\n for i in range(n):\r\n if a[i] == '.':\r\n a[i] = 'C'\r\n else:\r\n a[i] = '.'\r\n return a\r\n\r\n\r\nfor i in range(n):\r\n print(*a, sep='')\r\n a = swap(a)\r\n", "s=int(input())\r\nprint((s*s+1)//2)\r\nfor i in range(s):\r\n print(('C.'*1000)[i:i+s])", "n = int(input())\r\nr1 = 'C.' * (n//2)\r\nr2 = '.C' * (n//2)\r\nif n%2 == 0 :\r\n print( n * n // 2 )\r\n print((r1+'\\n'+r2+'\\n') * (n//2) )\r\nelse :\r\n print(n*(n//2+1) - n//2)\r\n r1 += 'C'\r\n r2 += '.'\r\n print((r1+'\\n'+r2+'\\n') * (n//2) +r1 )", "n = int(input())\r\nif not n & 1:\r\n t = (n * n)// 2\r\nelse:\r\n t = (n * n) // 2 + 1\r\nprint(t)\r\nfor i in range(n):\r\n r = []\r\n for j in range(n):\r\n if (j % 2 == 0 and i % 2 == 0) or (j % 2 == 1 and i % 2 == 1):\r\n r += ['C']\r\n else:\r\n r += ['.']\r\n print(\"\".join(r))", "m = int(input())\r\ns = \"\"\r\nfor i in range(1,m+1):\r\n\tif i%2!=0:\r\n\t\tfor j in range(1,m+1):\r\n\t\t\tif j%2!=0:\r\n\t\t\t\ts += \"C\"\r\n\t\t\telif j%2==0:\r\n\t\t\t\ts += \".\"\t\t\t\t\r\n\telif i%2==0:\r\n\t\tfor j in range(1,m+1):\r\n\t\t\tif j%2!=0:\r\n\t\t\t\ts += \".\"\r\n\t\t\telif j%2==0:\r\n\t\t\t\ts += \"C\"\r\nprint(s.count(\"C\"))\t\t\t\t\r\nfor k in range(0,len(s),m):\r\n\tprint(s[k:k+m])\t\t", "import sys\r\nimport math\r\nn = int(input())\r\nprint((n*n+1)//2)\r\nfor i in range(n):\r\n s=\"\"\r\n s= \"\".join(['.' if (i+j)%2 else 'C' for j in range(n)])\r\n print(s)\r\n\r\n", "n=int(input())\r\nif n%2==0:\r\n print(int(n*n/2))\r\nelse :\r\n print(int((n*n+1)/2))\r\ns1=\"\"\r\ns2=\"\"\r\nfor j in range(0,n):\r\n if j%2==0:\r\n s1+='C'\r\n else :\r\n s1+='.'\r\nfor j in range(0,n):\r\n if j%2==0:\r\n s2+='.'\r\n else :\r\n s2+='C'\r\nfor i in range(0,n):\r\n if i%2==0:\r\n print(\"%s\"%s1) \r\n else :\r\n print(\"%s\"%s2)\r\n ", "n = int(input())\r\n\r\nif n == 1:\r\n print(\"1\\nC\")\r\n exit(0)\r\n\r\neven = \"C.\" * (n // 2) + (\"C\" if n & 1 else \"\")\r\nodd = \".C\" * (n // 2) + (\".\" if n & 1 else \"\")\r\n\r\nprint(n * n // 2 + (n & 1))\r\nfor row in range(n):\r\n print(odd if row & 1 else even)", "n=int(input())\r\nprint((n*n+1)//2)\r\ns='C.'*n\r\nfor i in range(n):\r\n print(s[i:i+n])", "n = int(input())\r\nres = []\r\nc = 0\r\nfor i in range(n):\r\n s = ''\r\n for j in range(n):\r\n if (i + j) % 2 == 0:\r\n s += 'C'\r\n c += 1\r\n else:\r\n s += '.'\r\n res.append(s)\r\nprint(c)\r\nfor i in res:\r\n print(i)\r\n", "from sys import stdin\n\ndef main():\n n = int(stdin.readline().strip())\n print(n * n // 2 + (n & 1))\n s0 = ('C.' * (n // 2 + 1))[:n]\n s1 = ('.C' * (n // 2 + 1))[:n]\n for i in range(n):\n print((s0, s1)[i & 1])\n\n\nmain()\n", "# for testCase in range(6):\nn = int(input())\nprint((n*n+1)//2)\nfor i in range(n):\n for j in range(n):\n if (j&1) == (i&1):\n print('C' ,end='')\n else:\n print('.' ,end='')\n print()\n", "n = int(input())\n\ncounter = 0\nboard = []\nfor i in range(n):\n if i % 2 == 0:\n s = \"\"\n for j in range(n):\n if j % 2 == 0:\n counter += 1\n s += \"C\"\n else:\n s += \".\"\n board.append(s)\n else:\n s = \"\"\n for j in range(n):\n if j % 2 == 0:\n s += \".\"\n else:\n counter += 1\n s += \"C\"\n board.append(s)\nprint(counter)\nfor row in board:\n print(row)\n", "n=int(input())\r\nprint((n*n+1)//2)\r\narr=\"C.\"*n\r\nprint(\"\\n\".join(arr[i:n+i] for i in range(n)))", "n=int(input())\r\nif n%2==0:\r\n print(n**2//2)\r\nelse:\r\n print(n**2//2+1)\r\n \r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n s='C.'*(n//2)+'C'*(n%2)\r\n print(s)\r\n else:\r\n s='.C'*(n//2)+'.'*(n%2)\r\n print(s)\r\n \r\n\r\n \r\n \r\n", "n = int(input())\r\nprint(int((n * n + 1) // 2))\r\nfor i in range(n):\r\n print(('C.'*600)[i%2:i%2+n])", "n = int(input())\ns = \"C.\"*n\ns1 = s[:n]\ns2 = s[1:n+1]\n\nprint(n*n//2 + (n*n)%2)\nfor i in range(n):\n\tif i%2==0:\n\t\tprint(s1)\n\telse:\n\t\tprint(s2)", "n=int(input())\r\nif(n%2==0):\r\n print((n*n)//2)\r\nelse:\r\n print((n*n)//2+1)\r\ns=\"C.\"*n\r\nfor i in range(n):\r\n print(s[i:i+n]) ", "n=int(input())\r\nif (n**2)%2==0:\r\n print((n**2)//2)\r\nelif (n**2)%2!=0:\r\n print(((n**2)//2)+1)\r\nb=[]\r\ns=\"\"\r\nfor i in range(n):\r\n for j in range((n//2)+1):\r\n if i%2==0:\r\n s+=\"C.\"\r\n else:\r\n s+=\".C\"\r\n b.append(s)\r\n s=\"\"\r\nc=[]\r\nfor p in b:\r\n c.append(p[0:n])\r\nfor l in c:\r\n print(l)\r\n", "n = int(input())\r\nprint((n//2 + n%2) ** 2 + (n - (n//2 + n%2)) * (n // 2))\r\nc = ''\r\nd = ''\r\np = 1\r\nfor i in range(n):\r\n c += ('C', '.')[p<0]\r\n d += ('C', '.')[p>0]\r\n p *= -1\r\np = 1\r\nfor i in range(n):\r\n print((c,d)[p < 0])\r\n p *= -1", "n = int(input())\r\nstr=''\r\nc=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i+j)%2:str+='.'\r\n else:\r\n str+='C'\r\n c += 1\r\n str+='\\n'\r\nprint(c)\r\nprint(str)", "n = int(input())\r\nans = 0\r\nif n % 2 == 0:\r\n print((n // 2) * n)\r\nelse:\r\n print((n // 2 + 1) * (n // 2 + 1) + (n // 2) * (n // 2))\r\nfor i in range(n):\r\n s = ''\r\n for j in range(n):\r\n if (j % 2 == 0 and i % 2 == 0) or (j % 2 == 1 and i % 2 == 1):\r\n s += 'C'\r\n else:\r\n s += '.'\r\n print(s)\r\n", "n = int(input())\r\nprint((n**2+1)//2)\r\neven='C.'\r\nodd='.C'\r\nif n%2==0:\r\n for i in range(n):\r\n if i&1:\r\n print(odd*(n//2))\r\n else:\r\n print(even*(n//2))\r\nelse:\r\n for i in range(n):\r\n if i&1:\r\n print(odd*(n//2)+'.')\r\n else:\r\n print(even*(n//2)+'C')", "from math import ceil\nn=int(input())\nprint(ceil(n*n/2))\nfor i in range(1,n+1):\n\ts=''\n\tif i%2!=0:\n\t\tfor j in range(1,n+1):\n\t\t\tif j%2!=0:\n\t\t\t\ts+=\"C\"\n\t\t\telse:\n\t\t\t\ts+='.'\t\n\telse:\n\t\tfor j in range(1,n+1):\n\t\t\tif j%2!=0:\n\t\t\t\ts+='.'\n\t\t\telse:\n\t\t\t\ts+='C'\n\tprint(s)\t\t", "def per(n , x): \r\n r =''\r\n if n % 2 != 0:\r\n d =( n//2 + 1 )\r\n else: \r\n d = n//2 \r\n for i in range (d) : \r\n r += x \r\n if n % 2 != 0:\r\n return r[:-1]\r\n return r\r\nn =int(input())\r\nif n % 2 == 0 : \r\n print((n//2) * n )\r\nelse : \r\n print(((n//2)+1)**2 + ((n//2))**2) \r\nfor i in range(n) : \r\n if i % 2 == 0 : \r\n print(per(n , \"C.\"))\r\n else:\r\n print(per(n,\".C\"))", "import math\r\nn = int(input())\r\ncoders = math.ceil(n*n/2)\r\n\r\nshift = 0\r\ntoggle = True\r\nline = \"\"\r\nprint(coders)\r\nfor i in range(n):\r\n if not shift :\r\n for j in range(n):\r\n if toggle:\r\n line = line + 'C'\r\n toggle = False\r\n else:\r\n line = line + '.'\r\n toggle = True\r\n else:\r\n for j in range(n):\r\n if not toggle:\r\n line = line + 'C'\r\n toggle = True\r\n else :\r\n line = line + '.'\r\n toggle = False\r\n print(line)\r\n line =\"\"\r\n shift = (shift+1)%2\r\n toggle = True\r\n", "n = int(input())\r\nboard = []\r\ncount = 0\r\nfor i in range (0, n):\r\n row = []\r\n if i % 2 == 0:\r\n for j in range (0, n):\r\n if j % 2 == 0:\r\n row.append('C')\r\n count += 1\r\n else:\r\n row.append('.')\r\n else:\r\n for j in range (0, n):\r\n if j % 2 != 0:\r\n row.append('C')\r\n count += 1\r\n else:\r\n row.append('.')\r\n board.append(row)\r\nprint(count)\r\nfor row in board:\r\n print(\"\".join(row))", "n = int(input())\r\nprint(n*n//2 if n % 2 == 0 else n*n//2 + 1)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i % 2 == 0:\r\n print('C' if j % 2 == 0 else '.', end='')\r\n else:\r\n print('.' if j % 2 == 0 else 'C', end='')\r\n print()\r\n", "n=int(input())\r\nstring=''\r\nfor line in range(n):\r\n if line%2==0:\r\n sub=''\r\n for i in range(1,1+n):\r\n if i%2!=0:\r\n sub+='C'\r\n else:\r\n sub+='.'\r\n else:\r\n string+=sub+'\\n'\r\n\r\n\r\n else:\r\n sub=''\r\n for i in range(1,n+1):\r\n if i%2!=0:\r\n sub+='.'\r\n else:\r\n sub+='C'\r\n else:\r\n string+=sub+'\\n'\r\nprint(string.count('C'))\r\nprint(string)\r\n", "n=int(input())\r\nprint((n*n+1)//2)\r\nv=\"C.\"*n\r\nfor i in range(n):\r\n print(v[i:i+n])", "a = int(input())\r\nif a % 2 == 1:\r\n print(a ** 2 // 2 + 1)\r\nelse:\r\n print(a ** 2 // 2)\r\nfor i in range(a):\r\n b = ''\r\n if i % 2 == 0:\r\n for g in range(a):\r\n if g % 2 == 0:\r\n b += 'C'\r\n else:\r\n b += '.'\r\n else:\r\n for g in range(a):\r\n if g % 2 == 0:\r\n b += '.'\r\n else:\r\n b += 'C'\r\n print(b)", "n = int(input())\r\nif n % 2 == 0 :\r\n\tc = 'C.'*(n//2)\r\n\th = '.C'*(n//2)\r\n\tprint((n**2)//2)\r\n\tfor i in range(n//2):\r\n\t\tprint(c)\r\n\t\tprint(h)\r\nelse:\r\n\tc = 'C.'*(n//2)+'C'\r\n\th = '.C'*(n//2)+'.'\r\n\tprint((n**2+1)//2)\r\n\tfor i in range(n//2):\r\n\t\tprint(c)\r\n\t\tprint(h)\r\n\tprint(c)\r\n", "n = int (input())\r\nif n % 2 == 0:\r\n print(n**2 // 2)\r\nelse:\r\n print(n**2 // 2 + 1)\r\n\r\nodd = False\r\nfor i in range(1,n+1):\r\n str = \"\"\r\n while len(str) != n:\r\n if (odd):\r\n str += \".\"\r\n if(not odd):\r\n str +=\"C\"\r\n odd = not odd\r\n if len(str) % 2 == 0:\r\n odd = not odd \r\n print(str)", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n ans = []\r\n for i in range(1, n+1):\r\n s = ''\r\n for j in range(1,n+1):\r\n if j%2!=0:\r\n if i%2!=0:\r\n s += 'C'\r\n else:\r\n s += '.'\r\n else:\r\n if i%2!=0:\r\n s += '.'\r\n else:\r\n s += 'C'\r\n ans.append(s)\r\n q,r = 0,0\r\n if n%2 == 0:\r\n q = r = n//2\r\n else:\r\n q = n//2\r\n r = q+1\r\n print(f'{q**2+r**2}\\n'+'\\n'.join(ans))\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\ta=\"C.\"*n\n\tprint((n*n)//2 + (n%2))\n\tfor i in range(n):\n\t\tprint(a[i%2:(i%2)+n])\n\nsolve()\n", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nAB\r\nAABB\r\nABAB\r\n\r\nBBAA X\r\nAABBA\r\n\r\n010101\r\n\r\nx+y = n\r\nx = n - y\r\nx*y vs (n-y)^2\r\n\r\n0 = 1\r\n1 = 1\r\n01 = max(1*1) = 1\r\n10 = 1\r\n00 = 4\r\n11 = 4\r\n11110 = 16\r\n\r\ncompare biggest group of 1's 0's and num1's * num0's\r\n\r\n5 -1 -2\r\n'''\r\n\r\n# sys.stdin = open(\"backforth.in\", \"r\")\r\n# sys.stdout = open(\"backforth.out\", \"w\")\r\ninput = sys.stdin.readline\r\n\r\ndef dist(c1, c2):\r\n return abs(c1[0] - c2[0]) + abs(c1[1] - c2[1])\r\n\r\ndef solve():\r\n n = II()\r\n ans = 0\r\n\r\n if n & 1:\r\n for i in range(1,n,2):\r\n ans += i*2\r\n ans += n\r\n else:\r\n for i in range(2,n,2):\r\n ans += i*2\r\n ans += n\r\n\r\n board = []\r\n odd = ['C' if i%2 == 0 else '.' for i in range(n)]\r\n even = ['C' if i&1 else '.' for i in range(n)]\r\n\r\n\r\n\r\n print(ans)\r\n for i in range(1,n+1):\r\n if i&1:\r\n WNS(odd)\r\n else:\r\n WNS(even)\r\n\r\n\r\n\r\nsolve()", "n = int(input())\r\n\r\nif n % 2:\r\n print((n**2 + 1) // 2)\r\n type1 = \"C.\" * (n//2) + \"C\"\r\n type2 = \".C\" * (n//2) + \".\"\r\nelse:\r\n print((n**2) // 2)\r\n type1 = \"C.\" * (n//2)\r\n type2 = \".C\" * (n//2)\r\n\r\n\r\nfor i in range(n):\r\n print(type2 if i % 2 else type1)\r\n\r\n\"\"\"\r\n//////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n//////////////////////////////////////////\r\n\"\"\"", "f=lambda:map(int,input().split())\r\nn=int(input())\r\nprint([n**2//2,(n**2+1)//2][n%2])\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n print('C.'*(n//2)+'C' if n%2!=0 else 'C.'*(n//2))\r\n else:\r\n print('.C' * (n // 2) + '.' if n % 2 != 0 else '.C' * (n // 2))", "# https://codeforces.com/contest/384/problem/A\r\n\r\ndef sol(n):\r\n if(n&1):\r\n ans = (pow(n,2) + 1)//2\r\n else:\r\n ans = (pow(n,2))//2\r\n if(n==1):\r\n print(ans)\r\n print('C')\r\n else:\r\n print(ans)\r\n s = ''\r\n a = ''\r\n for i in range(n):\r\n if(i%2==0):\r\n s+='C'\r\n a+='.'\r\n else:\r\n s+='.'\r\n a+='C'\r\n for i in range(n):\r\n if(i%2==0):\r\n print(s)\r\n else:\r\n print(a)\r\n \r\n \r\n \r\nn = int(input())\r\nsol(n)", "n=int(input())\r\ntc=0\r\nans=[]\r\nfor i in range(n):\r\n if i%2==0:\r\n c=0\r\n y=\"\"\r\n for j in range(n):\r\n if j&1==0:\r\n y+=\"C\"\r\n c+=1\r\n else:\r\n y+=\".\"\r\n ans.append(y)\r\n tc+=c\r\n elif i&1:\r\n y=\"\"\r\n c=0\r\n for j in range(n):\r\n if j&1:\r\n y+=\"C\"\r\n c+=1\r\n else:\r\n y+=\".\"\r\n ans.append(y)\r\n tc+=c\r\nprint(tc)\r\nfor i in ans:\r\n print(i)\r\n", "from math import ceil\r\na = int(input())\r\nb = []\r\nprint(ceil((a*a)/2))\r\nfor i in range(1, a+1):\r\n if i % 2 == 1:\r\n print(*list('C'*ceil(a/2)), sep='.', end='.\\n' if a % 2 == 0 else '\\n')\r\n else:\r\n print(*list('.' * ceil(a / 2)), sep='C', end='C\\n' if a % 2 == 0 else '\\n')", "if __name__ == '__main__':\r\n n = int(input())\r\n s = n * n\r\n\r\n print((s // 2) + (s % 2))\r\n line_1, line_2 = 'C.' * ((n // 2) + 1), '.C' * ((n // 2) + 1)\r\n for i in range(n):\r\n if i % 2 == 0:\r\n print(line_1[:n])\r\n\r\n else:\r\n print(line_2[:n])\r\n", "n = int(input())\r\nc = ((n ** 2) + 1) // 2\r\nprint(c)\r\nfor i in range(n):\r\n s = \"\"\r\n for j in range(n):\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n s += \"C\"\r\n else:\r\n s += \".\"\r\n else:\r\n if j % 2 == 0:\r\n s += \".\"\r\n else:\r\n s += \"C\"\r\n print(s)", "n = int(input())\r\nif n%2 == 0:\r\n print(int(n*n/2))\r\nelse:\r\n print(int((1+n//2)*n-n//2))\r\nans = \"\"\r\nif n%2 == 0:\r\n for i in range(n):\r\n ans = \"\"\r\n for j in range(int(n/2)):\r\n if i%2 == 0:\r\n ans = ans + \"C.\"\r\n else:\r\n ans = ans + \".C\"\r\n print(ans)\r\nelse:\r\n for i in range(n):\r\n ans = \"\"\r\n for j in range(n):\r\n if i%2 == 0:\r\n if j%2 == 0:\r\n ans = ans + \"C\"\r\n else:\r\n ans = ans + \".\"\r\n else:\r\n if j%2 == 1:\r\n ans = ans + \"C\"\r\n else:\r\n ans = ans + \".\"\r\n print(ans)", "import math\r\nn = int(input())\r\nprint(math.ceil((n * n) / 2))\r\nt = 0\r\nfor i in range(n):\r\n if n % 2 == 0:\r\n t += 1\r\n for j in range(n):\r\n if t % 2: c = '.'\r\n else: c = 'C'\r\n print(c, end = \"\")\r\n t += 1\r\n print()\r\n ", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\n\r\nn=int(input())\r\n\r\nx=(n+1)//2\r\n\r\nprint(x*x+(n-x)*(n-x))\r\ns=['']*2\r\nfor i in range(2):\r\n for j in range(n):\r\n if j%2==i%2:\r\n s[i]+='C'\r\n else:\r\n s[i]+='.'\r\n\r\n\r\nfor i in range(n):\r\n print(s[i%2])\r\n\r\n", "a = int(input(\"\"))\r\nresult = []\r\nfor i in range(a):\r\n result.append([\".\"]*a)\r\nfs = 'C'\r\nss = '.'\r\nfor i in range(a-1):\r\n if fs[len(fs)-1] == 'C':\r\n fs = fs + '.'\r\n else:\r\n fs = fs + 'C'\r\n if ss[len(ss)-1] == 'C':\r\n ss = ss + '.'\r\n else:\r\n ss = ss +'C'\r\n\r\n \r\ntemp = 0\r\nif a % 2 == 1:\r\n print(int(((a*a)+1)/2))\r\nelse:\r\n print(int(((a*a))/2))\r\nfor i in range(a):\r\n if temp == 0:\r\n print(fs)\r\n temp = 1\r\n else:\r\n print(ss)\r\n temp = 0\r\n", "a=int(input())\r\nif a*a%2==0:\r\n print(a*a//2)\r\nelse:\r\n print((a*a//2)+1)\r\nn=0 \r\nfor i in range(a):\r\n if n==0: \r\n if a%2>0:\r\n print('C.'*(a//2),'C',sep='')\r\n else:\r\n print('C.'*(a//2))\r\n n+=1\r\n else:\r\n n=0\r\n if a%2>0:\r\n print('.C'*(a//2),'.',sep='')\r\n else:\r\n print('.C'*(a//2))\r\n ", "n=int(input())\r\nstr1,str2=[],[]\r\n\r\nfor i in range(n):\r\n if (i % 2 == 0):\r\n str1.append('C')\r\n str2.append('.')\r\n else:\r\n str2.append('C')\r\n str1.append('.')\r\n\r\nmoves=str1.count('C')**2+str2.count('C')**2\r\nprint(moves)\r\nfor i in range(n):\r\n if(i%2==0):\r\n print(''.join(str1))\r\n else:\r\n print(''.join(str2))\r\n\r\n\r\n", "n=int(input())\r\nf=0\r\nlst=[]\r\ns=\"\"\r\ncnt=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i%2:\r\n if f:\r\n s+=\"C\"\r\n f=0\r\n cnt+=1\r\n else:\r\n s+=\".\"\r\n f=1\r\n else:\r\n if f:\r\n s+=\".\"\r\n f=0\r\n else:\r\n s+=\"C\"\r\n f=1\r\n cnt+=1\r\n f=0\r\n lst.append(s)\r\n s=\"\"\r\nprint(cnt)\r\nfor i in range(n):\r\n print(lst[i])\r\n\r\n\r\n\r\n\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nn=int(input())\r\nl=[['.' for i in range(n)]for j in range(n)]\r\nc=0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i%2==0:\r\n\t\t\tif j%2==0:\r\n\t\t\t\tl[i][j]='C'\r\n\t\t\t\tc+=1\r\n\t\telse:\r\n\t\t\tif j%2!=0:\r\n\t\t\t\tl[i][j]='C'\r\n\t\t\t\tc+=1\r\n \r\nprint(c)\r\nfor i in range(n):\r\n\ts=''.join(l[i])\r\n\tprint(s)", "# 1674585970903\r\nn = int(input())\r\n\r\nprint(n*(n//2) + (n%2)*((n+1)//2))\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n print('C.'*(n//2)+'C'*(n%2))\r\n else:\r\n print('.C'*(n//2)+'.'*(n%2))", "N = int(input())\r\nprint((N // 2 + (N%2))**2 + (N // 2) ** 2)\r\nfor i in range(N):\r\n print(''.join([('C' if (j+i)%2 == 0 else '.') for j in range(N)]))", "n=int(input())\r\nif n%2==0:\r\n print(n**2//2)\r\nelse:\r\n print(n**2//2+1)\r\nfor i in range(n):\r\n x=''\r\n for j in range(n):\r\n if i%2==0:\r\n if j%2==0:\r\n x+='C'\r\n else:\r\n x+='.'\r\n else:\r\n if j%2==0:\r\n x+='.'\r\n else:\r\n x+='C'\r\n print(x)\r\n", "n=int(input())\r\nl=[]\r\ncnt=0\r\nfor z in range(n):\r\n s=\"\"\r\n if z%2==0:\r\n for y in range(n):\r\n if y%2==0:\r\n s+=\"C\"\r\n cnt+=1\r\n else :\r\n s+=\".\"\r\n else :\r\n for y in range(n):\r\n if y%2==0:\r\n s+=\".\"\r\n else :\r\n s+=\"C\"\r\n cnt+=1\r\n l.append(s)\r\nprint(cnt)\r\nprint(*l,sep=\"\\n\")", "number = int(input())\r\nstart = 1\r\ncounter = 0\r\narr = []\r\nfor i in range( 0 , number) :\r\n start = 0 if start == 1 else 1\r\n now = \"C\" if start == 0 else \".\"\r\n ar = \"\"\r\n for j in range(0 , number) :\r\n ar += \"C\"if now == \"C\" else \".\"\r\n now = \".\" if now == \"C\" else \"C\"\r\n counter += 1 if now == '.' else 0\r\n arr.append(ar)\r\nprint(counter)\r\nfor i in arr :\r\n print(i)", "\r\ndef main():\r\n n = int(input())\r\n c = 0\r\n data =[]\r\n for i in range(n):\r\n res = \"\"\r\n for j in range(n):\r\n if i%2==0:\r\n res+=\"C\" if j%2==0 else \".\"\r\n if j%2==0:\r\n c+=1\r\n else:\r\n res += \"C\" if j % 2 != 0 else \".\"\r\n if j%2!=0:\r\n c+=1\r\n data.append(res)\r\n print(c)\r\n for l in data:\r\n print(l)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\n n = int(input())\n total = (n // 2) * n if n % 2 == 0 \\\n else (n // 2) * n + (n + 1) // 2\n\n print(total)\n for i in range(n):\n s = ''\n\n if n % 2 == 0:\n s = 'C.' * (n // 2) if i % 2 == 0 \\\n else '.C' * (n // 2)\n else:\n s = 'C.' * (n // 2) + 'C' if i % 2 == 0 \\\n else '.C' * (n // 2) + '.'\n\n print(s)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\n\r\nL=['C','.']\r\ncnt=0\r\nAns=\"\"\r\nfor i in range(n):\r\n x=i%2\r\n for j in range(n):\r\n Ans+=L[x]\r\n if(x==0):\r\n cnt+=1\r\n x=1-x\r\n Ans+=\"\\n\"\r\nprint(cnt)\r\nprint(Ans,end=\"\")\r\n", "import math\r\nn = (int)(input())\r\nprint(math.ceil((n*n)/2))\r\n\r\nx = ''\r\nfor z in range(0 , n , 1):\r\n if z%2 == 0:\r\n x += 'C'\r\n else:\r\n x += '.'\r\n\r\ny = ''\r\nfor z in range(0 , n , 1):\r\n if z%2 == 0:\r\n y += '.'\r\n else:\r\n y += 'C'\r\n\r\nfor q in range(0 , n , 1):\r\n if q%2 == 0:\r\n print(x)\r\n else:\r\n print(y)\r\n", "n = int(input())\r\na = n // 2\r\nif n%2 == 0:\r\n print(n**2//2)\r\n for i in range(n):\r\n if i%2 == 0:\r\n print('C.'*a)\r\n else:\r\n print('.C'*a)\r\n \r\nelse:\r\n m = (n-1)//2\r\n print(m**2 + (m+1)**2)\r\n for i in range(n):\r\n if i%2 == 0:\r\n print('C.'*a + 'C')\r\n else:\r\n print('.C'*a + '.')", "import sys\r\nt=int(input())\r\nn=0\r\nfor i in range(t):\r\n for j in range(t):\r\n if(i%2==j%2):\r\n n=n+1\r\nprint(n)\r\nfor i in range(t):\r\n for j in range(t):\r\n if(i%2==j%2):\r\n sys.stdout.write(\"C\") \r\n else:\r\n sys.stdout.write(\".\") \r\n sys.stdout.write(\"\\n\")", "n = int(input())\r\ntot = 0\r\nout = \"\"\r\nfor i in range(n):\r\n for ii in range(n):\r\n if (i+ii) % 2 == 0:\r\n out += \"C\"\r\n tot += 1\r\n else:\r\n out += \".\"\r\n out += \"\\n\"\r\nprint(tot)\r\nprint(out)\r\n", "n = int(input())\r\nprint(n*n//2 + (n%2))\r\nx = 'C.' * (n // 2)\r\ny = '.C' * (n // 2)\r\nfor i in range(0,n):\r\n if(i % 2 == 0):\r\n print(x,end = '')\r\n if(n % 2):\r\n print('C',end = '')\r\n if(i % 2 == 1):\r\n print(y,end = '')\r\n if(n % 2):\r\n print('.',end = '')\r\n print()\r\n\r\n", "def answer():\r\n a = int(input())\r\n print(int((a**2)/2)+a%2)\r\n i=1\r\n while i<=a:\r\n j=1\r\n c_out=\"\"\r\n \r\n while j<=a:\r\n if j%2==i%2:\r\n start=\"C\"\r\n else:\r\n start=\".\"\r\n c_out+=start\r\n j+=1\r\n print(c_out)\r\n i+=1\r\nanswer()", "n = int(input())\r\nif n % 2 == 0:\r\n print((int(n // 2)) * n)\r\n for i in range(int(n//2)):\r\n print(\"C.\"*(int(n//2)));print(\".C\"*(int(n//2)))\r\nelse:\r\n print((int(n // 2) + 1) ** 2 + (int(n // 2)) ** 2)\r\n for i in range(int(n//2)):\r\n print(\"C.\" * (int(n // 2)) + \"C\");print(\".C\" * (int(n//2)) + \".\")\r\n print(\"C.\" * (int(n // 2)) + \"C\")", "n = int(input())\nans = (n ** 2 + 1) // 2\nprint(ans)\nfor i in range(n):\n result = \"\"\n for j in range(n):\n if (i - j) % 2 == 0:\n result += \"C\"\n else:\n result += \".\"\n print(result)\n", "n=int(input())\r\nprint(int((n*n)/2) if n%2==0 else int((n*n)/2)+1)\r\nfor i in range(n):\r\n print(\"\".join([\"C\" if not bool((i+j)%2) else \".\" for j in range(n)]))\r\n\r\n", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn = int(input())\r\ncnt = 0\r\nans = []\r\nfor i in range(n):\r\n x = ''\r\n for j in range(n):\r\n if i % 2 == 0 and j % 2 == 0:\r\n x += 'C'\r\n cnt += 1\r\n elif i % 2 == 0 and j % 2:\r\n x += '.'\r\n elif i % 2 and j % 2 == 0:\r\n x += '.'\r\n else:\r\n x += 'C'\r\n cnt += 1\r\n ans.append(x)\r\nprint(cnt)\r\nfor r in ans:\r\n print(r)", "def solve(n):\n m = [['.']*(n+2) for _ in range(n+2)]\n c = 0\n for i in range(1, n+1):\n for j in range(1, n+1):\n if m[i+1][j] == '.' and \\\n m[i-1][j] == '.' and \\\n m[i][j-1] == '.' and \\\n m[i][j+1] == '.':\n m[i][j] = \"C\"\n c += 1\n print(c)\n for i in range(1, n+1):\n print(''.join(m[i][1:-1]))\n\n\ndef main():\n n = int(input())\n solve(n)\n\n\nmain()\n", "n=int(input())\nl=list()\ndot=0\nlet=0\nfor i in range(0,1002):\n\tif i%2==0:\n\t\tl.append('C')\n\telse:\n\t\tl.append('.')\nif n%2==0:\n\tdot=int(n/2)\n\tlet=int(n/2)\nelse:\n\tlet=int(n/2)+1\n\tdot=int(n/2)\nprint((dot*dot)+(let*let))\nfor i in range(0,n):\n\tif i%2==0:\n\t\tprint(\"\".join(l[0:n]))\n\telse:\n\t\tprint(\"\".join(l[1:n+1]))", "n = int(input())\r\n\r\nk = n // 2\r\nprint(n * k + (n % 2) * (k + 1))\r\n\r\ns = 'C.' * (k + 1) \r\nfor i in range(n):\r\n q = i % 2\r\n print(s[q : n + q])\r\n", "n = int(input())\r\nif n%2 == 0:\r\n\tres = (n*(n//2))\r\nelse:\r\n\tres = (n*(n//2) + (n//2) + 1)\r\nprint (res)\r\nline1 = []\r\nline2 = []\r\nturn = True\r\nfor i in range(n):\r\n\tif turn: \r\n\t\tline1.append('C')\r\n\t\tline2.append('.')\r\n\telse:\r\n\t\tline1.append('.')\r\n\t\tline2.append('C')\r\n\tturn = not turn\r\nturn = True\r\nstr1 = \"\".join(line1)\r\nstr2 = \"\".join(line2)\r\nfor i in range(n):\r\n\tif turn:\r\n\t\tprint (str1)\r\n\telse:\r\n\t\tprint (str2)\r\n\tturn = not turn", "n=int(input())\ns=\"\"\np=[]\ns1=0\nfor i in range(n):\n if i%2==0:\n for j in range(n):\n if j%2==0:\n #print(\"C\",end=\"\")\n s+=\"C\"\n s1+=1\n else:\n # print(\".\",end=\"\")\n s+=\".\"\n p+=[s]\n s=\"\"\n else:\n for j in range(n):\n if j%2==0:\n #print(\".\",end=\"\")\n s+=\".\"\n \n else:\n #print(\"C\",end=\"\")\n s+=\"C\"\n s1+=1\n p+=[s]\n s=\"\"\nprint(s1)\nfor i in p:\n print(i)\n", "from collections import *\nimport sys \ninput=sys.stdin.readline\n\n# \"\". join(strings) \n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \nn = ri()\n\nif n % 2 == 0:\n\tprint(n // 2 * n)\n\tfor i in range(n):\n\t\tif i % 2 == 0:\n\t\t\tprint(\"C.\"*(n//2))\n\t\telse:\n\t\t\tprint(\".C\"*(n//2))\n\nif n % 2 == 1:\n\tk = n // 2 # n = 2*k + 1\n\tprint((k+1)**2 + k**2)\n\tfor i in range(n):\n\t\tif i % 2 == 0:\n\t\t\tprint(\"C.\"*k + \"C\")\n\t\telse:\n\t\t\tprint(\".C\"*k + \".\")\n", "n = int(input())\r\ngrid = [[\".\" for _ in range(n)] for k in range(n)]\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n grid[i][j] = \"C\"\r\n cnt += 1\r\n else:\r\n if j % 2 != 0:\r\n grid[i][j] = \"C\"\r\n cnt += 1\r\nprint(cnt)\r\nfor i in range(n):\r\n print(\"\".join(grid[i]))", "s1, s2 = \"\", \"\"\r\nn = int(input())\r\n\r\nif n%2==0:\r\n print(int((n/2)*n))\r\n for y in range(int(n/2)):\r\n s1+=\"C.\"\r\n s2+=\".C\"\r\n for x in range(int(n/2)):\r\n print(s1)\r\n print(s2)\r\n\r\nif n%2!=0:\r\n x = int(n/2 + 1)\r\n print(x*x + (x-1)*(x-1))\r\n for y in range(int(n / 2)):\r\n s1+=\"C.\"\r\n s2+=\".C\"\r\n for z in range(int(n/2)):\r\n print(s1+\"C\")\r\n print(s2+\".\")\r\n print(s1+\"C\")", "def main():\r\n lst = ['.' for x in range(0, 500)]\r\n s = 'C'.join(lst) + 'C'\r\n lst = ['C' for x in range(0, 500)]\r\n s_ = '.'.join(lst) + '.'\r\n \r\n n = int(input())\r\n \r\n if ((n*n) % 2 == 0):\r\n print((n*n)//2)\r\n else:\r\n print((n*n)//2 + 1)\r\n \r\n cs = s[:n]\r\n cs_ = s_[:n]\r\n flag = True\r\n for i in range(n):\r\n if(flag):\r\n print(cs_)\r\n flag = False\r\n else:\r\n print(cs)\r\n flag = True\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\nans=0\nfor i in range(n,0,-1):\n\t#print(ans)\n\t#if i==1 :\n\t\t#ans+=1\n\n\tif i%2==0:\n\t\tans+=(2*(i//2))-1\n\telse:\n\t\tans+=(2*((i//2)+1))-1\t\nprint(ans)\t\n\n\nif n%2==0:\n\n\tfor i in range(n//2):\n\t\tprint('.C'*(n//2)) \n\t\tprint('C.'*(n//2))\nelse:\n\tfor i in range(1,n+1):\n\t\tif i%2!=0:\n\t\t\tprint(('C.'*(n//2))+'C')\n\t\telse:\n\t\t\tprint(('.C'*(n//2))+'.')\t\t\t", "n = int(input())\r\ns, t = 'C.' * 500, '.C' * 500\r\nif n % 2 == 0:\r\n print(n * (n // 2))\r\nelse:\r\n print((n - 1) * (n - 1) // 2 + n)\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n print(s[:n:])\r\n else:\r\n print(t[:n:])", "import math\r\n\r\nn = int(input())\r\nprint(math.ceil(n*n/2))\r\nodd_s = ''\r\neven_s = ''\r\nfor i in range(1, n+1):\r\n odd_s += ('C' if i%2 == 1 else '.')\r\n even_s += ('C' if i%2 == 0 else '.')\r\nfor i in range(1, n+1):\r\n if i%2 == 1:\r\n print(odd_s)\r\n else:\r\n print(even_s)\r\n", "'''HackerRank: Coder'''\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n if n % 2 == 0:\r\n print(int(n * n / 2))\r\n else:\r\n print(int((n * n + 1) / 2))\r\n\r\n arr = ['C', '.'] * n\r\n for i in range(n):\r\n if i % 2 == 1:\r\n print(*arr[1:n+1], sep='')\r\n else:\r\n print(*arr[:n], sep='')\r\n", "s=''\r\nn=int(input())\r\nl=[1,2]*n\r\nfor i in range(n):\r\n if l[i]==1:\r\n for j in range(n):\r\n if l[j]==1:\r\n s+='C'\r\n else:\r\n s+='.'\r\n else:\r\n for j in range(n):\r\n if l[j]==1:\r\n s+='.'\r\n else:\r\n s+='C'\r\n s+='\\n'\r\nprint(s.count('C'))\r\nprint(s)", "n = int(input())\r\nif n % 2 == 0:\r\n print((n * n) // 2)\r\nelse:\r\n print((n // 2 * n) + (n - n // 2))\r\ns1 = \".\"\r\ns2 = \"C\"\r\nfor i in range(n - 1):\r\n if i % 2 == 0:\r\n s1 = s1 + \"C\"\r\n s2 = s2 + \".\"\r\n\r\n else:\r\n s1 = s1 + \".\"\r\n s2 = s2 + \"C\"\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n print(s2)\r\n else:\r\n print(s1)", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\ndef ii():\r\n return int(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return list(map(str, input().split()))\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n#╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\nn = int(input())\r\ns = (n*n+1)//2\r\nprint(s)\r\nfor i in range(n):\r\n print(('C.'*n)[i:i+n])\r\n ", "n = int(input())\n\nif (n % 2 == 0):\n print(n**2//2)\nelse:\n print(n**2//2 + 1)\n\nfor i in range(n):\n line = ''\n for j in range (n):\n if ((i+j) % 2 == 0):\n line += 'C'\n else:\n line += '.'\n print(line)\n\n", "#In the name of Allah\r\n\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\n\r\nstdout.write(str(n * n // 2 + n % 2) + \"\\n\")\r\n\r\nbrd = [[\".\"] * n for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i + j) % 2 == 0:\r\n brd[i][j] = \"C\"\r\n\r\nfor ln in brd:\r\n stdout.write(\"\".join(ln) + \"\\n\")\r\n", "n = int(input())\r\nrow1 = ('C.' * (n // 2))\r\nrow2 = ('.C' * (n // 2))\r\n\r\nif (n % 2 == 0):\r\n print(n * n // 2)\r\n res = (row1 + '\\n' + row2 + '\\n') * (n // 2)\r\n print(res)\r\nelse:\r\n print(n * (n // 2 + 1) - n // 2)\r\n row1 += 'C'\r\n row2 += '.'\r\n res = (row1 + '\\n' + row2 + '\\n') * (n // 2) + row1\r\n print(res)", "n = int(input())\r\nprint((n * n + 1) // 2)\r\nfor i in range(n):\r\n\tprint(('C.'*1000)[i % 2:i % 2 + n])\r\n", "'''a=[int(i) for i in input().split()]\r\nx=a[0]\r\ny=a[1]\r\nz=a[2]\r\nif y==x and z==0:\r\n print('0')\r\nelif x>y+z:\r\n print('+')\r\nelif y>x+z:\r\n print('-')\r\nelse:\r\n print('?')\r\nn=int(input())\r\nz=[int(i) for i in input().split()]\r\nx=[]\r\nd=0\r\nv=''\r\nfor i in range(n):\r\n c=0\r\n e=0\r\n for f in range(len(z)):\r\n if z[f]>c and f+1 not in x:\r\n c=z[f]\r\n e=f+1\r\n d+=(i*c)+1\r\n x.append(e)\r\nprint(d)\r\nfor i in x:\r\n v+=str(i)\r\n v+=' '\r\nprint(v)\r\n\r\nf=int(input())\r\ng=[int(i) for i in input().split()]\r\nfor i in range(len(g)-1):\r\n for f in range(len(g)-1-i):\r\n if g[f]>g[f+1]:\r\n g[f],g[f+1]=g[f+1],g[f]\r\nif g[0]*g[1]>g[-2]*g[-3] and g[-1]>0:\r\n print(g[-1]*g[0]*g[1])\r\nelse:\r\n print(g[-1]*g[-2]*g[-3])\r\nfor u in range(int(input())):\r\n z=int(input())\r\n y=[int(f) for f in input().split()]\r\n y.sort()\r\n d=0\r\n for i in y:\r\n d+=i\r\n if d<2048:\r\n print('No')\r\n continue\r\n if 2048 in y:\r\n print('yes')\r\n continue\r\n for x in range(z+1):\r\n if 2048 in y:\r\n print('yes')\r\n break\r\n for i in range(len(y)-1):\r\n if y[i]==y[i+1]:\r\n y[i+1]=y[i]*2\r\n y.pop(i)\r\n if i>len(y)-3:\r\n break\r\n y.sort()\r\n else:\r\n print('no')\r\nn=int(input())\r\nx=[]\r\nfor i in range(1,((n**2)//2)+1):\r\n x.append(n**2+1-i)\r\n x.append(i)\r\n if len(x)==n:\r\n print(*x)\r\n x=[]\r\nfor z in range(int(input())):\r\n z=int(input())\r\n x=[int(i) for i in input().split()]\r\n f=0\r\n o=0\r\n t=0\r\n for i in range(z):\r\n if x[i]%3==0:\r\n f+=1\r\n elif x[i]%3==1:\r\n o+=1\r\n else:\r\n t+=1\r\n if o<t:\r\n print(f+o+(t-o)//3)\r\n else:\r\n print(f+t+(o-t)//3)\r\nn=int(input())\r\nif n%2==1:\r\n print(0)\r\nelif n%4==0:\r\n print((n//4)-1)\r\nelse:\r\n print(n//4)\r\nn=[int(i) for i in input().split()]\r\nif n[2]>=0 and n[0]>n[1]:\r\n print('NO')\r\nelif n[2]<=0 and n[0]<n[1]:\r\n print('NO')\r\nelif n[2]==0:\r\n if n[0]==n[1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif (n[1]-n[0])%n[2]==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\nfor f in range(int(input())):\r\n f=[int(i) for i in input().split()]\r\n a=f[0]\r\n b=f[1]\r\n c=f[2]\r\n r=f[3]\r\n a,b=min(a,b),max(a,b)\r\n if c+r<=a or c-r>=b:\r\n print(b-a)\r\n elif c<=a:\r\n print(max(b-c-r,0))\r\n elif c>=b:\r\n print(max(c-a-r,0))\r\n else:\r\n v=max(b-c-r,0)\r\n print(v+max(c-a-r,0))\r\ndef bt(p,c):\r\n if c%p+c//p==0:\r\n return ''\r\n else:\r\n return bt(p,c//p)+str(c%p)\r\nprint(bt(int(input()),int(input())))\r\nfor t in range(int(input())):\r\n t=[int(i) for i in input().split()]\r\n n=t[0]\r\n m=t[1]\r\n x=t[2]\r\n y=t[3]\r\n d=0\r\n for f in range(n):\r\n e=input()\r\n c=0\r\n for i in range(m):\r\n if c==0 and i==m-1:\r\n if e[i]=='.':\r\n d+=x\r\n break\r\n elif c==1:\r\n c=0\r\n continue\r\n else:\r\n if e[i]=='.' and e[i+1]=='.' and y<2*x:\r\n c=1\r\n d+=y\r\n elif e[i]=='.':\r\n d+=x\r\n else:\r\n continue\r\n print(d)\r\nx=[int(i) for i in input().split()]\r\nd=x[3]\r\nx.pop(3)\r\nx.sort()\r\na=x[0]\r\nb=x[1]\r\nc=x[2]\r\nprint(max(d-b+a,0)+max(d+b-c,0))\r\nd=int(input())\r\ns=input()\r\nx=s.count('0')\r\ny=s.count('1')\r\nif y!=x:\r\n print(1)\r\n print(s)\r\nelse:\r\n print(2)\r\n print(s[0:-1],s[-1],sep=' ')\r\nfrom random import choice\r\ndef qs(y):\r\n if len(y)<2:\r\n return y\r\n d=choice(y)\r\n s=[]\r\n e=[]\r\n l=[]\r\n for i in y:\r\n if i<d:\r\n s.append(i)\r\n elif i>d:\r\n l.append(i)\r\n else:\r\n e.append(i)\r\n return qs(l)+e+qs(s)\r\nn=int(input())\r\nm=int(input())\r\na=[]\r\nd=0\r\nfor i in range(n):\r\n a.append(int(input()))\r\nc=qs(a)\r\nfor i in range(n):\r\n d+=c[i]\r\n if d>=m:\r\n print(i+1)\r\n break'''\r\nn=int(input())\r\nif n%2==0:\r\n print((n**2)//2)\r\nelse:\r\n print(((n**2)//2)+1)\r\nfor f in range(n):\r\n c=''\r\n for i in range(n):\r\n if f%2==0:\r\n if i%2==0:\r\n c+='C'\r\n else:\r\n c+='.'\r\n else:\r\n if i%2==1:\r\n c+='C'\r\n else:\r\n c+='.'\r\n print(c)\r\n \r\n", "n=int(input())\r\nfinal=0\r\neven1='C.'\r\neven2='.C'\r\nif n%2==0:\r\n final=int((n**2)/2)\r\n print(final)\r\n for i in range(n):\r\n if i%2==0:\r\n print(even1*int(n/2))\r\n else:\r\n print(even2*int(n/2))\r\nelse:\r\n final=int((((n**2)+1)/2))\r\n print(final)\r\n for i in range(n):\r\n if i%2==0:\r\n print(even1*int((n-1)/2)+even1[0])\r\n else:\r\n print(even2*int((n-1)/2)+even2[0])", "n=int(input())\r\nc=0\r\nres=[]\r\nif n%2==0:\r\n print((n*n)//2)\r\n for i in range(n):\r\n for j in range(n):\r\n if i%2==0:\r\n if j%2==0:\r\n print(\".\",end=\"\")\r\n else:\r\n print(\"C\",end=\"\")\r\n else:\r\n if j%2==0:\r\n print(\"C\",end=\"\")\r\n else:\r\n print(\".\",end=\"\")\r\n print()\r\nelse:\r\n t=(n//2)\r\n print((t*t)+(t+1)*(t+1))\r\n for i in range(n):\r\n for j in range(n):\r\n if i%2==0:\r\n if j%2==0:\r\n print(\"C\",end=\"\")\r\n else:\r\n print(\".\",end=\"\")\r\n else:\r\n if j%2==0:\r\n print(\".\",end=\"\")\r\n else:\r\n print(\"C\",end=\"\")\r\n print()\r\n \r\n", "n = int(input())\nif n %2 == 0:\n print(int(n**2/2))\nelse:\n print(int(n**2/2)+1)\n\nfor i in range(1,n+1):\n s = ''\n if i%2 != 0:\n for j in range(1,n+1):\n if j%2 != 0:\n s = s+'C'\n else:\n s = s+'.'\n else:\n for j in range(1,n+1):\n if j%2 !=0:\n s = s+'.'\n else:\n s = s+'C'\n print(s)\n \n \n", "n = int(input())\r\nif n%2==0:\r\n\tprint((n*n)//2)\r\nelse:\r\n\tprint(((n*n)//2)+1)\r\nfor i in range(n):\r\n\tif n%2==0:\r\n\t\tif i%2==0:\r\n\t\t\tprint(\"C.\"*(n//2))\r\n\t\telse:\r\n\t\t\tprint(\".C\"*(n//2))\r\n\telse:\r\n\t\tif i%2==0:\r\n\t\t\tprint(\"C.\"*(n//2)+\"C\")\r\n\t\telse:\r\n\t\t\tprint(\".C\"*(n//2)+\".\")", "from sys import stdin\r\nfrom sys import stdout\r\nfrom math import ceil\r\n#Fast IO\r\ndef glis():\r\n\treturn list(map(int,(stdin.readline().strip().split())))\r\n\r\ndef gtis():\r\n\treturn tuple(map(int,stdin.readline().strip().split()))\r\n\r\ndef gstr():\r\n\treturn stdin.readline().strip().split()\r\n\r\ndef gi():\r\n\treturn int(stdin.readline().strip())\r\n\r\ndef gcl():\r\n\ts=stdin.readline().strip().split()\r\n\treturn list(s[:len(s)-1])\r\n\r\ndef p(x,end='\\n'):\r\n\tstdout.write(str(x)+end)\r\n\r\ndef pi(s):\r\n\tp(' '.join(map(str,s)))\r\n\r\ndef main():\r\n\tt=gi()\r\n\tp(ceil((t**2)/2))\r\n\ty=t\r\n\ti='C'\r\n\twhile y>0:\r\n\t\tfor k in range(t):\r\n\t\t\tif k==t-1:\r\n\t\t\t\tp(i)\r\n\t\t\t\tif t%2!=0:\r\n\t\t\t\t\tif i=='C':\r\n\t\t\t\t\t\ti='.'\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\ti='C'\r\n\t\t\telse:\r\n\t\t\t\tp(i,end='')\r\n\t\t\t\tif i=='C':\r\n\t\t\t\t\ti='.'\r\n\t\t\t\telse:\r\n\t\t\t\t\ti='C'\r\n\t\ty-=1\r\n\r\n\r\nif __name__=='__main__':\r\n\tmain()", "n = int(input())\r\na=\"C.\"*n\r\nprint([(n**2)//2,(n**2 + 1)//2][n%2!=0])\r\nfor i in range(n):\r\n print(a[i:i+n])", "import math\r\nn = int(input())\r\ncnt = 0\r\nans = []\r\nfor i in range(n):\r\n s = ['.'] * n\r\n for j in range(n):\r\n if j % 2 == i % 2:\r\n s[j] = 'C'\r\n cnt += 1\r\n ans.append(''.join(s))\r\nprint(cnt)\r\nfor x in ans:\r\n print(x)", "import math\r\n\r\na=int(input())\r\nprint(math.ceil(pow(a,2)/2))\r\nif a%2==0:\r\n for i in range(a):\r\n if(i%2==0): print('C.'*int(a/2))\r\n else: print('.C'*int(a/2))\r\nelse:\r\n for i in range(a):\r\n if(i%2==0): print('C.'*int(a/2)+'C')\r\n else: print('.C'*int(a/2)+\".\")", "import math\r\nn = int(input())\r\nl = 1\r\nans = math.ceil(n * n / 2)\r\nprint(ans)\r\nfor i in range(n):\r\n s = \"\"\r\n for j in range(n):\r\n if l % 2 == 0:\r\n s += \".\"\r\n else:\r\n s += \"C\"\r\n l += 1\r\n print(s)\r\n if n % 2 == 0:\r\n l += 1", "n = int(input())\r\nt = ''\r\nc = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n t += 'C'\r\n c += 1\r\n else:\r\n t += '.'\r\n else:\r\n if j % 2 == 0:\r\n t += '.'\r\n else:\r\n t += 'C'\r\n c += 1\r\n t+='\\n'\r\nprint(c)\r\nprint(t)", "import math\r\nn=int(input())\r\narr = []\r\nif n%2 == 0:\r\n print(str(int((n/2)*n)))\r\n for z in range(n):\r\n line= ['.' for i in range(n)]\r\n for i in range(len(line)):\r\n if z%2 == 0 and i%2==0:\r\n line[i]='C'\r\n elif z%2 !=0 and i%2 != 0:\r\n line[i]='C'\r\n arr.append(line)\r\n for a in arr:\r\n print(''.join(a))\r\nelse:\r\n s=0\r\n for i in range(n):\r\n if i % 2 == 0:\r\n s+= math.ceil(n/2)\r\n else:\r\n s+= math.ceil(n/2) -1\r\n print(str(s))\r\n\r\n for z in range(n):\r\n line= ['.' for i in range(n)]\r\n for i in range(len(line)):\r\n if z%2 == 0 and i%2==0:\r\n line[i]='C'\r\n elif z%2 !=0 and i%2 != 0:\r\n line[i]='C'\r\n arr.append(line)\r\n for a in arr:\r\n print(''.join(a))", "n=int(input())\r\ns=\"C.\"*n\r\nk=n//2+n%2\r\nq=n*(n//2)+n%2*k\r\nprint(q)\r\nfor i in range(n):\r\n if i%2:\r\n print(s[1:n+1])\r\n else:\r\n print(s[:n])", "n = int(input())\r\nchessboard = []\r\ncount = 0\r\nfor i in range(n):\r\n temp = [\".\"] * n\r\n if i % 2 == 0:\r\n for j in range(0, n, 2):\r\n count += 1\r\n temp[j] = \"C\"\r\n else:\r\n for k in range(1, n, 2):\r\n count += 1\r\n temp[k] = \"C\"\r\n chessboard.append(temp)\r\nprint(count)\r\nfor i in range(n):\r\n print(\"\".join(chessboard[i]))", "n=int(input())\r\n\r\nans=n**2\r\nans=(ans+1)//2\r\nprint(ans)\r\n\r\ntemp1=[]\r\n\r\nfor i in range(n):\r\n if i%2==0:\r\n temp1.append(\"C\")\r\n else:\r\n temp1.append(\".\")\r\n\r\ntemp2=[]\r\n\r\nfor i in range(n):\r\n if i%2==0:\r\n temp2.append(\".\")\r\n else:\r\n temp2.append(\"C\")\r\n\r\narr=[]\r\n\r\nfor i in range(n):\r\n if (i%2==0):\r\n arr.append(temp1)\r\n else:\r\n arr.append(temp2)\r\n\r\n\r\n\r\ndef solve(arr):\r\n for i in range(len(arr)):\r\n print(arr[i],end='')\r\n print(\"\")\r\n\r\nfor i in range(n):\r\n solve(arr[i])\r\n\r\n", "a = int(input())\r\nif a%2==1:\r\n print(a*a//2+1)\r\nelse:\r\n print(a*a//2)\r\nch=[\"C\",\".\"]\r\nfs = [\" \"]*a\r\nss = [\" \"]*a\r\nfor i in range(a):\r\n fs[i] = ch[i%2]\r\nfor i in range(a):\r\n ss[i] = ch[(i+1)%2]\r\nfs = \"\".join(fs)\r\nss = \"\".join(ss)\r\nfor i in range(a):\r\n if i%2 == 0:\r\n print(fs)\r\n else:\r\n print(ss)\r\n", "n=int(input())\r\na=\"C.\"*n\r\nprint((n*n+1)//2)\r\nfor i in range(n):\r\n print(a[i:i+n])", "N = int(input())\nCodeR = 0\nif N%2 == 0:\n CodeR = N* N//2\nelif(N%2 != 0):\n CodeR = (N* (N//2)) + (N//2) + 1\nprint(CodeR)\nfor i in range(N):\n if(i%2 == 0):\n if (N%2 == 0):\n print(\"C.\"*(N//2))\n elif(N%2 != 0):\n print(\"C.\"*(N//2)+\"C\")\n else:\n if (N%2 == 0):\n print(\".C\"*(N//2))\n elif(N%2 != 0):\n print(\".C\"*(N//2)+\".\")", "n = int(input())\r\n\r\nprint(n*n//2 if n % 2 == 0 else n*n//2+1)\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n if n % 2 == 0:\r\n print('C.'*(n//2))\r\n else:\r\n print('C.' * (n // 2)+'C')\r\n else:\r\n if n % 2 == 0:\r\n print('.C'*(n//2))\r\n else:\r\n print('.C'*(n//2)+'.')\r\n", "n=int(input())\r\nif(n%2==0):\r\n print(int(n/2)*n)\r\nelif(n%2==1):\r\n if(n==3):\r\n print(5)\r\n else:\r\n d=(n//2+1)*(n//2+1)\r\n e=(n-(n//2+1))*(n-(n//2+1))\r\n print(d+e)\r\nfor i in range(n):\r\n if(i%2==0):\r\n if(n%2==0):\r\n print(\"C.\"*int(n/2))\r\n else:\r\n print(\"C.\"*int((n-1)/2),end=\"\")\r\n print(\"C\")\r\n else:\r\n if(n%2==0):\r\n print(\".C\"*int(n/2))\r\n else:\r\n print(\".C\"*int((n-1)/2),end=\"\")\r\n print(\".\")\r\n", "n=int(input())\nl=[]\nnb=0\nfor i in range(n):\n\tl.append([])\n\tif i%2==0:\n\t\tfor k in range(n):\n\t\t\tif k%2==0:\n\t\t\t\tl[i].insert(k,\"C\")\n\t\t\t\tnb+=1\n\t\t\telse:\n\t\t\t\tl[i].insert(k,\".\")\n\t\t\t\t\n\telse:\n\t\tfor k in range(n):\n\t\t\tif k%2==0:\n\t\t\t\tl[i].insert(k,\".\")\n\t\t\telse:\n\t\t\t\tl[i].insert(k,\"C\")\n\t\t\t\tnb+=1\n\nprint(nb)\nfor i in range(n):\n\tprint(''.join(map(str, l[i])))\n\n\n\n\n", "if __name__ == '__main__':\r\n n = int(input())\r\n c = 0\r\n for i in range(1,n,2):\r\n c += 2*i\r\n if n % 2 == 1:\r\n c += n\r\n s1 = \"\"\r\n s2 = \"\"\r\n for i in range(n):\r\n if i % 2 == 1:\r\n s1 += \"C\"\r\n s2 += \".\"\r\n else:\r\n s1 += \".\"\r\n s2 += \"C\"\r\n print(c)\r\n for i in range(n):\r\n if i % 2 == 1:\r\n print(s1)\r\n else:\r\n print(s2)\r\n", "n = int(input())\r\n\r\n\r\nif (n%2)!=0:\r\n print((n*n//2)+1)\r\nelse: print(n*n//2)\r\nfor i in range(n):\r\n rep=''\r\n for j in range(n):\r\n if i %2==0:\r\n if j%2==0:\r\n rep+='C'\r\n else:\r\n rep+='.'\r\n else:\r\n if j%2!=0:\r\n rep+='C'\r\n else:\r\n rep+='.'\r\n \r\n print(rep)", "n = int(input())\r\nl = []\r\nc = 0\r\nfor i in range(n):\r\n s = \"\"\r\n if(i % 2 == 0):\r\n for j in range(n):\r\n if(j % 2 == 0):\r\n s += \"C\"\r\n c += 1\r\n else:\r\n s += \".\"\r\n else:\r\n for j in range(n):\r\n if(j % 2 == 0):\r\n s += \".\"\r\n else:\r\n s += \"C\"\r\n c += 1\r\n l.append(s)\r\nprint(c)\r\nfor s in l:\r\n print(s)\r\n \r\n \r\n", "w=int(input())\r\ns=\"C.\"*w\r\nprint((w*w+1)//2)\r\nprint('\\n'.join(s[i:w+i] for i in range(w)))\r\n", "n = int(input())\r\nprint(-(-n * n // 2))\r\nfor i in range(n):\r\n print((n * 'C.')[i:n+i])\r\n", "n=int(input())\r\nt=1\r\nl=[]\r\nk=0\r\nfor i in range(n) :\r\n S=''\r\n if t==1 :\r\n for j in range(n) :\r\n if (j+1)%2!=0 :\r\n S=S+'C'\r\n k=k+1\r\n else :\r\n S=S+'.'\r\n if t==2 :\r\n for j in range(n) :\r\n if (j+1)%2==0 :\r\n S=S+'C'\r\n k=k+1\r\n else :\r\n S=S+'.'\r\n if t==1 :\r\n t=2\r\n else :\r\n t=1\r\n l.append(S)\r\nprint(k)\r\nfor i in range(n) :\r\n print(l[i])\r\n \r\n \r\n \r\n \r\n", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nn = int(input())\r\nprint((n*n + 1) // 2)\r\nfor i in range(n):\r\n l= ''\r\n for j in range(n):\r\n if (i+j) % 2 == 0:\r\n l+= 'C'\r\n else:\r\n l+= '.'\r\n print(l)", "n=int(input())\r\nc1=(n+1)//2\r\nem=n//2\r\ns=\"\"\r\nc=c1*c1+em*em\r\nprint(c)\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\ts+=\"C\"\r\n\telse:\r\n\t\ts+=\".\"\r\ns2=\".\"+s[:-1]\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\tprint(s)\r\n\telse:\r\n\t\tprint(s2)", "n = int(input())\r\nh = n >> 1\r\n\r\nodd = n & 1\r\n\r\nif odd:\r\n hh = h + 1\r\n t = h * h + hh * hh\r\n print(t)\r\n ol = 'C.' * h + 'C' + '\\n'\r\n ev = '.C' * h + '.' + '\\n'\r\n d = ol + ev\r\n ret = d * h + ol\r\n print(ret)\r\nelse:\r\n print(h * n)\r\n ol = 'C.' * h + '\\n'\r\n ev = '.C' * h + '\\n'\r\n d = ol + ev\r\n ret = d * h\r\n print(ret)", "n = int(input())\r\nprint((n*n+1)//2)\r\nfor i in range(n):\r\n print(('C.'*600)[i%2:i%2+n])\r\n", "n = int(input())\r\nrows = [([\"C\", \".\"] * (n // 2) + [\"C\"] * (n % 2)), ([\".\", \"C\"] * (n // 2) + [\".\"] * (n % 2))]\r\nprint((n ** 2) // 2 + n % 2) \r\nfor i in range(0, n):\r\n print(\"\".join(rows[i % 2]))", "a=int(input())\nif a%2==1:\n\tprint((a//2)**2+((a-a//2)*(a//2+1)))\nelse:\n\tprint(a*a//2)\nif a%2==0:\n\tfor i in range(a):\n\t\tif i%2==0:\n\t\t\tprint('C.'*(a//2))\n\t\telse:\n\t\t\tprint('.C'*(a//2))\nelif a%2==1:\t\n\tfor i in range(a):\t\n\t\tif i%2==0:\n\t\t\tprint('C.'*((a-1)//2),end='')\n\t\t\tprint('C')\n\t\telse:\n\t\t\tprint('.C'*((a-1)//2),end='')\n\t\t\tprint('.')\n", "n=int(input())\r\nprint(-(-n*n//2))\r\nfor i in range(n): print((n*'C.')[i:n+i])", "def solve(n):\r\n\r\n count = 0\r\n result = []\r\n\r\n for i in range(n):\r\n s = ''\r\n if i % 2 == 0:\r\n for j in range(n):\r\n if j % 2 == 0:\r\n s += 'C'\r\n count += 1\r\n else:\r\n s += '.'\r\n else:\r\n for j in range(n):\r\n if j % 2 == 0:\r\n s += '.'\r\n else:\r\n s += 'C'\r\n count += 1\r\n result.append(s)\r\n print(count)\r\n [print(x) for x in result]\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n solve(n) ", "n=int(input())\r\nlist1=[]\r\nlist2=[]\r\ns=\"\"\r\ns2=\"\"\r\nif n%2!=0:\r\n\ta=int((n+1)/2)\r\n\tb=int((n-1)/2)\r\n\tprint(a**2+b**2)\r\n\tfor i in range(2):\r\n\t\tfor j in range(n):\r\n\t\t\tif i==0:\r\n\t\t\t\tif (i+j)%2==0:\r\n\t\t\t\t\tlist1.append(\"C\")\r\n\t\t\t\telse:\r\n\t\t\t\t\tlist1.append(\".\")\r\n\t\t\telse:\r\n\t\t\t\tif (i+j)%2==0:\r\n\t\t\t\t\tlist2.append(\"C\")\r\n\t\t\t\telse:\r\n\t\t\t\t\tlist2.append(\".\")\r\n\r\nelse:\r\n\tprint(int(n/2)*n)\r\n\tfor i in range(2):\r\n\t\tfor j in range(n):\r\n\t\t\tif i==0:\r\n\t\t\t\tif (i+j)%2==0:\r\n\t\t\t\t\tlist1.append(\"C\")\r\n\t\t\t\telse:\r\n\t\t\t\t\tlist1.append(\".\")\r\n\t\t\telse:\r\n\t\t\t\tif (i+j)%2==0:\r\n\t\t\t\t\tlist2.append(\"C\")\r\n\t\t\t\telse:\r\n\t\t\t\t\tlist2.append(\".\")\r\nans1=s.join(list1)\r\nans2=s2.join(list2)\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\tprint(ans1)\r\n\telse:\r\n\t\tprint(ans2)", "from math import ceil as c\r\n\r\nn = int(input())\r\n\r\nprint(c(n*n/2))\r\nfor i in range(n):\r\n for j in range(n):\r\n if i&1:\r\n if j&1:\r\n print(\"C\", end = \"\")\r\n else:\r\n print(\".\", end = \"\")\r\n else:\r\n if (j&1):\r\n print(\".\", end = \"\")\r\n else:\r\n print(\"C\", end = \"\")\r\n print()\r\n", "n = int(input())\r\nprint(((n**2)//2) if (n**2) % 2 == 0 else (((n//2)+1)**2 + (n//2)**2))\r\nfor i in range(n):\r\n string = \"\"\r\n for j in range(n):\r\n string += \"C\" if (i+j) % 2 == 0 else \".\"\r\n print(string)\r\n", "n=int(input())\r\nif(n%2==0):\r\n x=(n//2)*n\r\n print(x)\r\n for i in range(n):\r\n if(i%2==0):\r\n print(\"C.\"*(n//2))\r\n else:\r\n print(\".C\"*(n//2))\r\nelse:\r\n x=(n*(n+1)//2)-(n//2)\r\n print(x)\r\n for i in range(n):\r\n if(i%2==0):\r\n y=(\"C.\"*(n//2)+\"C\")\r\n print(y)\r\n else:\r\n y=(\".C\"*(n//2)+\".\")\r\n print(y)\r\n", "n = int(input())\r\nif n % 2 == 0:\r\n print(n**2 //2)\r\nelse:\r\n print( n ** 2 // 2 + 1)\r\nd = [['.'] * n for i in range(n)]\r\nfor i in range(n):\r\n if i % 2 != 0:\r\n print('.C' * (n // 2) + '.' * (n % 2))\r\n else:\r\n print('C.' * (n // 2) + 'C' * (n % 2))", "n=int(input())\r\nprint(((n**2)+1)//2)\r\nfor x in range(n):\r\n\ta=list(\".\"*n)\r\n\tif x%2==0:\r\n\t\tfor y in range((n+1)//2):\r\n\t\t\ta[2*y]=\"C\"\r\n\telse:\r\n\t\tfor y in range(n//2):\r\n\t\t\ta[(2*y)+1]=\"C\"\r\n\tprint(\"\".join(a))\r\n", "n=int(input())\r\n# print((n//2)*n)\r\nl,l1=[],[]\r\nif n%2!=0:\r\n\tprint(1+((n//2)*n)+n//2)\r\n\tl.append('C.'*(n//2))\r\n\tl.append('C')\r\n\tl1.append('.C'*(n//2))\r\n\tl1.append('.')\r\n\tfor i in range(n):\r\n\t\tif i%2==0:\r\n\t\t\tprint(*l,sep='')\r\n\t\telse:\r\n\t\t\tprint(*l1,sep='')\r\nelse:\r\n\tprint((n//2)*n)\r\n\tl.append('C.'*(n//2))\r\n\tl1.append('.C'*(n//2))\r\n\r\n\tfor i in range(n):\r\n\t\tif i%2==0:\r\n\t\t\tprint(*l,sep='')\r\n\t\telse:\r\n\t\t\tprint(*l1,sep='')\r\n", "n=int(input())\r\nif n==1:\r\n\tprint(1)\r\n\tprint(\"C\")\r\nelse:\r\n\ts=\"\"\r\n\tc1=(n+1)//2\r\n\tc2=(n)//2\r\n\tc=c1*c1+c2*c2\r\n\tfor i in range(n):\r\n\t\tif i%2==0:\r\n\t\t\ts+=\"C\"\r\n\t\telse:\r\n\t\t\ts+=\".\"\r\n\ts2=\".\"+s[:-1]\r\n\tprint(c)\r\n\tfor i in range(n):\r\n\t\tif i%2==0:\r\n\t\t\tprint(s)\r\n\t\telse:\r\n\t\t\tprint(s2)", "\r\nn = int(input())\r\n\r\nL=[]\r\nans = 0\r\n\r\nfor i in range(n) :\r\n s = \"\"\r\n for j in range(n) :\r\n if ((i % 2) == (j % 2)) :\r\n s = s + \"C\"\r\n ans += 1\r\n else :\r\n s = s + \".\"\r\n L.append(s)\r\n\r\nprint(ans)\r\nfor s in L :\r\n print(s)\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n):\r\n if n % 2==0:\r\n a1 = (n*n)//2\r\n else:\r\n a1 = (n*n)//2+1\r\n sys.stdout.write(f'{a1}\\n')\r\n for i in range(n):\r\n row = []\r\n for j in range(n):\r\n if (i+j) % 2==0:\r\n row.append('C')\r\n else:\r\n row.append('.')\r\n row = ''.join(row)\r\n sys.stdout.write(f'{row}\\n')\r\n \r\nn = int(input())\r\nprocess(n)", "n=int(input())\r\nt=0\r\nb=[]\r\nfor i in range(n):\r\n x=''\r\n for j in range(n):\r\n if i%2==0:\r\n if j%2==0:\r\n x=x+'C'\r\n t+=1\r\n else:\r\n x=x+'.'\r\n else:\r\n if j%2==0:\r\n x=x+'.'\r\n else:\r\n x=x+'C'\r\n t+=1\r\n b.append(x)\r\nprint(t)\r\nfor i in range(len(b)):\r\n print(b[i])\r\n", "n = int(input())\noddFlag = (n%2!=0)\nhalf = n//2\nif oddFlag:print((((n+1)//2) ** 2) + (((n-1)//2) ** 2))\nelse: print(n//2*n)\nfor i in range(n):\n if (i+1) % 2 != 0:\n print('C.'*half, end = \"\")\n if oddFlag: print('C',end = \"\")\n else:\n print('.C'*half,end = \"\")\n if oddFlag: print('.',end = \"\")\n\n print()", "def ii():\r\n return int(input())\r\ndef ss():\r\n return [x for x in input()]\r\ndef si():\r\n return [int(x) for x in input().split()]\r\ndef mi():\r\n return map(int, input().split())\r\n\r\na = ii()\r\ns = 0\r\nprint((a * a + 1) // 2)\r\nif not a % 2:\r\n for i in range(a):\r\n print(\"\".join([(\".C\" if i % 2 else \"C.\") for x in range(a // 2)]))\r\nelse:\r\n for i in range(a):\r\n print(\"\".join([(\".C\" if i % 2 else \"C.\") for x in range(a // 2)] + [\".\" if i % 2 else \"C\"]))", "n = int(input())\r\nprint(n*(n//2) + ((n+1)//2) * (n%2))\r\nodd = ['C.'*(n//2)] if n%2 == 0 else ['C.'*(n//2)] + ['C']\r\neven = ['.C'*(n//2)] if n%2 == 0 else ['.C'*(n//2)] + ['.']\r\nfor i in range(1,n+1):\r\n print(''.join(odd if i%2 == 1 else even) )\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jun 16 20:42:52 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn = int(input())\r\nif n % 2 == 0:\r\n print(int((n * n)/2))\r\n for i in range(n):\r\n if i % 2 == 0:\r\n print(\"C.\" * (n // 2))\r\n else:\r\n print(\".C\" * (n // 2))\r\nelse:\r\n print(((n * n)//2) + 1)\r\n for i in range(n):\r\n if i % 2 == 0:\r\n print(\"C.\" * (n // 2) + \"C\")\r\n else:\r\n print(\".C\" * (n // 2) + \".\")", "# Codeforces A. Coder\r\n# Created by Abdulrahman Elsayed on 13/01/2021\r\n\r\nn = int(input())\r\n\r\nif ((n % 2 == 0)):\r\n print(int((n * n) / 2))\r\nelse:\r\n print(int((n * n) / 2 + (1 / 2)))\r\n\r\neven_row = str()\r\nodd_row = str()\r\n\r\nfor j in range(n):\r\n if ((j % 2) == 0):\r\n even_row += 'C'\r\n odd_row += '.'\r\n else:\r\n even_row += '.'\r\n odd_row += 'C'\r\n\r\nfor i in range(n):\r\n if ((i % 2) == 0):\r\n print(even_row)\r\n else: \r\n print(odd_row)", "n = int(input())\r\ns = \"C.\" * n\r\nprint((n * n + 1) // 2)\r\nprint('\\n'.join(s[i:n + i] for i in range(n)))", "# https://codeforces.com/contest/384/problem/A\r\nimport math\r\n\r\nn = int(input())\r\nprint((math.ceil(n / 2) ** 2) + (n // 2) ** 2)\r\neven = \"\"\r\nodd = \"\"\r\n\r\nfor j in range(n):\r\n if j % 2 == 0:\r\n even += \"C\"\r\n odd += \".\"\r\n else:\r\n even += \".\"\r\n odd += \"C\"\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n print(even)\r\n else:\r\n print(odd)\r\n", "from math import ceil\r\nn = int(input())\r\nif n%2 == 0:\r\n coders = (n**2)//2\r\n print(coders)\r\n ss = {0:'C.'*(n//2),1:'.C'*(n//2)}\r\n for i in range(0,n):\r\n print(ss[i%2])\r\nelse:\r\n coders = ceil(n/2)**2+ (n//2)**2\r\n ss = {0:'C.'*ceil(n/2),1:'.C'*ceil(n/2)}\r\n print(coders)\r\n for i in range(0,n):\r\n print(ss[i%2][0:n])", "n = int(input())\n\nanswer = 0\nif n%2==0:\n\tanswer = (n*n)//2\nelse:\n\tanswer = (n*n + 1)//2\nprint (answer)\nfor i in range(n):\n\tfor j in range(n):\n\t\tif (i+j)%2==0:\n\t\t\tprint ('C', end=\"\")\n\t\telse:\n\t\t\tprint ('.', end=\"\")\n\tprint (\"\")\n", "n = int(input())\n\ncoder = 0\nlines = []\n\nfor i in range(n):\n line = ''\n if i % 2 == 0:\n for j in range(n):\n if j % 2 == 0:\n line += 'C'\n coder += 1\n else:\n line += '.'\n else:\n for j in range(n):\n if j % 2 == 0:\n line += '.'\n else:\n line += 'C'\n coder += 1\n lines.append(line)\n\nprint(coder)\nfor line in lines:\n print(line)", "n = int(input())\r\ns = \"\"\r\nkod = 0\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if((i + 1) % 2 == 0):\r\n if( (j + 1)% 2 == 0):\r\n s +=\"C\"\r\n kod += 1\r\n else:\r\n s +=\".\"\r\n else:\r\n if( (j + 1)% 2 == 1):\r\n s += \"C\"\r\n kod += 1\r\n else:\r\n s += \".\"\r\n s +=\"\\n\"\r\nprint(kod)\r\nprint(s)", "# # RED CODER # #\r\nn = int(input())\r\na = '.C'\r\nb = 'C.'\r\nif n % 2 == 0:\r\n print((n**2)//2)\r\nelse:\r\n print((n**2)//2 + 1)\r\nfor x in range(n):\r\n if x % 2 == 0:\r\n print((b*n)[:n])\r\n else:\r\n print((a*n)[:n])", "n = int(input())\n\nprint((n*n)//2+n%2)\ns1 = ''.join(['C' if x%2==0 else '.' for x in range(n)])\ns2 = ''.join(['C' if x%2==1 else '.' for x in range(n)])\nfor i in range(n):\n print(s1 if i%2==0 else s2)\n\n", "n = int(input())\ncnt = 0\nboard = ''\nfor i in range(n):\n for j in range(n):\n if i % 2:\n if j % 2: \n board += 'C'\n cnt += 1\n else: board += '.'\n else:\n if j % 2: board += '.'\n else: \n board += 'C'\n cnt += 1\n board += '\\n'\nprint(cnt)\nprint(board[:len(board) - 1])\n\t \t \t \t \t\t \t\t\t\t\t\t \t \t \t\t \t", "n=int(input())\r\nif n % 2 == 0:\r\n\ta=n*n//2\r\n\tprint(a)\r\n\tfor i in range(1,n+1):\r\n\t\tprint(\"C.\"*(n//2) if i % 2 != 0 else \".C\"*(n//2))\r\nelse:\r\n\ta=n*(n//2)+(n//2)+1\r\n\tprint(a)\r\n\tfor i in range(1,n+1):\r\n\t\tprint(\"C.\"*(n//2)+\"C\" if i % 2 !=0 else \".C\" *(n//2)+\".\")", "n=int(input())\r\nif n%2==0:\r\n print((n*n)//2)\r\nelse:\r\n print((n*n)//2+1)\r\ns=''\r\ns2=''\r\nfor i in range(n):\r\n if i%2==0:\r\n s+='C'\r\n s2+='.'\r\n else:\r\n s2+='C'\r\n s+='.'\r\nfor i in range(n//2):\r\n print(s)\r\n print(s2)\r\nif n%2==1:\r\n print(s)", "n=int(input())\r\nif n==1:\r\n print(\"1\")\r\n print(\"C\")\r\nelse:\r\n if n%2==0:\r\n print(n*(n//2))\r\n for i in range(1,n+1):\r\n if i%2!=0:\r\n print(\"C.\"*(n//2))\r\n \r\n else:\r\n print(\".C\"*(n//2))\r\n \r\n \r\n else:\r\n print((n//2+1)**2 + (n//2)**2)\r\n for i in range(1,n+1):\r\n if i%2!=0:\r\n print(\"C.\"*(n//2)+\"C\")\r\n \r\n else:\r\n print(\".C\"*(n//2)+\".\")\r\n", "n=int(input())\r\nif n%2==0:\r\n\tprint((n**2)//2)\r\nelif n%2!=0:\r\n\tprint(((n**2)+1)//2)\r\na=\"\"\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\ta+=\"C\"\r\n\telif i%2!=0:\r\n\t\ta+=\".\"\r\nb=\"\"\r\nfor i in range(n):\r\n\tif i%2!=0:\r\n\t\tb+=\"C\"\r\n\telif i%2==0:\r\n\t\tb+=\".\"\r\nfor j in range(n):\r\n\tif j%2==0:\r\n\t\tprint(a)\r\n\telif j%2!=0:\r\n\t\tprint(b)", "n = int(input())\r\nmat = \"\"\r\n\r\nif(n%2 == 0):\r\n print((n*n)//2)\r\n for j in range(n):\r\n if(j %2 == 0):\r\n for i in range(n//2):\r\n mat += \"C.\"\r\n else:\r\n for i in range(n//2):\r\n mat += \".C\"\r\n mat+=\"\\n\"\r\nelse:\r\n print(((n*n)+1)//2)\r\n for j in range(n):\r\n if(j %2 == 0):\r\n for i in range(n//2):\r\n mat += \"C.\"\r\n mat += \"C\"\r\n else:\r\n for i in range(n//2):\r\n mat += \".C\"\r\n mat += \".\"\r\n mat+=\"\\n\"\r\n \r\n \r\nprint(mat)", "import math as ma\r\nx=int(input())\r\nprint(ma.ceil(x/2)**2+ma.floor(x/2)**2)\r\ns1=''\r\ns2=''\r\nfor n in range(x):\r\n\tif n%2==0:\r\n\t\ts1+='C'\r\n\t\ts2+='.'\r\n\telse:\r\n\t\ts1+='.'\r\n\t\ts2+='C'\r\nfor n in range(x):\r\n\tif n%2==0:\r\n\t\tprint(s1)\r\n\telse:\r\n\t\tprint(s2)", "n = int(input())\r\nif n%2 == 0:\r\n print(int((n*n)/2))\r\nelse:\r\n print(int(((n+1)*(n+1)/4)+((n-1)*(n-1)/4)))\r\nfor i in range(1, n+1):\r\n if i%2 == 0:\r\n print(\".C\"*(n//2)+(\".\" if n%2 else \"\"))\r\n else:\r\n print(\"C.\"*(n//2)+(\"C\" if n%2 else \"\"))", "n = int(input())\nf = 0 - (-n // 2)\ns = 0 - (-(n - 1) // 2)\nt = (f * ((n + 1) // 2)) + (s * (n // 2))\nprint(t)\nfor i in range(0, n):\n if i % 2 == 1:\n print(('.C' * n)[:n])\n else:\n print(('C.' * n)[:n])\n", "N = int(input())\nans = N * N // 2 if N % 2 == 0 else N * N // 2 + 1\nflg = True\nprint(ans)\nfor i in range(N):\n line = \"\"\n for j in range(N):\n if j % 2 == 0:\n if flg:\n line += \"C\"\n else:\n line += \".\"\n else:\n if flg:\n line += \".\"\n else:\n line += \"C\"\n flg = not flg\n print(line)\n", "n=int(input())\r\nif(n%2==0):\r\n p=n*n//2\r\nelse:\r\n p=(n*(n//2))+(n//2+1)\r\nprint(p)\r\nc1=[]\r\nc2=[]\r\nfor i in range(n):\r\n if(i%2==0):\r\n c1.append(\"C\")\r\n c2.append(\".\")\r\n else:\r\n c1.append(\".\")\r\n c2.append(\"C\")\r\nc3=''.join(c1)\r\nc4=''.join(c2)\r\ns=1\r\nwhile(n):\r\n if(s==1):\r\n print(c3)\r\n else:\r\n print(c4)\r\n s=1-s\r\n n-=1", "import math;n=int(input());print((math.ceil(n/2)**2+(n//2)**2))\r\nfor h in range(1,n+1):print(*([\".C\"*(n//2)+(\".\" if n%2 else \"\")] if h%2==0 else [\"C.\"*(n//2)+(\"C\" if n%2 else \"\")]))", "if __name__==\"__main__\":\r\n n = int(input())\r\n print((n * n + 1) // 2)\r\n s = 'C.' * n\r\n for i in range(n):\r\n print(s[i:i + n])", "import math\r\nn = int(input())\r\na = math.ceil(n / 2)\r\nb = math.floor(n / 2)\r\nc = 0\r\nfor x in range(n):\r\n if x % 2 == 0:\r\n c += a\r\n else:\r\n c += b\r\nprint(c)\r\na = \"\"\r\nb = \"\"\r\nfor x in range(n):\r\n if x % 2 == 0:\r\n a += \"C\"\r\n b += \".\"\r\n else:\r\n a += \".\"\r\n b += \"C\"\r\nfor x in range(n):\r\n if x % 2 == 0:\r\n print(a)\r\n else:\r\n print(b)", "n = int(input())\r\nmaxm = (n * n + 1) // 2\r\n\r\nchessboard = []\r\nfor _ in range(n):\r\n row = []\r\n for _ in range(n):\r\n row.append('.')\r\n chessboard.append(row)\r\n \r\nfor i in range(n):\r\n for j in range(i % 2, n, 2):\r\n chessboard[i][j] = 'C'\r\n\r\nprint(maxm)\r\nfor k in chessboard:\r\n print(''.join(k))", "n = int(input())\r\nif n%2 == 0:\r\n\tcount_of_coder = (n//2)*n\r\nelse:\r\n\tcount_of_coder = (n//2 + 1)*(n//2) + (n//2)*(n//2) + (n//2 + 1)\r\ncoder = []\r\ni = 0\r\nprint(count_of_coder)\r\nwhile i < n:\r\n\tj = 0\r\n\twhile j < n:\r\n\t\tif i%2 == 0:\r\n\t\t\tif j%2 == 0:\r\n\t\t\t\tcoder.append('C')\r\n\t\t\telse:\r\n\t\t\t\tcoder.append('.')\r\n\t\telse:\r\n\t\t\tif j%2 != 0:\r\n\t\t\t\tcoder.append('C')\r\n\t\t\telse:\r\n\t\t\t\tcoder.append('.')\r\n\t\tj += 1\r\n\tprint(' '.join(coder).replace(' ', ''))\r\n\tcoder = []\r\n\ti += 1", "import math\r\nx = int(input())\r\njk = 0\r\nfor i in range(x):\r\n\tans = \"\"\r\n\tif i%2==0:\t\r\n\t\tfor k in range(x):\r\n\t\t\tif k%2==0:\r\n\t\t\t\tans+=\"C\"\r\n\t\t\t\tjk+=1\r\n\t\t\telse:\r\n\t\t\t\tans+=\".\"\r\n\telse:\r\n\t\tfor k in range(x):\r\n\t\t\tif k%2!=0:\r\n\t\t\t\tans+=\"C\"\r\n\t\t\t\tjk+=1\r\n\t\t\telse:\r\n\t\t\t\tans+=\".\"\r\n\tif i==0 and x%2!=0:\r\n\t\tprint (math.floor(x/2)**2 + math.ceil(x/2)**2)\r\n\telif i==0:\r\n\t\tprint (x*jk)\r\n\tprint (ans)", "n=int(input())\nm=n*n\nprint(m//2 if m%2==0 else (m//2)+1)\n\ny=0\nfor i in range(n):\n if(n%2==0):\n y=1-y\n line=[]\n for j in range(n):\n y=1-y\n if y:\n line.append('C')\n else:\n line.append('.')\n print(''.join(line))\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/24 22:46\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\nA = [['.' for _ in range(N)] for _ in range(N)]\r\nif N % 2 == 0:\r\n print(N*N//2)\r\nelse:\r\n a = N//2+1\r\n print(a*a + (a-1)**2)\r\n\r\nfor r in range(N):\r\n s = 1 if r % 2 == 1 else 0\r\n for c in range(s, N, 2):\r\n A[r][c] = 'C'\r\n\r\nfor row in A:\r\n print(\"\".join(row))", "n=int(input())\r\np=0\r\nq=0\r\na=[]\r\nb=[]\r\nfor x in range(1,n+1):\r\n a+=['C']\r\n p+=1\r\n if p==n:\r\n break\r\n a+=['.']\r\n p+=1\r\n if p==n:\r\n break\r\n #a=\r\n \r\n \r\nfor y in range(1,n+1):\r\n b+=['.']\r\n q+=1\r\n if q==n:\r\n break\r\n b+=['C']\r\n q+=1\r\n if q==n:\r\n break\r\n #b=\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nif n%2==0:\r\n print((n*n)//2)\r\n p=0\r\n for x in range(1,n+1):\r\n print(''.join([str(x) for x in b]))\r\n p+=1\r\n #print('')\r\n if p==n:\r\n break\r\n print(''.join([str(x) for x in a]))\r\n p+=1\r\n #print('')\r\n if p==n:\r\n break\r\nelse:\r\n temp=(n*n)//2\r\n print(temp+1)\r\n p=0\r\n for x in range(1,n+1):\r\n print(''.join([str(x) for x in a]))\r\n p+=1\r\n #print('')\r\n if p==n:\r\n break\r\n print(''.join([str(x) for x in b]))\r\n p+=1\r\n #print('')\r\n if p==n:\r\n break\r\n", "n = int(input())\r\nif n % 2 == 0:\r\n print(n * n // 2)\r\n for i in range(n):\r\n if i % 2 == 0:\r\n for j in range(n//2):\r\n print(\"C\",end = \".\")\r\n print()\r\n else:\r\n for j in range(n//2):\r\n print(\".\",end = \"C\")\r\n print()\r\nelse:\r\n print((n // 2 + 1)*(n//2+1) + (n//2)*(n//2))\r\n for i in range(n):\r\n if i % 2 == 0:\r\n for j in range(n//2):\r\n print(\"C\",end = \".\")\r\n print(\"C\")\r\n else:\r\n for i in range(n//2):\r\n print(\".\",end = \"C\")\r\n print(\".\")", "n = int(input())\n\ns = ''\nc = 0\n\nfor x in range(n):\n\tfor y in range(n):\n\t\tif (x % 2 == 0 and y % 2 == 0) or (x % 2 == 1 and y % 2 == 1):\n\t\t\ts += 'C'\n\t\t\tc += 1\n\t\telse:\n\t\t\ts += '.'\n\t\t\t\n\ts += '\\n'\n\nprint(c)\nprint(s)\n \t \t\t\t\t\t\t\t\t \t \t\t\t\t\t\t\t\t \t\t", "#==========3 задание===============\nimport math\n\nn = int(input())\n\nr1 = math.ceil(n/2)\nr2 = math.floor(n/2)\nr3 = r1*r1 + r2*r2\n\nprint(r3)\nl = []\nl1 = [\"C.\" for i in range(n)]\nl2 = [\".C\" for i in range(n)]\nfor i in range(n):\n l += [\"\".join(l1)[:n]]\n l += [\"\".join(l2)[:n]]\nl = l[:n]\nfor i in l:\n print(i)\n", "n=int(input())\r\nprint((n**2+1)//2)\r\nif n%2==0:\r\n for i in range(n):\r\n if i%2==0:\r\n print('C.'*(n//2))\r\n else:\r\n print('.C'*(n//2))\r\nelse:\r\n for i in range(n):\r\n if i%2==0:\r\n print('C.'*(n//2),end='')\r\n print('C')\r\n else:\r\n print('.C'*(n//2),end='')\r\n print('.')", "a=int(input())\r\np=a//2\r\nans=a*a\r\nif a%2==0:\r\n ans=ans//2\r\nelse:\r\n ans=(ans+1)//2\r\nprint(ans)\r\nfor num in range(1,a+1):\r\n if a%2==0:\r\n if num%2==0:\r\n print('.C'*p)\r\n else:\r\n print('C.'*p)\r\n else:\r\n if num%2==0:\r\n print('.C'*p+'.')\r\n else:\r\n print('C.'*p+'C')\r\n ", "n = int(input())\r\n\r\nprint((n ** 2 + 1) // 2)\r\nres = ''\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif (i % 2 == 0) ^ (j % 2 == 0):\r\n\t\t\tres += '.'\r\n\t\telse:\r\n\t\t\tres += 'C'\r\n\tres += '\\n'\r\n\r\nprint(res, end='')\r\n", "def is_valid(i,j,n):\r\n return i>=0 and i<=n-1 and j>=0 and j<=n-1\r\n\r\n\r\nn=int(input())\r\n\r\nboard=[['C' for i in range(n)]for i in range(n)]\r\nans=0\r\nmp={}\r\nmp['C']=0\r\nmp['.']=0\r\n#print(type(board))\r\n\r\n\r\n\r\nprint((n * n + 1) // 2)\r\nfor i in range(n):\r\n if i %2==1:\r\n print('.C'*(n//2)+'.'*(n%2))\r\n else:\r\n print('C.'*(n//2)+'C'*(n%2))\r\n\r\n\r\n ", "import math\nn = int(input())\nprint(math.ceil(n**2/2))\nfor i in range(n):\n for j in range(n):\n k = i+j\n if k %2 == 0:\n print('C',end='')\n else:\n print('.',end='')\n print()", "a = int(input())\r\nprint((a * a + 1) // 2)\r\nfor i in range(a):\r\n for j in range(a):\r\n if i % 2 == j % 2:\r\n print(\"C\" , end = \"\")\r\n else:\r\n print(\".\" , end = \"\")\r\n print(\"\")", "n=int(input())\r\na='C.'\r\nb='.C'\r\nlst=[]\r\nfor i in range(1,n+1):\r\n if(i%2!=0):\r\n s=a*n\r\n w=s[:n]\r\n lst.append(w)\r\n else:\r\n s=b*n\r\n w=s[:n]\r\n lst.append(w)\r\nif(n%2==0):\r\n v=((n*n)//2)\r\nelse:\r\n v=((n*n)//2)+1\r\nprint(v)\r\nfor j in lst:\r\n print(j)\r\n \r\n", "n=int(input())\r\nif n%2==0:\r\n print(n*n//2)\r\nelse:\r\n print(((n+1)//2)**2+(n//2)**2)\r\nfor i in range(n):\r\n c=[]\r\n for j in range(n):\r\n if i%2==0:\r\n if j%2==0:\r\n c.append('C')\r\n else:\r\n c.append('.')\r\n else:\r\n if j%2==0:\r\n c.append('.')\r\n else:\r\n c.append('C')\r\n print(''.join(c))\r\n", "n = int(input())\r\nprint((n ** 2 // 2) + n % 2)\r\nfor i in range(n):\r\n output = ''\r\n for j in range(n):\r\n if (i + j) % 2 == 0:\r\n output += 'C'\r\n else:\r\n output += '.'\r\n print(output)\r\n", "n = int(input())\n\nans = 0\ns = [['.' for _ in range(n)] for i in range(n)]\nfor i in range(n):\n for j in range(n):\n if (i+j) % 2 == 0:\n ans += 1\n s[i][j] = 'C'\n\nprint(ans)\nfor i in range(n):\n print(''.join(s[i]))\n\n", "n = int(input())\n\nboard = [['.' for _ in range(n)] for _ in range(n)]\n\ncount = 0\nfor i in range(n):\n for j in range(n):\n if (i+j)%2 == 0:\n board[i][j] = 'C'\n count += 1\n\nprint(count)\nfor i in range(n):\n print(''.join(board[i]))", "n = int(input())\r\nprint(n**2 // 2 if n % 2 == 0 else (n**2 + 1) // 2)\r\n\r\ns0 = ('C.' * (n // 2 + 1))[:n]\r\ns1 = ('.' + s0)[:n]\r\nprint(\"\\n\".join([s0, s1][k % 2] for k in range(n)))", "# input Operation \r\nn=int(input())\r\n\r\n# output operation \r\n# max_number_of coder\r\nif n%2==0:\r\n max=(n**2)/2\r\nelse:\r\n max=(n**2)/2+1\r\n# To print arr table from \"C\",\".\"\r\nbig_list=[]\r\nsub_list=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i+j) %2==0:\r\n sub_list.append(\"C\")\r\n else:\r\n sub_list.append(\".\")\r\n # print(sub_list)\r\n big_list.append(sub_list)\r\n sub_list=[] #To reset the sub_list after adding it to big_list\r\n\r\n\r\n# For printing The Excepted output\r\nprint(int(max))\r\nfor i in big_list:\r\n print(\"\".join(i))\r\n\r\n \r\n\r\n", "n = int(input())\r\nprint((n * n) // 2 + n % 2)\r\ns = 'C.'* (n // 2+1)\r\nfor i in range(n):\r\n k = i % 2\r\n print(s[k: k + n])", "if __name__ == '__main__':\r\n n = int(input())\r\n res = [\r\n 'C.' * (n // 2),\r\n '.C' * (n // 2)\r\n ]\r\n if n % 2:\r\n res[0] += 'C'\r\n res[1] += '.'\r\n print((n**2 + 1) // 2)\r\n for i in range(n):\r\n print(res[i % 2])\r\n", "n=int(input())\r\nprint(-(-n*n//2))\r\nfor i in range(n): print((n*'C.')[i%2:n+i%2])", "from math import ceil\r\ninp = int(input())\r\nprint(ceil(inp*inp/2))\r\nfor i in range(inp):\r\n st=''\r\n if i%2==0:\r\n for q in range(inp):\r\n st+='C' if q%2==0 else '.'\r\n else:\r\n for q in range(inp):\r\n st+='.' if q%2==0 else 'C'\r\n print(st)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\nprint((n*n+1)//2)\r\nif n==1:print('C')\r\nelse:\r\n c='C.';e='.C'\r\n c=c*(n//2)+'C'*int(n%2==1)\r\n e=e*(n//2)+'.'*int(n%2==1)\r\n for i in range(n):\r\n if i%2==0:\r\n print(c)\r\n else:\r\n print(e)", "n = int(input())\r\ns = 'C.' * 500\r\np = '.C' * 500\r\n\r\nif n%2 == 0:\r\n print(n*(n//2))\r\nelse:\r\n print((n-1)*(n-1)//2 + n)\r\n \r\nfor i in range(n):\r\n if i%2 == 0:\r\n print(s[:n:])\r\n else:\r\n print(p[:n:])", "n = int(input())\r\n\r\ncoders = 0\r\nstart = 0\r\n\r\nfor i in range(n):\r\n for j in range(start, n, 2):\r\n if i % 2 == 0:\r\n start = 0\r\n else:\r\n start = 1\r\n\r\n coders += 1\r\n\r\n\r\nprint(coders)\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n print(\"C\", end=\"\")\r\n else:\r\n print(\".\", end=\"\")\r\n else:\r\n if j % 2 != 0:\r\n print(\"C\", end=\"\")\r\n else:\r\n print(\".\", end=\"\")\r\n\r\n print()\r\n\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/384/A\r\n\r\nn = int(input())\r\n\r\nt = 0\r\nl_o = list()\r\nfor i in range(n):\r\n l_c = list()\r\n for j in range(n):\r\n if (i % 2 + j) % 2 == 0:\r\n t += 1\r\n l_c.append(\"C\")\r\n else:\r\n l_c.append(\".\")\r\n l_o.append(l_c)\r\n \r\nprint(t)\r\nprint(\"\\n\".join(\"\".join(l_c) for l_c in l_o))", "n=int(input())\r\nres=[]\r\nx=n\r\nfor i in range(n):\r\n mat=[]\r\n for j in range(n//2):\r\n if i%2==0:\r\n mat.append('C')\r\n mat.append('.')\r\n if i%2!=0:\r\n mat.append('.')\r\n mat.append('C')\r\n if x%2!=0 and i%2==0 and j==(n//2)-1:\r\n mat.append('C')\r\n if x%2!=0 and i%2!=0 and j==(n//2)-1:\r\n mat.append('.')\r\n \r\n res.append(mat)\r\nif n%2!=0:\r\n print(((n*n)//2)+1)\r\nelse:\r\n print(((n*n)//2))\r\nif n==1:\r\n print('C')\r\nelse:\r\n for line in res:\r\n print(''.join(line))\r\n", "import math\r\nn=int(input())\r\nans=math.ceil((n*n)/2)\r\nprint(ans)\r\ns=''\r\ns1=''\r\nfor i in range(n):\r\n if(i%2==0):\r\n s+='C'\r\n else:\r\n s+='.'\r\nfor i in range(n):\r\n if(i%2==0):\r\n s1+='.'\r\n else:\r\n s1+='C'\r\nfor i in range(n):\r\n if(i%2==0):\r\n print(s)\r\n else:\r\n print(s1)\r\n\r\n\r\n", "n = int(input())\n\neven = 'C.'*(n//2)\nodd = '.C'*(n//2)\n\nevenElem = even.count('C')\noddElem = odd.count('C')\ntotal = 0\n\nif n%2 != 0:\n even +='C'\n odd +='.'\n total += (evenElem + 1) * (n//2 + 1) + oddElem * ((n//2))\n\nelse:\n total += (evenElem + oddElem ) * n//2 \n\nprint(total)\nfor x in range(n):\n if x % 2 == 0:\n print(even)\n else:\n print(odd)", "a=int(input())\r\nb='C.'\r\nprint((a**2+1)//2)\r\nfor i in range(a):\r\n c=''\r\n for j in range(a):\r\n c+=b[(i+j)%2]\r\n print(c)\r\n \r\n", "n=int(input())\r\nif(n%2==0):\r\n print((n**2)//2)\r\nelse:\r\n print((n**2+1)//2)\r\na=[[\".\"]*n]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i%2==0):\r\n if(j%2==0):\r\n a[i][j]=\"C\"\r\n print(a[i][j],end=\"\")\r\n\r\n else:\r\n a[i][j]=\".\"\r\n print(a[i][j],end=\"\")\r\n else:\r\n if(j%2!=0):\r\n a[i][j]=\"C\"\r\n print(a[i][j],end=\"\")\r\n else:\r\n a[i][j]=\".\"\r\n print(a[i][j],end=\"\")\r\n print(\"\")\r\n# for i in range(n):\r\n# for j in range(n):\r\n# print(a[i][j],end=\"\")\r\n# print(\"\")\r\n", "n = int(input())\n# C.C.C.C\n# .C.C.C.\n# C.C.C.C\n# .........\nres = (n**2 + 1) // 2\nprint(res)\nfor i in range(n):\n print((\"C.\" * ((n + 2) // 2))[i & 1 : n + (i & 1)])\n", "n = int(input())\r\noutput = 0\r\ntext = []\r\nif n%2 == 0:\r\n is_c = False\r\n c_first = True\r\n string = \"\"\r\n for i in range(n):\r\n if c_first: is_c = not is_c\r\n\r\n for j in range(n):\r\n if is_c:\r\n string += \"C\"\r\n output +=1\r\n else:\r\n string += \".\"\r\n is_c = not is_c\r\n c_first = not c_first\r\n\r\n \r\n text.append(string)\r\n string = ''\r\n \r\n \r\nelse:\r\n is_c = True\r\n string = \"\"\r\n for i in range(n):\r\n for j in range(n):\r\n if is_c:\r\n string += \"C\"\r\n output += 1\r\n else: string += \".\"\r\n is_c = not is_c\r\n text.append(string)\r\n string = ''\r\nprint(output)\r\nprint(\"\\n\".join(text))\r\n", "from math import ceil\r\n\r\nnum = int(input())\r\nprint(ceil((num*num)/2))\r\nl1 = \"\"\r\nl2 = \"\"\r\nfor i in range(num):\r\n if i%2 ==0:\r\n l1 = l1+\"C\"\r\n else:\r\n l1 = l1+\".\"\r\n\r\nfor i in range(num):\r\n if i%2 ==0:\r\n l2 = l2+\".\"\r\n else:\r\n l2 = l2+\"C\"\r\nif num%2==0:\r\n for i in range(num//2):\r\n print(l1)\r\n print(l2)\r\nelse:\r\n for i in range(num//2):\r\n print(l1)\r\n print(l2)\r\n print(l1)", "n=int(input())\r\nprint((n*n+1)//2)\r\ns1='C.'*n\r\nfor i in range(n):\r\n print(s1[i:i+n])", "# cf 384 A 800\nn = int(input())\n\nrows = []\nc = 0\n\nfor i in range(n):\n c += (n // 2)\n if n % 2 != 0 and i % 2 == 0:\n c += 1\n if i % 2 == 0: # even\n row = [ \"C.\" ] * (n // 2)\n if n % 2 == 1:\n row += [ \"C\" ]\n else:\n row = [ \".C\" ] * (n // 2)\n if n % 2 == 1:\n row += [ \".\" ]\n rows.append(row)\n\nprint(c)\nfor row in rows:\n print(\"\".join(row))\n", "a=int(input())\r\n\r\nif a%2==0:\r\n nc=(a//2)*a\r\nelse:\r\n nc=(a//2)**2+(a//2+1)**2\r\n\r\ns=\"\"\r\nprint(nc)\r\nfor i in range(a):\r\n if i%2==0:\r\n for j in range(a):\r\n if j%2==0:\r\n s=s+\"C\"\r\n else:\r\n s=s+\".\"\r\n else:\r\n for j in range(a):\r\n if j%2==0:\r\n s=s+\".\"\r\n else:\r\n s=s+\"C\"\r\n \r\n print(s)\r\n s=\"\"", "n = int(input())\r\n\r\nprint((n ** 2 + 1) // 2)\r\n\r\nk, mod_ = divmod(n, 2)\r\ns1, s2 = 'C.' * k, '.C' * k\r\n\r\nif mod_:\r\n s1, s2 = s1 + 'C', s2 + '.'\r\n\r\nfor i in range(n):\r\n print(s2 if i % 2 else s1)", "n=int(input())\r\na=\"C\"\r\nb=\".\"\r\nfor j in range(1,n):\r\n if j%2==0:\r\n a+=\"C\"\r\n b+=\".\"\r\n else:\r\n a+=\".\"\r\n b+=\"C\"\r\nif n%2==0:\r\n print(int((n**2)//2))\r\nelse:\r\n print(int(((n**2)+1)//2))\r\nfor _ in range(n):\r\n if _ %2==0:\r\n print(a)\r\n else:\r\n print(b)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn=int(input())\r\nc='C.'\r\nif n%2==0:\r\n\tprint(int(n*n/2))\r\n\ti=0\r\n\twhile i < int(n/2):\r\n\t\tprint(c*int(n/2))\r\n\t\tprint(c[::-1]*int(n/2))\r\n\t\ti+=1\r\nelse:\r\n\tprint(int((n*n)/2)+1)\r\n\ti=0 \r\n\twhile i<int(n/2):\r\n\t\tprint(c*int(n/2)+c[0])\r\n\t\tprint(c[::-1]*int(n/2)+c[-1])\r\n\t\ti+=1\r\n\tprint(c*int(n/2)+c[0])\r\n\r\n\r\n\r\n\r\n\r\n# for i in range(n):\r\n# \tfor j in range(n):\r\n# \t\tif c==True:\r\n# \t\t\tprint('C',end='')\r\n# \t\t\tc=False\r\n# \t\telse:\r\n# \t\t\tprint(\".\",end='')\t\r\n# \t\t\tc=True\r\n# \tprint()\r\n# \tif i %2==0:\r\n# \t\tc=False\r\n# \telse:\r\n# \t\tc=True\r\n\r\n", "import math\r\ndef solve():\r\n\tn = int(input())\r\n\tprint(math.ceil(n*n/2))\r\n\tpattern = 'C.' * 501\r\n\tfor i in range(n):\r\n\t\toffs = i&1\r\n\t\tprint(pattern[offs:n+offs])\r\n\r\nsolve()", "# A. Coder\r\nn = int(input())\r\nprint((n*n)//2 if n%2==0 else ((n*n)//2)+1)\r\nStr = ''\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i+j) % 2 == 0:\r\n Str += 'C'\r\n else:\r\n Str += '.'\r\n Str += '\\n'\r\nprint(Str)\r\n\r\n\r\n", "\r\nn = int(input())\r\nline = ''\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i + j) % 2 == 0 :\r\n line += 'C'\r\n else:\r\n line +='.'\r\n\r\n line += '\\n'\r\n\r\nprint(line.count('C'))\r\nprint(line)\r\n\r\n\r\n\r\n", "n=int(input())\r\nl=[]\r\nc=0\r\nfor i in range(1,n+1):\r\n\tfor j in range(1,n+1):\r\n\t\tif i%2==1:\r\n\t\t\tif j%2==1:\r\n\t\t\t\tl.append(\"C\")\r\n\t\t\t\tc+=1\r\n\t\t\telse:\r\n\t\t\t\tl.append(\".\")\r\n\t\telse:\r\n\t\t\tif j%2==1:\r\n\t\t\t\tl.append(\".\")\r\n\t\t\telse:\r\n\t\t\t\tl.append(\"C\")\r\n\t\t\t\tc+=1\r\nprint(c)\r\ns=\"\".join(l)\r\nfor i in range(0,len(l),n):\r\n\tt=slice(0+i,n+i)\r\n\tprint(s[t])\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\nprint((n*n+1)//2)\r\nfor i in range(n):\r\n\t# for j in range(n):\r\n\t# \tif (i+j)%2==0:\r\n\t# \t\tprint(\"\".join(\"C\"),end=\"\")\r\n\t# \telse:\r\n\t# \t\tprint(\"\".join(\".\"))\r\n\tprint(\"\".join((\"C\" if (i+j)%2==0 else \".\" )for j in range(n)))\r\n", "N = int(input())\r\nprint((N**2+1)//2)\r\nfor i in range(N):\r\n print (''.join(['C' if not (i+j)%2 else '.' for j in range(N)]))\r\n", "def get_int():\r\n return map(int, input().split())\r\n\r\nn = int(input())\r\n\r\ns1 = 'C.' * (n//2) + ['', 'C'][n % 2]\r\ns2 = '.C' * (n//2) + ['', '.'][n % 2]\r\n\r\nx = [((n//2)+1)**2 + (n//2)**2, n*n//2][n % 2 == 0]\r\na = [[s1, s2][i % 2] for i in range(n)]\r\nprint(x)\r\nfor i in a:\r\n print(i)\r\n", "n=int(input())\nans= (((n+1)//2)**2)+((n//2)**2)\n#for i in range(n):\n# for j in range(n):\n# if i%2==0:\n\nstr1 =['C' if(i%2==0) else '.' for i in range(n)]\nstr2= ['.' if(i%2==0) else 'C' for i in range(n)]\nprint(ans,end='\\n')\nstr1=\"\".join(str1)\nstr2=\"\".join(str2)\n\nfor i in range(n):\n if(i%2==0):\n print(str1)\n else:\n print(str2)\n", "t = int(input())\r\nans = 0\r\na = [[] for _ in range(t)]\r\nfor i in range(t):\r\n for j in range(t):\r\n if (i % 2 == 0 and j % 2 == 0) or (i % 2 == 1 and j % 2 == 1):\r\n ans += 1\r\n a[i].append('C')\r\n else:\r\n a[i].append('.')\r\nprint(ans)\r\nfor i in range(t):\r\n print(''.join(a[i]))", "\r\nn=int(input())\r\nx=\"C.\"\r\ny='.C'\r\nc=n//2\r\nans=2*c*c\r\nif n%2==0:\r\n\tprint(ans)\r\nelse:\r\n\tans+=n\r\n\tprint(ans)\r\nfor i in range(0,n):\r\n\tfor j in range(0,n):\r\n\t\tif i%2==0:\r\n\t\t\tprint(x[j%2],end='')\r\n\t\telse:\r\n\t\t\tprint(y[j%2],end='')\r\n\tprint()", "n = int(input())\r\nboard = [['.' for r in range(n)] for c in range(n)]\r\ncount = 0\r\n\r\nfor i in range(n):\r\n for c in range(i%2, n, 2):\r\n board[i][c] = 'C'\r\n count += 1\r\n\r\nprint(count)\r\nfor row in board:\r\n print(\"\".join(row))", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n n = I()\r\n if n%2==0:\r\n res = n//2 * n \r\n else:\r\n a = (n+1)//2\r\n b = n-a\r\n res = pow(a, 2) + pow(b, 2)\r\n print(res)\r\n \r\n for i in range(n):\r\n if i%2==0:\r\n for j in range(n):\r\n if j%2==0:\r\n print('C', end='')\r\n else: \r\n print('.', end='')\r\n print()\r\n else:\r\n for j in range(n):\r\n if j%2==1:\r\n print('C', end='')\r\n else:\r\n print('.', end='')\r\n print()\r\n\r\nif __name__ == '__main__':\r\n main()", "rows = int(input())\r\nimport math\r\nprint(math.ceil(rows**2/2))\r\n\r\nodd = ''.join('C' if not c % 2 else '.' for c in range(rows))\r\neven = ''.join('C' if c % 2 else '.' for c in range(rows))\r\n\r\nfor r in range(rows):\r\n print(even) if r % 2 else print(odd)", "# ===============================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===============================\r\nimport math, fractions\r\n# ===============================\r\nn = int(input())\r\ns = \"C.\"*(pow(n,2))\r\nif n%2==0:\r\n\tprint(n*(n//2))\r\nelse:\r\n\tprint((n*(n+1)//2) - n//2)\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\tprint(s[:n])\r\n\telse:\r\n\t\tprint(s[1:n+1])", "n=int(input())\r\nif n%2:\r\n print((-(-n//2)*-(-n//2))+(n//2)*(n//2))\r\nelse:\r\n print(n//2*n)\r\nfor i in range (n):\r\n if i%2:\r\n print('.C'*(n//2)+'.'*(n%2))\r\n else:\r\n print('C.'*(n//2)+'C'*(n%2))\r\n\r\n\r\n\r\n", "par=\"C.\"\r\nimpar=\".C\"\r\nL=[]\r\nn=int(input())\r\ncont=0\r\nfor k in range(n):\r\n s=\"\"\r\n if(k%2):\r\n s=impar*(-1*(-n//2))\r\n else:\r\n s=par*(-1*(-n//2))\r\n cont+=s[:n].count(\"C\")\r\n L+=[s[:n]]\r\nprint(cont)\r\nprint(\"\\n\".join(L))\r\n", "n = int(input())\r\nif n%2 == 0:\r\n print(n//2*n)\r\nelse:\r\n print((n//2+1)*n - (n//2))\r\n\r\n\r\n\r\naux = 0\r\nfor i in range(n):\r\n a = [\".\"]*n\r\n for j in range(aux, n, 2):\r\n a[j] = \"C\"\r\n if aux == 0:\r\n aux = 1\r\n elif aux == 1:\r\n aux = 0\r\n print(\"\".join(map(str, a)))\r\n ", "def main() -> None:\r\n n = int(input())\r\n print((n * n + 1) // 2)\r\n res = 0\r\n for i in range(n):\r\n for j in range(n):\r\n print('C' if j & 1 == res else '.', end='')\r\n print()\r\n res ^= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nprint ((n**2+1)//2)\r\nfor i in range(n):\r\n print(('C.' * 1000)[i:i + n])\r\n", "a=int(input())\r\nif(a%2==0):\r\n print(a**2//2)\r\nelse:\r\n print((a**2+1)//2)\r\nfor i in range(0,a):\r\n if(i%2==0):\r\n for j in range(0,a):\r\n if(j%2==0):\r\n print(\"C\",end=\"\")\r\n else:\r\n print(\".\",end=\"\")\r\n print()\r\n else:\r\n for j in range(0,a):\r\n if(j%2==0):\r\n print(\".\",end=\"\")\r\n else:\r\n print(\"C\",end=\"\")\r\n print()", "\r\nn = int(input())\r\n\r\ncnt = 0\r\nfor i in range(1,n+1) :\r\n \r\n if i%2!=0 :\r\n if i!=n :\r\n \r\n cnt = cnt + 2*i \r\n \r\n else :\r\n cnt = cnt + i\r\n \r\nprint(cnt)\r\n \r\n \r\nfor i in range(n) :\r\n ans = \"\"\r\n for j in range(n) :\r\n \r\n if i%2==0 :\r\n if j%2==0 :\r\n \r\n ans = ans + \"C\"\r\n \r\n else :\r\n ans = ans + \".\"\r\n \r\n else :\r\n \r\n if j%2==0 :\r\n ans = ans + \".\"\r\n \r\n else :\r\n ans= ans + \"C\"\r\n \r\n print(ans)\r\n \r\n \r\n \r\n ", "import math\r\nn=int(input())\r\n\r\nif ((n & 1) == 0):\r\n total_coder=int(n*n/2)\r\n print(total_coder)\r\nelse:\r\n total_coder=int(math.ceil(n*n/2))\r\n print(total_coder)\r\n \r\nfor i in range(n): \r\n if ((i & 1) == 0):\r\n for_even_place=\"C.\"\r\n z= math.ceil(n/2)\r\n final_string=for_even_place*z\r\n print(final_string[0:n])\r\n else:\r\n for_odd_place=\".C\"\r\n z= math.ceil(n/2)\r\n final_string=for_odd_place*z\r\n print(final_string[0:n]) ", "n=int(input())\r\ns1=\"\"\r\nfor i in range(1,n+1):\r\n if i%2:\r\n s1+=\"C\"\r\n else:\r\n s1+=\".\"\r\ns2=s1.replace(\"C.\", \".C\")\r\ns2=s2.replace(\"CC\", \"C.\")\r\nif n%2:\r\n print((int(n/2+1))**2 + (int(n/2))**2)\r\nelse:\r\n print(int(n**2/2))\r\nfor i in range(1,n+1):\r\n if i%2:\r\n print(s1)\r\n else:\r\n print(s2)", "from math import ceil\r\nn = int(input())\r\ncounter = ((ceil(n/2)**2) + (n//2)**2)\r\nprint(counter)\r\nfor i in range(1, n+1):\r\n if i % 2 == 0:\r\n print(*list('.'*ceil(n/2)), sep='C', end='C\\n' if n % 2 == 0 else '\\n')\r\n else:\r\n print(*list('C'*ceil(n/2)), sep='.', end='.\\n' if n % 2 == 0 else '\\n')\r\n", "n = int(input())\r\n\r\nprint(n * n // 2 if n % 2 == 0 else n * (n // 2) + n // 2 + 1)\r\n\r\na = [['.' for i in range(n)] for j in range(n)]\r\nb = [''] * n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n pos_1 = i % 2 == 0 and j % 2 == 0\r\n pos_2 = i % 2 == 1 and j % 2 == 1\r\n if pos_1 or pos_2:\r\n a[i][j] = 'C'\r\n b[i] = ''.join(a[i])\r\n\r\nfor i in range(n):\r\n print(b[i], flush=False)\r\n", "n=int(input())\r\narr=\"\"\r\nbrr=\"\"\r\nfor x in range(n):\r\n if(x%2):\r\n arr+='C'\r\n brr+='.'\r\n else:\r\n arr+='.'\r\n brr+='C'\r\nprint((n*n+1)//2)\r\nfor x in range(n):\r\n if(x%2):\r\n print(arr)\r\n else:\r\n print(brr)", "# Wadea #\r\n\r\ns = int(input())\r\n\r\ns1 = \"\"\r\ns2 = \"\"\r\nfor i in range(s):\r\n if i % 2 == 0:\r\n s1 += \"C\"\r\n s2 += \".\"\r\n else:\r\n s1 += \".\"\r\n s2 += \"C\"\r\n\r\nlst1 = []\r\nlst2 = []\r\nfor j in range(s):\r\n if j % 2 == 0:\r\n lst1 += s1\r\n lst2 += s2\r\n else:\r\n lst1 += s1\r\n lst2 += s2\r\ncount_C = 0\r\nfor k in range(s):\r\n if k % 2 == 0:\r\n count_C += s1.count(\"C\")\r\n else:\r\n count_C += s2.count(\"C\")\r\nprint(count_C)\r\nfor k in range(s):\r\n if k % 2 == 0:\r\n print(s1)\r\n else:\r\n print(s2)\r\n\r\n", "n = int(input())\nprint(n % 2 + n * n // 2)\nfor i in range(n):\n if i % 2:\n print(''.join('C' if j % 2 else '.' for j in range(n)))\n else:\n print(''.join('.' if j % 2 else 'C' for j in range(n)))\n\n\n", "n = int(input())\r\n\r\nf = [['.' for i in range(n)] for j in range(n)]\r\nprint\r\n\r\n\r\nresult = 0\r\nfor i in range(0, n, 2):\r\n pos = i\r\n for j in range(0, n - i):\r\n f[j][i + j] = 'C'\r\n f[i + j][j] = 'C'\r\n result += 2\r\nresult -= n \r\nprint(result)\r\nfor l in f:\r\n print(''.join(l))\r\n ", "n = int(input())\r\nx = 0\r\nl = [['.' for _ in range(n+2)] for _ in range(n+2)]\r\nfor i in range(1,len(l)-1):\r\n for j in range(1,len(l)-1):\r\n if l[i][j+1] != 'C' and l[i][j-1] != 'C' and l[i+1][j] != 'C' and l[i-1][j] != 'C':\r\n l[i][j] = 'C'\r\n x+=1\r\nprint(x)\r\nfor i in range(1,len(l)-1):\r\n for j in range(1,len(l)-1):\r\n print(l[i][j],end=\"\")\r\n print()", "n = int(input())\ns = [['.'] * n for i in range(n)]\nprint(n * n // 2 + n % 2)\nfor i in range(n):\n\tfor j in range(n):\n\t\tif (i + j) % 2 == 0:\n\t\t\ts[i][j] = 'C'\nprint('\\n'.join([''.join(l) for l in s]))\n", "n=int(input())\r\n\r\nif n%2==1:\r\n\tprint((((n+1)//2)*n)-n//2)\r\n\tfor j in range (1,n+1):\r\n\t\tif j%2==1:\r\n\t\t\tfor i in range ((n-1)//2):\r\n\t\t\t\tprint(\"C.\",end=\"\")\r\n\t\t\tprint(\"C\")\r\n\t\telse :\r\n\t\t\tfor i in range ((n-1)//2):\r\n\t\t\t\tprint(\".C\",end=\"\")\r\n\t\t\tprint(\".\")\r\n\r\n\r\nelse :\r\n\tprint((n//2)*n)\r\n\tfor j in range (1,n+1):\r\n\t\tif j%2==1:\r\n\t\t\tfor i in range ((n)//2):\r\n\t\t\t\tprint(\"C.\",end=\"\")\r\n\t\t\tprint()\r\n\t\telse :\r\n\t\t\tfor i in range ((n)//2):\r\n\t\t\t\tprint(\".C\",end=\"\")\r\n\t\t\tprint()\r\n", "\"\"\"\nhttps://codeforces.com/problemset/problem/384/A\n\"\"\"\n\ndef solve(n):\n is_coder = True\n r = []\n c = 0\n for _ in range(n):\n l = ''\n for _ in range(n):\n if is_coder:\n l += 'C'\n c += 1\n else:\n l += '.'\n is_coder = not is_coder\n if n % 2 == 0:\n is_coder = not is_coder\n r.append(l)\n return c, r\n\ndef print_res(c, r):\n print(c)\n for l in r:\n print(l)\n\n\nn = int(input())\nprint_res(*solve(n))\n", "n=int(input())\r\nl=[]\r\ncnt=0\r\nfor io in range(0,n):\r\n if io%2==0:\r\n s=\"C\"\r\n else:\r\n s=\".\"\r\n for hj in range(0,n-1):\r\n if s[len(s)-1]==\"C\":\r\n s=s+\".\"\r\n else:\r\n s=s+\"C\"\r\n l.append(s)\r\n cnt=cnt+s.count(\"C\")\r\nprint(cnt)\r\nfor bn in range(0,len(l)):\r\n print(l[bn])\r\n", "s = int(input())\r\nadd = 0\r\nif s*s%2 != 0:\r\n add = 1\r\nprint((s*s)//2+add)\r\nfor x in range(s):\r\n for y in range(s):\r\n if x%2+y%2==2 or x%2+y%2 == 0:\r\n print(\"C\", end = \"\")\r\n else:\r\n print(\".\", end = \"\")\r\n print()", "a = int(input())\r\ns = \"\"\r\nfor i in range(a):\r\n if i%2 == 0:\r\n s+=((\"C.\"*(a//2+1))[:a])+\"\\n\"\r\n else:\r\n s+=((\".C\"*(a//2+1))[:a])+\"\\n\"\r\nprint(s.count(\"C\"))\r\nprint(s[:-1])", "#for _ in range(int(input())):\r\n #s,a,b,c=map(int,input().split())\r\nn=int(input())\r\nif(n%2==0):\r\n print((n//2)*n)\r\nelse:\r\n print((n//2)*n+n//2+1)\r\nfor i in range(n):\r\n for j in range(n):\r\n if((j-i)%2==0):\r\n print(\"C\",end=\"\")\r\n else:\r\n print(\".\",end=\"\")\r\n print()", "n = int(input())\nr, l = 0, [\"\", \"\"]\n\nfor i in range(n):\n r += n//2 + n % 2*(1 - i % 2)\n l[0] += \"C\" if i % 2 == 0 else \".\"\n l[1] += \"C\" if i % 2 == 1 else \".\"\nprint(r)\ns = l[0]\nfor i in range(1, n):\n s += '\\n' + l[i % 2]\nprint(s)\n", "# -*- coding: utf-8 -*-\r\nn = int(input())\r\n\r\nif n % 2 == 0:\r\n print(n*n // 2)\r\n print('\\n'.join([('C.' if i % 2 == 0 else '.C') * (n//2) for i in range(n)]))\r\nelse:\r\n p = n // 2\r\n q = (n+1) // 2\r\n print(p*p + q*q)\r\n print('\\n'.join([('C.' * p + 'C') if i % 2 == 0 else ('.C' * p + '.') for i in range(n)]))", "n = [int(i) for i in input().split()][0]\r\nprint (n**2//2 + n %2)\r\nif n %2 == 1:\r\n for i in range(n):\r\n if i%2 == 0:\r\n print ('C.' * (n//2) + 'C')\r\n else:\r\n print ('.C' * (n//2) + '.')\r\nelse:\r\n for i in range(n):\r\n if i%2 == 0:\r\n print ('C.' * (n//2))\r\n else:\r\n print ('.C' * (n//2))\r\n", "n = int(input())\r\nd = []\r\nfor k in range(n):\r\n if k % 2 == 0:\r\n w = 'C'\r\n else:\r\n w = '.'\r\n while True:\r\n if len(w) == n:\r\n break\r\n else:\r\n if w[-1] == '.':\r\n w += 'C'\r\n else:\r\n w += '.'\r\n d.append(w)\r\nprint(int(((n*n+1)/2)//1))\r\nfor k in d:\r\n print(k)", "from collections import *\r\nfrom math import *\r\n\r\nn = int(input())\r\na = [['.' for i in range(n)] for j in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif (i+j)%2 == 0:\r\n\t\t\ta[i][j] = 'C'\r\n\t\t\tans += 1\r\nprint(ans)\r\nfor i in range(n):\r\n\tprint(\"\".join(a[i]))\r\n", "def main():\r\n n = int(input())\r\n\r\n r = ((n + 1)//2)**2 + (n//2)**2\r\n\r\n print(r)\r\n\r\n s1 = []\r\n s2 = []\r\n for i in range(1, n + 1):\r\n if i % 2 == 1:\r\n s1.append('C')\r\n s2.append('.')\r\n else:\r\n s1.append('.')\r\n s2.append('C')\r\n\r\n s1 = \"\".join(s1)\r\n s2 = \"\".join(s2)\r\n\r\n for i in range(1, n + 1):\r\n print(i % 2 == 1 and s1 or s2)\r\n\r\nmain()", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn = int(input())\r\nif not n % 2:\r\n\tprint(n * (n // 2))\r\nelse:\r\n\tprint((n // 2 + 1) ** 2 + (n // 2) ** 2)\r\na = True\r\nif n % 2:\r\n\tfor i in range(n):\r\n\t\tans = \"\"\r\n\t\tif a:\r\n\t\t\tans += \"C.\" * (n // 2) + \"C\"\r\n\t\t\ta = False\r\n\t\telse:\r\n\t\t\tans += \".C\" * (n // 2) + \".\"\r\n\t\t\ta = True\r\n\t\tprint(ans)\r\nelse:\r\n\tfor i in range(n):\r\n\t\tans = \"\"\r\n\t\tif a:\r\n\t\t\tans += \"C.\" * (n // 2)\r\n\t\t\ta = False\r\n\t\telse:\r\n\t\t\tans += \".C\" * (n // 2)\r\n\t\t\ta = True\r\n\t\tprint(ans)\r\n", "n=int(input())\r\nif n%2==0:\r\n print(n*n//2)\r\n for i in range(0,n):\r\n if i%2==0:\r\n k=''\r\n for j in range(0,n):\r\n if j%2==0:\r\n k+='C'\r\n else:\r\n k+='.'\r\n print(k)\r\n else:\r\n k=''\r\n for j in range(0,n):\r\n if j%2==0:\r\n k+='.'\r\n else:\r\n k+='C'\r\n print(k)\r\nelse:\r\n print((n//2+1)**2+(n//2)**2)\r\n for i in range(0,n):\r\n if i%2==0:\r\n k=''\r\n for j in range(0,n):\r\n if j%2==0:\r\n k+='C'\r\n else:\r\n k+='.'\r\n print(k)\r\n else:\r\n k=''\r\n for j in range(0,n):\r\n if j%2==0:\r\n k+='.'\r\n else:\r\n k+='C'\r\n print(k)\r\n", "n = int(input())\nif n % 2 == 0:\n print((n // 2) * n)\nelse:\n a = -(-n) // 2\n b = n - a\n print(a * a + b * b)\nfor i in range(n):\n ans = ''\n for j in range(n):\n if (i + j) % 2 == 0:\n ans += 'C'\n else:\n ans += '.'\n print(ans)\n \t \t \t\t \t \t\t \t \t \t\t\t", "a=int(input())\r\nif a%2==0:\r\n\tprint((a**2)//2)\r\nelif a%2!=0:\r\n\tprint(((a**2)+1)//2)\r\np=\"\"\r\nfor i in range(a):\r\n\tif i%2==0:\r\n\t\tp+=\"C\"\r\n\telif i%2!=0:\r\n\t\tp+=\".\"\r\nq=\"\"\r\nfor i in range(a):\r\n\tif i%2!=0:\r\n\t\tq+=\"C\"\r\n\telif i%2==0:\r\n\t\tq+=\".\"\r\nfor j in range(a):\r\n\tif j%2==0:\r\n\t\tprint(p)\r\n\telif j%2!=0:\r\n\t\tprint(q)", "import math\r\n\r\nn = int(input())\r\n\r\nprint(str(math.ceil(n / 2) * math.ceil(n / 2) + math.floor(n / 2) * math.floor(n / 2)))\r\n\r\nstart = True\r\nfor i in range(n):\r\n current = start\r\n for j in range(n):\r\n if current:\r\n print(\"C\", end=\"\")\r\n else:\r\n print(\".\", end=\"\")\r\n current = not current\r\n print()\r\n start = not start\r\n", "a=int(input())\r\nprint((a**2+1)//2)\r\nfor i in range(a):\r\n s=\"\"\r\n for j in range(a):\r\n \r\n if (i+j)%2==0:\r\n s=s+\"C\"\r\n else:\r\n s=s+\".\"\r\n print(s)", "n = int(input())\r\n\r\nm = ''\r\nfor i in range(n):\r\n for j in range(n):\r\n if i%2 == 0 and j%2 ==0 :\r\n m +='C'\r\n elif i%2 != 0 and j%2 !=0 :\r\n m +='C'\r\n else:\r\n m +='.'\r\n m +='\\n'\r\nprint(int((n*n)/2+ (n*n)%2))\r\nprint(m)\r\n", "import time\r\nnumber=int(input())\r\n#start_time=time.time()\r\ntota_no_of_coders=((number+1)//2)*((number+1)//2)\r\ntota_no_of_coders=tota_no_of_coders+(number//2)*(number//2)\r\nprint(tota_no_of_coders)\r\ndef make_line(number,flag):\r\n dict={}\r\n dict[0]='C'\r\n dict[1]='.'\r\n line=''\r\n for i in range(number):\r\n line=''.join([line,dict[flag]])\r\n flag=(flag+1)%2\r\n return line\r\nline1=make_line(number,0)\r\nline2=make_line(number,1)\r\n\r\n\r\ndef print_lines(number,line_number):\r\n if(line_number%2==0):\r\n eval('print(line1)')\r\n else:\r\n eval('print(line2)')\r\n\r\n\r\n'''\r\ndef print_line(number,line_number):\r\n dict={}\r\n dict[0]='C'\r\n dict[1]='.'\r\n flag=line_number%2\r\n for i in range(number):\r\n print(dict[flag],end='')\r\n flag=(flag+1)%2\r\n print('')\r\n'''\r\nfor i in range(number):\r\n print_lines(number,i)\r\n#end_time=time.time()\r\n#print(end_time-start_time)", "x=int(input())\r\np=['C' for i in range((x+1)//2)]\r\nq=p.copy()\r\nq.pop()\r\nif x%2==0:\r\n\tprint((x//2)*x)\r\n\tfor i in range(x//2):\r\n\t\tprint(\".\".join(p)+\".\")\r\n\t\tprint(\".\"+\".\".join(p))\r\nelse:\r\n\tprint(((x+1)//2)*x-(x//2))\r\n\tfor i in range(x//2):\r\n\t\tprint('.'.join(p))\r\n\t\tprint('.'+'.'.join(q)+'.')\r\n\tprint('.'.join(p))", "n=int(input())\r\nif n%2==0:\r\n\tprint(n*n//2)\r\nelse:\r\n\tprint(n//2*n+n//2+1)\r\nline1='C.'*(n//2+1)\r\nline2='.C'*(n//2+1)\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\tprint(line1[:n])\r\n\telse:\r\n\t\tprint(line2[:n])\r\n", "n = int(input())\r\nif(n % 2 == 0):\r\n print(n * (n // 2))\r\nelse:\r\n halfN = (n // 2)\r\n print(((halfN + 1) * (halfN + 1)) + (halfN * (halfN)))\r\n\r\nfor i in range(n):\r\n result = ''\r\n isEven = i % 2 == 0\r\n for j in range(n):\r\n if(isEven):\r\n if(j % 2 == 0):\r\n result += 'C'\r\n else:\r\n result += '.'\r\n else:\r\n if(j % 2 == 0):\r\n result += '.'\r\n else:\r\n result += 'C'\r\n print(result)\r\n", "from math import ceil\r\nn=int(input())\r\nb=[]\r\nprint(ceil((n*n)/2))\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n print(*list('C'*ceil(n/2)),sep='.',end='')\r\n if n%2==0:\r\n print('.')\r\n else:\r\n print()\r\n else:\r\n print(*list('.'*ceil(n/2)),sep='C',end='')\r\n if n%2==0:\r\n print('C')\r\n else:\r\n print()", "n = int(input())\nif n%2 == 0:\n print(n*n//2)\n for x in range(n//2):\n for x in range(n//2):\n print(\"C.\", end = \"\")\n print(\"\")\n for x in range(n//2):\n print(\".C\", end = \"\")\n print(\"\")\nelse:\n print((((n//2) + 1)*((n//2) + 1)) + ((n//2)*(n//2)))\n for x in range(n//2):\n for x in range(n//2):\n print(\"C.\", end = \"\")\n print(\"C\")\n for x in range(n//2):\n print(\".C\", end = \"\")\n print(\".\")\n for x in range(n//2):\n print(\"C.\", end = \"\")\n print(\"C\")", "import math\r\nn=int(input())\r\nif n%2==0:\r\n print(int(n**2/2))\r\nif n%2!=0:\r\n print(math.ceil(n**2/2))\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n if n%2!=0:\r\n print(\"C.\" *int(n/2)+'C')\r\n elif n%2==0:\r\n print(\"C.\" * int(n/2))\r\n elif i%2==0:\r\n if n%2!=0:\r\n print(\".C\" * int(n/2)+'.')\r\n elif n%2==0:\r\n print(\".C\"*int(n/2))\r\n", "n = int(input())\r\nprint((n**2 + 1)//2)\r\nfor i in range(n):\r\n if i%2 == 0: print(n//2 * 'C.' if n%2 == 0 else n//2 * 'C.' + 'C')\r\n else: print(n//2 * '.C' if n%2 == 0 else n//2 * '.C' + '.')\r\n", "n=int(input())\r\nprint(((n//2)**2)+int((n+1)//2)**2)\r\nfor i in range(n):print({True:(\"C.\"*n)[:n],False:((\".C\"*n)[:n])}[i%2==0])", "x = int(input())\r\nprint((x*x+1)//2)\r\nfor i in range(x):\r\n for j in range(x):\r\n print('C' if (i+j) % 2 == 0 else '.', end=\"\")\r\n print()\r\n", "# not Completed\n\nx = int(input())\n\nans = \"\"\ncount = 0\n\nfor i in range(x):\n if i % 2 == 0:\n line = \"C.\" * (x // 2)\n if x % 2 != 0:\n line += \"C\"\n else:\n line = \".C\" * (x // 2)\n if x % 2 != 0:\n line += \".\"\n count += line.count(\"C\")\n ans += line + \"\\n\"\n\nprint(count)\nprint(ans)\n", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n for i2 in range(n):\r\n if i%2==0:\r\n if i2%2==0:\r\n ans+=1\r\n else:\r\n if i2%2==1:\r\n ans+=1\r\nprint(ans)\r\nfor i in range(n):\r\n for i2 in range(n):\r\n if i%2==0:\r\n if i2%2==0:\r\n print(\"C\",end=\"\")\r\n else:\r\n print(\".\",end=\"\")\r\n else:\r\n if i2%2==1:\r\n print(\"C\",end=\"\")\r\n else:\r\n print(\".\",end=\"\")\r\n if i2==n-1:\r\n print(\"\")", "n = int(input())\n\nif not n%2:\n num = ((n // 2) ** 2) * 2\nelse:\n num = (n // 2) ** 2 + (n // 2 + 1) ** 2\n\nprint(num)\n\nfor i in range(n):\n if not i%2:\n print('C.'*(n//2) + 'C'*(n % 2))\n else:\n print('.C'*(n//2) + '.'*(n % 2))\n", "n=int(input())\r\nif(n%2==1):\r\n k=n//2\r\n print((n*n)//2+1)\r\n for i in range(n//2):\r\n print('C.'*k+'C')\r\n print('.C'*k+'.')\r\n print('C.'*k+'C')\r\nelse:\r\n k=n//2\r\n print(n*n//2)\r\n for i in range(n//2):\r\n print('C.'*k)\r\n print('.C'*k)\r\n", "n = int(input())\r\nprint((n*n+1)//2)\r\nd, r = divmod(n, 2)\r\ne = 'C.'*d+'C'*r\r\no = '.C'*d+'.'*r\r\nfor i in range(n):\r\n if i % 2:\r\n print(o)\r\n else:\r\n print(e)\r\n", "import math\r\nlength = int(input())\r\n\r\nbase = \"C.\"\r\n\r\neven = \"\"\r\nodd = \"\"\r\nresult = 0\r\nif(length % 2 == 0):\r\n result = (length/2) * length\r\nelse:\r\n result = int((length- 1) / 2)\r\n result = result + (result + 1)\r\n result = math.ceil(result * (length / 2.0))\r\n \r\nprint(int(result)) \r\n \r\nif( length % 2 == 1):\r\n even = (base * int((length- 1) / 2)) + 'C'\r\n base = \".C\"\r\n odd = ((base * int((length- 1) / 2))) + '.'\r\nelse:\r\n even = (base * int(length /2))\r\n base = \".C\"\r\n odd= (base * int(length/2) )\r\n \r\nfor i in range(1,length +1):\r\n if(i % 2== 1):\r\n print(even)\r\n else:\r\n print(odd)\r\n \r\n", "from math import ceil, trunc\n\nn = int(input())\n\nk1 = 0\nline1 = []\nb = True\nfor i in range(n):\n line1.append('C' if b else '.')\n k1 += b\n b = not b\nline1 = ''.join(line1)\n\nk2 = 0\nline2 = []\nb = False\nfor i in range(n):\n line2.append('C' if b else '.')\n k2 += b\n b = not b\nline2 = ''.join(line2)\n\nprint(ceil(n / 2) * k1 + trunc(n / 2) * k2)\n\nb = True\nfor i in range(n):\n print(line1 if b else line2)\n b = not b\n", "a = int(input())\r\nz,b =0,[]\r\nfor i in range(a):\r\n\tv =[]\r\n\tfor j in range(a):\r\n\t\tif i%2==0:\r\n\t\t\tif j%2==0:v.append(\"C\");z+=1\r\n\t\t\telse:v.append(\".\")\r\n\t\telse:\r\n\t\t\tif j%2==0:v.append(\".\")\r\n\t\t\telse:v.append(\"C\");z+=1\r\n\tb.append(v)\r\nprint(z)\r\nfor i in b:\r\n\tprint(\"\".join(i))", "from math import ceil\r\n\r\nn = int(input())\r\nprint(ceil(n*n / 2))\r\na = (\"C.\" * n)[:n]\r\nb = (\"C.\" * n)[1:n+1]\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n print(a)\r\n else:\r\n print(b)\r\n", "import math\r\nn=int(input())\r\nc=['C','.']\r\nf=\"\".join([c[x&1] for x in range(n)])\r\ns=\"\".join([c[not(x&1)] for x in range(n)])\r\nq=[f,s]\r\nprint((math.trunc(n/2)+1)**2+(n>>1)**2 if n&1 else n*(n>>1))\r\nprint(\"\".join([str(q[x&1])+'\\n' for x in range(n)]))\r\n\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = [0] * 2\r\n for i in range(n):\r\n for j in range(n):\r\n val = (i + j) % 2\r\n A[val] += 1\r\n print(max(A))\r\n if A[0] >= A[1]:\r\n for i in range(n):\r\n B = ['.'] * n\r\n for j in range(n):\r\n if (i + j) % 2 == 0:\r\n B[j] = 'C'\r\n print(''.join(B))\r\n else:\r\n for i in range(n):\r\n B = ['.'] * n\r\n for j in range(n):\r\n if (i + j) % 2 == 1:\r\n B[j] = 'C'\r\n print(''.join(B))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nk=0\r\ns=\"C.\"\r\nss=\".C\"\r\ns1=s*(n//2)\r\ns2=ss*(n//2)\r\nif n%2==1:\r\n s1+=\"C\"\r\n s2+=\".\"\r\ncount=0\r\nfor i in range(n//2):\r\n count+=s1.count(\"C\")\r\n count+=s2.count(\"C\")\r\nif n%2==1:\r\n count+=s1.count(\"C\")\r\nprint(count)\r\nfor i in range(n//2):\r\n print(s1)\r\n print(s2)\r\nif n%2==1:\r\n print(s1)\r\n", "n = int(input())\r\n\r\nmax_coders = (n*n)//2 + (n*n)%2\r\nprint(max_coders)\r\n\r\nfor i in range(n):\r\n row = \"\"\r\n for j in range(n):\r\n if (i+j)%2 == 0 and max_coders > 0:\r\n row += \"C\"\r\n max_coders -= 1\r\n else:\r\n row += \".\"\r\n print(row)\r\n", "n = int(input())\r\npair = n//2\r\nnum_C = pair*2\r\nodd = \"C.\"*pair\r\neve = \".C\"*pair\r\n\r\nif n%2 !=0:\r\n odd += \"C\"\r\n eve += \".\"\r\n num_C += 1\r\n num_C *= n//2\r\n num_C += pair+1\r\nelse:\r\n num_C *= n//2\r\n \r\n\r\nprint (num_C)\r\n\r\nfor x in range(1,n+1):\r\n if x%2 != 0:\r\n print (odd)\r\n else:\r\n print (eve)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\nif n %2 == 0:\r\n print(int(n**2/2))\r\n for cont in range(0,n,2):\r\n s = 'C.'*int(n/2)\r\n print(s)\r\n s = '.C'*int(n/2)\r\n print(s)\r\nelse:\r\n print(int((n**2+1)/2))\r\n print ('C.'*int(n/2)+'C')\r\n for cont in range(1,n,2):\r\n print('.C'*int(n/2)+'.')\r\n print('C.'*int(n/2)+'C')" ]

[ "def main():\r\n n, m = map(int, input().split())\r\n l = list(tuple(map(int, input().split())) for _ in range(n))\r\n ma = max(x for _ in l for x in _)\r\n bb = l[0]\r\n x = bb[0]\r\n aa = [_[0] - x for _ in l]\r\n err = set(map(abs, filter(None, (a + b - x for a, row in zip(aa, l) for b, x in zip(bb, row)))))\r\n if err:\r\n k = err.pop()\r\n if err or k <= ma:\r\n print('NO')\r\n return\r\n else:\r\n k = ma + 1\r\n for i in range(n):\r\n aa[i] %= k\r\n print('YES')\r\n print(k)\r\n print(*aa)\r\n print(*bb)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, m = map(int, input().split())\r\nw = [[0] * (m + 1) for _ in range(n + 1)]\r\nk = -1\r\nb = [0] * 111\r\na = [0] * 111\r\nfor i in range(1, n + 1):\r\n w[i][1:] = list(map(int, input().split()))\r\na[0] = 0\r\nb[1:m + 1] = w[1][1:m + 1]\r\nfor i in range(2, n + 1):\r\n a[i] = -1\r\n for j in range(1, m + 1):\r\n if b[j] <= w[i][j]:\r\n if a[i] != -1 and a[i] != w[i][j] - b[j]:\r\n print(\"NO\")\r\n exit()\r\n a[i] = w[i][j] - b[j]\r\n if a[i] != -1:\r\n for j in range(1, m + 1):\r\n if b[j] > w[i][j]:\r\n if k != -1 and k != a[i] + b[j] - w[i][j]:\r\n print(\"NO\")\r\n exit()\r\n k = a[i] + b[j] - w[i][j]\r\nif k == -1:\r\n k = int(1e10) + 9\r\nfor i in range(2, n + 1):\r\n if w[i][1] >= b[1]:\r\n a[i] = w[i][1] - b[1]\r\n else:\r\n a[i] = (w[i][1] + k - b[1]) % k\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if (a[i] + b[j]) % k != w[i][j]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nprint(k)\r\nprint(\" \".join(str(a[i]) for i in range(1, n + 1)))\r\nprint(\" \".join(str(b[j]) for j in range(1, m + 1)))# 1692262302.7646472" ]

[ "import io\nimport os\n\n# List with O(n^1/3) (for n=10**6) get/set/insert/delete based on: https://github.com/cheran-senthil/PyRival/blob/master/pyrival/data_structures/SortedList.py\n\n\nclass UnsortedList:\n def __init__(self, iterable=[], _load=200):\n \"\"\"Initialize sorted list instance.\"\"\"\n values = sorted(iterable)\n self._len = _len = len(values)\n self._load = _load\n self._lists = _lists = [values[i : i + _load] for i in range(0, _len, _load)]\n self._list_lens = [len(_list) for _list in _lists]\n # self._mins = [_list[0] for _list in _lists]\n self._fen_tree = []\n self._rebuild = True\n\n def _fen_build(self):\n \"\"\"Build a fenwick tree instance.\"\"\"\n self._fen_tree[:] = self._list_lens\n _fen_tree = self._fen_tree\n for i in range(len(_fen_tree)):\n if i | i + 1 < len(_fen_tree):\n _fen_tree[i | i + 1] += _fen_tree[i]\n self._rebuild = False\n\n def _fen_update(self, index, value):\n \"\"\"Update `fen_tree[index] += value`.\"\"\"\n if not self._rebuild:\n _fen_tree = self._fen_tree\n while index < len(_fen_tree):\n _fen_tree[index] += value\n index |= index + 1\n\n def _fen_query(self, end):\n \"\"\"Return `sum(_fen_tree[:end])`.\"\"\"\n if self._rebuild:\n self._fen_build()\n\n _fen_tree = self._fen_tree\n x = 0\n while end:\n x += _fen_tree[end - 1]\n end &= end - 1\n return x\n\n def _fen_findkth(self, k):\n \"\"\"Return a pair of (the largest `idx` such that `sum(_fen_tree[:idx]) <= k`, `k - sum(_fen_tree[:idx])`).\"\"\"\n _list_lens = self._list_lens\n if k < _list_lens[0]:\n return 0, k\n if k >= self._len - _list_lens[-1]:\n return len(_list_lens) - 1, k + _list_lens[-1] - self._len\n if self._rebuild:\n self._fen_build()\n\n _fen_tree = self._fen_tree\n idx = -1\n for d in reversed(range(len(_fen_tree).bit_length())):\n right_idx = idx + (1 << d)\n if right_idx < len(_fen_tree) and k >= _fen_tree[right_idx]:\n idx = right_idx\n k -= _fen_tree[idx]\n return idx + 1, k\n\n def _delete(self, pos, idx):\n \"\"\"Delete value at the given `(pos, idx)`.\"\"\"\n _lists = self._lists\n # _mins = self._mins\n _list_lens = self._list_lens\n\n self._len -= 1\n self._fen_update(pos, -1)\n del _lists[pos][idx]\n _list_lens[pos] -= 1\n\n if _list_lens[pos]:\n # _mins[pos] = _lists[pos][0]\n pass\n else:\n del _lists[pos]\n del _list_lens[pos]\n # del _mins[pos]\n self._rebuild = True\n\n def __len__(self):\n \"\"\"Return the size of the sorted list.\"\"\"\n return self._len\n\n def __getitem__(self, index):\n \"\"\"Lookup value at `index` in sorted list.\"\"\"\n pos, idx = self._fen_findkth(self._len + index if index < 0 else index)\n return self._lists[pos][idx]\n\n def __delitem__(self, index):\n \"\"\"Remove value at `index` from sorted list.\"\"\"\n pos, idx = self._fen_findkth(self._len + index if index < 0 else index)\n self._delete(pos, idx)\n\n def __setitem__(self, index, value):\n pos, idx = self._fen_findkth(self._len + index if index < 0 else index)\n self._lists[pos][idx] = value\n\n def insert(self, index, value):\n _load = self._load\n _lists = self._lists\n _list_lens = self._list_lens\n\n if _lists:\n pos, idx = self._fen_findkth(self._len + index if index < 0 else index)\n self._fen_update(pos, 1)\n _list = _lists[pos]\n _list.insert(idx, value)\n _list_lens[pos] += 1\n if _load + _load < len(_list):\n _lists.insert(pos + 1, _list[_load:])\n _list_lens.insert(pos + 1, len(_list) - _load)\n _list_lens[pos] = _load\n del _list[_load:]\n self._rebuild = True\n else:\n _lists.append([value])\n _list_lens.append(1)\n self._rebuild = True\n self._len += 1\n\n def __iter__(self):\n \"\"\"Return an iterator over the sorted list.\"\"\"\n return (value for _list in self._lists for value in _list)\n\n def __reversed__(self):\n \"\"\"Return a reverse iterator over the sorted list.\"\"\"\n return (value for _list in reversed(self._lists) for value in reversed(_list))\n\n def __repr__(self):\n \"\"\"Return string representation of sorted list.\"\"\"\n return \"SortedList({0})\".format(list(self))\n\n\ndef solve(N, M, queries):\n idToMark = [-1 for i in range(N)]\n cups = UnsortedList([i for i in range(N)])\n for mark, pos in queries:\n pos -= 1 # 0-indexed\n cupId = cups[pos]\n del cups[pos]\n cups.insert(0, cupId)\n\n if idToMark[cupId] == -1:\n idToMark[cupId] = mark\n elif idToMark[cupId] != mark:\n return b\"-1\"\n\n markToCounts = [0 for i in range(N + 1)]\n for cupId, mark in enumerate(idToMark):\n if mark != -1:\n markToCounts[mark] += 1\n if markToCounts[mark] > 1:\n return b\"-1\"\n\n j = 1\n ans = []\n for cupId, mark in enumerate(idToMark):\n if mark != -1:\n ans.append(mark)\n else:\n while markToCounts[j] > 0:\n j += 1\n ans.append(j)\n j += 1\n return b\" \".join(str(x).encode(\"ascii\") for x in ans)\n\n\nif False:\n N, M = 10 ** 6, 10 ** 6\n queries = [[N // 2 + (i % (N // 2)), N // 2] for i in range(M)]\n ans = solve(N, M, queries)\n # print(ans)\n assert ans != b\"-1\"\n exit()\n\nif __name__ == \"__main__\":\n input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\n N, M = [int(x) for x in input().split()]\n queries = ((int(x) for x in input().split()) for i in range(M))\n ans = solve(N, M, queries)\n\n os.write(1, ans)\n" ]

[ "from sys import stdin\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\ndef dfs(x,y,z):\r\n\tif x==y:return True\r\n\tg[x]=1\r\n\tfor p in cl[x]:\r\n\t\tif p[1]==z and g[p[0]]==0 and dfs(p[0],y,z):return True\r\n\treturn False\r\nn,m=R()\r\ncl=[[] for i in range(n)]\r\nfor i in range(m):\r\n\ta,b,c=R()\r\n\tcl[a-1].append([b-1,c-1])\r\n\tcl[b-1].append([a-1,c-1])\r\nq=I()\r\ns=[0]*q\r\nfor i in range(q):\r\n\tu,v=R()\r\n\tfor j in range(100):\r\n\t\tg=[0]*(n)\r\n\t\tif dfs(u-1,v-1,j):s[i]+=1\r\nfor i in s:print(i)", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\ndef dfs(u,i,v):\r\n global l\r\n global z\r\n vis[u]=1\r\n if u==v:\r\n z=1\r\n return 0\r\n for w in l[i][u]:\r\n if vis[w]==0:\r\n dfs(w,i,v)\r\n\r\nn,m=map(int,input().split())\r\nl=[[[] for j in range(101)] for i in range(101)]\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n l[c][a].append(b)\r\n l[c][b].append(a)\r\nq=int(input())\r\nfor __ in range(q):\r\n u,v=map(int,input().split())\r\n ans=0\r\n for i in range(1,101):\r\n vis=[0]*(101)\r\n if len(l[i][u])==0 or len(l[i][v])==0:\r\n continue\r\n z=0\r\n dfs(u,i,v)\r\n if z==1:\r\n ans+=1\r\n print(ans)", "from collections import defaultdict\r\n \r\n \r\ndef dfs(graph, start, end, visited, color):\r\n q = [start]\r\n while q:\r\n node = q.pop()\r\n visited[node] = True\r\n \r\n if node == end:\r\n break\r\n \r\n for v in graph[color][node]:\r\n if not visited[v]:\r\n q.append(v)\r\n \r\n \r\ndef has_path(graph, start, end, visited, color):\r\n for i in range(len(visited)):\r\n visited[i] = False\r\n \r\n dfs(graph, start, end, visited, color)\r\n return visited[end]\r\n \r\n \r\nn, m = map(int, input().split())\r\n \r\ngraph = defaultdict(lambda: defaultdict(list))\r\n \r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n \r\n graph[c][a].append(b)\r\n graph[c][b].append(a)\r\n \r\nvisited = [False] * n\r\n \r\nq = int(input())\r\n \r\nfor _ in range(q):\r\n u, v = map(int,input().split())\r\n u -= 1\r\n v -= 1\r\n ans = 0\r\n \r\n for c in graph.keys():\r\n if has_path(graph, u, v, visited, c):\r\n ans += 1\r\n \r\n print(ans)\r\n", "def make_set(color, v):\n if (parent[color][v] != -1):\n return\n parent[color][v] = v\n rank[color][v] = 0\n\ndef find_set(color, v):\n if (parent[color][v] == -1):\n return -1\n if (v == parent[color][v]):\n return v\n parent[color][v] = find_set(color, parent[color][v])\n return parent[color][v]\n\ndef union_set(color, a, b):\n a = find_set(color, a)\n b = find_set(color, b)\n if (a != b):\n if (rank[color][a] < rank[color][b]):\n a, b = b, a\n parent[color][b] = a\n if (rank[color][a] == rank[color][b]):\n rank[color][a] += 1\n\n\nn, m = list(map(int, input().split()))\nparent = [[-1 for _ in range(n+1)] for _ in range(m+1)]\nrank = [[-1 for _ in range(n+1)] for _ in range(m+1)]\nfor i in range(m):\n a, b, c = list(map(int, input().split()))\n make_set(c, a)\n make_set(c, b)\n union_set(c, a, b)\n\nq = int(input())\nfor i in range(q):\n u, v = list(map(int, input().split()))\n result = 0\n for j in range(m+1):\n parent_u = find_set(j, u)\n parent_v = find_set(j, v)\n if (parent_u == -1 or parent_v == -1):\n continue\n if (parent_u == parent_v):\n result += 1\n print(result)\n\n", "class Graph(object):\r\n def __init__(self, num_nodes):\r\n self.num_nodes = num_nodes\r\n self.adj_list = {}\r\n\r\n def __add_directional_edge(self, a, b, c):\r\n if a in self.adj_list:\r\n if b in self.adj_list[a]:\r\n if c not in self.adj_list[a][b]:\r\n self.adj_list[a][b].append(c)\r\n else:\r\n self.adj_list[a][b] = []\r\n self.adj_list[a][b].append(c)\r\n else:\r\n self.adj_list[a] = {}\r\n self.adj_list[a][b] = []\r\n self.adj_list[a][b].append(c)\r\n\r\n def add_edge(self, a, b, c):\r\n self.__add_directional_edge(a, b, c)\r\n self.__add_directional_edge(b, a, c)\r\n\r\n def print_graph(self):\r\n print(self.adj_list)\r\n\r\n\r\ndef tc():\r\n g = readGraph()\r\n # g.print_graph()\r\n for k in range(1, g.num_nodes + 1):\r\n for i in range(1, g.num_nodes + 1):\r\n for j in range(1, g.num_nodes + 1):\r\n l1 = g.adj_list.get(i, {}).get(k, [])\r\n l2 = g.adj_list.get(k, {}).get(j, [])\r\n for color in l1:\r\n if color in l2:\r\n g.add_edge(i,j,color)\r\n # g.print_graph()\r\n return g\r\n\r\n\r\ndef readGraph():\r\n n, m = map(int, input().split())\r\n g = Graph(n)\r\n for _ in range(m):\r\n a, b, c = map(int, input().split())\r\n g.add_edge(a,b,c)\r\n return g\r\n\r\n\r\ndef read_query():\r\n q = int(input())\r\n q_list = []\r\n for _ in range(q):\r\n u,v = map(int, input().split())\r\n q_list.append((u,v))\r\n return q_list\r\n\r\n\r\ndef solve_query(g, q_list):\r\n for u,v in q_list:\r\n if u in g.adj_list:\r\n if v in g.adj_list[u]:\r\n print(len(g.adj_list[u][v]))\r\n else:\r\n print(\"0\")\r\n else:\r\n print(\"0\")\r\n\r\n\r\ndef main():\r\n g = tc()\r\n q_list = read_query()\r\n solve_query(g, q_list)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def main():\r\n def dfs(index, color):\r\n visited[index] = True\r\n for p in adj[index]:\r\n if not visited[p[0]] and p[1] == color:\r\n dfs(p[0], color)\r\n\r\n n, m = map(int, input().split())\r\n adj = [[] for _ in range(n)]\r\n for _ in range(m):\r\n a, b, c = map(int, input().split())\r\n adj[a - 1].append((b - 1, c))\r\n adj[b - 1].append((a - 1, c))\r\n q = int(input())\r\n for _ in range(q):\r\n a, b = map(int, input().split())\r\n ans = 0\r\n for i in range(1, m + 1):\r\n visited = [False] * n\r\n dfs(a - 1, i)\r\n if visited[b - 1]:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m=map(int,input().split())\r\ng=[[] for _ in range(n)]\r\nfor _ in range(m):\r\n a,b,c=map(int,input().split())\r\n g[a-1].append((b-1,c-1))\r\n g[b-1].append((a-1,c-1))\r\ndef dfs(x,c,t):\r\n if x==t:return True\r\n v[x]=1\r\n for j in g[x]:\r\n if j[1]==c and v[j[0]]==0:\r\n if dfs(j[0],c,t):return True\r\n return False\r\nq=int(input())\r\no=[0]*q\r\nv=[]\r\nfor i in range(q):\r\n f,y=map(int,input().split())\r\n for c in range(100):\r\n v=[0]*n\r\n if dfs(f-1,c,y-1):o[i]+=1\r\nprint('\\n'.join(list(map(str,o))))\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 21/05/2023 10:23:11 Hanoi, Vietnam\r\n# **/\r\n\r\nn, m = map(int, input().split())\r\n\r\ng = {}\r\nfor i in range(1, n+1):\r\n g[i] = []\r\n\r\nfor i in range(m):\r\n u, v, c = map(int, input().split())\r\n g[u].append([v, c])\r\n g[v].append([u, c])\r\n\r\nfor _ in range(int(input())):\r\n u, v = map(int, input().split())\r\n ans = 0\r\n\r\n for c in range(1, m+1):\r\n vis = [False for _ in range(n+1)]\r\n st = [u]\r\n while st:\r\n x = st.pop()\r\n if x == v:\r\n st.clear()\r\n ans += 1\r\n else:\r\n vis[x] = True\r\n for k in g[x]:\r\n if k[1] == c and vis[k[0]] == False:\r\n st.append(k[0])\r\n\r\n print(ans)", "from collections import defaultdict\r\nimport copy\r\n\r\n\r\ndef dfs(u, v, c):\r\n global ans\r\n\r\n if u == v:\r\n ans.add(c)\r\n return\r\n\r\n for e, i in g[u]:\r\n # print(u, e, i, c, 'dd')\r\n if not edges[min(e, u)][max(e, u)] and i == c:\r\n # print(u, e, i)\r\n edges[min(e, u)][max(e, u)] = 1\r\n dfs(e, v, c)\r\n return\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\ng = defaultdict(list)\r\nedges = defaultdict(dict)\r\n\r\nfor _ in range(m):\r\n u, v, i = map(int, input().split())\r\n g[u].append((v, i))\r\n g[v].append((u, i))\r\n edges[min(u, v)][max(u, v)] = 0\r\n\r\nc_edges = copy.deepcopy(edges)\r\n# print(g)\r\nfor _ in range(int(input())):\r\n ans = set()\r\n u, v = map(int, input().split())\r\n for i, c in g[u]:\r\n if not edges[min(u, i)][max(u, i)]:\r\n dfs(i, v, c)\r\n edges = copy.deepcopy(c_edges)\r\n # print(edges)\r\n print(len(ans))\r\n", "import math\r\nimport sys\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom functools import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom random import *\r\nfrom string import *\r\nfrom types import GeneratorType\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n# MOD = 998244353\r\n# MOD = 10 ** 9 + 7\r\n# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef solve() -> None:\r\n n, m = mint()\r\n edges = []\r\n for _ in range(m):\r\n u, v, c = mint()\r\n edges.append((u, v, c))\r\n\r\n cnt = Counter()\r\n fa = list(range(n + 1))\r\n def find(x: int):\r\n cur = x\r\n while x != fa[x]:\r\n x = fa[x]\r\n while fa[cur] != x:\r\n tmp = fa[cur]\r\n fa[cur] = x\r\n cur = tmp\r\n return x\r\n\r\n edges.append((n, n, m + 1))\r\n edges.sort(key = lambda x: x[2])\r\n prec = 0\r\n vs = set()\r\n for i, (u, v, c) in enumerate(edges):\r\n if c != prec:\r\n # 计数 & 重置并查集\r\n vl = sorted(vs)\r\n for i in range(len(vl)):\r\n x = vl[i]\r\n for j in range(i + 1, len(vl)):\r\n y = vl[j]\r\n if find(x) == find(y):\r\n cnt[(x, y)] += 1\r\n fa[x] = x\r\n\r\n prec = c\r\n vs.clear()\r\n\r\n fu = find(u)\r\n fv = find(v)\r\n fa[fv] = fu\r\n vs.add(u)\r\n vs.add(v)\r\n\r\n q = sint()\r\n for _ in range(q):\r\n u, v = mint()\r\n if u > v: u, v = v, u\r\n print(cnt[(u, v)])\r\n\r\n# for _ in range(int(input())):\r\nsolve()", "import os\r\nimport sys\r\nimport bisect\r\nimport functools\r\nimport math\r\nimport random\r\nimport threading\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom functools import cmp_to_key, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\nfrom io import BytesIO, IOBase\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom operator import add, iand, ior, itemgetter, mul, xor\r\nfrom string import ascii_lowercase, ascii_uppercase\r\n# from sortedcontainers import SortedList, SortedSet\r\nfrom typing import *\r\n\r\nBUFSIZE = 4096\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\n\r\n\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef II():\r\n return int(input())\r\n\r\n\r\ndef MII():\r\n return map(int, input().split())\r\n\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\n# from types import GeneratorType\r\n\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n#\r\n# return wrappedfunc\r\n\r\n\r\nsys.setrecursionlimit(100000)\r\n\r\ninf = float('inf')\r\nmod = 10 ** 9 + 7\r\n\r\n# for _ in range(II()):\r\nn, m = MII()\r\ng = defaultdict(dict)\r\ncolors = set()\r\nfor i in range(m):\r\n a, b, c = MII()\r\n colors.add(c)\r\n if b not in g[a]:\r\n g[a][b] = {c}\r\n g[b][a] = {c}\r\n else:\r\n g[a][b].add(c)\r\n g[b][a].add(c)\r\nQ = II()\r\ndef bfs(st, ed):\r\n res = 0\r\n for c in colors:\r\n q = deque()\r\n vis = set()\r\n q.appendleft(st)\r\n while q:\r\n t = q.popleft()\r\n if t == ed:\r\n res += 1\r\n break\r\n vis.add(t)\r\n for nxt in g[t]:\r\n if nxt in vis: continue\r\n for path in g[t][nxt]:\r\n if path != c: continue\r\n q.append(nxt)\r\n return res\r\n \r\nfor ii in range(Q):\r\n a, b = MII()\r\n print(bfs(a, b))", "from collections import defaultdict\n\n\ndef main():\n n, m = map(int, input().split())\n edges = defaultdict(lambda: defaultdict(list))\n for _ in range(m):\n a, b, c = map(int, input().split())\n d = edges[c]\n d[a].append(b)\n d[b].append(a)\n\n def dfs(t):\n chain.add(t)\n dd = color.get(t, ())\n for y in dd:\n if y not in chain:\n dfs(y)\n\n res = []\n chain = set()\n for _ in range(int(input())):\n a, b = map(int, input().split())\n x = 0\n for color in edges.values():\n chain.clear()\n dfs(a)\n if b in chain:\n x += 1\n res.append(str(x))\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "n,m = list(map(int, input().split()))\nvalor = n + 1\narr = [[] for x in range(valor)]\n\nfor i in range(m):\n val1,val2,val3 = map(int, input().split())\n arr[val1].append((val2, val3)) \n arr[val2].append((val1, val3))\n\nq = int(input())\n\ndef contador(val1, val2, val3):\n arr2[val1] = True\n if(val1 == val2):\n return 1\n for i,j in arr[val1]:\n if(j == val3):\n if(arr2[i] == False):\n if(contador(i, val2, val3)):\n return 1\n return 0 \n\n\nfor i in range(q):\n u,v = list(map(int, input().split())) \n cont = 0 \n for j in range(100):\n arr2 = [0] * (n+1)\n cont += contador(u, v, j+1)\n \n print(cont)\n \t\t \t\t\t\t\t\t\t \t\t \t \t \t \t \t", "import queue\r\n\r\ndef bfs(start,end,color):\r\n q=queue.Queue()\r\n q.put(start)\r\n used={}\r\n while not q.empty():\r\n d=q.get(0)\r\n for u in g[d]:\r\n if u[1]==color and u[0] not in used:\r\n used[u[0]]=1\r\n q.put(u[0])\r\n if end in used:\r\n return True\r\n else:\r\n return False\r\n\r\nn,m=map(int,input().split())\r\n\r\n\r\ng=[[] for i in range(n)]\r\ncolors={}\r\n\r\nfor _ in range(m):\r\n a,b,c=map(int,input().split())\r\n a-=1;b-=1\r\n if c not in colors:\r\n colors[c]=1\r\n g[b].append([a,c])\r\n g[a].append([b,c])\r\n\r\nq=int(input())\r\n\r\nfor _ in range(q):\r\n u,v=map(int,input().split())\r\n u-=1;v-=1\r\n\r\n res=0\r\n for color in colors:\r\n if bfs(u,v,color):\r\n res+=1\r\n\r\n print(res)\r\n\r\n\r\n", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nn, m = mp()\r\nd = defaultdict(list)\r\nfor _ in range(m):\r\n a, b, c = mp()\r\n d[(a, c)].append(b)\r\n d[(b, c)].append(a)\r\nQ = inp()\r\nv = [0 for i in range(n+1)]\r\nfor i in range(Q):\r\n x, y = mp()\r\n ans = 0\r\n for j in range(1, m+1):\r\n q = deque()\r\n q.append((x, j))\r\n copy_visited = list(v)\r\n copy_visited[x] = 1\r\n while q:\r\n a, b = q.popleft()\r\n if a == y:\r\n ans += 1\r\n break\r\n for k in d[(a, b)]:\r\n if not copy_visited[k]:\r\n copy_visited[k] = 1\r\n q.append((k, b))\r\n print(ans)\r\n", "from collections import defaultdict\r\n\r\n\r\ndef dfs(g, u, visited=None):\r\n if visited is None:\r\n visited = set()\r\n\r\n visited.add(u)\r\n for node in g[u]:\r\n if node not in visited:\r\n dfs(g, node, visited)\r\n\r\n return visited\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n graphs = {}\r\n for _ in range(m):\r\n a, b, c = map(int, input().split())\r\n if c not in graphs:\r\n graphs[c] = defaultdict(list)\r\n graphs[c][a].append(b)\r\n graphs[c][b].append(a)\r\n\r\n num_queries = int(input())\r\n for _ in range(num_queries):\r\n u, v = map(int, input().split())\r\n ans = 0\r\n for g in graphs.values():\r\n if v in dfs(g, u):\r\n ans += 1\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def find(y, x):\n p = dsu[y]\n if x == p[x]:\n return x \n return find(y, p[x])\n\ndef union(c, x ,y):\n x = find(c, x)\n y = find(c,y)\n if x == y:\n return \n p = dsu[c]\n p[x] = y \n\nn,m = map(int, input().split())\n\ndsu = [[i for i in range(n+1)] for _ in range(m+1)]\n\nfor _ in range(m):\n a,b,c = map(int, input().split())\n union(c,a,b)\n\nq = int(input())\n\nfor _ in range(q):\n a,b = map(int, input().split())\n count = 0\n\n for c in range(1,m+1):\n if find(c,a) == find(c,b):\n count += 1\n\n print(count)\n\t \t \t \t\t\t \t \t \t\t \t \t\t\t\t \t\t\t\t \t", "import math\r\nimport sys\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque, defaultdict\r\nfrom itertools import permutations\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef ii():\r\n return int(input())\r\n\r\n\r\ndef li():\r\n return list(input().split())\r\n\r\n\r\ndef mi():\r\n return map(int, input().split())\r\n\r\n\r\ndef lii():\r\n return list(map(int, input().split()))\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.parent = defaultdict(lambda :list(range(101)))\r\n self.size = defaultdict(lambda :list(range(101)))\r\n\r\n def find(self, a,c):\r\n acopy = a\r\n while a != self.parent[c][a]:\r\n a = self.parent[c][a]\r\n while acopy != a:\r\n self.parent[c][acopy], acopy = a, self.parent[c][acopy]\r\n return a\r\n\r\n def merge(self, a, b,c):\r\n s, f = self.find(a,c), self.find(b,c)\r\n if s == f:return\r\n ss, ff = s, f\r\n if self.size[c][s] > self.size[c][f]:\r\n ss, ff = f, s\r\n self.parent[c][ss] = ff\r\n self.size[c][ff] += self.size[c][ss]\r\n\r\n\r\n\r\nn,m = mi()\r\nuf = UnionFind(n)\r\nfor i in range(m):\r\n u,v,w = mi()\r\n uf.merge(u,v,w)\r\nfor _ in range(ii()):\r\n u,v = mi()\r\n cnt = 0\r\n for c in uf.parent:\r\n if uf.find(u,c) == uf.find(v,c):\r\n cnt += 1\r\n print(cnt)\r\n\r\n\r\n\r\n", "def find(fa,x):\r\n # 不会被卡爆栈的并查集find函数 省空间\r\n t = x\r\n while fa[x] != x:\r\n x = fa[x]\r\n while t != x:\r\n fa[t], t = x, fa[t]\r\n return x\r\n\r\ndef union(fa,son, father):\r\n # 数值往坐标高处合并 应该这么写才对\r\n x = find(fa,son)\r\n y = find(fa,father)\r\n if x != y:\r\n fa[x] = y\r\n\r\nn, m = map(int, input().split())\r\nfrom collections import defaultdict\r\ng = defaultdict(lambda: list(range(n+1)))\r\nfor _ in range(m):\r\n u, v, c = map(int, input().split())\r\n union(g[c], u, v)\r\nq = int(input())\r\nfor _ in range(q):\r\n u,v = map(int, input().split())\r\n ans = 0\r\n for k in g.keys():\r\n if find(g[k], u) == find(g[k], v):\r\n ans += 1\r\n # print(g)\r\n print(ans)", "n, m = list(map(int, input().split()))\r\nadj = [[] for _ in range(n + 1)]\r\nfor _ in range(m):\r\n a, b, c = list(map(int, input().split()))\r\n adj[a].append((b, c))\r\n adj[b].append((a, c))\r\n\r\nvisited = [False] * (n + 1)\r\n\r\ndef dfs(node, target, colour):\r\n if node == target:\r\n return True\r\n else:\r\n for ne in adj[node]:\r\n next, col = ne\r\n if col != colour:\r\n continue\r\n elif visited[next]:\r\n continue\r\n else:\r\n visited[next] = True\r\n if dfs(next, target, colour):\r\n visited[next] = False\r\n return True\r\n visited[next] = False\r\n return False\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n u, v = list(map(int, input().split()))\r\n re = set()\r\n for ne in adj[u]:\r\n next, col = ne\r\n visited[next] = True\r\n if dfs(next, v, col):\r\n re.add(col)\r\n visited[next] = False\r\n print(len(re))\r\n", "from collections import defaultdict,deque,Counter,OrderedDict\r\ndef main():\r\n N = 105\r\n n,m = map(int,input().split())\r\n par = [ [j for j in range(N)] for i in range(N)]\r\n\r\n def find(a,c):\r\n if par[c][a] == a: return a\r\n par[c][a] = find(par[c][a],c)\r\n return par[c][a]\r\n\r\n def merge(a,b,c):\r\n a = find(a,c)\r\n b = find(b,c)\r\n par[c][b] = a\r\n\r\n for i in range(m):\r\n a,b,c = map(int,input().split())\r\n a,b = a-1,b-1\r\n merge(a,b,c)\r\n\r\n q = int(input())\r\n for i in range(q):\r\n a,b = map(int,input().split())\r\n a,b,ans = a-1,b-1,0\r\n for i in range(N):\r\n if find(a,i) == find(b,i):\r\n ans +=1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "class CodeforcesTask505BSolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.edges = []\n self.q = 0\n self.queries = []\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n for x in range(self.n_m[1]):\n self.edges.append([int(y) for y in input().split(\" \")])\n self.q = int(input())\n for x in range(self.q):\n self.queries.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n graphs = [[[] for x in range(self.n_m[0])] for c in range(self.n_m[1])]\n for edge in self.edges:\n graphs[edge[2] - 1][edge[0] - 1].append(edge[1])\n graphs[edge[2] - 1][edge[1] - 1].append(edge[0])\n results = []\n for query in self.queries:\n to_visit = [(query[0], c) for c in range(self.n_m[1])]\n used = set()\n visited = [[False] * self.n_m[0] for x in range(self.n_m[1])]\n while to_visit:\n visiting = to_visit.pop(-1)\n\n if visiting[1] not in used and not visited[visiting[1]][visiting[0] - 1]:\n visited[visiting[1]][visiting[0] - 1] = True\n if visiting[0] == query[1]:\n used.add(visiting[1])\n else:\n to_visit.extend([(x, visiting[1]) for x in graphs[visiting[1]][visiting[0] - 1]])\n colors = len(used)\n results.append(colors)\n self.result = \"\\n\".join([str(x) for x in results])\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask505BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from sys import setrecursionlimit as setrec\nsetrec(10010)\n\ndef dfs(i, s, cnt):\n if colored[i][s] > 0: return\n colored[i][s] = cnt\n for t in g[i][s]:\n dfs(i, t, cnt)\n\nver_n, edge_n = map(int, input().split())\ng = [[[] for _ in range(ver_n)] for _ in range(edge_n)]\nfor _ in range(edge_n):\n a, b, c = map(lambda x: int(x)-1, input().split())\n g[c][a].append(b)\n g[c][b].append(a)\n\ncolored = [[0] * ver_n for _ in range(edge_n)]\nfor i in range(edge_n):\n cnt = 1\n for j in range(ver_n):\n dfs(i, j, cnt)\n cnt += 1\n\nq = int(input())\nfor i in range(q):\n cnt = 0\n u, v = map(lambda x: int(x)-1, input().split())\n for j in range(edge_n):\n if colored[j][u] == colored[j][v]:\n cnt += 1\n print(cnt)\n \n \n", "n, m = map(int, input().split())\r\nfs = [list(range(n + 1)) for _ in range(m + 1)]\r\n\r\ndef find(x, fa):\r\n if fa[x] != x:\r\n fa[x] = find(fa[x], fa)\r\n return fa[x]\r\n\r\ndef union(v, w, fa):\r\n fv = find(v, fa)\r\n fw = find(w, fa)\r\n if fv == fw: return\r\n fa[fv] = fw\r\n\r\nfor _ in range(m):\r\n v, w, c = map(int, input().split())\r\n union(v, w, fs[c])\r\n\r\nfor _ in range(int(input())):\r\n v, w = map(int, input().split())\r\n\r\n # 遍历所有颜色\r\n ans = 0\r\n for c in range(1, m + 1):\r\n fv = find(v, fs[c])\r\n fw = find(w, fs[c])\r\n if fv == fw:\r\n ans += 1\r\n print(ans)", "\r\nimport os,sys,collections,heapq,itertools\r\nif os.path.exists('in.txt'):\r\n file = open('in.txt') \r\n input = file.readline \r\nelse : \r\n input = sys.stdin.readline \r\nfrom functools import reduce \r\nfrom itertools import accumulate,chain,combinations,count \r\nfrom itertools import groupby,permutations,product,zip_longest\r\nfrom heapq import heapify,heappush,heappop,heapreplace,merge,nlargest,nsmallest\r\nfrom collections import Counter,defaultdict,deque \r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import comb,floor,ceil,inf ,gcd , sqrt \r\nimport functools \r\nreadi = lambda: int(input()) \r\nreadis = lambda: list(map(int,input().split()))\r\nreads = lambda: input().rstrip() \r\nreadss = lambda: input().split() \r\n\r\nclass UF():\r\n def __init__(self, n):\r\n self.n = n \r\n self.FA = list(range(n)) \r\n def getroot(self,x):\r\n path = []\r\n while x != self.FA[x]:\r\n path.append(x)\r\n x = self.FA[x]\r\n for w in path:\r\n self.FA[w] = x\r\n return x\r\n def union(self ,x, y): \r\n self.FA[self.getroot(x)] = self.getroot(y) \r\n def getgroup(self, vertices ):\r\n G = defaultdict(list)\r\n for i in vertices:\r\n G[self.getroot(i)].append(i)\r\n return G\r\ndef solution(): \r\n n,m = readis() \r\n E = defaultdict(list) \r\n for _ in range(m):\r\n x,y,c = readis() \r\n E[c].append((x,y)) \r\n u = UF(n+1) \r\n P = defaultdict(int)\r\n ST = defaultdict(set)\r\n L , cnt = int(sqrt(n)) , 0 \r\n for es in E.values():\r\n for x,y in es:\r\n u.union(x,y) \r\n st = set(chain(*es))\r\n G = u.getgroup(st)\r\n for v in G.values():\r\n if len(v) <= L : \r\n for x,y in combinations(v,2):\r\n P[(x,y)] += 1 \r\n P[(y,x)] += 1 \r\n else : \r\n for x in v:\r\n ST[x].add(cnt) \r\n cnt += 1 \r\n for x in st:\r\n u.FA[x] = x \r\n q = readi() \r\n for _ in range(q):\r\n x,y = readis() \r\n print( P[(x,y)] + len(ST[x] & ST[y]))\r\n \r\nfor i in range( 1 ):\r\n solution() \r\n\r\n\r\n \r\n ", "n, m = map(int, input().split())\r\nfrom collections import defaultdict \r\ng = defaultdict(list)\r\nfor _ in range(m):\r\n v, w, c = map(int, input().split())\r\n g[c].append([v, w])\r\n\r\nparent = defaultdict(lambda : list(range(n + 1)))\r\n\r\ndef find(x, c):\r\n if parent[c][x] != x:\r\n parent[c][x] = find(parent[c][x], c)\r\n return parent[c][x]\r\n\r\ndef union(x, y, c):\r\n xset = find(x, c)\r\n yset = find(y, c)\r\n if xset != yset:\r\n parent[c][yset] = xset\r\n\r\nfor c in g:\r\n for a, b in g[c]:\r\n union(a, b, c)\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n v, w = map(int, input().split())\r\n res = 0 \r\n for c in g:\r\n if find(parent[c][v], c) == find(parent[c][w], c):\r\n res += 1\r\n print(res) ", "# http://codeforces.com/contest/505/problem/B\nclass Node:\n\tdef __init__(self, n):\n\t\tself.n = n\n\t\tself.neighs = {}\n\n\tdef dfs_color(self, f, t, nodes, visited):\n\t\t# if self.n in visited:\n\t\t\t# return visited[self.n]\n\t\tvisited.add(self.n)\n\t\tconnected = set()\n\n\t\tfor neigh, colors_to_neigh in self.neighs.items():\n\t\t\tif neigh == f or neigh in visited:\n\t\t\t\tcontinue\n\t\t\tcolors = colors_to_neigh if neigh == t else nodes[neigh].dfs_color(self.n,t,nodes, visited)\n\t\t\tconnected.update(colors.intersection(colors_to_neigh))\n\t\t# visited[self.n] = connected\n\t\tvisited.remove(self.n)\n\t\treturn connected\n\n\tdef dfs_colored_path(self, cc, nodes, visited):\n\t\tvisited.add(self.n)\n\t\tfor neigh, colors_to_neigh in self.neighs.items():\n\t\t\tif neigh in visited or cc not in colors_to_neigh:\n\t\t\t\tcontinue\n\t\t\tnodes[neigh].dfs_colored_path(cc, nodes, visited)\n\t\treturn visited\n\n\tdef search_with_color(self, t, nodes):\n\t\tcolors_to_explore = set()\n\t\tcolors = set()\n\n\t\tfor neigh, colors_to_neigh in self.neighs.items():\n\t\t\tcolors_to_explore.update(colors_to_neigh)\n\n\t\tfor color in colors_to_explore:\n\t\t\tcities = self.dfs_colored_path(color, nodes, set())\n\t\t\tif t in cities:\n\t\t\t\tcolors.add(color)\n\t\treturn len(colors)\n\n\n\nn, m = [int(n) for n in input().split()]\n# edges = [int(n) for _ in range(m) for input().split()]\nedges = []\nwhile m:\n\tedge = [int(n) for n in input().split()]\n\tedges.append(edge)\n\tm-=1\n\n\nnodes = [Node(i) for i in range(n+1)]\nfor f, t, c in edges:\n\tif t not in nodes[f].neighs:\n\t\tnodes[f].neighs[t] = set() \n\tnodes[f].neighs[t].add(c)\n\n\tf,t = t,f\n\tif t not in nodes[f].neighs:\n\t\tnodes[f].neighs[t] = set() \n\tnodes[f].neighs[t].add(c)\n\nqs = int(input())\n\nfor q in range(qs):\n\t# visited = set()\n\tf, t = [int(n) for n in input().split()]\n\t# print(len(nodes[f].dfs_color(f, t, nodes, visited)))\n\tprint(nodes[f].search_with_color(t, nodes))\n", "def main():\n n, m = map(int, input().split())\n edges = {_: {} for _ in range(1, m + 1)}\n for _ in range(m):\n a, b, c = map(int, input().split())\n d = edges[c]\n l = d.get(a)\n if l:\n l.append(b)\n else:\n d[a] = [b]\n l = d.get(b)\n if l:\n l.append(a)\n else:\n d[b] = [a]\n\n def dfs(t):\n unused[t] = False\n for y in dcolor.get(t, ()):\n if unused[y]:\n dfs(y)\n\n res = []\n n += 1\n unused = [True] * n\n for _ in range(int(input())):\n a, b = map(int, input().split())\n x = 0\n for dcolor in edges.values():\n for j in range(n):\n unused[j] = True\n dfs(a)\n if not unused[b]:\n x += 1\n res.append(str(x))\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\ndef dfs(a , co):\r\n vis[a] = 1\r\n for i in graph[a]:\r\n if vis[i] == 0 and co in c[(a , i)]:\r\n dfs(i , co)\r\n\r\n \r\nn , m = list(map(int,input().split()))\r\ngraph = [[] for i in range(n+1)]\r\nc = {}\r\nfor i in range(1 , 101):\r\n for j in range(1 , 101):\r\n c[(i , j)] = []\r\nfor i in range(m):\r\n u , v , ci = list(map(int,input().split()))\r\n c[(u , v)].append(ci)\r\n c[(v , u)].append(ci)\r\n graph[u].append(v)\r\n graph[v].append(u)\r\nq = int(input())\r\nvis = [0 for i in range(n+1)]\r\nfor i in range(q):\r\n u , v = list(map(int,input().split()))\r\n count = 0\r\n for j in range(1 , m+1):\r\n dfs(u , j)\r\n if vis[v] == 1:\r\n count += 1\r\n vis = [0 for i in range(n+1)]\r\n\r\n print(count)\r\n \r\n", "from collections import defaultdict\r\n\r\ndef color_path(graph, n, m, u, v, c):\r\n # 1 if there is a path form u to v\r\n # where all the edges have color c.\r\n # 0 otherwise.\r\n stack = [u]\r\n visited = [False] * (n + 1)\r\n while len(stack) > 0:\r\n x = stack.pop()\r\n visited[x] = True\r\n for y, cy in graph[x]:\r\n if not visited[y] and cy == c:\r\n stack.append(y)\r\n if x == v:\r\n return 1\r\n return 0\r\n\r\nn, m = map(int, input().split())\r\n\r\ngraph = defaultdict(list)\r\ncolors = set()\r\n\r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n graph[a].append((b, c))\r\n graph[b].append((a, c))\r\n colors.add(c)\r\n\r\nfor _ in range(int(input())):\r\n u, v = map(int, input().split())\r\n total = 0\r\n for c in colors:\r\n total += color_path(graph, n, m, u, v, c)\r\n print(total)", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\n\r\nvisited = [False] * 105\r\n\r\ngraph = defaultdict(list)\r\n\r\nfor _ in range(m):\r\n\ta, b, c = map(int, input().split())\r\n\ta -= 1\r\n\tb -= 1\r\n\tc -= 1\r\n\tgraph[a].append((b, c))\r\n\tgraph[b].append((a, c))\r\n\r\ndef dfs(v: int, col: int, dst: int):\r\n\tvisited[v] = True\r\n\r\n\tif v == dst:\r\n\t\treturn True\r\n\tfor a, b in graph[v]:\r\n\t\tif b == col and not visited[a]:\r\n\t\t\tif dfs(a, col, dst):\r\n\t\t\t\treturn True\r\n\treturn False\r\n\r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n\tu, v = map(int, input().split())\r\n\tu -= 1\r\n\tv -= 1\r\n\r\n\tanswer = 0\r\n\tfor i in range(100):\r\n\t\tvisited = [False] * 105\r\n\t\tif dfs(u, i, v):\r\n\t\t\tanswer += 1\r\n\tprint(answer)\r\n", "'''\r\nhttps://codeforces.com/problemset/problem/505/B\r\n\r\n输入 n(2≤n≤100) m(1≤m≤100) 表示一个 n 点 m 边的无向图，节点编号从 1 到 n。\r\n然后输入 m 条边，每条边输入 v w c(1≤c≤m)，表示有条颜色为 c 的边连接 v 和 w。\r\n然后输入 q(1≤q≤100) 和 q 个询问，每个询问输入 v w，你需要输出有多少种颜色 c 满足：从 v 到 w 存在一条路径，这条路径上的边均为颜色 c。\r\n\r\n进阶：你能想出一个低于 O(平方) 的算法吗？\r\n见 https://codeforces.com/contest/506/problem/D\r\n输入\r\n4 5\r\n1 2 1\r\n1 2 2\r\n2 3 1\r\n2 3 3\r\n2 4 3\r\n3\r\n1 2\r\n3 4\r\n1 4\r\n输出\r\n2\r\n1\r\n0\r\n'''\r\n\r\nfrom collections import defaultdict\r\n\r\n\r\ndef _n():\r\n return int(input())\r\n\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef _nS():\r\n return input().split()\r\n\r\n\r\ndef solve():\r\n n, m = _nA()\r\n fm = {}\r\n\r\n def find(c, b):\r\n c, fb = fm.get((c, b), (c, b))\r\n if fb != b:\r\n c, fb = find(c, fb)\r\n fm[(c, b)] = (c, fb)\r\n return c, fb\r\n\r\n cs = set()\r\n for _ in range(m):\r\n v, w, c = _nA()\r\n c, v = find(c, v)\r\n c, w = find(c, w)\r\n fm[(c, v)] = (c, w)\r\n cs.add(c)\r\n for _ in range(_n()):\r\n v, w = _nA()\r\n cnt = 0\r\n for c in cs:\r\n if find(c, v) == find(c, w):\r\n cnt += 1\r\n print(cnt)\r\n\r\n\r\nsolve()\r\n", "def find(i,se,u,v):\r\n q = [[u,i]]\r\n while q :\r\n j,c = q.pop()\r\n if se[j] : continue\r\n se[j]=1\r\n for k in g[j]:\r\n if not se[k[0]] and k[1]==i :\r\n q.append(k)\r\n if k[0]==v and k[1]==i : return True\r\n return False \r\n\r\n\r\nn,k = map(int,input().split())\r\ng = [list() for _ in range(n)]\r\nse = [0]*n\r\ndef main():\r\n for _ in range(k):\r\n a,b,c = map(int,input().split())\r\n g[a-1].append([b-1,c])\r\n g[b-1].append([a-1,c])\r\n for _ in range(int(input())):\r\n u,v = map(int , input().split())\r\n ans = 0\r\n for i in range(1,101) :\r\n se = [0]*n\r\n if find(i,se,u-1,v-1) : ans +=1\r\n print(ans) \r\n\r\nmain() ", "\r\nfrom collections import defaultdict\r\n\r\n\r\ndef dfs(i,col):\r\n bool[i-1] = True\r\n\r\n\r\n for j in hash1[i]:\r\n\r\n if j[1] == col:\r\n if bool[j[0]-1] == False:\r\n dfs(j[0],col)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\n\r\nhash1 = defaultdict(list)\r\nhash2 = defaultdict(set)\r\nfor i in range(m):\r\n\r\n a,b,c = map(int,input().split())\r\n hash1[a].append([b,c])\r\n hash2[a].add(c)\r\n hash1[b].append([a,c])\r\n hash2[b].add(c)\r\n\r\nq = int(input())\r\nans = []\r\n\r\nfor i in range(q):\r\n\r\n\r\n a,b = map(int,input().split())\r\n\r\n\r\n count = 0\r\n for j in hash2[a]:\r\n bool = [False]*n\r\n dfs(a,j)\r\n\r\n if bool[b-1] == True:\r\n count+=1\r\n\r\n ans.append(count)\r\n\r\n\r\nprint(*ans)\r\n", "entrada = list(map(int, input().split()))\na = [[] for x in range(entrada[0] + 1)]\n\nfor i in range(entrada[1]):\n entrada2 = list(map(int, input().split()))\n cont1 = entrada2[0]\n cont2 = entrada2[1]\n cont3 = entrada2[2]\n a[cont1].append((cont2, cont3)) \n a[cont2].append((cont1, cont3))\ndef defans(cont1, cont2, cont3):\n b[cont1] = True\n if(cont1 == cont2):\n return 1\n for i,j in a[cont1]:\n if(j == cont3):\n if(b[i] == False):\n if(defans(i, cont2, cont3)):\n return 1\n return 0 \nq = int(input())\nk = 0\nfor i in range(q):\n entrada3 = list(map(int, input().split())) \n soma = 0 \n for k in range(100):\n b = [0] * (entrada[0]+1)\n soma += defans(entrada3[0], entrada3[1], k+1)\n k += 1\n \n print(soma)\n \t\t\t\t \t \t\t \t\t \t\t \t\t \t\t", "from collections import deque\r\n\r\ndef bfs(st, ed, c):\r\n q = deque([st])\r\n vis = [False] * (n+1)\r\n vis[st] = True\r\n\r\n while q:\r\n t = q.popleft()\r\n if t == ed: return True\r\n for v, x in g[t]:\r\n if x != c: continue\r\n if not vis[v]:\r\n vis[v] = True\r\n q.append(v)\r\n return False\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n g = [[] for i in range(n+1)]\r\n\r\n for _ in range(m):\r\n v, w, c = map(int, input().split())\r\n g[v].append((w, c))\r\n g[w].append((v, c))\r\n \r\n q = int(input())\r\n for _ in range(q):\r\n u, v = map(int, input().split())\r\n res = 0\r\n for i in range(1, m+1):\r\n if bfs(u, v, i): res += 1\r\n print(res)\r\n", "# 505B.py\n# Mr. Kitayuta's Colorful Graph\n\n#First try\n# n,m = map(int, raw_input().split())\n# g = [[[] for _ in range(n+1)] for _ in range(m+1)]\n# for i in xrange(m):\n# a,b,c = map(int, raw_input().split())\n# g[c][a].append(b)\n\n# q = int(raw_input())\n\n# for i in xrange(q):\n# u,v = map(int, raw_input().split())\n# out = 0\n# for j in xrange(1, len(g)):\n# u_found = v_found = False\n# for k in xrange(1, n+1):\n# if g[j][k]:\n# if k == u:\n# u_found = True\n# elif k == v:\n# v_found = True\n\n# for l in g[j][k]:\n# if l == u:\n# u_found = True\n# elif l == v:\n# v_found = True\n# if v_found == True and u_found == True:\n# break\n# if v_found == True and u_found == True:\n# out += 1\n\n# print out\n \n#Editorial\n#DFS\n\n#file = open(\"505Btest\")\nf = lambda: input()\n#f = lambda: file.readline()\nml = lambda: list(map(int, f().split()))\n\nn,m = ml()\ng = [[ []for x in range(n+1)] for x in range(m+1)]\n\nfor i in range(m):\n a,b,c = ml()\n g[c][a].append(b)\n g[c][b].append(a)\n\nq = int(f())\n\ndef dfs(c, start, end):\n global g, n\n discovered = [False] *(n+1)\n s = []\n s.append(start)\n while s:\n v = s.pop()\n if not discovered[v]:\n discovered[v] = True\n for i in g[c][v]:\n if i == end:\n return True\n s.append(i)\n\n return False\n\nfor i in range(q):\n u,v = ml()\n count = 0\n for j in range(1, m+1):\n if g[j]:\n if dfs(j, u, v):\n count += 1\n print(count)\n \n", "from sys import stdin, stderr, stdout\nfrom math import *\nfrom bisect import *\nfrom collections import Counter, deque, defaultdict\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\n\ninput = lambda: stdin.buffer.readline().decode().rstrip()\ninp = lambda: input().split()\n\n# Solution here\nres = deque()\ng = defaultdict(list)\n\n\ndef bfs(u, v, c):\n q = deque()\n q.append(u)\n vis = set()\n vis.add(u)\n\n while q:\n cur_node = q.popleft()\n if v in vis:\n return 1\n\n for child, col in g[cur_node]:\n if child not in vis and col == c:\n vis.add(child)\n q.append(child)\n\n return 0\n\n\ndef solve(tt):\n n, m = map(int, inp())\n all_col = set()\n for _ in range(m):\n u, v, c = map(int, inp())\n g[u].append((v, c))\n g[v].append((u, c))\n all_col.add(c)\n q = int(input())\n\n while q:\n q -= 1\n u, v = map(int, inp())\n ans = 0\n for cur_c in all_col:\n ans += bfs(u, v, cur_c)\n res.append(ans)\n\n\ndef main():\n test_case = 1\n # test_case = int(input())\n for tt in range(1, test_case + 1):\n solve(f\"{tt}: -------------------------\")\n stdout.write(\"\\n\".join(map(str, res)))\n return\n\n\ndef dbg(*args):\n import inspect\n import re\n\n debug = lambda *args, end=\"\\n\": stderr.write(\" \".join([str(x) for x in args]) + end)\n frame = inspect.currentframe().f_back\n s = inspect.getframeinfo(frame).code_context[0]\n r = re.search(r\"\\((.*)\\)\", s).group(1)\n var_name = r.split(\", \")\n stderr.write(\"\\n\")\n for i, (var, val) in enumerate(zip(var_name, args)):\n debug(f\"{var} = {val}\")\n\n\nif __name__ == \"__main__\":\n main()\n", "def dfs(x, c):\n vis[x] = 1\n for i in adj[c][x]:\n if not vis[i]:\n dfs(i, c)\n \ndef check(u, v, c):\n for i in range(1, n + 1):\n vis[i] = False\n dfs(u, c)\n return vis[v]\n \nn, m = map(int, input().split())\n \nadj = []\nfor i in range(m + 1):\n adj.append([])\n for j in range(n + 1):\n adj[i].append([])\nvis = [False] * (n + 1)\n \nfor i in range(m):\n a,b,c = map(int, input().split())\n adj[c][a].append(b)\n adj[c][b].append(a)\n \nq = int(input())\nfor i in range(q):\n u,v = map(int, input().split())\n ans = 0;\n for c in range(1,m + 1):\n if check(u, v, c):\n ans += 1\n print(ans)\n\t\t\t \t\t\t\t\t \t\t \t \t\t\t\t\t\t \t\t\t", "from collections import Counter as cntr\r\nfrom math import inf\r\ndef cin():\r\n\treturn map(int, input().split(' '))\r\ndef dfs(graph, src, dest, color):\r\n\tglobal count, visited\r\n\tif src == dest:\r\n\t\tcount += 1\r\n\r\n\t\treturn 0\r\n\tfor v in range(n):\r\n\t\tif graph[src][v] and visited[v]==False and color in graph[src][v]:\r\n\t\t\tl = graph[src][v]\r\n\r\n\t\t\tfor j in l:\r\n\t\t\t\tif color == j:\r\n\t\t\t\t\tvisited[v] = True\r\n\t\t\t\t\t\r\n\t\t\t\t\tdfs(graph, v, dest, color)\r\nn, m = cin()\r\nkita = [[0 for i in range(n)] for i in range(n)]\r\nclrs = [[]for i in range(n)]\r\nfor i in range(m):\r\n\ta, b, c = cin()\r\n\ta -= 1\r\n\tb -= 1\r\n\tif kita[a][b] == 0:\r\n\t\tkita[a][b] = [c]\r\n\t\tkita[b][a] = [c]\r\n\telse:\r\n\t\tkita[a][b].append(c)\r\n\t\tkita[b][a].append(c)\r\n\tclrs[a].append(c)\r\n\tclrs[b].append(c)\r\nq = int(input())\r\nfor i in range(q):\r\n\tcount = 0\r\n\tu,v = cin()\r\n\tu -= 1\r\n\tv -= 1\r\n\tll = set(clrs[u])\r\n\t#print(ll)\r\n\tfor jj in ll:\r\n\t\tvisited = [False for i in range(n)]\r\n\t\tvisited[u] = True\r\n\t\tdfs(kita, u, v, jj)\r\n\t\t\r\n\r\n\r\n\tprint(count)\r\n\r\n\r\n\r\n", "import sys\nsys.setrecursionlimit(100000)\n\nn,m = map(int,input().split())\n\nlas = [[[] for i in range(n + 2)] for j in range(101)]\nvisitados = [[False for i in range(n + 2)] for j in range(101)]\n\n\nfor i in range(m):\n v1,v2,cor = map(int,input().split())\n\n las[cor][v1].append(v2)\n las[cor][v2].append(v1)\n\n\ndef dfs(x,i):\n visitados[i][x] = True\n\n for elem in las[i][x]:\n if not visitados[i][elem]:\n dfs(elem,i)\n\nqueries = int(input())\n\nfor q in range(queries):\n inicio,fim = map(int,input().split())\n\n soma = 0\n for i in range(101):\n dfs(inicio,i)\n\n if visitados[i][fim]:\n soma += 1\n \n visitados = [[False for i in range(n + 2)] for j in range(101)]\n print(soma)\n\n \t \t \t\t \t \t\t \t\t\t\t \t \t \t\t \t \t", "from collections import defaultdict\r\ndef dfs(node,b,graph,colour,vis):\r\n if node==b:\r\n return True\r\n vis[node] = True\r\n for i in graph[node]:\r\n if not vis[i[0]]:\r\n if i[1]==colour:\r\n if dfs(i[0],b,graph,i[1],vis):\r\n return True\r\n return False\r\nn,m = map(int,input().split())\r\ngraph = defaultdict(list)\r\nfor i in range(m):\r\n a,b,c = map(int,input().split())\r\n graph[a].append([b,c])\r\n graph[b].append([a,c])\r\nq = int(input())\r\nvisited = [False]*(n+1)\r\nfor i in range(q):\r\n a,b = map(int,input().split())\r\n ans = 0\r\n for i in range(101):\r\n vis = visited[:]\r\n if dfs(a,b,graph,i,vis):\r\n ans+=1\r\n print(ans)\r\n \r\n", "n,m=map(int,input().split())\r\nINF=10**18\r\nd=[[[INF]*n for j in range(n)] for i in range(m)]\r\nedges=[[[] for i in range(n)] for i in range(m)]\r\nfor _ in range(m):\r\n a,b,c=map(int,input().split())\r\n a-=1\r\n b-=1\r\n c-=1\r\n edges[c][a].append(b)\r\n edges[c][b].append(a)\r\n d[c][a][b]=d[c][b][a]=1\r\nfor color in range(m):\r\n for s in range(n):\r\n q=[s]\r\n visited=[False]*n\r\n visited[s]=True\r\n while q:\r\n node=q.pop(0)\r\n visited[node]=True\r\n for to in edges[color][node]:\r\n if visited[to]:\r\n continue\r\n d[color][s][to]=d[color][to][s]=1\r\n q.append(to)\r\nQ=int(input())\r\nfor _ in range(Q):\r\n u,v=map(int,input().split())\r\n u-=1\r\n v-=1\r\n ans=0\r\n for color in range(m):\r\n if d[color][u][v]<INF:\r\n ans+=1\r\n print(ans)", "# In this template you are not required to write code in main\r\n\r\nimport sys\r\ninf = float(\"inf\")\r\n\r\nsys.setrecursionlimit(1000000)\r\n#from cmath import sqrt\r\n#from collections import deque, Counter, OrderedDict,defaultdict\r\n#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace\r\nfrom math import ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n#from bisect import bisect_left,bisect_right\r\n#import numpy as np\r\n\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod,MOD=1000000007,998244353\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n self.parent[self.find(b)] = self.find(a)\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nn,m=get_ints()\r\nArr=[0]*(105)\r\nfor i in range(105):\r\n Arr[i]=UnionFind(105)\r\nfor i in range(m):\r\n x,y,z=get_ints()\r\n Arr[z].union(x,y)\r\nq=int(input())\r\nwhile q>0:\r\n x,y=get_ints();count=0\r\n for i in range(105):\r\n if Arr[i].find(x)==Arr[i].find(y):\r\n count+=1\r\n print(count)\r\n q-=1", "def dfs(place,target):\r\n vis[place]=True\r\n if target==place:total[0]+=1;return()\r\n anyAdj=0\r\n for i in j[place]:\r\n if not vis[i]:anyAdj=1;dfs(i,target)\r\n if anyAdj==0:return()\r\n\r\nv,e=map(int,input().split())\r\nedges=[]\r\nfor i in range(e):edges.append(list(map(int,input().split())))\r\ncolors=[]\r\nfor i in edges:colors.append(i[2])\r\ncolors=list(set(colors))\r\ncolorAdjs=[]\r\nfor i in colors:\r\n colorAdjs.append([[] for w in range(v)])\r\n for j in edges:\r\n if j[2]==i:\r\n colorAdjs[-1][j[0]-1].append(j[1]-1)\r\n colorAdjs[-1][j[1]-1].append(j[0]-1)\r\nq=int(input())\r\nfor i in range(q):\r\n total=[0]\r\n a,b=map(int,input().split())\r\n a-=1;b-=1\r\n for j in colorAdjs:\r\n vis=[False]*v\r\n dfs(a,b)\r\n print(total[0])\r\n", "\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.pa = list(range(n))\r\n self.size = [1] * n\r\n\r\n def find(self, x):\r\n if x != self.pa[x]:\r\n self.pa[x] = self.find(self.pa[x])\r\n return self.pa[x]\r\n\r\n def merge(self, x, y):\r\n root_x, root_y = self.find(x), self.find(y)\r\n if root_x != root_y:\r\n self.pa[root_y] = root_x\r\n self.size[root_x] += self.size[root_y]\r\n\r\n def getSize(self, x):\r\n return self.size[self.find(x)]\r\n\r\ndef solve():\r\n n, m = list(map(int, input().split()))\r\n un = [UnionFind(n) for _ in range(m)]\r\n for _ in range(m):\r\n a, b, c = list(map(int, input().split()))\r\n un[c - 1].merge(a - 1, b - 1)\r\n q = int(input())\r\n for _ in range(q):\r\n a, b = list(map(int, input().split()))\r\n res = 0\r\n for un1 in un:\r\n if un1.find(a - 1) == un1.find(b - 1):\r\n res += 1\r\n print(res)\r\n\r\n# N = int(input())\r\nfor _ in range(1):\r\n solve()", "# If you win, you live. You cannot win unless you fight.\r\nfrom sys import stdin,setrecursionlimit\r\ninput=stdin.readline\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nrdone=lambda: map(lambda s: int(s)-1, input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\n#from scratch practice\r\nclass dsu():\r\n def __init__(self,n:int):\r\n self.st=[i for i in range(n)]\r\n self.sz=[1 for i in range(n)]\r\n def find(self,a):\r\n if a==self.st[a]:\r\n return a\r\n self.st[a]=self.find(self.st[a])\r\n return self.st[a]\r\n def union(self,a,b):\r\n a=self.find(a)\r\n b=self.find(b)\r\n if a==b:\r\n return True\r\n if self.sz[a]<self.sz[b]:\r\n a,b=b,a\r\n self.st[b]=a\r\n self.sz[a]+=self.sz[b]\r\n return False\r\nn,m=rd()\r\ndc=[dsu(n) for i in range(100)]\r\nfor _ in range(m):\r\n x,y,c=rdone()\r\n dc[c].union(x,y)\r\nfor i in range(ri()):\r\n x,y=rdone()\r\n cnt=0\r\n for col in range(100):\r\n if dc[col].find(x)==dc[col].find(y):\r\n cnt+=1\r\n print(cnt)\r\n", "# n, m = map(int, input().split())\n\n# graph = [[]] * n\n# colors = set()\n\n# for _ in range(m):\n # a, b, c = map(int, input().split())\n # a -= 1\n # b -= 1\n # graph[a].append((b, c))\n # graph[b].append((a, c))\n # colors.add(c)\n\n# for _ in range(int(input())):\n # u, v = map(int, input().split())\n # u -= 1\n # v -= 1\n\n # count = 0\n\n # for c in colors:\n # visited = [False] * n\n # if dfs(u, v, c):\n # count += 1\n\n # print(count)\n\ndef dfs(current, dest, color):\n visited[current] = True\n\n if current == dest:\n return True\n\n for v, c in graph[current]:\n if c == color and not visited[v]:\n if dfs(v, dest, color):\n return True\n return False\n\n\nn, m = map(int, input().split())\n\ngraph = [[] for _ in range(n)]\ncolors = set()\n\nfor _ in range(m):\n a, b, c = map(int, input().split())\n a -= 1\n b -= 1\n graph[a].append((b, c))\n graph[b].append((a, c))\n colors.add(c)\n\nfor _ in range(int(input())):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n\n count = 0\n\n for c in colors:\n visited = [False] * n\n if dfs(u, v, c):\n count += 1\n\n print(count)\n\n \t\t\t \t\t\t\t \t\t\t\t\t\t \t \t \t\t\t\t", "class Solution:\n def __init__(self, n, m, edges):\n self.n = n\n self.m = m\n self.edges = [[[] for _ in range(m+1)] for _ in range(n+1)]\n for _from, _to, _color in edges:\n self.edges[_from][_color].append(_to)\n self.edges[_to][_color].append(_from)\n self.id = 0\n\n def initialize(self):\n self.discovered = [[0]*(self.n+1) for i in range(self.m+1)]\n\n def bfs(self, x0, color):\n self.id += 1\n stack = [x0]\n while stack:\n n = stack.pop()\n if not self.discovered[color][n]:\n self.discovered[color][n] = self.id\n for neigh in self.edges[n][color]:\n stack.append(neigh)\n\ndef solve(graph, colors, u, v):\n counter = 0\n for color in colors:\n if not graph.discovered[color][u] and not graph.discovered[color][v]:\n graph.bfs(u, color)\n if graph.discovered[color][u] == graph.discovered[color][v]:\n counter += 1\n return counter\n\ndef main():\n n, m = map(int, input().split())\n edges = []\n colors = set()\n for _ in range(m):\n a, b, c = map(int, input().split())\n colors.add(c)\n edges.append((a, b, c))\n graph = Solution(n, m, edges)\n graph.initialize()\n q = int(input())\n for _ in range(q):\n u, v = map(int, input().split())\n print(solve(graph, colors, u, v))\n\nif __name__ == '__main__':\n main()\n \n\n \n \n", "from copy import deepcopy\r\ndef bfs(A, s, C):\r\n Allparent = {}\r\n for v in A[s]:\r\n for color in C[(s, v)]: \r\n Allparent[color] = []\r\n parent = [None for v in A]\r\n parent[s] = s\r\n level = [[s]]\r\n while (len(level[-1]) > 0):\r\n level.append([])\r\n for u in level[-2]:\r\n for v in A[u]:\r\n if color in C[(u, v)]:\r\n if parent[v] == None:\r\n parent[v] = u\r\n level[-1].append(v)\r\n Allparent[color].append(parent)\r\n return Allparent\r\n \r\ndef unweighted_shortest_path(A, s, d, C):\r\n allparent = bfs(A, s, C)\r\n tmpC = deepcopy(C)\r\n count = 0\r\n for color in allparent:\r\n for parent in allparent[color]:\r\n if parent[d] != None:\r\n last = 0\r\n i = d\r\n while (i != s):\r\n last = i\r\n i = parent[i]\r\n if len(tmpC[(s, last)]) != 0:\r\n count += 1\r\n tmpC[(s, last)].remove(color) \r\n tmpC[(last, s)].remove(color) \r\n return count\r\n\r\n\r\ndef main():\r\n V, E = list(map(int, input().split()))\r\n A = [[] for _ in range(V)]\r\n C = {}\r\n for i in range(E):\r\n u, v, c = list(map(int, input().split()))\r\n if (v - 1) not in A[u - 1]:\r\n A[u - 1].append(v - 1)\r\n if (u - 1) not in A[v - 1]:\r\n A[v - 1].append(u - 1)\r\n \r\n if (u - 1, v - 1) not in C.keys():\r\n C[(u - 1, v - 1)] = [c]\r\n C[(v - 1, u - 1)] = [c]\r\n else:\r\n C[(u - 1, v - 1)].append(c)\r\n C[(v - 1, u - 1)].append(c)\r\n q = int(input())\r\n for _ in range(q):\r\n s, d = list(map(int, input().split()))\r\n count = unweighted_shortest_path(A, s - 1, d - 1, C)\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn, m = list(map(int, input().split()))\n \nl = []\n\nfor i in range(m):\n l.append(list(range(n)))\n\nfor i in range(m):\n x = list(map(int, input().split()))\n l2 = l[x[2]-1]\n \n g = max(l2[x[0]-1],l2[x[1]-1])\n h = min(l2[x[0]-1],l2[x[1]-1])\n \n for j in range(len(l2)):\n if (l2[j] == g):\n l2[j] = h\n l[x[2]-1] = l2\n\nz = int(input())\nl3 = []\n \nfor i in range(z):\n s = 0\n a,b = list(map(int, input().split()))\n for n in l:\n if n[a-1] == n[b-1]:\n s += 1\n l3.append(s)\n\nfor i in l3:\n print(i)\n \t\t \t\t\t \t \t\t \t \t \t\t \t\t \t", "def get_connected_matrix(adjacency_matrix):\n n = len(adjacency_matrix)\n non_visited_vertices = set(i for i in range(n))\n cluster_numbers = [0] * n\n cluster_number = 1\n\n def traverse(u):\n non_visited_vertices.remove(u)\n cluster_numbers[u] = cluster_number\n for v in range(n):\n if v in non_visited_vertices:\n if adjacency_matrix[u][v]:\n traverse(v)\n\n while non_visited_vertices:\n vertex = non_visited_vertices.pop()\n non_visited_vertices.add(vertex)\n traverse(vertex)\n cluster_number += 1\n\n connected_matrix = [[False] * n for _ in range(n)]\n\n for u in range(n):\n for v in range(n):\n if u == v:\n continue\n connected_matrix[u][v] = connected_matrix[v][u] = (cluster_numbers[u] == cluster_numbers[v])\n\n return connected_matrix\n\n\ndef main():\n n, m = [int(t) for t in input().split()]\n\n matrices = [[[False] * n for _ in range(n)] for _ in range(m)]\n\n for _ in range(m):\n a, b, c = [int(t) - 1 for t in input().split()]\n matrices[c][a][b] = True\n matrices[c][b][a] = True\n\n connected_matrices = [get_connected_matrix(matrix) for matrix in matrices]\n\n q = int(input())\n for _ in range(q):\n u, v = [int(t) - 1 for t in input().split()]\n total_connection = sum(1 for connected_matrix in connected_matrices if connected_matrix[u][v])\n print(total_connection)\n\n\nif __name__ == '__main__':\n main()\n", "\r\n#make a table\r\nn,m = map(int,input().split())\r\narr = [[] for i in range(n+1)]\r\nfor i in range(1,m+1):\r\n l = list(map(int,input().split()))\r\n arr[l[0]].append((l[1],l[2]))\r\n arr[l[1]].append((l[0],l[2]))\r\n\r\n\r\n#dfs\r\ndef dfs(a,b,k):\r\n if a == b:\r\n return True\r\n seen.append(a)\r\n for i in arr[a]:\r\n x,c = i\r\n if c == k and x not in seen:\r\n if dfs(x,b,k):\r\n return True\r\n return False\r\n \r\nquery = int(input())\r\ncount = 0\r\nscore = [0]*(query)\r\nseen = []\r\n#get destination inputs\r\nfor i in range(query):\r\n a,b = map(int,input().split())\r\n for k in range(1,101):\r\n seen = []\r\n if dfs(a,b,k):\r\n count += 1\r\n score[i] = count\r\n count = 0\r\n\r\nprint(\"\\n\".join(list(map(str,score))))", "def checkcolors(a, b, c, v) :\n colorset = set()\n if c == 0 :\n for edge in edges[a] :\n if edge[0] == b :\n v[edge[0]].append(edge[1])\n colorset.add(edge[1])\n else :\n if c not in v[edge[0]] :\n v[edge[0]].append(edge[1])\n colorset.update(checkcolors(edge[0],b,edge[1], v))\n else :\n for edge in edges[a] :\n if edge[0] == b and edge[1] == c :\n v[edge[0]].append(edge[1])\n colorset.add(edge[1])\n elif edge[1] == c :\n if c not in v[edge[0]] :\n v[edge[0]].append(edge[1])\n colorset.update(checkcolors(edge[0],b,c, v))\n return colorset\n\n\nn, m = list(map(int, input().split()))\nedges = []\nfor i in range(n+1) :\n edges.append([])\nfor i in range(m) :\n a, b, c = list(map(int, input().split()))\n edges[a].append([b, c])\n edges[b].append([a, c])\n\nq = int(input())\nfor i in range(q) :\n a, b = list(map(int, input().split()))\n v = []\n for i in range(n+1) :\n v.append([])\n colornum = checkcolors(a, b, 0, v)\n print(len(colornum))\n \t \t \t \t\t\t \t \t\t \t\t\t \t \t\t", "n, m = map(int, input().split())\r\ngraph = [[[-1] for x in range(n + 1)] for i in range(n + 1)]\r\n\r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n if graph[a][b] != [-1]:\r\n graph[a][b].append(c)\r\n else:\r\n graph[a][b] = [c]\r\n\r\n\r\ndef bfs(start, end, color):\r\n neighbors, visited = [start], set()\r\n while neighbors:\r\n current, neighbors = neighbors, []\r\n for each in current:\r\n for i in range(1, n + 1):\r\n if (color in graph[i][each] or color in graph[each][i]) and i not in visited:\r\n visited.add(i)\r\n if i == end:\r\n return True\r\n neighbors.append(i)\r\n return False\r\n\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n u, v = map(int, input().split())\r\n starting_colors, colors = set(), 0\r\n for i in range(1, n + 1):\r\n if graph[i][u] != [-1]:\r\n starting_colors.update(graph[i][u])\r\n elif graph[u][i] != [-1]:\r\n starting_colors.update(graph[u][i])\r\n\r\n for each_color in starting_colors:\r\n if bfs(u, v, each_color):\r\n colors += 1\r\n print(colors)\r\n", "# Problem: B. Mr. Kitayuta's Colorful Graph\r\n# Contest: Codeforces - Codeforces Round 286 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/505/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"\r\n\"\"\"\r\n\r\n\r\ndef lower_bound(lo: int, hi: int, key):\r\n \"\"\"由于3.10才能用key参数，因此自己实现一个。\r\n :param lo: 二分的左边界(闭区间)\r\n :param hi: 二分的右边界(闭区间)\r\n :param key: key(mid)判断当前枚举的mid是否应该划分到右半部分。\r\n :return: 右半部分第一个位置。若不存在True则返回hi+1。\r\n 虽然实现是开区间写法，但为了思考简单，接口以[左闭,右闭]方式放出。\r\n \"\"\"\r\n lo -= 1 # 开区间(lo,hi)\r\n hi += 1\r\n while lo + 1 < hi: # 区间不为空\r\n mid = (lo + hi) >> 1 # py不担心溢出，实测py自己不会优化除2，手动写右移\r\n if key(mid): # is_right则右边界向里移动，目标区间剩余(lo,mid)\r\n hi = mid\r\n else: # is_left则左边界向里移动，剩余(mid,hi)\r\n lo = mid\r\n return hi\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n\r\nclass DSU:\r\n def __init__(self, n):\r\n self.fathers = list(range(n))\r\n self.size = [1] * n # 本家族size\r\n self.edge_size = [0] * n # 本家族边数(带自环/重边)\r\n self.n = n\r\n self.setCount = n # 共几个家族\r\n\r\n def find_fa(self, x):\r\n fs = self.fathers\r\n t = x\r\n while fs[x] != x:\r\n x = fs[x]\r\n while t != x:\r\n fs[t], t = x, fs[t]\r\n return x\r\n\r\n def union(self, x: int, y: int) -> bool:\r\n x = self.find_fa(x)\r\n y = self.find_fa(y)\r\n\r\n if x == y:\r\n self.edge_size[y] += 1\r\n return False\r\n # if self.size[x] > self.size[y]: # 注意如果要定向合并x->y，需要干掉这个；实际上上边改成find_fa后，按轶合并没必要了，所以可以常关\r\n # x, y = y, x\r\n self.fathers[x] = y\r\n self.size[y] += self.size[x]\r\n self.edge_size[y] += 1 + self.edge_size[x]\r\n self.setCount -= 1\r\n return True\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, m = RI()\r\n ds = [DSU(n + 1) for _ in range(m + 1)]\r\n for _ in range(m):\r\n a, b, c = RILST()\r\n ds[c].union(a, b)\r\n q, = RI()\r\n for _ in range(q):\r\n u, v = RI()\r\n print(sum(1 for d in ds if d.find_fa(u) == d.find_fa(v)))\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "def dfs(node, x, color):\n visited[node] = True\n\n if node == x: return True\n\n for i, c in graph[node]:\n if c == color and not visited[i]:\n if dfs(i, x, color):\n return True\n return False\n\n\nn, m = map(int, input().split())\n\ngraph = [[] for i in range(n+1)]\n\nfor i in range(m):\n a, b, c = map(int, input().split())\n graph[a].append((b, c))\n graph[b].append((a, c))\n\nq = int(input())\n\nfor i in range(q):\n u, v = map(int, input().split())\n\n c = 0\n for j in range(1, 101):\n visited = [0] * (n+1)\n\n if dfs(u, v, j): c += 1\n\n print(c)\n\t \t \t \t \t\t \t\t \t \t\t \t\t \t\t \t", "def dfs(u,v,col,visited):\r\n q = [i for i in edges[u]]\r\n while q :\r\n j = q.pop()\r\n if visited[j[0]] or j[1]!=col : continue\r\n visited[j[0]] = 1\r\n for k in edges[j[0]] :\r\n if k[0]==v and k[1]==col :\r\n return True\r\n if k[1]==col and not visited[k[0]] :\r\n q.append(k)\r\n \r\n \r\n\r\n\r\nn,m = map(int,input().split())\r\nedges = [list() for _ in range(n)]\r\ndef main():\r\n for _ in range(m):\r\n a,b,c = map(int,input().split())\r\n edges[a-1].append([b-1,c-1])\r\n edges[b-1].append([a-1,c-1])\r\n for i in range(int(input())):\r\n u,v = map(int,input().split())\r\n ans = 0\r\n for w in range(100):\r\n visited = [0]*n\r\n if dfs(u-1,v-1,w,visited) : ans+=1 \r\n print(ans) \r\nmain() ", "from collections import defaultdict, deque\r\n\r\nn, m = map(int, input().split())\r\n\r\ngraphs = [defaultdict(set) for i in range(m)]\r\ndsus = [list(range(101)) for i in range(m)]\r\n\r\ndef find(parent, x):\r\n while parent[x] != x:\r\n parent[x] = parent[parent[x]]\r\n x = parent[x]\r\n return x\r\n\r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n c = c-1\r\n parent = dsus[c]\r\n root = find(parent, a)\r\n parent[find(parent, b)] = root\r\n \r\nfor _ in range(int(input())):\r\n u, v = map(int, input().split())\r\n print(sum(find(dsus[c], u) == find(dsus[c], v) for c in range(m)))\r\n ", "from sys import stdin,stdout\r\ninput = stdin.readline\r\n \r\ndef main():\r\n n, m = map(int,input().split())\r\n sets = [list(range(n+1)) for i in range(m)]\r\n sizes = [[1]*(n+1) for i in range(m)]\r\n def get(a,ind):\r\n if sets[ind][a] != a:\r\n sets[ind][a] = get(sets[ind][a],ind)\r\n return sets[ind][a]\r\n def union(a, b,ind):\r\n a = get(a,ind)\r\n b = get(b,ind)\r\n if a == b:return\r\n if sizes[ind][a] > sizes[ind][b]:\r\n a,b = b,a\r\n sets[ind][a] = b\r\n sizes[ind][b] += sizes[ind][a]\r\n for i in range(m):\r\n a, b, c = map(int,input().split())\r\n a -= 1\r\n b -= 1\r\n c -= 1\r\n union(a,b,c)\r\n q = int(input())\r\n for i in range(q):\r\n ans = 0\r\n u,v = map(int,input().split())\r\n u-=1\r\n v-=1\r\n for j in range(m):\r\n ans += int(get(u,j) == get(v,j))\r\n print(ans)\r\nmain()\r\n", "\"\"\"\r\nSince neither the graph nor the number of queries is too large, for each \r\nquery you can simply count the number of the \"good\" colors \r\n(the colors that satisfies the condition) by checking if each color is \r\n\"good\". To do that, you can perform Depth First Search (or Breadth First Search)\r\nand verify whether you can reach vi from ui traversing only the edges of that \r\ncolor. If you prefer using Union-Find, it will also do the job.\r\n\"\"\"\r\nfrom collections import defaultdict\r\n\r\n\r\ndef dfs(graph, start, end, visited, color):\r\n q = [start]\r\n while q:\r\n node = q.pop()\r\n visited[node] = True\r\n\r\n if node == end:\r\n break\r\n\r\n for v in graph[color][node]:\r\n if not visited[v]:\r\n q.append(v)\r\n\r\n\r\ndef has_path(graph, start, end, visited, color):\r\n for i in range(len(visited)):\r\n visited[i] = False\r\n\r\n dfs(graph, start, end, visited, color)\r\n return visited[end]\r\n\r\n\r\nn, m = map(int, input().split())\r\n \r\ngraph = defaultdict(lambda: defaultdict(list))\r\n\r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n\r\n graph[c][a].append(b)\r\n graph[c][b].append(a)\r\n\r\nvisited = [False] * n\r\n \r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n u, v = map(int,input().split())\r\n u -= 1\r\n v -= 1\r\n ans = 0\r\n\r\n for c in graph.keys():\r\n if has_path(graph, u, v, visited, c):\r\n ans += 1\r\n\r\n print(ans)\r\n", "import sys \r\ninput = sys.stdin.readline \r\ndef find(parent, i):\r\n if parent[i] == i:\r\n return i\r\n return find(parent, parent[i])\r\n \r\n \r\nn, m = map(int, input().split())\r\ncolor = [[] for i in range(m + 1)]\r\nfor i in range(m + 1):\r\n color[i].append([j for j in range(n + 1)])\r\nfor i in range(m):\r\n u, v, c = map(int, input().split())\r\n \r\n x = find(color[c][0], u)\r\n y = find(color[c][0], v)\r\n color[c][0][x] = y\r\n \r\nq = int(input())\r\nfor i in range(q):\r\n u, v = map(int, input().split()) \r\n c = 0\r\n for j in range(m + 1):\r\n if(find(color[j][0], u) == find(color[j][0], v)):\r\n c += 1 \r\n print(c)\r\n \r\n ", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n nVertices, nEdges = map(int, input().split())\r\n colorfulGraph = {vertex: [] for vertex in map(str, range(1, nVertices+1))}\r\n\r\n for i in range(nEdges):\r\n vertex1, vertex2, color = input().split()\r\n colorfulGraph[vertex1].append((vertex2, color))\r\n colorfulGraph[vertex2].append((vertex1, color))\r\n\r\n def nColorsThatConnect(vertex1, vertex2):\r\n nColors, colorsUsed = 0, set()\r\n for neighbor in colorfulGraph[vertex1]:\r\n if neighbor[1] not in colorsUsed and \\\r\n possibleColor(neighbor[1], {vertex1, neighbor[0]}, neighbor[0], vertex2):\r\n nColors += 1\r\n colorsUsed.add(neighbor[1])\r\n return nColors\r\n\r\n def possibleColor(color, examinedVertices, start, destination):\r\n if start == destination:\r\n return True\r\n for neighbor in colorfulGraph[start]:\r\n if neighbor[0] not in examinedVertices and neighbor[1] == color:\r\n examinedVertices.add(neighbor[0])\r\n if possibleColor(color, examinedVertices, neighbor[0], destination):\r\n return True\r\n return False\r\n\r\n for j in range(int(input())):\r\n vertex1, vertex2 = input().split()\r\n print(nColorsThatConnect(vertex1, vertex2))\r\n\r\n\r\nif __name__ == '__main__':\r\n # print(main())\r\n main()\r\n", "def DFS(start, color):\r\n global isUsed\r\n isUsed[start] = True\r\n for i in graph[start]:\r\n if not isUsed[i[0]] and i[1] == color:\r\n DFS(i[0], color)\r\n\r\nn, m = tuple(map(int, input().split()))\r\n\r\ngraph = [[] for i in range(n)]\r\n\r\nfor i in range(m):\r\n a, b, c = tuple(map(int, input().split()))\r\n graph[a - 1].append((b - 1, c))\r\n graph[b - 1].append((a - 1, c))\r\n\r\nq = int(input())\r\nanswers = [0] * q\r\nfor i in range(q):\r\n u, v = tuple(map(int, input().split()))\r\n for j in range(1, m + 1):\r\n isUsed = [False] * n\r\n DFS(u - 1, j)\r\n if isUsed[v - 1]:\r\n answers[i] += 1\r\n\r\nprint(\"\\n\".join(map(str, answers)))\r\n", "n,m = input().split(' ')\r\nl = []\r\nfor x in range(int(m)):\r\n l.append(list(range(int(n))))\r\nfor x in range(int(m)):\r\n p = input().split(' ')\r\n newl = l[int(p[2])-1]\r\n a,i = max(newl[int(p[0])-1],newl[int(p[1])-1]),min(newl[int(p[0])-1],newl[int(p[1])-1])\r\n for y in range(len(newl)):\r\n if newl[y] == a:\r\n newl[y] = i\r\n l[int(p[2])-1] = newl\r\nq = int(input())\r\nput = []\r\nfor x in range(q):\r\n out = 0\r\n a,b = input().split(' ')\r\n for n in l:\r\n if n[int(a)-1] == n[int(b)-1]:\r\n out += 1\r\n put.append(out)\r\nfor x in put:\r\n print(x)\r\n", "n, m = map(int, input().split())\r\ng = [[] for _ in range(n)]\r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n g[a - 1].append((b - 1, c - 1))\r\n g[b - 1].append((a - 1, c - 1))\r\n\r\n\r\ndef dfs(x, c, t):\r\n if x == t: \r\n return True\r\n v[x] = 1\r\n for j in g[x]:\r\n if j[1] == c and v[j[0]] == 0:\r\n if dfs(j[0], c, t): \r\n return True\r\n return False\r\n\r\n\r\nq = int(input())\r\no = [0] * q\r\nv = []\r\nfor i in range(q):\r\n f, y = map(int, input().split())\r\n for c in range(100):\r\n v = [0] * n\r\n if dfs(f - 1, c, y - 1): \r\n o[i] += 1\r\nprint('\\n'.join(list(map(str, o))))\r\n", "def arr_inp(n):\r\n if n == 1:\r\n return [int(x) for x in stdin.readline().split()]\r\n elif n == 2:\r\n return [float(x) for x in stdin.readline().split()]\r\n else:\r\n return [str(x) for x in stdin.readline().split()]\r\n\r\n\r\nclass disjointset:\r\n def __init__(self, n):\r\n self.rank, self.parent, self.n, self.nsets, self.edges = defaultdict(int), defaultdict(int), n, defaultdict(\r\n int), defaultdict(int)\r\n for i in range(1, n + 1):\r\n self.parent[i], self.nsets[i] = i, 1\r\n\r\n def find(self, x):\r\n\r\n if self.parent[x] == x:\r\n return x\r\n\r\n result = self.find(self.parent[x])\r\n\r\n self.parent[x] = result\r\n\r\n return result\r\n\r\n def union(self, x, y):\r\n xpar, ypar = self.find(x), self.find(y)\r\n\r\n # already union\r\n if xpar == ypar:\r\n self.edges[xpar] += 1\r\n return\r\n # perform union by rank\r\n if self.rank[xpar] < self.rank[ypar]:\r\n self.parent[xpar] = ypar\r\n self.edges[ypar] += self.edges[xpar] + 1\r\n self.nsets[ypar] += self.nsets[xpar]\r\n\r\n elif self.rank[xpar] > self.rank[ypar]:\r\n self.parent[ypar] = xpar\r\n self.edges[xpar] += self.edges[ypar] + 1\r\n self.nsets[xpar] += self.nsets[ypar]\r\n\r\n else:\r\n self.parent[ypar] = xpar\r\n self.rank[xpar] += 1\r\n self.edges[xpar] += self.edges[ypar] + 1\r\n self.nsets[xpar] += self.nsets[ypar]\r\n\r\n\r\nfrom sys import stdin\r\nfrom collections import defaultdict\r\n\r\nn, m = arr_inp(1)\r\ncolor = [disjointset(n) for i in range(m)]\r\nfor i in range(m):\r\n a, b, c = arr_inp(1)\r\n color[c - 1].union(a, b)\r\n\r\nfor i in range(int(input())):\r\n u, v = arr_inp(1)\r\n ans = 0\r\n for j in range(m):\r\n if color[j].find(u) == color[j].find(v):\r\n ans += 1\r\n print(ans)\r\n", "class ufds:\r\n def __init__(self):\r\n self.rank = dict()\r\n self.value = dict()\r\n\r\n def union(self,a,b):\r\n x,y = self.findSet(a),self.findSet(b)\r\n if self.rank[x] > self.rank[y]:\r\n self.value[y] = x\r\n else:\r\n self.value[x] = y\r\n if self.rank[x] == self.rank[y]:\r\n self.rank[y] += 1\r\n \r\n def findSet(self,x):#Path Compression\r\n if x != self.value[x]:\r\n self.value[x] = self.findSet(self.value[x])\r\n return self.value[x]\r\n \r\n def sameSet(self,a,b):\r\n return self.findSet(a) == self.findSet(b)\r\n \r\n def createKey(self,x):\r\n self.rank.update({x:0})\r\n self.value.update({x:x})\r\n \r\na = list(map(int,input().split()))\r\nsize = a[0]\r\ngraph = dict()\r\nfor i in range(a[1]):\r\n b = list(map(int,input().split()))\r\n color = b[2]\r\n if color not in graph.keys():\r\n graph.update({color:ufds()})\r\n for i in range(size):\r\n graph[color].createKey(i+1)\r\n graph[color].union(b[0],b[1])\r\nfor i in range(int(input())):\r\n b = list(map(int,input().split()))\r\n counter = 0\r\n for j in graph.keys():\r\n if graph[j].sameSet(b[0],b[1]):\r\n counter+=1\r\n print(counter)", "from sys import stdin, stderr, stdout\nfrom math import *\nfrom bisect import *\nfrom collections import Counter, deque, defaultdict\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\n\ninput = lambda: stdin.buffer.readline().decode().rstrip()\ninp = lambda: input().split()\n\n# Solution here\nres = deque()\ng = defaultdict(list)\n\n\ndef bfs(u, v):\n # init queue\n q = deque()\n q.append((u, \"\"))\n cnt = 0\n\n # vis and col set()\n vis: set[tuple[int, int, int]] = set()\n all_col = {col for _, col in g[u]}\n found_col = set()\n\n while q:\n # dbg(q)\n cur_u, col = q.popleft()\n if cur_u == v:\n # reached the target\n if col in found_col:\n continue\n cnt += 1\n found_col.add(col)\n continue\n\n for child, c in g[cur_u]:\n if (\n (col == \"\" or c == col)\n and (cur_u, child, c) not in vis\n and c in all_col\n and c not in found_col\n ):\n vis.add((cur_u, child, c))\n q.append((child, c))\n # dbg(vis, found_col)\n return cnt\n\n\ndef solve(tt):\n v, e = map(int, inp())\n for _ in range(e):\n u, v, w = map(int, inp())\n g[u].append((v, w))\n g[v].append((u, w))\n # dbg(g)\n\n q = int(input())\n while q:\n q -= 1\n u, v = map(int, inp())\n cnt = bfs(u, v)\n # dbg(cnt)\n res.append(f\"{cnt}\")\n\n\ndef main():\n test_case = 1\n # test_case = int(input())\n for tt in range(1, test_case + 1):\n solve(f\"{tt}: -------------------------\")\n stdout.write(\"\\n\".join(map(str, res)))\n return\n\n\ndef dbg(*args):\n import inspect\n import re\n\n debug = lambda *args, end=\"\\n\": stderr.write(\" \".join([str(x) for x in args]) + end)\n frame = inspect.currentframe().f_back\n s = inspect.getframeinfo(frame).code_context[0]\n r = re.search(r\"\\((.*)\\)\", s).group(1)\n var_name = r.split(\", \")\n stderr.write(\"\\n\")\n for i, (var, val) in enumerate(zip(var_name, args)):\n debug(f\"{var} = {val}\")\n\n\nif __name__ == \"__main__\":\n main()\n", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\nd = [defaultdict(list) for i in range(1+m)]\r\n\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n d[c][a].append(b)\r\n d[c][b].append(a)\r\n \r\nq = int(input())\r\n\r\nfor _ in range(q):\r\n u, v = map(int, input().split())\r\n ct = 0\r\n \r\n for adj in d:\r\n vst = [0]*(n+1)\r\n q = [u]\r\n \r\n while q:\r\n e = q.pop()\r\n \r\n if e == v:\r\n ct += 1\r\n break\r\n else:\r\n vst[e] = 1\r\n for j in adj[e]:\r\n if not vst[j]:\r\n q.append(j)\r\n \r\n print(ct)\r\n ", "\r\n\r\ndef dfs(g, u, v):\r\n\r\n colors = set()\r\n for neighbors in g[u]:\r\n colors.add(neighbors[1])\r\n\r\n cnt = 0\r\n for color in colors:\r\n\r\n stack = []\r\n visited = [False for i in range(len(g) + 1)]\r\n stack.append(u)\r\n\r\n found = False\r\n while stack:\r\n node = stack.pop()\r\n\r\n if visited[node]: continue\r\n visited[node] = True\r\n\r\n neighbors = g[node]\r\n for n in neighbors:\r\n\r\n if n[1] == color:\r\n stack.append(n[0])\r\n\r\n if n[0] == v:\r\n found = True\r\n break\r\n\r\n if found:\r\n cnt += 1\r\n\r\n found = False\r\n\r\n return cnt\r\n\r\n\r\n\r\ndef main():\r\n\r\n n, m = [int(i) for i in input().split()]\r\n\r\n g = {i: [] for i in range(1, n + 1)}\r\n for i in range(m):\r\n a, b, c = [int(i) for i in input().split()]\r\n g[a].append([b, c])\r\n g[b].append([a, c])\r\n\r\n # requests\r\n q = int(input())\r\n for i in range(q):\r\n u, v = [int(i) for i in input().split()]\r\n print(dfs(g, u, v))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "class UnionFind:\n\n def __init__(self,n) -> None:\n self.node_list = list(range(n+1))\n\n def find(self,index)->int:\n if index == self.node_list[index]:\n return index\n self.node_list[index] = self.find(self.node_list[index] )\n\n return self.node_list[index]\n \n def union(self,index1,index2):\n self.node_list[self.find(index1)] = self.find(index2)\n\n\ndef main()->int:\n\n n_m = input().split(' ')\n\n n ,m = int(n_m[0]),int(n_m[1])\n colordict = dict()\n\n for _ in range(m):\n v_w_c = input().split(' ')\n v,w,c = int(v_w_c[0]),int(v_w_c[1]),int(v_w_c[2])\n uf = None\n if c not in colordict:\n uf = UnionFind(n)\n colordict[c] = uf\n else:\n uf = colordict[c]\n uf.union(v,w)\n \n query_cnt = int(input())\n\n # query_array = []\n\n ufs = list(colordict.values())\n\n for _ in range(query_cnt):\n v_w = input().split(' ')\n v,w = int(v_w[0]),int(v_w[1])\n cnt = 0\n for uf in ufs:\n if uf.find(v) == uf.find(w):\n cnt+=1\n print(cnt)\n # query_array.append((v,w))\n\nmain()", "class Union:\n\n def __init__(self, size):\n self.ancestor = [i for i in range(size+1)]\n\n def find(self, node):\n\n if self.ancestor[node] == node:\n return node\n\n self.ancestor[node] = self.find(self.ancestor[node])\n return self.ancestor[node]\n\n def merge(self, a, b):\n a, b = self.find(a), self.find(b)\n self.ancestor[a] = b\n\n\nn, m = map(int, input().split())\nunions = [Union(n) for _ in range(m+1)]\ngraph = [[] for _ in range(n+1)]\n\nfor _ in range(m):\n a, b, c = map(int, input().split())\n graph[a].append((b, c))\n graph[b].append((a, c))\n unions[c].merge(a, b)\n\nfor _ in range(int(input())):\n a, b = map(int, input().split())\n ans = 0\n for i in range(1, m+1):\n ans += unions[i].find(a) == unions[i].find(b)\n print(ans)\n", "dic = {}\r\nmark = []\r\nv = []\r\n\r\ndef DFS(x):\r\n global mark, v\r\n mark[x] = True\r\n for i in v[x]:\r\n if mark[i]:\r\n continue\r\n DFS(i)\r\n\r\ns = input()\r\ns = s.split()\r\nn = int(s[0])\r\nm = int(s[1])\r\n\r\nfor i in range(m):\r\n s = input()\r\n s = s.split()\r\n x = int(s[0])\r\n y = int(s[1])\r\n z = int(s[2])\r\n x -= 1\r\n y -= 1\r\n if z not in dic:\r\n dic[z] = []\r\n for j in range(n):\r\n dic[z].append(list([]))\r\n dic[z][x].append(y)\r\n dic[z][y].append(x)\r\nk = int(input())\r\nfor i in range(k):\r\n ans = 0\r\n s = input()\r\n s = s.split()\r\n x = int(s[0])-1\r\n y = int(s[1])-1\r\n for j in dic.keys():\r\n mark = [False]*n\r\n v = dic[j]\r\n DFS(x)\r\n if mark[y]:\r\n ans += 1\r\n print(ans)", "n, m = map(int, input().split())\n\ngraphs = [[[] for _ in range(n)] for _ in range(m)]\nfor _ in range(m):\n a, b, c = map(int, input().split())\n graphs[c - 1][a - 1].append(b - 1)\n graphs[c - 1][b - 1].append(a - 1)\n\nused = None\n\n\ndef dfs(vertex, color):\n used[vertex] = True\n for nei in graphs[color][vertex]:\n if not used[nei]:\n dfs(nei, color)\n\n\nq = int(input())\n\nfor _ in range(q):\n u, v = map(int, input().split())\n c = 0\n for _color in range(m):\n used = [False] * n\n dfs(u - 1, _color)\n if used[v - 1]:\n c += 1\n print(c)\n", "class DisjointSet: #only support query, NO construction supported\r\n def __init__(self, n):\r\n self.num_sets = n #--@union\r\n self.parents = list(range(n))\r\n self.ranks = [0] * n\r\n self.sizes = [1] * n #used@union: size of set@root! 0 if NOT repsentive\r\n \r\n def __str__(self):\r\n return '%s'%self.parents\r\n\r\n def __repr__(self):\r\n return '%s'%self.parents\r\n\r\n def find(self,j): #no compress\r\n while self.parents[j]!=j:\r\n j = self.parents[j]\r\n return j\r\n\r\n def union(self,i,j):\r\n i = self.find(i)\r\n j = self.find(j)\r\n if i == j:\r\n return False\r\n rd = self.ranks[i] - self.ranks[j]\r\n if rd == 0: # Increment repr0's rank if both nodes have same rank\r\n self.ranks[i] += 1\r\n elif rd < 0: # Swap to ensure that repr0's rank >= repr1's rank\r\n i, j = j, i\r\n self.parents[j] = i #merge\r\n self.sizes[i] += self.sizes[j]\r\n self.sizes[j] = 0\r\n self.num_sets -= 1\r\n return True\r\n\r\ndef main():\r\n n,m = list(map(int,input().split())) #100,100\r\n el = [list(map(int,input().split())) for _ in range(m)]\r\n q = int(input())\r\n vl = [list(map(int,input().split())) for _ in range(q)] \r\n\r\n dl = [DisjointSet(n) for _ in range(m)]\r\n for a,b,c in el:\r\n dl[c-1].union(a-1,b-1)\r\n [print(sum([d.find(u-1)==d.find(v-1) for d in dl])) for u,v in vl]\r\n\r\nmain()\r\n\r\n'''\r\nimport cProfile\r\ncProfile.run(\"main()\")\r\n'''\r\n", "from sys import stdin, stderr, stdout\nfrom math import *\nfrom bisect import *\nfrom collections import Counter, deque, defaultdict\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\n\ninput = lambda: stdin.buffer.readline().decode().rstrip()\ninp = lambda: input().split()\n\n# Solution here\nres = deque()\n\n\nclass DisjointSetUnion:\n def __init__(self, n):\n self.parent = list(range(n))\n self.size = [1] * n\n self.num_sets = n\n\n def find(self, a):\n acopy = a\n while a != self.parent[a]:\n a = self.parent[a]\n while acopy != a:\n self.parent[acopy], acopy = a, self.parent[acopy]\n return a\n\n def union(self, a, b):\n a, b = self.find(a), self.find(b)\n if a != b:\n if self.size[a] < self.size[b]:\n a, b = b, a\n\n self.num_sets -= 1\n self.parent[b] = a\n self.size[a] += self.size[b]\n\n def set_size(self, a):\n return self.size[self.find(a)]\n\n def __len__(self):\n return self.num_sets\n\n\ndef solve(tt):\n n, m = map(int, inp())\n g = [DisjointSetUnion(n) for _ in range(m)]\n for _ in range(m):\n u, v, c = map(int, inp())\n g[c - 1].union(u - 1, v - 1)\n\n q = int(input())\n while q:\n q -= 1\n u, v = map(int, inp())\n u, v = u - 1, v - 1\n cnt = 0\n for i in range(m):\n if g[i].find(u) == g[i].find(v):\n cnt += 1\n res.append(cnt)\n\n\ndef main():\n test_case = 1\n # test_case = int(input())\n for tt in range(1, test_case + 1):\n solve(f\"{tt}: -------------------------\")\n stdout.write(\"\\n\".join(map(str, res)))\n return\n\n\ndef dbg(*args):\n import inspect\n import re\n\n debug = lambda *args, end=\"\\n\": stderr.write(\" \".join([str(x) for x in args]) + end)\n frame = inspect.currentframe().f_back\n s = inspect.getframeinfo(frame).code_context[0]\n r = re.search(r\"\\((.*)\\)\", s).group(1)\n var_name = r.split(\", \")\n stderr.write(\"\\n\")\n for i, (var, val) in enumerate(zip(var_name, args)):\n debug(f\"{var} = {val}\")\n\n\nif __name__ == \"__main__\":\n main()\n", "class UnionFind:\n def __init__(self, n):\n self.p = [None, *range(1, 1 + n)]\n self.r = [None, *([1] * n)]\n\n def find(self, i):\n p = self.p[i]\n\n if p != i:\n p = self.p[i] = self.find(p)\n\n return p\n\n def union(self, a, b):\n a = self.find(a)\n b = self.find(b)\n\n ra = self.r[a]\n rb = self.r[b]\n\n if ra > rb:\n self.p[b] = a\n elif ra < rb:\n self.p[a] = b\n else:\n self.p[b] = a\n self.r[b] += 1\n\n\nn, m = map(int, input().split())\nufs = [UnionFind(n) for _ in range(m)]\n\nfor _ in range(m):\n a, b, c = map(int, input().split())\n ufs[c - 1].union(a, b)\n\nfor _ in range(int(input())):\n u, v = map(int, input().split())\n print(sum(1 for uf in ufs if uf.find(u) == uf.find(v)))\n", "import queue\nn,m = map(int,input().split(' '))\ncolours = [[[] for node in range(n)] for colour in range(m)]\n\ndef bfs(adjacency,start,destination):\n q = queue.Queue()\n q.put(start)\n visited = [0 for _ in adjacency]\n while not q.empty():\n cur = q.get()\n if not visited[cur]:\n visited[cur]=1\n for child in adjacency[cur]:\n if child == destination:\n return True\n if not visited[child]:\n q.put(child)\n return False\nfor _ in range(m):\n a,b,c = map(int,input().split(' '))\n colours[c-1][a-1].append(b-1)\n colours[c-1][b-1].append(a-1)\nq = int(input())\nfor query in range(q):\n a,b = map(int,input().split(' '))\n reaches = [bfs(colour,a-1,b-1) for colour in colours]\n print(sum(reaches))\n\t \t\t \t\t\t\t \t \t \t\t \t\t\t \t\t\t\t\t", "def build_graph():\r\n line1 = input().strip().split()\r\n n = int(line1[0])\r\n m = int(line1[1])\r\n graph = {}\r\n for _ in range(m):\r\n line = input().strip().split()\r\n u = int(line[0])\r\n v = int(line[1])\r\n c = int(line[2])\r\n if c not in graph:\r\n graph[c] = {j: [] for j in range(1, n+1)}\r\n graph[c][u].append(v)\r\n graph[c][v].append(u)\r\n return graph\r\n\r\ndef no_of_paths(u, v, graph):\r\n x = 0\r\n for c in graph:\r\n parent = {}\r\n parent = dfs_visit(v, graph[c], parent)\r\n if u in parent:\r\n x += 1\r\n return x\r\n\r\ndef dfs_visit(i, adj_list, parent):\r\n for j in adj_list[i]:\r\n if j not in parent:\r\n parent[j] = i\r\n dfs_visit(j, adj_list, parent)\r\n return parent\r\n\r\n\r\nif __name__ == \"__main__\":\r\n graph = build_graph()\r\n for _ in range(int(input())):\r\n line = input().strip().split()\r\n print(no_of_paths(int(line[0]), int(line[1]), graph))", "\r\nfrom collections import deque ,defaultdict\r\n\r\n\r\ndef dfs(node , c):\r\n\r\n for i in g[node]:\r\n if not visited[i[0]] and i[1] == c :\r\n visited[i[0]] = True\r\n dfs(i[0] , i[1])\r\n\r\n\r\n\r\nn , m = map(int,input().split())\r\n\r\ng = defaultdict(list)\r\ncols = deque()\r\n#g = [[] for i in range(n + 1)]\r\n\r\nfor i in range(m):\r\n u , v , c = map(int,input().split())\r\n g[u].append([v , c])\r\n g[v].append([u , c])\r\n cols.append(c)\r\n\r\n\r\nq = int(input())\r\nans = deque()\r\nfor i in range(q):\r\n x , y = map(int,input().split())\r\n cnt = 0\r\n for j in range(1 , m + 1 ):\r\n visited = [False]*(n + 1)\r\n\r\n dfs(x , j)\r\n if visited[y] == True:\r\n cnt +=1\r\n ans.append(cnt)\r\n\r\n\r\nfor i in ans:\r\n print(i)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nn,m = map(int,input().strip().split())\r\n\r\ngr = [[[] for i in range(n)] for i in range(m) ]\r\n\r\nfor i in range(m):\r\n a,b,c = map(int,input().strip().split())\r\n gr[c-1][a-1].append(b)\r\n gr[c-1][b-1].append(a)\r\n\r\nq = int(input())\r\n\r\nfor j in range(q):\r\n x,y = map(int,input().strip().split())\r\n ans = 0\r\n for i in range(m):\r\n st = [x]\r\n par = {x:1}\r\n flag = 0\r\n while st:\r\n u = st.pop()\r\n if u==y:\r\n flag = 1\r\n break\r\n for v in gr[i][u-1]:\r\n if v not in par:\r\n st.append(v)\r\n par[v] = 1\r\n if flag==1:\r\n #print(i+1)\r\n ans+=1\r\n print(ans)\r\n\r\n \r\n\r\n \r\n", "n, m = list(map(int,input().split()))\r\narr = [ [i for i in range(n)] for j in range(m) ]\r\n\r\ndef find(c, x):\r\n if x == arr[c][x]: \r\n return x\r\n arr[c][x] = find(c, arr[c][x])\r\n return arr[c][x]\r\n\r\nfor i in range(m):\r\n a, b, c = list(map(int, input().split()))\r\n a-=1 ; b-=1 ; c-=1\r\n arr[c][find(c, a)] = find(c, b)\r\n\r\nfor i in range(int(input())):\r\n a, b = list(map(int, input().split()))\r\n a-=1 ; b-=1\r\n res = sum(1 if find(i, a) == find(i, b) else 0 for i in range(m))\r\n print(res)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Aug 10 11:36:11 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 60 - CF505-DIV2B\r\n\"\"\"\r\n\r\nfrom collections import deque\r\n\r\nn, m = map(int,input().split())\r\ngraph = [[] for _ in range(n)]\r\nmaxcol = 0\r\nfor i in range(m):\r\n fro, to, col = map(int,input().split())\r\n graph[fro-1].append((to-1,col))\r\n graph[to-1].append((fro-1,col))\r\n maxcol = max(maxcol,col)\r\n\r\nqu = int(input())\r\nfor i in range(qu):\r\n fro, to = map(int,input().split())\r\n fro -= 1\r\n to -= 1\r\n ans = 0\r\n for j in range(maxcol):\r\n col = j+1\r\n d = {}\r\n visited = {fro: 1}\r\n q = deque()\r\n q.append(fro)\r\n while q:\r\n point = q.popleft()\r\n if point == to:\r\n ans += 1\r\n break\r\n else:\r\n for k in range(len(graph[point])):\r\n if graph[point][k][0] not in visited and graph[point][k][1] == col:\r\n visited[graph[point][k][0]] = 1\r\n q.append(graph[point][k][0])\r\n print(ans)\r\n \r\n ", "from collections import defaultdict\nfrom sys import stdin, stdout\n\npar = defaultdict(list)\n\ndef build(n):\n global par, size\n for c in range(101):\n par[c] = []\n for i in range(n):\n par[c].append(i)\n return par\n\ndef find(c, i):\n global par\n if par[c][i] == i:\n return i\n par[c][i] = find(c, par[c][i])\n return par[c][i]\n\ndef union(a, b, c):\n global par, scc, size\n p = find(c, a)\n q = find(c, b)\n if p == q:\n return\n par[c][q] = par[c][p]\n\ndef main():\n (n, m) = map(int, stdin.readline().strip().split(' '))\n par = build(n)\n max_c = 0\n for i in range(m):\n (a, b, c) = map(lambda i: int(i) - 1, stdin.readline().strip().split(' '))\n union(a, b, c)\n max_c = max(max_c, c)\n q = int(stdin.readline().strip())\n for i in range(q):\n (a, b) = map(lambda i: int(i) - 1, stdin.readline().strip().split(' '))\n count = 0\n for c in range(max_c + 1):\n p = find(c, a)\n q = find(c, b)\n if p == q:\n count += 1\n stdout.write('{}\\n'.format(count))\nmain()\n", "n, m = list(map(int,input().split()))\np = [ [ i for i in range(n) ] for j in range(m)]\ndef f(ci,xi):\n if xi==p[ci][xi]: return xi\n p[ci][xi] = f(ci,p[ci][xi])\n return p[ci][xi]\ndef uni(ci,xi,yi):\n p[ci][f(ci,xi)]=f(ci,yi)\nfor i in range(m):\n a, b, c = list(map(int,input().split()))\n uni(c-1,a-1,b-1)\nfor i in range(int(input())):\n a, b = list(map(int,input().split()))\n print(sum(1 if f(i,a-1) == f(i,b-1) else 0 for i in range(m)))\n", "def dfs(node, x, color):\n \n visitado[node] = True\n \n if node == x:\n return True\n \n for v, c in grafo[node]:\n if c == color and not visitado[v]:\n if dfs(v,x,color):\n return True\n return False\n \n \nn, m = map(int, input().split())\n \ngrafo = [[] for i in range(n+1)]\nfor i in range(m):\n a, b, c = map(int, input().split())\n grafo[a].append((b, c))\n grafo[b].append((a, c))\n\nq = int(input())\nres = []\nfor i in range(q):\n u, v = map(int, input().split())\n \n cnt = 0\n for cor in range(1, m+1):\n visitado = [0]*(n+1)\n \n if dfs(u,v,cor):\n cnt += 1\n res.append(cnt)\n\nfor i in res:\n print(i)\n\t\t\t \t\t\t\t\t \t\t \t \t \t \t \t\t \t\t", "from collections import deque\r\n\r\nn, m = [int(i) for i in input().split()]\r\ngraph = [[] for i in range(n)]\r\n\r\nfor i in range(m):\r\n a, b, c = [int(i) for i in input().split()]\r\n graph[a - 1].append([c, b - 1])\r\n graph[b - 1].append([c, a - 1])\r\n\r\nq = int(input())\r\n\r\n\r\ndef bfs(s, e):\r\n ans = 0\r\n for color in set([i[0] for i in graph[s]]):\r\n visited = [False] * n\r\n visited[s] = True\r\n queue = deque([s])\r\n while queue:\r\n vertex = queue.pop()\r\n for i in graph[vertex]:\r\n if not visited[i[1]] and i[0] == color:\r\n visited[i[1]] = True\r\n queue.append(i[1])\r\n if visited[e]:\r\n ans += 1\r\n\r\n return ans\r\n\r\n\r\nfor _ in range(q):\r\n u, v = [int(i) for i in input().split()]\r\n u, v = u - 1, v - 1\r\n if len(graph[u]) > len(graph[v]):\r\n print(bfs(v, u))\r\n else:\r\n print(bfs(u, v))", "# 505B\r\nfrom collections import defaultdict\r\n\r\n__author__ = 'artyom'\r\n\r\nread = lambda: map(int, input().split())\r\nall_edges = defaultdict(list)\r\nn, m = read()\r\nfor _ in range(m):\r\n a, b, c = read()\r\n all_edges[c].append((a, b))\r\n\r\ngraphs = []\r\n\r\n\r\ndef root(components, x, l=0):\r\n return (x, l) if components[x] == x else root(components, components[x], l + 1)\r\n\r\n\r\ndef connected_components(edges):\r\n components = [i for i in range(n + 1)]\r\n for u, v in edges:\r\n ru, lu = root(components, u)\r\n rv, lv = root(components, v)\r\n if ru != rv:\r\n if lu < lv:\r\n components[ru] = rv\r\n else:\r\n components[rv] = ru\r\n return components\r\n\r\n\r\nfor c, edges in all_edges.items():\r\n graphs.append(connected_components(edges))\r\n\r\n\r\ndef count_in_same_component(u, v):\r\n count = 0\r\n for graph in graphs:\r\n if root(graph, u)[0] == root(graph, v)[0]:\r\n count += 1\r\n return count\r\n\r\n\r\nans = ''\r\nfor __ in range(int(input())):\r\n u, v = read()\r\n ans += str(count_in_same_component(u, v)) + '\\n'\r\nprint(ans)", "n, m = map(int, input().split())\r\ne, g = {}, {x: set() for x in range(1, n + 1)}\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n e[(a, b)] = e[(b, a)] = e.get((a, b), set()) | {c}\r\n g[a].add(b)\r\n g[b].add(a)\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n ans = 0\r\n for color in range(1, m + 1):\r\n vis = [0] * (n + 1)\r\n q = [a]\r\n while q:\r\n \r\n v = q.pop()\r\n if v == b:\r\n \r\n ans += 1\r\n break\r\n vis[v] = 1\r\n for i in g[v]:\r\n if not vis[i] and color in e[(v, i)]:\r\n q.append(i)\r\n print(ans)", "def find(c, a):\n if seq[c][a] == -1:\n return a\n else:\n return find(c, seq[c][a])\n\n\ndef union(c, a, b):\n\n s1 = find(c, a)\n s2 = find(c, b)\n\n if s1 != s2:\n seq[c][s2] = s1\n\n\nn, m = map(int, input().split())\n\nseq = [[-1 for i in range(n)] for i in range(m)]\n\nfor i in range(m):\n a, b, c = map(int, input().split())\n union(c-1, a-1, b-1)\n\nq = int(input())\nfor i in range(q):\n count = 0\n a, b = map(int, input().split())\n for j in range(m):\n s1 = find(j, a-1)\n s2 = find(j, b-1)\n\n if s1 == s2:\n count += 1\n\n print(count)\n", "from collections import defaultdict\r\n\r\ndef connectedComponents(root, visited, graph, c, comp):\r\n visited[root] = 1\r\n comp[root] = c\r\n for i in graph[root]:\r\n if visited[i] == 0:\r\n connectedComponents(i, visited, graph, c, comp)\r\n return\r\n\r\nn, m = map(int, input().split())\r\ngraphs = [defaultdict(list) for i in range(m + 1)]\r\nvert = defaultdict(set)\r\nfor _ in range(m):\r\n u, v, c = map(int, input().split())\r\n graphs[c][u].append(v)\r\n graphs[c][v].append(u)\r\n vert[c].add(v)\r\n vert[c].add(u)\r\n\r\ncomponents = [[0 for i in range(n + 1)]for i in range(m + 1)]\r\n\r\nfor i in range(1, m + 1):\r\n c = 0\r\n visited = [0 for i in range(n + 1)]\r\n for r in graphs[i].keys():\r\n if visited[r] == 0:\r\n c += 1\r\n connectedComponents(r, visited, graphs[i], c, components[i])\r\n\r\n# for i in components:\r\n# print(i)\r\nq = int(input())\r\nfor i in range(q):\r\n u, v = map(int, input().split())\r\n ans = 0\r\n for j in range(1, m + 1):\r\n if components[j][u] == components[j][v] and components[j][u] != 0:\r\n ans += 1\r\n print(ans)", "def dfs(x,c):\r\n vis[x] = 1\r\n for i in adj[c][x]:\r\n if not vis[i]:\r\n dfs(i,c)\r\n\r\ndef check(u,v,c):\r\n for i in range(1,n+1):\r\n vis[i] = False\r\n dfs(u,c)\r\n return vis[v]\r\n\r\nn,m = map(int,input().split())\r\n\r\nadj = []\r\nfor i in range(m+1):\r\n adj.append([])\r\n for j in range(n+1):\r\n adj[i].append([])\r\nvis = [False]*(n+1)\r\n\r\nfor i in range(m):\r\n a,b,c = map(int,input().split())\r\n adj[c][a].append(b)\r\n adj[c][b].append(a)\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n u,v = map(int,input().split())\r\n ans = 0;\r\n for c in range(1,m+1):\r\n if check(u,v,c):\r\n ans+=1\r\n print(ans)", "n,m = map(int, input().split())\nfrom collections import defaultdict as DD\nclass UF:\n def __init__(self):\n self.parents = DD(lambda: None)\n\n def union(self, v1, v2):\n root1,d1 = self.root(v1)\n root2,d2 = self.root(v2)\n if root1 == root2:\n return False\n if d1 > d2:\n self.parents[root2] = root1\n else:\n self.parents[root1] = root2\n return True\n\n def root(self, v):\n depth = 0\n while self.parents[v] != None:\n depth += 1\n v = self.parents[v]\n return v, depth\n\nuf = [UF() for _ in range(m)]\n\nfor _ in range(m):\n a,b,c = map(lambda x: int(x)-1, input().split())\n uf[c].union(a,b)\n\ndef answer(a,b):\n count = 0\n for c in range(m):\n if uf[c].root(a)[0] == uf[c].root(b)[0]:\n count += 1\n return count\n\nq, = map(int, input().split())\nfor _ in range(q):\n a,b = map(lambda x: int(x)-1, input().split())\n print(answer(a,b))\n", "def find(c, x):\r\n p = dsu[c]\r\n if x == p[x]:\r\n return x\r\n return find(c, p[x])\r\n \r\ndef union(c, x, y):\r\n x = find(c, x)\r\n y = find(c, y)\r\n if x == y:\r\n return\r\n p = dsu[c]\r\n p[x] = y\r\n \r\nn, m = map(int, input().split())\r\ndsu = [[i for i in range(n + 1)] for _ in range(m + 1)]\r\nfor _ in range(m):\r\n a, b, c = map(int, input().split())\r\n union(c, a, b)\r\n \r\nq = int(input())\r\nfor _ in range(q):\r\n a, b = map(int, input().split())\r\n count = 0\r\n for c in range(1, m + 1):\r\n if find(c, a) == find(c, b):\r\n count += 1\r\n print(count)\r\n", "def create_adj(edge):\r\n edges={}\r\n for u in edge:\r\n if u[0] in edges.keys():\r\n edges[u[0]].append(u[1])\r\n else:\r\n edges[u[0]]=[u[1]]\r\n return edges\r\ndef explore(adj,v,visited):\r\n visited[v]=True\r\n #print(visited)\r\n # print('adj',adj)\r\n # print('v',v)\r\n for i in adj[v]:\r\n if visited[i]==False:\r\n explore(adj,i,visited)\r\ndef find(adj,u,v):\r\n global c\r\n if(u not in adj.keys() or v not in adj.keys()):\r\n return\r\n visited={}\r\n for r in adj.keys():\r\n visited[r]=False\r\n explore(adj,u,visited)\r\n if(visited[v]==True):\r\n\r\n c=c+1\r\n # print('yes',c)\r\n return c\r\nn,m=map(int,input().split())\r\nht={}\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n if(c in ht.keys()):\r\n ht[c].append([a,b])\r\n ht[c].append([b,a])\r\n else:\r\n ht[c]=[[a,b],[b,a]]\r\nq=int(input())\r\n#print(ht)\r\nc=0\r\nfor j in range(q):\r\n c=0\r\n u,v=map(int,input().split())\r\n for y in ht.keys():\r\n adj=create_adj(ht[y])\r\n\r\n #print(adj)\r\n find(adj,u,v)\r\n print(c)", "scanf = lambda:map(int,input().split())\r\nn,m = scanf()\r\nf = [list(range(n+1)) for _ in range(m+2)]\r\ndef fd(a,c):\r\n if f[c][a]!=a:f[c][a] = fd(f[c][a],c)\r\n return f[c][a]\r\ndef un(a,b,c):\r\n ra,rb = fd(a,c),fd(b,c)\r\n if ra==rb:return\r\n f[c][ra] = rb\r\ndef swap(a,b):\r\n tmp = a\r\n a = b\r\n b = tmp\r\nfor a,b,c in [map(int,input().split()) for _ in range(m)]:\r\n un(a,b,c)\r\nq = int(input())\r\nfor x,y in [map(int,input().split()) for _ in range(q)]:\r\n print(sum(1 for i in range(1,m+1) if fd(x,i) == fd(y,i)))", "from sys import stdin, stdout\r\n\r\ndef find(node, color):\r\n x = []\r\n while colors[color][node] > 0:\r\n x.append(node)\r\n node = colors[color][node]\r\n for i in x:\r\n colors[color][i] = node\r\n return node\r\n\r\ndef union(node1, node2, color):\r\n if node1 != node2:\r\n if colors[color][node1] > colors[color][node2]:\r\n node1, node2 = node2, node1\r\n colors[color][node1] += colors[color][node2]\r\n colors[color][node2] = node1\r\n\r\nn, m = map(int, stdin.readline().strip().split())\r\ncolors = [[-1 for i in range(n+1)] for j in range(m+1)]\r\nfor __ in range(m):\r\n a, b, c = map(int, stdin.readline().strip().split())\r\n union(find(b, c), find(a, c), c)\r\nq = int(stdin.readline().strip())\r\noutputs = []\r\nfor __ in range(q):\r\n count = 0\r\n a, b = map(int, stdin.readline().strip().split())\r\n for i in range(1, m+1):\r\n if find(a, i) == find(b, i):\r\n count += 1\r\n outputs.append(count)\r\nfor output in outputs:\r\n stdout.write(f'{output}\\n')\r\n\r\n", "def frente(a, c):\n if f[c][a] != a:\n f[c][a] = frente(f[c][a], c)\n return f[c][a]\n\ndef antes(a, b, c):\n ra, rb = frente(a, c), frente(b, c)\n if ra == rb:\n return\n f[c][ra] = rb\n \nn, m = map(int,input().split())\nf = [list(range(n + 1)) for _ in range(m + 2)]\nfor a, b, c in [map(int,input().split()) for _ in range(m)]:\n antes(a, b, c)\n\nq = int(input())\nfor x, y in [map(int, input().split()) for _ in range(q)]:\n print(sum(1 for i in range(1, m + 1) if frente(x, i) == frente(y, i)))\n \t\t\t\t \t\t\t \t \t\t \t \t\t\t\t \t", "import sys\r\nfrom collections import defaultdict\r\n\r\nsys.setrecursionlimit(200000)\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nn, m = inl()\r\n\r\n\r\ndef dfs(curr, dis, col):\r\n if curr == dis:\r\n return True\r\n visited.add(curr)\r\n\r\n for vertex in graph[curr][col]:\r\n if vertex not in visited:\r\n if dfs(vertex, dis, col):\r\n return col\r\n\r\n return None\r\n\r\n\r\n# 1. Create the Dict\r\ngraph = defaultdict(lambda: defaultdict(list))\r\nfor _ in range(m):\r\n a, b, c = inl()\r\n graph[a][c].append(b)\r\n graph[b][c].append(a)\r\n\r\nfor _ in range(int(input())):\r\n start, dist = inl()\r\n\r\n # 2. Check each color if there is a path return the color\r\n ans = set()\r\n for color in graph[start]:\r\n visited = set()\r\n a = dfs(start, dist, color)\r\n ans.add(a)\r\n\r\n # 3. print the number of colors (set)\r\n print(len(ans) - (None in ans))\r\n", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\nI = lambda : int(sys.stdin.buffer.readline())\r\nNeo = lambda : list(map(int, sys.stdin.buffer.readline().split()))\r\n\r\nn,m = Neo()\r\nColor = defaultdict(set)\r\n\r\nG = defaultdict(set) \r\n\r\nC = set()\r\n\r\ndef addEdge(a,b):\r\n G[a].add(b)\r\n G[b].add(a)\r\n \r\ndef addColor(a,b,c):\r\n Color[(a,b)].add(c)\r\n Color[(b,a)].add(c)\r\n C.add(c)\r\n \r\nfor i in range(m):\r\n a,b,c = Neo()\r\n addColor(a,b,c)\r\n addEdge(a,b)\r\n \r\nvis = [False]*(n+1)\r\nAns = []\r\n \r\ndef fun(node,dest,vis,grp):\r\n if not grp:\r\n return\r\n if node == dest:\r\n for i in grp:\r\n Ans.append(i)\r\n return\r\n vis[node] = True\r\n for i in G.get(node,[]):\r\n if not vis[i]:\r\n newvis = vis.copy()\r\n z = grp.intersection(Color[node,i])\r\n fun(i,dest,newvis,z)\r\n\r\nfor i in range(I()):\r\n a,b = Neo()\r\n vis = [False]*(n+1)\r\n grp = C.copy()\r\n fun(a,b,vis,grp)\r\n print(len(set(Ans)))\r\n Ans =[]\r\n\r\n ", "'''\r\nhttps://codeforces.com/problemset/problem/505/B\r\n\r\n输入 n(2≤n≤100) m(1≤m≤100) 表示一个 n 点 m 边的无向图，节点编号从 1 到 n。\r\n然后输入 m 条边，每条边输入 v w c(1≤c≤m)，表示有条颜色为 c 的边连接 v 和 w。\r\n然后输入 q(1≤q≤100) 和 q 个询问，每个询问输入 v w，你需要输出有多少种颜色 c 满足：从 v 到 w 存在一条路径，这条路径上的边均为颜色 c。\r\n\r\n进阶：你能想出一个低于 O(平方) 的算法吗？\r\n见 https://codeforces.com/contest/506/problem/D\r\n输入\r\n4 5\r\n1 2 1\r\n1 2 2\r\n2 3 1\r\n2 3 3\r\n2 4 3\r\n3\r\n1 2\r\n3 4\r\n1 4\r\n输出\r\n2\r\n1\r\n0\r\n'''\r\n\r\nfrom collections import defaultdict\r\n\r\n\r\ndef _n():\r\n return int(input())\r\n\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef _nS():\r\n return input().split()\r\n\r\n\r\ndef solve():\r\n n, m = _nA()\r\n edges = []\r\n graph = defaultdict(list)\r\n for i in range(m):\r\n # edges.append(_nA())\r\n v, w, c = _nA()\r\n graph[v].append((w, c))\r\n graph[w].append((v, c))\r\n\r\n ret = set()\r\n\r\n def dfs(v, w, vis, c):\r\n if v == w:\r\n ret.add(c)\r\n return\r\n for nv in graph[v]:\r\n if nv[0] in vis:\r\n continue\r\n vis.add(nv[0])\r\n if c == -1:\r\n dfs(nv[0], w, vis, nv[1])\r\n elif c == nv[1]:\r\n dfs(nv[0], w, vis, c)\r\n vis.remove(nv[0])\r\n\r\n for i in range(_n()):\r\n v, w = _nA()\r\n ret = set()\r\n vis = set([v])\r\n dfs(v, w, vis, -1)\r\n print(len(ret))\r\n\r\n\r\nsolve()\r\n", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm, log2\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef main():\r\n def find(x, c):\r\n if L[c][x] != x:\r\n L[c][x] = L[c][find(L[c][x], c)]\r\n return L[c][x]\r\n\r\n def union(x, y, c):\r\n root1 = find(x, c)\r\n root2 = find(y, c)\r\n if root1 != root2:\r\n L[c][root2] = root1\r\n return\r\n\r\n n, m = map(int, input().split())\r\n # 构建 m 个并查集\r\n L = [list(range(n)) for _ in range(m)]\r\n for _ in range(m):\r\n x, y, c = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n c -= 1\r\n union(x, y, c)\r\n q = int(input())\r\n for _ in range(q):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n ans = 0\r\n for i in range(m):\r\n if find(x, i) == find(y, i):\r\n ans += 1\r\n print(ans)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def dfs(p, f, gr, used):\n\tif p == f:\n\t\treturn 1\n\tif used[p]:\n\t\treturn 0\n\tused[p] = 1\n\tfor v in gr[p]:\n\t\tif dfs(v, f, gr, used):\n\t\t\treturn 1\n\treturn 0\n\ndef check(gr, u, v):\n\tused = [0] * len(gr)\n\treturn dfs(u, v, gr, used)\n\nn, m = (int(x) for x in input().split())\ncgr = [[[] for j in range(n)] for _ in range(m)]\nfor i in range(m):\n\ta, b, c = (int(x) for x in input().split())\n\tc -= 1\n\ta -= 1\n\tb -= 1\n\tcgr[c][a].append(b)\n\tcgr[c][b].append(a)\nq = int(input())\nfor i in range(q):\n\tu, v = (int(x) for x in input().split())\n\tans = 0\n\tfor gr in cgr:\n\t\tans += check(gr, u - 1, v - 1)\n\tprint(ans)\n", "from collections import deque\r\n\r\ndef BFS(graph,a,b):\r\n \r\n q = deque()\r\n q.append(a)\r\n visited = [ False for _ in range(len(graph))]\r\n \r\n while len(q):\r\n v = q.pop()\r\n\r\n if visited[v]:\r\n continue\r\n\r\n for x in graph[v]:\r\n if not visited[x]:\r\n q.append(x)\r\n\r\n visited[v] = True\r\n\r\n return visited[b]\r\n\r\n\r\nn, m = map(int, input().split())\r\ncolor = {}\r\nfor i in range(m):\r\n v1, v2, c = map(int, input().split())\r\n\r\n if c not in color:\r\n color[c] = [ [] for _ in range(n+1) ]\r\n\r\n color[c][v1].append(v2)\r\n color[c][v2].append(v1)\r\n \r\nq = int(input())\r\nfor _ in range(q):\r\n a, b = map(int, input().split())\r\n\r\n ans = 0\r\n for i in color:\r\n if BFS(color[i], a, b):\r\n ans += 1\r\n print(ans)", "#code by aanchaltiwari__\r\ndef dfs(x, y, color):\r\n visited = [False for i in range(n + 1)]\r\n visited[x] = True\r\n stack = [x]\r\n while stack:\r\n node = stack.pop()\r\n for child, childcolor in g[node]:\r\n if visited[child] == False and childcolor == color:\r\n visited[child] = True\r\n stack.append(child)\r\n if visited[y] == True:\r\n return True\r\n return False\r\n\r\n\r\nn, m = map(int, input().split())\r\ng = {i: [] for i in range(1, n + 1)}\r\ns = set()\r\nfor i in range(m):\r\n u, v, c = map(int, input().split())\r\n s.add(c)\r\n g[u].append([v, c])\r\n g[v].append([u, c])\r\ns = list(s)\r\n# print(g)\r\n# print(s)\r\nans = [[0 for i in range(n+1)]for j in range(n+1)]\r\nfor i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n for c in s:\r\n if i != j:\r\n if dfs(i, j, c):\r\n ans[i][j] += 1\r\n# print(ans)\r\nq = int(input())\r\nfor i in range(q):\r\n u, v = map(int, input().split())\r\n print(ans[u][v])\r\n", "# main\r\nused = []\r\n\r\n\r\ndef dfs(p, t, c):\r\n if p == t:\r\n return True\r\n if used[p]:\r\n return False\r\n used[p] = True\r\n for ch in adj[p]:\r\n if ch[1] == c and not (used[ch[0]]) and dfs(ch[0], t, ch[1]):\r\n return True\r\n return False\r\n\r\n\r\nn, m = map(int, input().split())\r\nadj = []\r\nfor i in range(n + 1):\r\n adj.append([])\r\n used.append(False)\r\n\r\nfor i in range(m):\r\n a, b, c = map(int, input().split())\r\n adj[a].append([b, c])\r\n adj[b].append([a, c])\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n u, v = map(int, input().split())\r\n ctr = 0\r\n for j in range(m + 1):\r\n if dfs(u, v, j + 1):\r\n ctr += 1\r\n for k in range(n + 1):\r\n used[k] = False\r\n print(ctr)\r\n", "def solution():\r\n\tn,m = [int(x) for x in input().split(' ')]\r\n\tgraphs = {}\r\n\tedges = {}\r\n\tfor i in range(m):\r\n\t\tx,y,c = input().split(' ')\r\n\t\tif c not in graphs:\r\n\t\t\tgraphs[c]={}\r\n\t\tif x not in graphs[c]:\r\n\t\t\tgraphs[c][x] = []\r\n\r\n\t\tif y not in graphs[c]:\r\n\t\t\tgraphs[c][y] = []\r\n\r\n\t\tgraphs[c][x].append(y)\r\n\t\tgraphs[c][y].append(x)\r\n\r\n\tq = int(input())\r\n\tqueries = []\r\n\tfor i in range(q):\r\n\t\tx,y = input().split(' ')\r\n\t\tans = 0\r\n\t\tfor c,graph in graphs.items():\r\n\t\t\tans+=1 if areConnected(x,y,graph) else 0\r\n\r\n\t\tprint(ans)\r\n\r\ndef areConnected(x,y,graph):\r\n\tif x not in graph or y not in graph:\r\n\t\treturn False\r\n\tqueu = [x]\r\n\talready = [x]\r\n\twhile len(queu) != 0:\r\n\t\tcurrent = queu[0]\r\n\t\tif current == y:\r\n\t\t\treturn True\r\n\t\tdel queu[0]\r\n\t\talready.append(current)\r\n\t\tfor i in graph[current]:\r\n\t\t\tif i not in already and i not in queu:\r\n\t\t\t\tif i == y:\r\n\t\t\t\t\treturn True\r\n\r\n\t\t\t\tqueu.append(i)\r\n\r\n\treturn False\r\n\r\nsolution()", "n,m = [int(x) for x in input().split()]\r\nedge = {}\r\nfor i in range (1,n+1):\r\n\tedge[i] = {}\r\n\tfor j in range (1,m+1):\r\n\t\tedge[i][j] = []\r\nfor i in range (m):\r\n\ta,b,c = [int(x) for x in input().split()]\r\n\tedge[a][c].append(b)\r\n\tedge[b][c].append(a)\r\nq = int(input())\r\nfor i in range (q):\r\n\tu,v = [int(x) for x in input().split()]\r\n\tcount = 0\r\n\tfor key in edge[u]:\r\n\t\tlevel = {u:0}\r\n\t\tfrontier = [u]\r\n\t\tfound = False\r\n\t\twhile frontier and not found:\r\n\t\t\tnext = []\r\n\t\t\tfor uu in frontier:\r\n\t\t\t\tfor vv in edge[uu][key]:\r\n\t\t\t\t\tif not(vv in level):\r\n\t\t\t\t\t\tif vv == v:\r\n\t\t\t\t\t\t\tfound = True\r\n\t\t\t\t\t\tlevel[vv] = 0\r\n\t\t\t\t\t\tnext.append(vv)\r\n\t\t\tfrontier = next\r\n\t\tif(found):\r\n\t\t\tcount += 1\r\n\tprint (count)", "\nn, m = map(int, input().split())\ngraph = [[] for _ in range(105)]\n \nfor _ in range(m):\n a, b, c = map(int, input().split())\n graph[a].append([b,c])\n graph[b].append([a,c])\n \n \ndef dfs(source, destination, colour):\n if source == destination:\n return True\n visited[source] = True\n for node in graph[source]:\n if node[1] == colour and visited[node[0]] is False:\n if dfs(node[0], destination, colour):\n return True\n return False\n \nfor i in range(int(input())):\n ans = 0\n f, y = map(int ,input().split())\n for colour in range(1, 101):\n visited = [False]*(n+1)\n if dfs(f, y, colour):\n ans += 1\n print(ans)\n \t \t\t\t \t \t\t \t \t \t \t", "from collections import defaultdict\r\nclass DisjSet: \r\n def __init__(self, n): \r\n # Constructor to create and \r\n # initialize sets of n items \r\n self.rank = [1] * n \r\n self.parent = [i for i in range(n)] \r\n \r\n \r\n # Finds set of given item x \r\n def find(self, x): \r\n \r\n # Finds the representative of the set \r\n # that x is an element of \r\n if (self.parent[x] != x): \r\n \r\n # if x is not the parent of itself \r\n # Then x is not the representative of \r\n # its set, \r\n self.parent[x] = self.find(self.parent[x]) \r\n \r\n # so we recursively call Find on its parent \r\n # and move i's node directly under the \r\n # representative of this set \r\n \r\n return self.parent[x] \r\n \r\n \r\n # Do union of two sets represented \r\n # by x and y. \r\n def Union(self, x, y): \r\n \r\n # Find current sets of x and y \r\n xset = self.find(x) \r\n yset = self.find(y) \r\n \r\n # If they are already in same set \r\n if xset == yset: \r\n return\r\n \r\n # Put smaller ranked item under \r\n # bigger ranked item if ranks are \r\n # different \r\n if self.rank[xset] < self.rank[yset]: \r\n self.parent[xset] = yset \r\n \r\n elif self.rank[xset] > self.rank[yset]: \r\n self.parent[yset] = xset \r\n \r\n # If ranks are same, then move y under \r\n # x (doesn't matter which one goes where) \r\n # and increment rank of x's tree \r\n else: \r\n self.parent[yset] = xset \r\n self.rank[xset] = self.rank[xset] + 1\r\nL = []\r\nn,m = map(int,input().split())\r\nedges = []\r\nfor k in range(m):\r\n a,b,c = map(int,input().split())\r\n edges.append([a,b,c])\r\nq = int(input())\r\nqueries = []\r\nfor l in range(q):\r\n x,y = map(int,input().split())\r\n queries.append([x,y])\r\ncount = [0 for i in range(q)]\r\nfor i in range(1,101):\r\n g = DisjSet(101)\r\n for [u,v,c] in edges:\r\n if c == i:\r\n g.Union(u,v)\r\n for z in range(q):\r\n if g.find(queries[z][0]) == g.find(queries[z][1]):\r\n count[z] += 1\r\nfor m in range(q):\r\n print(count[m])", "from sys import stdin,stdout\n# from bisect import bisect_left,bisect\n# from sys import setrecursionlimit\n# from collections import defaultdict\n# from math import gcd,ceil,sqrt\n# setrecursionlimit(int(1e5))\ninput,print = stdin.readline,stdout.write\n\ndef dfs(v, col, dst):\n visited[v] = True\n if v == dst:\n return True\n for e in graph[v]:\n if e[1] == col and not visited[e[0]]:\n if dfs(e[0], col, dst):\n return True\n return False\n\nn,m = list(map(int,input().split()))\ngraph = [[] for _ in range(n)]\n\nfor _ in range(m):\n a,b,c = list(map(int,input().split()))\n a-=1\n b-=1\n c-=1\n graph[a].append((b, c))\n graph[b].append((a, c))\n\nq = int(input())\n\nfor _ in range(q):\n res = 0\n u,v = list(map(int, input().split()))\n u-=1\n v-=1\n for i in range(100):\n visited = [False for i in range(n)]\n if dfs(u,i,v):\n res+=1\n print(str(res)+\"\\n\")\n\n\t \t \t \t \t\t \t\t\t \t\t \t\t \t \t", "N,M = map(int,input().split())\ndat = [[] for _ in range(N)]\ncolor = [set() for _ in range(N)]\nfor _ in range(M):\n\ta,b,c = map(int,input().split())\n\tdat[a-1].append([b-1,c])\n\tdat[b-1].append([a-1,c])\n\tcolor[a-1].add(c)\n\tcolor[b-1].add(c)\n\ndef dfs(i,pre):\n\tglobal ans\n\tif i==v-1:\n\t\tans += 1\n\tvisited[i] = 1\n\tfor x,y in dat[i]:\n\t\tif visited[x]==1 or y!=pre:continue\n\t\tdfs(x,y)\n\nfor _ in range(int(input())):\n\tu,v = map(int,input().split())\n\tans = 0\n\tfor i in color[u-1]:\n\t\tif i not in color[v-1]:continue\n\t\tvisited = [0]*N\n\t\tdfs(u-1,i)\n\tprint(ans)\n\n\n", "n,m = map(int, input().split())\nG = [[[] for _ in range(n)] for _ in range(m)]\n\nfor _ in range(m):\n a,b,c = map(lambda x: int(x)-1, input().split())\n G[c][a].append(b)\n G[c][b].append(a)\n\ndef search(a,b,c):\n stack = [a]\n seen = set()\n while stack:\n node = stack.pop()\n if node == b:\n return True\n if node in seen: continue\n seen.add(node)\n for child in G[c][node]:\n stack.append(child)\n return False\n\ndef answer(a,b):\n count = 0\n for c in range(m):\n if search(a,b,c):\n count += 1\n return count\n\nq, = map(int, input().split())\nfor _ in range(q):\n a,b = map(lambda x: int(x)-1, input().split())\n print(answer(a,b))\n", "# Problem: B. Mr. Kitayuta's Colorful Graph\r\n# Contest: Codeforces - Codeforces Round 286 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/505/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\nprint = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，实测这个快。\r\n\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),\r\n (-1, 1)] # →↘↓↙←↖↑↗\r\n\r\nMOD = 10**9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/505/B\r\n\r\n输入 n(2≤n≤100) m(1≤m≤100) 表示一个 n 点 m 边的无向图，节点编号从 1 到 n。\r\n然后输入 m 条边，每条边输入 v w c(1≤c≤m)，表示有条颜色为 c 的边连接 v 和 w。\r\n然后输入 q(1≤q≤100) 和 q 个询问，每个询问输入 v w，你需要输出有多少种颜色 c 满足：从 v 到 w 存在一条路径，这条路径上的边均为颜色 c。\r\n\r\n进阶：你能想出一个低于 O(平方) 的算法吗？\r\n见 https://codeforces.com/contest/506/problem/D\r\n输入\r\n4 5\r\n1 2 1\r\n1 2 2\r\n2 3 1\r\n2 3 3\r\n2 4 3\r\n3\r\n1 2\r\n3 4\r\n1 4\r\n输出\r\n2\r\n1\r\n0\r\n\"\"\"\r\n\r\n\r\nclass DSU:\r\n \"\"\"基于数组的并查集\"\"\"\r\n def __init__(self, n):\r\n self.fathers = list(range(n))\r\n self.size = [1] * n # 本家族size\r\n self.edge_size = [0] * n # 本家族边数(带自环/重边)\r\n self.n = n\r\n self.set_count = n # 共几个家族\r\n\r\n def find_fa(self, x):\r\n fs = self.fathers\r\n t = x\r\n while fs[x] != x:\r\n x = fs[x]\r\n while t != x:\r\n fs[t], t = x, fs[t]\r\n return x\r\n\r\n def union(self, x: int, y: int) -> bool:\r\n x = self.find_fa(x)\r\n y = self.find_fa(y)\r\n\r\n if x == y:\r\n self.edge_size[y] += 1\r\n return False\r\n # if self.size[x] > self.size[y]: # 注意如果要定向合并x->y，需要干掉这个；实际上上边改成find_fa后，按轶合并没必要了，所以可以常关\r\n # x, y = y, x\r\n self.fathers[x] = y\r\n self.size[y] += self.size[x]\r\n self.edge_size[y] += 1 + self.edge_size[x]\r\n self.set_count -= 1\r\n return True\r\n\r\n# ms\r\ndef solve():\r\n n,m = RI()\r\n dsu = [DSU(n) for _ in range(m)]\r\n for _ in range(m):\r\n u,v,c = RI()\r\n dsu[c-1].union(u-1,v-1)\r\n q, = RI()\r\n for _ in range(q):\r\n u,v = RI()\r\n ans = 0\r\n for d in dsu:\r\n if d.find_fa(u-1) == d.find_fa(v-1):\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "from collections import defaultdict\r\n\r\ndef DFS(d,a,visited):\r\n\r\n\tvisited[a] = 1\r\n\tif a in d:\r\n\t\tfor i in d[a]:\r\n\r\n\t\t\tif visited[i] == 1:\r\n\t\t\t\tcontinue\r\n\t\t\telse:\r\n\t\t\t\tDFS(d,i,visited)\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\nl = [defaultdict(list) for i in range(m+1)]\r\n\r\nfor i in range(m):\r\n\ta,b,c = map(int,input().split())\r\n\r\n\tl[c][a].append(b)\r\n\tl[c][b].append(a)\r\n\r\nq = int(input())\r\n\r\nfor i in range(q):\r\n\ta,b = map(int,input().split())\r\n\tr = 0\r\n\tfor j in l:\r\n\t\tvisited = [0 for i in range(n+1)]\r\n\t\t\r\n\t\tDFS(j,a,visited)\r\n\r\n\t\tif visited[a] == 1 and visited[b] == 1:\r\n\t\t\tr = r + 1\r\n\r\n\tprint(r)\r\n\r\n", "n, m = map(int, input().split())\nd = {}\nadj = [[] for i in range(1 + n)]\nd = [[[-1 for k in range(101)] for j in range(1 + n)] for i in range(n + 1)]\n\nfor i in range(m):\n a, b, c = map(int, input().split())\n adj[a].append(b)\n adj[b].append(a)\n d[a][b][c] = 1\n d[b][a][c] = 1\n # d[(a, b)] = d.get((a, b), []) + [c]\n # d[(b, a)] = d.get((b, a), []) + [c]\nvisited = [0] * (n + 1)\n\ndef dfs(u, target, c):\n if u == target:\n return True\n visited[u] = 1\n for v in adj[u]:\n if visited[v] == 0 and d[u][v][c] == 1:\n if dfs(v, target, c):\n return True\n return False\n\n\n\nfor _ in range(int(input())):\n u, v = map(int, input().split())\n res = 0\n for i in range(1, 101):\n visited = [0] * (n + 1)\n if dfs(u, v, i):\n res += 1\n print(res)", "def dfs_busca(vertice, cor):\n visitados[vertice] = 1\n for vizinho in adjacencia[cor][vertice]:\n if not visitados[vizinho]:\n dfs_busca(vizinho, cor)\n\ndef verifica(origem, destino, cor):\n for i in range(1, n+1):\n visitados[i] = False\n dfs_busca(origem, cor)\n return visitados[destino]\n\nn, m = map(int, input().split())\n\nadjacencia = []\n\nfor i in range(m+1):\n adjacencia.append([])\n for j in range(n+1):\n adjacencia[i].append([])\nvisitados = [False]*(n+1)\n\nfor i in range(m):\n origem, destino, cor = map(int, input().split())\n adjacencia[cor][origem].append(destino)\n adjacencia[cor][destino].append(origem)\nq = int(input())\n\nfor i in range(q):\n origem, destino = map(int, input().split())\n resposta = 0\n\n for cor in range(1, m+1):\n if verifica(origem, destino, cor):\n resposta += 1\n print(resposta)\n\n \t\t\t \t \t\t\t\t \t\t \t\t\t \t\t\t \t\t", "from collections import defaultdict, deque\n\ndef bfs(g,s,c):\n visited = set()\n q = deque([s])\n while len(q) > 0:\n v = q.pop()\n visited.add(v)\n for adj,adj_c in g[v]:\n if adj_c == c and adj not in visited and adj not in q:\n q.append(adj)\n return visited\n \ndef con_components(g,c):\n visited = set()\n components = []\n for s in g.keys():\n if s not in visited:\n nodes = bfs(g,s,c)\n components.append(nodes)\n visited |= nodes\n return components\n\ndef main():\n n,m = map(int, input().split())\n g = defaultdict(list)\n colors = set()\n for _ in range(m):\n a,b,c = map(int, input().split())\n g[a].append((b,c))\n g[b].append((a,c))\n colors.add(c)\n components = {c:con_components(g,c) for c in colors}\n \n q = int(input())\n for _ in range(q):\n u,v = map(int, input().split())\n ct = 0\n for c in colors:\n for comp in components[c]:\n if u in comp and v in comp:\n ct += 1\n print(ct)\n \n\nif __name__ == '__main__':\n main() ", "maxn = 105\nn = 0\nm = 0\nq = 0\nff = [dict() for _ in range(maxn)]\nresposta = [dict() for _ in range(maxn)]\n\n\ndef encontra( v, c):\n saida = 0\n if ff[v][c] == v:\n saida = v\n else:\n ff[v][c] = encontra(ff[v][c], c)\n saida = ff[v][c]\n return saida\n \n\ndef uniao( a, b, c):\n if c not in ff[a].keys():\n ff[a][c] = a\n if c not in ff[b].keys():\n ff[b][c] = b\n fa = encontra(a, c)\n fb = encontra(b, c)\n if fa != fb:\n ff[fa][c] = fb\n \ndef troca(x,y):\n y1 = x\n x1 = y\n y = y1\n x = x1\n \n\nn, m = str(input()).split()\nn = int(n)\nm = int(m)\nfor k in range(m):\n a,b,c = str(input()).split()\n a = int(a)\n b = int(b)\n c = int(c)\n uniao(a, b, c)\n\n \nq = int(input())\n \nwhile (q) != 0:\n q -= 1\n x, y = str(input()).split()\n x = int(x)\n y = int(y)\n resp = 0\n if y in resposta[x].keys():\n print(\"{0:d}\\n\".format(resposta[x][y]), end = '')\n continue\n s1 = len(ff[x])\n s2 = len(ff[y])\n if s1 > s2:\n troca(x, y)\n for u in ff[x]:\n if u in ff[y].keys() and encontra(x, u) == encontra(y, u):\n resp += 1\n resposta[x][y] = resposta[y][x] = resp\n print(\"{0:d}\\n\".format(resp), end = '')\n \t \t\t \t\t\t\t\t\t \t\t\t\t \t\t \t\t", "n, m = list(map(int,input().split()))\r\ngrath = {}\r\nfor i in range(n):\r\n grath[i + 1] = []\r\nfor i in range(m):\r\n a,b,c = list(map(int,input().split()))\r\n grath[a].append([b, c])\r\n grath[b].append([a, c])\r\nq = int(input())\r\n\r\ndef dfs(v,used,color):\r\n used[v] = True\r\n for u in grath[v]:\r\n if u[1] == color and used[u[0]] == False:\r\n dfs(u[0], used, color)\r\nitog = []\r\nfor _ in range(q):\r\n count = 0\r\n u, v = list(map(int,input().split()))\r\n s = set()\r\n for i in grath[u]:\r\n s.add(i[1])\r\n for color in s:\r\n used = [False for j in range(n + 1)]\r\n dfs(u, used, color)\r\n if used[v] == True:\r\n count += 1\r\n itog.append(count)\r\nfor i in itog:\r\n print(i)\r\n\r\n", "\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef find(color,x):\r\n\r\n if(x!=parent[color][x]):\r\n parent[color][x]=find(color,parent[color][x])\r\n return parent[color][x]\r\n\r\ndef union(color,x,y):\r\n\r\n r1=find(color,parent[color][x])\r\n r2=find(color,parent[color][y])\r\n\r\n if(r1!=r2):\r\n parent[color][r1]=parent[color][r2]\r\n \r\n\r\n\r\nn,m=map(int,input().split())\r\nparent=[[i for i in range(n)] for j in range(m)]\r\n\r\n\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n union(c-1,a-1,b-1)\r\n\r\n\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n tot=0\r\n \r\n for i in range(m):\r\n if(find(i,a-1)==find(i,b-1)):\r\n tot+=1\r\n print(tot)\r\n", "from collections import defaultdict,deque\n\nn,m = map(int, input().split())\n\n\ndef dfs(graph, color, v, u):\n visited = set()\n\n q = deque()\n q.append(v)\n \n while q:\n n1,c1 = q.popleft()\n if n1 == u[0] and c1 == color:\n return 1\n if (n1,c1) in visited:\n continue\n visited.add((n1,c1))\n for n2,c2 in graph[n1]:\n if c2==color and (n2,c2) not in visited:\n q.append((n2,c2))\n # for n2,c2 in \n return 0\n\ncolors = set()\ngraph = defaultdict(list)\nfor i in range(m):\n a,b,c = map(int, input().split())\n graph[b].append((a,c))\n graph[a].append((b,c))\n colors.add(c)\nq = int(input())\nfor i in range(q):\n a,b = map(int, input().split())\n res = 0\n for j in colors:\n res += dfs(graph, j, (a,j), (b,j))\n print(res)\n\n \n", "import sys\r\nfrom math import sqrt,gcd,factorial,ceil,floor,pi\r\nfrom collections import deque,Counter,OrderedDict\r\nfrom heapq import heapify,heappush,heappop\r\n#sys.setrecursionlimit(10**7)\r\ninput =lambda: sys.stdin.readline()\r\nI =lambda :int(input())\r\nS =lambda :input().strip()\r\nM =lambda :map(int,input().strip().split())\r\nL =lambda :list(map(int,input().strip().split()))\r\nmod=10**9+7 \r\n\r\n##########################################################\r\n\r\ndef find(col,a):\r\n\tif a==d[col][0][a]: return a\r\n\tans=find(col,d[col][0][a])\r\n\td[col][0][a]=ans\r\n\treturn ans\r\n\r\ndef merge(a,b,col):\r\n\ta,b=find(col,a),find(col,b)\r\n\tif a==b: return\r\n\tif d[col][1][a]>d[col][1][b]: a,b=b,a\r\n\td[col][0][a]=b\r\n\td[col][1][b]+=d[col][1][a]\r\n\r\nn,m=M()\r\n\r\nd={i+1:[[i for i in range(n+1)],[1]*(n+1)] for i in range(m)}\r\n\r\nfor i in range(m):\r\n\ta,b,c=M()\r\n\tmerge(a,b,c)\r\n#print(d)\r\nfor i in range(I()):\r\n\tu,v=M()\r\n\r\n\tans=0\r\n\tfor j in range(m):\r\n\t\tp,q=find(j+1,u),find(j+1,v)\r\n\t\tif p==q: ans+=1\r\n\t\t#print(i,j,ans,p,q)\r\n\tprint(ans)", "\r\n\r\ndef dfs(start , color):\r\n\r\n for i in g[start]:\r\n if not vis[i[0]] and i[1] == color :\r\n vis[i[0]] = True\r\n dfs(i[0] , i[1])\r\n\r\n\r\n\r\nn , m = map(int,input().split())\r\ng = [[] for i in range(n)]\r\nfor i in range(m):\r\n a , b , c = map(int,input().split())\r\n g[a - 1].append((b - 1, c))\r\n g[b-1].append((a-1 , c))\r\n\r\nq = int(input())\r\nres = [0]*q\r\nfor i in range(q):\r\n u , v = map(int,input().split())\r\n\r\n for j in range(1 , m + 1):\r\n vis = [False] * n\r\n dfs(u - 1 , j)\r\n if vis[v - 1]:\r\n res[i] +=1\r\n\r\n#print(res)\r\n\r\nfor i in res:\r\n print(i)\r\n\r\n\r\n\r\n\r\n\r\n" ]

[ "n,a,b=list(map(int,input().split()))\r\nif n==1:\r\n print(n)\r\nelif b==0 and a==n-1:\r\n print(-1)\r\nelse:\r\n ans,p,sm=[1],0,1\r\n if b==0:\r\n sm=0 \r\n ans.append(1)\r\n p=1 \r\n for i in range(p,n-1):\r\n if b>0:\r\n ans.append(sm+1)\r\n sm+=ans[i+1]\r\n b-=1 \r\n elif a>0:\r\n ans.append(ans[i]+1)\r\n a-=1 \r\n else:\r\n ans.append(ans[i])\r\n print(*ans)" ]

[ "\r\n\r\ndx=[[0]*(1<<20) for _ in range(20)]\r\ndy=[[0]*(1<<20) for _ in range(20)]\r\nlg=[0]*(1<<20)\r\n\r\ndef mx(l,r):\r\n p=lg[r-l+1]\r\n return max(dx[p][l],dx[p][r-(1<<p)+1])\r\n\r\ndef mn(l,r):\r\n p=lg[r-l+1]\r\n return min(dy[p][l],dy[p][r-(1<<p)+1])\r\n\r\n\r\nif __name__ == '__main__':\r\n n=int(input())\r\n dx[0][1:n]=[int(x) for x in input().split()]\r\n dy[0][1:n]=[int(x) for x in input().split()]\r\n\r\n for p in range(1,20):\r\n if (1<<p)>n:\r\n break\r\n for i in range(1,n+2-(1<<p)):\r\n dx[p][i]=max(dx[p-1][i],dx[p-1][i+(1<<(p-1))])\r\n dy[p][i]=min(dy[p-1][i],dy[p-1][i+(1<<(p-1))])\r\n\r\n for i in range(2,n+1):\r\n lg[i]=lg[i>>1]+1\r\n\r\n ans=0\r\n for i in range(1,n+1):\r\n if mx(i,i)<=mn(i,i):\r\n l=i-1\r\n r=i\r\n p=1<<lg[n-i+1]\r\n while p:\r\n if p+l<=n and mx(i,l+p)<mn(i,l+p):l+=p\r\n if p+r<=n and mx(i,r+p)<=mn(i,r+p):r+=p\r\n p>>=1\r\n\r\n ans+=r-l\r\n\r\n print(ans)\r\n\r\n", "import bisect\r\nimport copy\r\nimport gc\r\nimport itertools\r\nfrom array import array\r\nfrom fractions import Fraction\r\nimport heapq\r\nimport math\r\nimport operator\r\nimport os, sys\r\nimport profile\r\nimport cProfile\r\nimport random\r\nimport re\r\nimport string\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict, deque, Counter\r\nfrom functools import reduce, lru_cache\r\nfrom io import IOBase, BytesIO\r\nfrom itertools import count, groupby, accumulate, permutations, combinations_with_replacement, product\r\nfrom math import gcd\r\nfrom operator import xor, add\r\nfrom typing import List\r\n\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# print = lambda d: sys.stdout.write(str(d)+\"\\n\")\r\ndef read_int_list(): return list(map(int, input().split()))\r\ndef read_int_tuple(): return tuple(map(int, input().split()))\r\ndef read_int(): return int(input())\r\n\r\n\r\n# endregion\r\n\r\n\r\nif 'AW' in os.environ['COMPUTERNAME']:\r\n f = open('inputs', 'r')\r\n def input(): return f.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef solve(n, a, b):\r\n mx, mn = deque(), deque()\r\n j = res = 0\r\n for i, (x, y) in enumerate(zip(a, b)):\r\n while mx and a[mx[-1]] <= x:\r\n mx.pop()\r\n mx.append(i)\r\n while mn and b[mn[-1]] >= y:\r\n mn.pop()\r\n mn.append(i)\r\n\r\n while j <= i and a[mx[0]] > b[mn[0]]:\r\n j += 1\r\n while mx and mx[0] < j: mx.popleft()\r\n while mn and mn[0] < j: mn.popleft()\r\n\r\n if mx and mn and a[mx[0]] == b[mn[0]]:\r\n res += min(mx[0], mn[0]) - j + 1\r\n\r\n return res\r\n\r\n\r\ndef main():\r\n for _ in range(1):\r\n n = read_int()\r\n a = read_int_list()\r\n b = read_int_list()\r\n print(solve(n, a, b))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n# cProfile.run(\"main()\")\r\n" ]

[ "n = int(input())\r\nA = list(map(int,input().strip().split()))[::-1]\r\np = 0\r\np_max = 0\r\nX = []\r\nfor i in A:\r\n # print(X)\r\n while(len(X)>0 and X[-1][0]<i):\r\n p = max((p+1,X[-1][1]))\r\n X.pop()\r\n X.append((i,p))\r\n if p>p_max:\r\n p_max = p\r\n p=0\r\nprint(p_max)\r\n", "def psychos(n, A):\r\n kills = [0] * n\r\n stack = []\r\n for i in range(n - 1, -1, -1):\r\n while len(stack) > 0 and A[stack[-1]] < A[i]:\r\n kills[i] = max(kills[i] + 1, kills[stack[-1]])\r\n stack.pop()\r\n stack.append(i)\r\n return max(kills)\r\n\r\n \r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\nprint(psychos(n, A))", "from math import sqrt,ceil,gcd\r\nfrom collections import defaultdict\r\n\r\n\r\n\r\ndef modInverse(b,m):\r\n g = gcd(b, m)\r\n if (g != 1):\r\n # print(\"Inverse doesn't exist\")\r\n return -1\r\n else:\r\n # If b and m are relatively prime,\r\n # then modulo inverse is b^(m-2) mode m\r\n return pow(b, m - 2, m)\r\n\r\ndef sol(n,m,rep):\r\n\r\n r = 1\r\n for i in range(2,n+1):\r\n j = i\r\n while j%2 == 0 and rep>0:\r\n\r\n j//=2\r\n rep-=1\r\n\r\n r*=j\r\n r%=m\r\n\r\n return r\r\n\r\n\r\n\r\n\r\n\r\ndef solve():\r\n\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n st = []\r\n ans = 0\r\n hash = defaultdict(lambda : -1)\r\n for i in range(n):\r\n hash[i] = 0\r\n\r\n\r\n while st!=[] and l[st[-1]]<l[i]:\r\n z = st.pop()\r\n hash[i] = max(hash[i],hash[z]+1)\r\n\r\n\r\n if st == []:\r\n hash[i] = -1\r\n st.append(i)\r\n ans = max(ans,hash[i]+1)\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\nsolve()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def psychos(arr):\n stack = [arr[1]]\n kills = [0 for _ in range(len(arr))]\n step = [-float('inf') for _ in range(len(arr))]\n step[arr[1]] = -1 # never dies\n for i in range(2, len(arr)):\n # print(f'{stack=}')\n while arr[i] > stack[-1]:\n stack.pop()\n if len(stack) == 0:\n break\n if len(stack) == 0:\n stack.append(arr[i])\n step[arr[i]] = -1\n else:\n top = stack.pop()\n while step[top] <= kills[top] and step[top] != -1:\n top = stack.pop()\n stack.append(top)\n kills[top] += 1\n step[arr[i]] = kills[top]\n stack.append(arr[i])\n # print(f'{i=}\\n{stack = }\\n{step = }\\n{kills = }')\n return max(step + [0])\n\nn = int(input())\narr = [None] + list(map(lambda x: int(x), input().split()))\nprint(psychos(arr))\n \t\t\t\t \t\t \t \t \t \t", "n = int(input())\r\nA = [int(i) for i in input().split()]\r\nans = 0\r\n\r\nst = [0]\r\n\r\ntdeath = [-1 for i in range(n)]\r\n\r\nfor i in range(1, n):\r\n tdeath[i] = 0\r\n while len(st) > 0 and A[st[-1]] < A[i]:\r\n tdeath[i] = max(tdeath[i], tdeath[st[-1]]+1)\r\n st.pop()\r\n if len(st)==0:\r\n tdeath[i] = -1\r\n st.append(i)\r\n ans = max(ans, tdeath[i]+1)\r\n \r\nprint(ans)\r\n", "n, t = int(input()), list(map(int, input().split()))\r\n\r\np, s, r = [0] * n, [0] * n, t[0]\r\n\r\nfor i in range(n - 1):\r\n\r\n j = i + 1\r\n\r\n x = t[j]\r\n\r\n if x > r: r = x\r\n\r\n else:\r\n\r\n while t[i] < x: s[j], i = max(s[j], s[i]), p[i]\r\n\r\n p[j] = i\r\n\r\n s[j] += 1\r\n\r\nprint(max(s))\r\n\r\n\r\n\r\n# Made By Mostafa_Khaled", "from sys import stdin,stdout\n\ndef main(n, a):\n ans = 0\n top = 0\n t = [0 for i in range(n)]\n f = [0 for i in range(n)]\n for i in range(n - 1, -1, -1):\n tt = 0\n while top > 0 and a[t[top - 1]] < a[i]:\n top -= 1\n tt = max(tt + 1, f[t[top]])\n f[i] = tt\n t[top] = i\n top += 1\n return max(f)\n\nstdout.write('{}\\n'.format(main(int(stdin.readline().strip()), list(map(int, input().split(' '))))))\n", "inf=10000000\r\n\r\ndef solve(lst):\r\n values=[0]\r\n for i in range(len(lst)):\r\n values.append(lst[i])\r\n n=len(lst)\r\n life=[0]*(n+1)\r\n life[0]=inf\r\n killers=[0]\r\n for i in range(1,n+1):\r\n life[i]=1\r\n while len(killers)>0 and values[i]>values[killers[-1]]:\r\n life[i]=max(life[i],life[killers[-1]]+1)\r\n #print(killers[-1])\r\n killers.pop()\r\n killers.append(i)\r\n ans=0\r\n for i in range(1,n+1):\r\n if life[i]<inf:\r\n ans=max(ans,life[i])\r\n return ans\r\n\r\nn=int(input())\r\nlst=list(map(int,input().strip().split()))[:n]\r\nprint(solve(lst))\r\n\r\n\r\n#lst=[2,4,5,6,1,3]\r\n#print(solve(lst))\r\n \r\n", "def Psycho():\r\n cantidad = int(input())\r\n lista = list(map(int, input().split()))\r\n\r\n lista = lista[::-1]\r\n result = 0\r\n queue = []\r\n for psycho in lista:\r\n aux_porElem = 0\r\n while len(queue) > 0 and queue[-1][0] < psycho:\r\n aux_porElem = max((aux_porElem + 1, queue[-1][1]))\r\n queue.pop()\r\n queue.append((psycho, aux_porElem))\r\n if aux_porElem > result:\r\n result = aux_porElem\r\n\r\n return result\r\n\r\nprint(Psycho())", "def psychos(n, A):\r\n death_time = [0] * n\r\n stack = []\r\n for i in range(n - 1, -1, -1):\r\n #print(death_time)\r\n while len(stack) > 0 and A[stack[-1]] < A[i]:\r\n death_time[i] = max(death_time[i] + 1, death_time[stack[-1]])\r\n stack.pop()\r\n stack.append(i)\r\n #print(death_time)\r\n return max(death_time)\r\n\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\nprint(psychos(n, A))" ]

[ "i1=int(input())\r\nar=list(map(int,input().split()))\r\nsm1=0\r\nsm2=0\r\nar.sort()\r\nfor i in range(1,i1,2):\r\n sm2+=abs(i-ar[int(i/2)])\r\nar.sort(reverse=True)\r\nfor i in range(0,i1,2):\r\n sm1+=abs(i1-i-ar[int(i/2)])\r\nprint(min(sm1,sm2))", "n = int(input())\r\n\r\nA = [int(x) for x in input().split()]\r\nA.sort()\r\nans1=0\r\nans2=0\r\nfor i in range(len(A)):\r\n\tdiff = 2*i+1\r\n\tans1 += abs(diff - A[i])\r\n\r\nfor i in range(len(A)):\r\n\tdiff = 2*i+2\r\n\tans2 += abs(diff - A[i])\r\n\r\nprint(min(ans1,ans2))\r\n", "n=int(input())\r\nlist1=[int(x) for x in input().split()]\r\nlist1.sort()\r\nmoves_odd=0\r\nmoves_even=0\r\nstart_odd=1\r\nstart_even=2\r\nfor i in list1:\r\n temp=i\r\n moves_odd+=abs(temp-start_odd);\r\n start_odd+=2;\r\n moves_even+=abs(temp-start_even);\r\n start_even+=2;\r\nprint(min(moves_even,moves_odd))", "import math\r\n#n,k = map(int, input().strip().split(' '))\r\nn=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nsum_odd=0\r\nsum_even=0\r\nlst.sort()\r\nfor i in range(n//2):\r\n sum_odd+=abs(lst[i]-(2*i+1))\r\nfor i in range(n//2):\r\n sum_even+=abs(lst[i]-(2*(i+1)))\r\nprint(min(sum_odd,sum_even))\r\n ", "n=int(input())\r\na=sorted(map(int,input().split()))\r\nprint(min([sum(abs(x-y)for x,y in zip(a,range(i,n+1,2)))for i in[1,2]]))", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\na=sorted(a)\r\nx=0\r\ny=0\r\nfor i in range(n//2):\r\n\tx+=abs(a[i]-i*2-1)\r\n\ty+=abs(a[i]-i*2-2)\r\nprint(min(x,y))", "n = int(input())\r\nmoo = list(map(int, input().split()))\r\nmoo.sort()\r\nodd = 0\r\neven = 0\r\nfor i in range(1, n//2+1):\r\n even += abs(i * 2 - moo[i-1])\r\n\r\nfor i in range(1, n//2+1):\r\n odd += abs(i * 2 - 1 - moo[i-1])\r\nprint(min(odd, even))", "import math\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\na = sorted(a)\r\nans1 = 0\r\nans2 = 0\r\nfor i in range(n//2):\r\n ans1 += math.fabs(a[i] - (i * 2 + 1))\r\n ans2 += math.fabs(a[i] - (i * 2 + 2))\r\nprint(int(min(ans1,ans2)))", "n = int(input())\r\nl = sorted([int(x) for x in input().split()])\r\nout1 = 0\r\nout2 = 0\r\nfor i in range(1, n+1, 2):\r\n out1 += abs(l[(i-1)//2] - i)\r\n out2 += abs(l[(i-1)//2] - i - 1)\r\n\r\nprint(min(out1, out2))\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\ntemp=[0]*n\r\nfor i in range(len(l)):\r\n\tx=l[i]-1\r\n\ttemp[x]=1\r\n\r\nd1,d2,k1,k2={},{},0,n-1\r\nfor i in range(len(temp)):\r\n\tif temp[i]==1:\r\n\t\td1.update({i:k1})\r\n\t\tk1+=2\r\nfor i in range(len(temp)-1,-1,-1):\r\n\tif temp[i]==1:\r\n\t\td2.update({i:k2})\r\n\t\tk2-=2\r\na,b=0,0\r\nfor i in range(len(temp)):\r\n\tif temp[i]==1:\r\n\t\ta=a+abs(i-d1[i])\r\nfor i in range(len(temp)-1,-1,-1):\r\n\tif temp[i]==1:\r\n\t\tb=b+abs(i-d2[i])\r\nprint(min(a,b))", "n= int(input())\r\nalist = [int(x) for x in input().split()]\r\nalist.sort();\r\nt=0;\r\nlc=[];\r\nll=[];\r\nsumc=0;\r\nsuml=0;\r\nh=int(n/2)\r\nfor i in range(h):\r\n t=t+2;\r\n lc.append(t);\r\nt=-1;\r\nfor i in range(h):\r\n t=t+2;\r\n ll.append(t);\r\nif n==2:\r\n print(0);\r\nelse:\r\n for i in reversed(range(h)):\r\n sumc=sumc+abs(lc[i]-alist[i]);\r\n for i in reversed(range(h)):\r\n suml=suml+abs(ll[i]-alist[i]);\r\n \r\n if sumc<suml:\r\n print(sumc);\r\n else:\r\n print(suml);\r\n \r\n", "def f(filled, empty):\r\n filled.sort()\r\n empty.sort()\r\n c = 0\r\n for i in range(len(filled)):\r\n c += abs(empty[i] - filled[i])\r\n return c\r\n\r\n\r\nn = int(input())\r\nfilled_w = []\r\nempty_b = []\r\nfilled_b = []\r\nempty_w = []\r\nnumbers = []\r\nfor i in range(1, n + 1):\r\n numbers.append(i)\r\nfor item in input().split():\r\n item = int(item)\r\n if item % 2 == 0:\r\n filled_w.append(item)\r\n else:\r\n filled_b.append(item)\r\n numbers.remove(item)\r\nfor item in numbers:\r\n if item % 2 == 0:\r\n empty_w.append(item)\r\n else:\r\n empty_b.append(item)\r\nprint(min(f(filled_w, empty_b), f(filled_b, empty_w)))", "n = int(input())\r\nx = sorted(map(int , input().split()))\r\nprint(min(sum(abs(a - b) for a , b in zip(x , range(ty , n + 1 , 2))) for ty in (1 , 2)))\r\n", "n = int(input())\r\np = sorted(map(int, input().split()))\r\nprint(min(sum(abs(x-i) for x,i in zip(p,range(s,n+1,2))) for s in(1,2)))", "n = int(input())\ns = [int(x) - 1 for x in input().split()]\ns1 = 0\ns2 = 0\ns.sort()\nfor i in range(len(s)):\n s1 += abs(i * 2 - s[i])\n s2 += abs(i * 2 - s[i] + 1)\nprint(min(s1, s2))", "n = int(input())\r\narr = sorted([int(i) for i in input().split()])\r\n\r\na, b = 0, 0\r\n\r\nfor i in range(n//2):\r\n\ta += abs(arr[i] - 1 - i * 2);\r\n\tb += abs(arr[i] - 2 - i * 2);\r\n\r\nprint(min(a, b))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n // 2):\r\n a[i] -= 1\r\na = sorted(a)\r\n\r\nans1 = 0\r\nfor i in range(n // 2):\r\n ans1 += abs(a[i] - 2 * i)\r\nans2 = 0\r\nfor i in range(n // 2):\r\n ans2 += abs(a[i] - (2 * i + 1))\r\n\r\nprint(min(ans1, ans2))", "k=int(input())\r\nk1=input().split()\r\nk2=[int(i) for i in k1]\r\nsum1=0\r\nsum2=0\r\nk2.sort()\r\nfor i in range(int(k/2)):\r\n\tsum1+=abs(k2[i]-(2*i+1))\r\n\t\r\n\tsum2+=abs(k2[i]-(2*i+2))\r\nprint(min(sum1,sum2))", "def calc(num):\n\tans=0\n\tfor i in range(len(l)):\n\t\tans+=(abs((l[i]-1)-(2*i+num)))\n\treturn ans\n\nn=int(input())\nl=list(map(int,input().split()))\nl.sort()\nprint (min(calc(0),calc(1)))", "def main():\n N = int(input())\n P = list(map(int, input().split()))\n\n P.sort()\n even, odd = 0, 0\n for i, j in enumerate(range(2, N + 1, 2)):\n even += abs(P[i] - j)\n for i, j in enumerate(range(1, N + 1, 2)):\n odd += abs(P[i] - j)\n print(min(even, odd))\n\nmain()\n", "print((lambda n, a: min(sum(abs(x - i) for i, x in zip(range(s, n + 1, 2), a)) for s in [1,2]))(int(input()), sorted(map(int, input().split()))))\n", "n = int(input())\r\np = [x-1 for x in sorted(map(int,input().split()))]\r\n\r\n\r\neven = [abs((2*i)-p[i]) for i in range(0,n//2)]\r\nodd = [abs((2*i+1)-p[i]) for i in range(0,n//2)]\r\nprint(min(sum(even),sum(odd)))\r\n\r\n", "n = int(input())\narr = sorted(map(int, input().split()))\nm1 = 0\ni = 2\nm2 = 0\nj = n - 1\nfor e in arr:\n m1 += abs(e - i)\n i += 2\nfor e in arr[::-1]:\n m2 += abs(e - j)\n j -= 2\nprint(min(m1, m2))\n", "n = eval(input())\r\nn >>= 1\r\na = list(map(int, input().split()))\r\nx = 0\r\ny = 0\r\na.sort()\r\nfor i in range(n):\r\n x += abs(2 * i + 1 - a[i])\r\n y += abs(2 * i + 2 - a[i])\r\nprint(min(x, y))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon May 21 22:31:07 2018\n\n@author: thomas\n\"\"\"\n\nn=int(input())\ninteger_numbers=input()\ninit_position=[int(x)-1 for x in integer_numbers.split()]\n#we consider 2 cases: all Black or all White\ninit_position.sort()\nsum_B=0\nfor i in range(len(init_position)):\n sum_B+=abs(init_position[i]-2*i)\n\nsum_W=0\nfor i in range(len(init_position)):\n sum_W+=abs(init_position[i]-2*i-1)\nprint(min(sum_B, sum_W))", "from collections import defaultdict\r\n_ = int(input())\r\nps = list(map(int, input().split()))\r\nps.sort()\r\neven = list(range(2, _+1, 2))\r\nodd = list(range(1, _, 2))\r\neven_sum = 0;odd_sum = 0\r\nfor i in range(len(ps)):\r\n even_sum += abs(even[i] - ps[i])\r\n odd_sum += abs(odd[i] - ps[i])\r\nprint(min(even_sum, odd_sum))", "n = int(input())\na, ans1, ans2 = sorted([int(i) for i in input().split()]), 0, 0\nfor i in range(n // 2):\n ans1 += abs(a[i] - (2 * i + 1))\n ans2 += abs(a[i] - (2 * (i + 1)))\nprint(min(ans1, ans2))\n\n# Fri Jan 01 2021 03:51:43 GMT+0300 (Москва, стандартное время)\n", "n = int(input())\r\na = [0] * n\r\npos = list(map(int, input().split()))\r\nfor i in range(n // 2):\r\n a[pos[i] - 1] = 1\r\n\r\nans1 = 0\r\nfor i in range(n - 1):\r\n if i % 2 == 0:\r\n j = i\r\n while a[j] == 0:\r\n j += 1\r\n a[j] = 0\r\n ans1 += (j - i)\r\n a[i] = 1\r\n else:\r\n j = i\r\n while a[j] == 1:\r\n j += 1\r\n a[j] = 1\r\n ans1 += (j - i)\r\n a[i] = 0\r\n\r\na = [0] * n\r\nfor i in range(n // 2):\r\n a[pos[i] - 1] = 1\r\n\r\nans2 = 0\r\nfor i in range(1, n):\r\n if i % 2 == 1:\r\n j = i\r\n while a[-j] == 0:\r\n j += 1\r\n a[-j] = 0\r\n ans2 += (j - i)\r\n a[-i] = 1\r\n else:\r\n j = i\r\n while a[-j] == 1:\r\n j += 1\r\n a[-j] = 1\r\n ans2 += (j - i)\r\n a[-i] = 0\r\n\r\nprint(min(ans1, ans2))\r\n", "n = int(input())\r\nL = sorted(map(int, input().split()))\r\ns1,s2 = 0,0\r\np,q = 1,2\r\nfor i in range(n//2):\r\n s1 += abs(p-L[i])\r\n p += 2\r\n s2 += abs(q-L[i])\r\n q += 2\r\nprint(min(s1,s2))", "n = int(input())\np = list(map(int, input().split()))\np.sort()\na,b = 0,0\noffset = 1\nfor i in range(n // 2):\n a += abs(p[i] - offset)\n b += abs(p[i] - (offset + 1))\n offset += 2\n\nprint(min(a,b))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ns,c=0,0\r\nx=1\r\nfor i in l:\r\n s=s+(abs(x-i))\r\n x=x+2\r\ny=2\r\nfor i in l:\r\n c+=abs(y-i)\r\n y+=2\r\nprint(min(c,s))\r\n", "n=int(input())\r\n\r\nli=input().split()\r\nfor i in range(0,len(li)):\r\n li[i]=int(li[i])\r\nli.sort()\r\nsum1=0\r\np1=1\r\nsum2=0\r\np2=2\r\nfor i in li:\r\n sum1+=abs(p1-i)\r\n sum2+=abs(p2-i)\r\n p1+=2\r\n p2+=2\r\nprint(min(sum1,sum2))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nneed, pos =0, 1\r\nfor i in a:\r\n\tneed += abs(pos-i)\r\n\tpos += 2\r\nans , pos = 0, 2\r\nfor i in a:\r\n\tans += abs(pos-i)\r\n\tpos += 2\r\nprint(min(ans,need))", "# https://codeforces.com/problemset/problem/985/A\n\nn = int(input())\nplacements = sorted(map(int, input().split()))\n\nans = min(sum(abs(a - b) for a, b in zip(placements, range(2, n + 1, 2))), sum(abs(a - b) for a, b in zip(placements, range(1, n + 1, 2))))\nprint(ans)", "def main():\r\n n = int(input())\r\n p = [int(c) for c in input().split()]\r\n p.sort()\r\n \r\n moves_odd = 0\r\n moves_even = 0\r\n for i in range(n // 2):\r\n moves_odd += abs(p[i] - (i * 2 + 1))\r\n moves_even += abs(p[i] - i * 2 - 2)\r\n\r\n print(min(moves_odd, moves_even))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = input()\r\nnumbers = sorted(map(int, input().split()))\r\n\r\nblack, white = 0, 0\r\nfor i, number in enumerate(numbers, 1):\r\n black += abs(number - (i*2 - 1))\r\n white += abs(number - i*2)\r\n\r\nprint(min(black, white))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()))\r\ns1 = list(range(1, n+1,2))\r\ns2 = list(range(2, n+1,2))\r\nc1 = 0\r\nfor i in range(n//2):\r\n c1 += abs(w[i]-s1[i])\r\nc2 = 0\r\nfor i in range(n//2):\r\n c2 += abs(w[i]-s2[i])\r\nprint(min(c1, c2))", "n=int(input())\r\nlist=list(map(int,input().split()))\r\nlist.sort()\r\nb_ans=0\r\nfor i in range(n//2):\r\n b_ans+=abs(list[i]-1-i*2)\r\n# print(\"b move:\",b_ans)\r\nw_ans=0\r\nfor i in range(n//2):\r\n w_ans+=abs(list[i]-1-(i*2+1))\r\n# print(\"W move:\",w_ans)\r\nprint(min(w_ans,b_ans)) ", "n=int(input())\r\nL=list(map(int,input().split()))\r\nL.sort()\r\ns=0\r\nt=0\r\nfor i in range(0,n//2):\r\n\ts+=abs(L[i]-2*i-1)\r\n\tt+=abs(L[i]-2*i-2)\r\nprint(min(s,t))", "if __name__ == '__main__':\r\n ans1, ans2 = 0,0\r\n n = int(input())\r\n vals = input().split(' ')\r\n vals = [int(x) for x in vals]\r\n vals.sort()\r\n i = 1\r\n for k in vals:\r\n ans1 += abs(i - k)\r\n ans2 += abs(i + 1 - k)\r\n i += 2\r\n print(min(ans1,ans2))\r\n", "\r\nn = int(input())\r\n\r\nnumbers = list(map(int,input().split()))\r\nnumbers.sort()\r\n\r\nallWhite = 0\r\nallBlack = 0\r\n\r\nfor i in range (len(numbers)):\r\n allWhite += abs(numbers[i] - 2*i -1)\r\n allBlack += abs(numbers[i] - 2*i -2)\r\n\r\nprint(min(allWhite,allBlack))", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=input().split()\r\nli=[int(i)-1 for i in l]\r\nli.sort()\r\nans=0\r\nfor i in range(n//2):\r\n ans+=abs(li[i]-2*i)\r\nok=0\r\nfor i in range(n//2):\r\n ok+=abs(li[i]-2*i-1)\r\nprint(min(ok,ans))\r\n", "n = int(input())\na = list(map(int, input().split()))\na = sorted(a)\nans1 = 0\nans2 = 0\nfor i in range(n//2):\n\tans1 += abs( i*2+1 - a[i] )\n\tans2 += abs( i*2+2 - a[i] )\n\nprint(min(ans1, ans2))", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\np=0\r\nq=0\r\nfor i in range(n//2):\r\n p+=abs(2*i+1-a[i])\r\n q+=abs(2*i+2-a[i])\r\nprint(min(p,q))\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\np.sort()\r\n\r\neven = []\r\nodd = []\r\nfor i in range(1, n + 1):\r\n if i % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n\r\nodd_ans = 0\r\neven_ans = 0\r\nfor i in range(n // 2):\r\n odd_ans += abs(p[i] - odd[i])\r\n even_ans += abs(p[i] - even[i])\r\n\r\nprint(min(even_ans, odd_ans))\r\n", "\"\"\"Problem A - Chess Placing.\n\nhttp://codeforces.com/contest/985/problem/a\n\nYou are given a chessboard of size 1 × n. It is guaranteed that n is even. The\nchessboard is painted like this: \"BWBW...BW\".\n\nSome cells of the board are occupied by the chess pieces. Each cell contains\nno more than one chess piece. It is known that the total number of pieces\nequals to .\n\nIn one step you can move one of the pieces one cell to the left or to the\nright. You cannot move pieces beyond the borders of the board. You also cannot\nmove pieces to the cells that are already occupied.\n\nYour task is to place all the pieces in the cells of the same color using the\nminimum number of moves (all the pieces must occupy only the black cells or\nonly the white cells after all the moves are made).\n\nInput:\n\nThe first line of the input contains one integer n (2 ≤ n ≤ 100, n is even) —\nthe size of the chessboard.\n\nThe second line of the input contains integer numbers (1 ≤ pi ≤ n) — initial\npositions of the pieces. It is guaranteed that all the positions are distinct.\n\nOutput:\n\nPrint one integer — the minimum number of moves you have to make to place all\nthe pieces in the cells of the same color.\n\n\"\"\"\nimport logging\n\n\nfmt = '%(levelname)s - %(name)s (line:%(lineno)s) - %(message)s'\nformatter = logging.Formatter(fmt)\n\nch = logging.StreamHandler()\nch.setLevel(logging.ERROR)\nch.setFormatter(formatter)\n\nlogger = logging.getLogger('chess_placing')\nlogger.setLevel(logging.ERROR)\nlogger.addHandler(ch)\n\n\ndef solve(pos):\n pos = sorted(pos)\n return min(\n sum(abs(2 * i + 1 - pos[i]) for i in range(len(pos))),\n sum(abs(2 * i + 2 - pos[i]) for i in range(len(pos)))\n )\n\n\ndef main():\n _ = input()\n positions = [int(x) for x in input().strip().split()]\n result = solve(positions)\n print(result)\n \n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nda=0;db=0\r\nfor i in range(1,(n//2)+1):\r\n da+=abs(a[i-1]-((2*i)-1))\r\n db+=abs(a[i-1]-(2*i))\r\nprint(min(da,db))", "n = int(input())\r\np = sorted(map(int, input().split()))\r\n\r\nb = 0\r\nw = 0\r\n\r\nfor i, pi in enumerate(p):\r\n b += abs(pi - (2 * i + 1))\r\n w += abs(pi - (2 * i + 2))\r\n\r\nprint(min(b, w))\r\n", "\"\"\" 616C \"\"\"\r\n\"\"\" 1152B \"\"\"\r\nimport math\r\n# import sys\r\ndef main():\r\n\t# n ,m= map(int,input().split())\r\n\t# arr = list(map(int,input().split()))\r\n\t# b = list(map(int,input().split()))\r\n\t# n = int(input())\r\n\t# string = str(input())\r\n\tn = int(input())\r\n\ta = list(map(int,input().split()))\r\n\ta.sort()\r\n\tdiff1 = 0 \r\n\tdiff2 = 0\r\n\tstart = 1\r\n\tfor i in range(n//2):\r\n\t\tdiff1 += abs(start-a[i])\r\n\t\tstart+=2\r\n\tstart = 2\r\n\tfor i in range(n//2):\r\n\t\tdiff2 += abs(start-a[i])\r\n\t\tstart+=2\r\n\tprint(min(diff1,diff2))\r\n\treturn\r\n\r\nmain()\r\n# def test():\r\n# \tt = int(input())\r\n# \twhile t:\r\n# \t\tmain()\r\n# \t\tt-=1\r\n# test()\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\ns1,s2=0,0\r\nx=1\r\nfor i in l:\r\n s1+=abs(x-i)\r\n s2+=abs((x+1)-i)\r\n x+=2\r\nprint(min(s1,s2))", "n = int(input())\r\narr = list(map(int, input().strip().split(\" \")))\r\narr.sort(reverse=True)\r\ncount = n\r\ntotal = 0\r\ntotal1 = 0\r\nfor i in range(len(arr)):\r\n l = abs(count - arr[i])\r\n count = count - 2\r\n total = total + l\r\ncount1 = n-1\r\nfor i in range(len(arr)):\r\n l = abs(count1 - arr[i])\r\n count1 = count1 - 2\r\n total1 = total1 + l\r\nmin1 = min(total,total1)\r\nprint(min1)", "# Have duplicated \r\nn = int(input())\r\np = sorted([int(i) for i in input().split()])\r\nb = 0\r\nw = 0\r\nfor i, v in enumerate(p):\r\n b += abs(v - (2 * i + 1))\r\n w += abs(v - (2 * i + 2))\r\nprint(min(b, w))", "n=int(input())\r\nl=list(map(int,input().strip().split()))\r\nl.sort()\r\nlo=[i for i in range(1,n+1,2)]\r\nle=[i for i in range(2,n+1,2)]\r\nodd,even=0,0\r\nfor i in range(n//2):\r\n odd+=abs(lo[i]-l[i])\r\n even+=abs(le[i]-l[i])\r\nprint(min(odd,even))", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\na = sorted(a)\r\nx = 0\r\ny = 0\r\nj = 1\r\nfor i in range(n//2):\r\n x += abs(j-a[i])\r\n j += 2\r\nj = 2\r\nfor i in range(n//2):\r\n y += abs(j-a[i])\r\n j += 2\r\nprint(min(x, y))", "n = input()\r\npos = sorted([int(x) for x in input().split(\" \")])\r\n\r\nans1 = ans2 = 0\r\n\r\ni = 1\r\nfor item in pos:\r\n ans1 += abs(item - i)\r\n ans2 += abs(item - i - 1)\r\n i += 2\r\n \r\nprint(min(ans1, ans2))\r\n \r\n", "input()\nxb, xw = 1, 2\nres_b = res_w = 0\nfor p in sorted(list(map(int, input().split()))):\n\tres_b += abs(p-xb)\n\tres_w += abs(p-xw)\n\txb += 2\n\txw += 2\nprint(min(res_b, res_w))\n \t\t\t \t \t\t \t\t \t \t\t\t", "from math import *\r\nimport random, sys\r\n\r\ndef nextInt():\r\n\treturn int(input())\r\ndef nextStrs():\r\n\treturn input().split()\r\ndef nextInts():\r\n\treturn list(map(int,nextStrs()))\r\n\r\ndef main():\r\n n = nextInt()\r\n arr = nextInts()\r\n \r\n arr.sort()\r\n\r\n res = 10**9+7; cnt = 0\r\n for i in range(len(arr)):\r\n cnt += abs(arr[i]-2*(i+1))\r\n \r\n res = min(res,cnt); cnt = 0\r\n\r\n for i in range(len(arr)):\r\n cnt += abs(arr[i]-2*i-1)\r\n \r\n res = min(res,cnt)\r\n\r\n print(res)\r\n\r\nif __name__ == \"__main__\":\r\n exit(main())", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ns1,s2=0,0\r\nfor i in range(len(a)):\r\n s1+=abs(a[i]-(i*2+1))\r\n s2+=abs(a[i]-(i*2+2))\r\nprint(min(s1,s2))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nans1 = 0\r\nans2 = 0\r\nfor i in range(n//2):\r\n ans1 += abs(2*i+1-a[i])\r\n ans2 += abs(2*i+2-a[i])\r\nprint(min(ans1,ans2))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\ns1,s2 = 0,0\r\nfor i in range(n//2):\r\n s1+=abs(l[i]-(2*i+1))\r\n s2+=abs(l[i]-(2*i+2))\r\nprint(min(s1,s2))", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n a = list(map(int, input().split(' ')))\n a.sort()\n\n ans1, ans2 = 0, 0\n for i in range(n // 2):\n ans1 += abs(a[i] - (i * 2 + 1))\n ans2 += abs(a[i] - (i * 2 + 2))\n print(min(ans1, ans2))\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n \t \t \t \t\t \t\t \t \t\t\t\t\t \t", "n=int(input())\r\na=[int(j) for j in input().split()]\r\na.sort()\r\nmoves1=0\r\nmoves2=0\r\nfor i in range(n//2):\r\n\tmoves1+=abs((2*i+1)-a[i])\r\n\tmoves2+=abs((2*i+2)-a[i])\r\nif(moves2>moves1):\r\n\tprint(moves1)\r\nelse:\r\n\tprint(moves2)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nans1, ans2 = 0, 0\r\nfor i in range(len(a)):\r\n ans1 += abs(a[i] - 2 * i - 2)\r\n ans2 += abs(a[i] - 2 * i - 1)\r\nprint(min(ans1, ans2))\r\n", "n=int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\na1=0\r\na2=0\r\nfor i in range(0,int(n/2)):\r\n a1+=abs(a[i]-(i*2+1))\r\n a2+=abs(a[i]-i*2-2)\r\n\r\nprint(min(a1,a2))\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n A.sort()\r\n min_val = 10 ** 18\r\n val = 0\r\n for i in range(n // 2):\r\n val += abs(A[i] - (2*i+2))\r\n min_val = min(min_val, val)\r\n val = 0\r\n for i in range(n // 2):\r\n val += abs(A[i] - (2*i+1))\r\n min_val = min(min_val, val)\r\n print(min_val)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nm = map(int, input().split())\r\ns1, s2 = 0, 0\r\nfor i, v in enumerate(sorted(m)): \r\n s1 += abs(v - 2*i-1)\r\n s2 += abs(v - 2*i-2)\r\nprint(min(s1,s2)) ", "n = int(input()) // 2\r\nP = sorted(map(int, input().split()))\r\n\r\nprint(min(sum(abs(P[i]-2*i-1) for i in range(n)),\r\n sum(abs(P[i]-2*i-2) for i in range(n))))", "# @Chukamin ZZU_TRAIN\n\ndef main():\n n = int(input())\n cnt = n >> 1\n data = list(map(int, input().split()))\n data.sort()\n ans1 = 0\n for i in range(cnt):\n ans1 += abs(data[i] - (2 * i + 1))\n ans2 = 0\n for i in range(cnt):\n ans2 += abs(data[i] - (2 * i + 2))\n print(min(ans1, ans2))\n \nif __name__ == '__main__':\n main()\n\n \t \t\t \t\t\t \t\t \t \t\t\t\t", "# A. Chess Placing\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nm1 = 0\r\nm2 = 0\r\nfor i in range(n//2):\r\n m1 += abs(a[i]-(i*2+1))\r\n m2 += abs(a[i]-(i*2+2))\r\nprint(min(m1,m2))\r\n \r\n ", "n=int(input())\r\np=[int(x) for x in input().split()]\r\np.sort()\r\nb=0\r\nw=0\r\ni=1\r\nj=2\r\nfor x in p:\r\n b+=abs(x-i)\r\n w+=abs(x-j)\r\n i+=2\r\n j+=2\r\nprint(min(b,w))", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\ncnt1=0\r\ncnt2=0\r\nd=n\r\nfor i in range(1,n//2+1):\r\n #print(d-a[-i])\r\n cnt1+=abs(d-a[-i])\r\n cnt2+=abs(d-1-a[-i])\r\n d-=2\r\nprint(min(cnt1,cnt2))\r\n\r\n\r\n\r\n", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nk1,k2,i,a1,a2=1,2,0,0,0\r\nwhile i<len(a):\r\n if a[i]>k1:\r\n a1+=(a[i]-k1)\r\n else:\r\n a1+=(k1-a[i])\r\n if a[i]>k2:\r\n a2+=(a[i]-k2)\r\n else:\r\n a2+=(k2-a[i])\r\n i+=1\r\n k1+=2\r\n k2+=2\r\nprint(min(a1,a2))\r\n\r\n \r\n \r\n\r\n", "n, p = int(input()), list(sorted(map(int, input().split())))\r\n\r\nb = sum([abs((p[i] - 1) - i * 2) for i in range(0, n // 2)])\r\nw = sum([abs((p[i] - 1) - (i * 2 + 1)) for i in range(0, n // 2)])\r\nprint(min(b, w))\r\n", "n = int(input())\nl = [int(i) for i in input().split()]\nl.sort()\n\ndef f(r):\n i = 0\n d = 0\n for j in r:\n d += abs(j - l[i])\n i += 1\n return d\n\nprint(min(f(range(1, n+1, 2)), f(range(2, n+1, 2))))\n\n", "n = int(input())\r\npp = list(map(int, input().split()))\r\npp = sorted(pp)\r\n\r\nans = 10000\r\nfor x in range(1, 3):\r\n cnt = 0\r\n for i in range(0, int(n/2)):\r\n p = pp[i]\r\n q = x + i * 2\r\n cnt += abs(p - q)\r\n\r\n ans = min(ans, cnt)\r\nprint(ans)\r\n", "n=int(input())\r\nx=int(n/2)\r\na=[1]*x\r\n#for i in range(x):\r\n #a[i]=int(input())\r\na = [int(a) for a in input().split()]\r\na.sort()\r\n\r\nwhite=0\r\nblack=0\r\nposition=1\r\ni=0\r\nwhile i<x:\r\n black=black+abs(a[i]-position)\r\n i=i+1\r\n position+=2\r\ni=0\r\nposition=2\r\nwhile i<x:\r\n white=white+abs(a[i]-position)\r\n i=i+1\r\n position+=2\r\nif white<=black:\r\n print(white)\r\nelse:\r\n print(black)", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nvar1=2\r\nsu=0\r\nfor i in range(n//2):\r\n su+=abs(var1-arr[i])\r\n var1+=2\r\ns=0\r\nvar=1\r\nfor i in range(n//2):\r\n s+=abs(var-arr[i])\r\n var+=2\r\nprint(min(s,su))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nb = sum([abs(a[i]-x) for i,x in enumerate(range(1,n,2))])\r\nc = sum([abs(a[i]-x) for i,x in enumerate(range(2,n+1,2))])\r\nprint(min(b,c))", "import sys\r\nreadline = sys.stdin.readline\r\n\r\nN = int(readline())\r\nP = list(map(lambda x: int(x) - 1, readline().split()))\r\nP.sort()\r\ninf = 10**18\r\nres = inf\r\n\r\nfor geta in range(2):\r\n cnt = 0\r\n for i in range(N//2):\r\n cnt += abs(P[i] - (2*i+geta))\r\n res = min(res, cnt)\r\nprint(res)", "t = int(input())\nli = [int(x) for x in input().split()]\nli.sort()\nodd = 0\neven = 0\noddLi = [x for x in range(1,t+1,2)]\nevenLi = [x for x in range(2,t+1,2)]\nfor i in range(t//2):\n odd += abs(li[i]-oddLi[i])\n even += abs(li[i]-evenLi[i])\nprint(min(odd,even))", "n = int(input())\nm = n - 1\npos = reversed(sorted(map(int,input().split())))\nodd = 0;even = 0\nfor p in pos:\n even+=abs(n-p)\n n-=2\n odd+=abs(m-p)\n m-=2\nprint (min(odd,even))\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nresodd = 0\r\nreseven = 0\r\nn = int(n/2)\r\nfor i in range(n):\r\n\tresodd += abs(i * 2 + 1 - a[i])\r\n\treseven += abs(i * 2 + 2 - a[i])\r\nprint(min(resodd, reseven))", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nind = 1\r\nv1, v2 = 0, 0\r\nfor i in range(len(a)):\r\n v1 += abs(a[i] - ind)\r\n ind += 2\r\n\r\nind = 2\r\nfor i in range(len(a)):\r\n v2 += abs(a[i] - ind)\r\n ind += 2\r\n\r\nprint(min(v1, v2))\n# Mon Jan 04 2021 15:53:12 GMT+0300 (Москва, стандартное время)\n", "while True:\r\n\ttry:\r\n\t\tdef solution(n):\r\n\t\t\ta = list(map(int, input().split()))\r\n\t\t\ta.sort()\r\n\t\t\te = [i for i in range(1,n,2)]\r\n\t\t\to = [i for i in range(2,n+1, 2)]\r\n\t\t\tans = 0\r\n\t\t\tfor i in range(n//2):\r\n\t\t\t\tans += abs(e[i]-a[i])\r\n\t\t\tanst = 0\r\n\t\t\tfor i in range(n//2):\r\n\t\t\t\tanst += abs(o[i]-a[i])\r\n\t\t\tprint(min(ans, anst))\r\n\t\t\t\r\n\t\t\t\r\n\t\tdef read():\r\n\t\t\tn = int(input())\r\n\t\t\tsolution(n)\r\n\t\t\t\r\n\t\tif __name__ == \"__main__\":\r\n\t\t\tread()\r\n\texcept EOFError:\r\n\t\tbreak", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nmas.sort()\r\nk = 0\r\nj = 0\r\ndelta = 1\r\nfor i in range(n//2):\r\n k += abs(mas[i] - delta)\r\n delta += 2\r\ndelta = 2\r\nfor i in range(n//2):\r\n j += abs(mas[i] - delta)\r\n delta += 2\r\nprint(min(j, k))", "n = int(input())\r\nchess = list(map(int, input().split()))\r\n\r\nmove1 = 0\r\nmove2 = 0\r\n\r\nchess.sort()\r\n\r\nfor i in range(len(chess)):\r\n move1 += abs(chess[i] - (i * 2 + 1))\r\n move2 += abs(chess[i] - (i * 2 + 2))\r\n\r\nprint(min(move1, move2))", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\neven=0\r\nfor i in range(len(arr)):\r\n even+=abs((i+1)*2-arr[i])\r\nodd=0\r\nfor i in range(len(arr)):\r\n odd+=abs((i+1)*2-1-arr[i])\r\nprint(min(even,odd))", "count = int(input())\r\narray = list(map(int, input().split()))\r\nn = 0\r\nfor elem in array:\r\n if elem % 2 == 0:\r\n n +=1\r\ncount1 = count // 2\r\narray1 = list()\r\narray2 = list()\r\ns1 = 0\r\ns2 = 0\r\nfor elem in range(count):\r\n if (elem + 1) in array:\r\n for elem1 in range(count):\r\n if (not (elem1 + 1 in array1)) and (elem1 % 2 == 0):\r\n array1.append(elem1 + 1)\r\n s1 = s1 + abs(elem1 - elem)\r\n break\r\n for elem1 in range(count):\r\n if (not (elem1 + 1 in array2)) and (elem1 % 2 == 1):\r\n array2.append(elem1 + 1)\r\n s2 = s2 + abs(elem1 - elem)\r\n break\r\nprint(min(s1, s2))", "# https://codeforces.com/problemset/problem/985/A\r\n# Chess Placing\r\n\r\nn = int(input())\r\nps = list(map(int, input().split()))\r\nps.sort()\r\nodd_cost = 0\r\neven_cost = 0\r\nfor i in range(n//2):\r\n odd_cost += abs(2*i+1 - ps[i])\r\n even_cost += abs(2*i+2 - ps[i])\r\nprint(min(odd_cost, even_cost))", "from bisect import bisect_left, bisect_right\r\n\r\ndef tuple_input(type):\r\n return map(type, input().strip().split())\r\n\r\nn = int(input())\r\np = list(tuple_input(int))\r\np.sort()\r\np = list(map(lambda x : x - 1, p))\r\n\r\nt = [2 * i for i in range(n // 2)]\r\nblack = 0\r\nfor i in range(n // 2):\r\n black += abs(p[i] - t[i])\r\nt = list(map(lambda x : x + 1, t))\r\nwhite = 0\r\nfor i in range(n // 2):\r\n white += abs(p[i] - t[i])\r\nprint(min(black, white))\r\n\r\n ", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n| created: 29.05.2018 15:59 |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n# inp = open(\"input.txt\", \"r\"); input = inp.readline; out = open(\"output.txt\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n ch = 0\r\n nch = 0\r\n l = list(sorted(l))\r\n for i in range(n//2):\r\n ch += abs(l[-i-1]-(n-2*i))\r\n nch += abs(l[-i-1]-(n-1-2*i))\r\n print(min(ch,nch))\r\n\r\n\r\n# ===========================================\r\nwhile TN != 0:\r\n solution()\r\n TN -= 1\r\n# ===========================================\r\n# inp.close()\r\n# out.close()\r\n", "n = int(input())\nl = sorted(map(int, input().split()))\nprint(min(sum(abs(i - x) for i, x in zip(range(s, n + 1, 2), l)) for s in (1, 2)))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed May 23 05:54:15 2018\r\n\r\n@author: Arsanuos\r\n\"\"\"\r\n\r\ndef main():\r\n n = int(input())\r\n arr = [int(t) for t in input().split()]\r\n arr = sorted(arr)\r\n val = 1\r\n step = 2\r\n cnt1 = 0\r\n for item in arr:\r\n if item != val:\r\n cnt1 += abs(item - val)\r\n val += step\r\n \r\n val = 2\r\n cnt2 = 0\r\n for item in arr:\r\n if item != val:\r\n cnt2 += abs(item - val)\r\n val += step\r\n \r\n print(min(cnt1, cnt2))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\np=sorted(map(int,input().split()))\nprint(min(sum(abs(x-i)for x,i in zip(p,range(s,n+1,2)))for s in(1,2)))\n\n\t \t\t \t \t\t\t\t \t\t\t \t\t \t \t\t\t" ]

[ "a, b, f, k = map(int, input().split())\r\n\r\ndef main():\r\n if(b < f):\r\n return -1;\r\n if(b < a - f):\r\n return -1;\r\n if(k == 1):\r\n if(b >= a):\r\n return 0\r\n else:\r\n return 1\r\n count = 0\r\n x = b\r\n to = True\r\n for i in range(k-1):\r\n if(to):\r\n if(x >= 2*a - f):\r\n x = x - a\r\n else:\r\n if(x >= f):\r\n x = b - a + f\r\n count += 1\r\n else:\r\n return -1\r\n to = False;\r\n else:\r\n if(x >= a + f):\r\n x -= a\r\n else:\r\n if(x >= a-f):\r\n x = b - f\r\n count += 1\r\n else:\r\n return -1\r\n to = True;\r\n if(to):\r\n if(x < f):\r\n return -1\r\n else:\r\n if(x < a - f):\r\n return -1\r\n if(x < a):\r\n count += 1\r\n return count\r\n\r\nprint(main())\r\n", "a, b, f, k = [int(x) for x in input().split()]\r\n\r\ncurpos = 0\r\npossible = True\r\ngas = b\r\nrefuelCount = 0\r\n\r\ndef dis(a, b):\r\n return abs(a-b)\r\n\r\nwhile k>0:\r\n if dis(curpos, f) > gas:\r\n possible = False\r\n break\r\n \r\n dis_to_edge = dis(f, 0) if curpos==a else dis(f, a)\r\n\r\n if k>1 and dis(curpos, f) + dis_to_edge*2 > gas:\r\n # move to fuel and take gas\r\n gas -= dis(curpos, f) # cost to reach f\r\n # curpos = f # at 'f' now\r\n if gas<0:\r\n possible = False\r\n break\r\n gas = b # refueling tank\r\n refuelCount += 1\r\n\r\n # now move to an edge\r\n gas -= dis_to_edge\r\n if gas<0:\r\n possible = False\r\n break\r\n curpos = a - curpos\r\n elif k>1:\r\n # just move. no take fuel\r\n curpos = a - curpos\r\n gas -= a\r\n if gas<0:\r\n possible = False\r\n break\r\n else:\r\n # last trip\r\n if gas >= a:\r\n curpos = a - curpos\r\n gas -= a\r\n elif dis(curpos, f) <= gas:\r\n refuelCount += 1\r\n curpos = a - curpos\r\n gas = b\r\n gas -= dis(curpos, f)\r\n if gas < 0:\r\n possible = False\r\n break\r\n else:\r\n possible = False\r\n break\r\n\r\n \r\n # print(6-curpos, \"->\", curpos, gas, refuelCount)\r\n\r\n if curpos == 0 or curpos == a:\r\n k -= 1\r\n \r\nif possible:\r\n print(refuelCount)\r\nelse:\r\n print(-1)", "a, b, f, k = map(int, input().split())\r\ns, t = 0, b - f\r\ng = f = a - f\r\nfor i in range(k):\r\n if t < 0: break\r\n if k - 1 - i: g += f\r\n if t < g: s, t = s + 1, b\r\n t -= g\r\n g = f = a - f\r\nprint(-1 if t < 0 else s)\r\n", "a, b, f, k=map(int,input().split())\r\nd=b\r\nn=0\r\ns=0\r\nx=a-f\r\nd -= f\r\nif (x*2>b) or (f*2>b):\r\n if k<3:\r\n if k==1:\r\n if a<=b:\r\n print(0)\r\n elif (f<=b) and (x<=b):\r\n print(1)\r\n else:\r\n print(-1)\r\n if k==2:\r\n if a+x<=b:\r\n print(1)\r\n elif (f<=b) and (x*2<=b):\r\n print(2)\r\n else:\r\n print(-1)\r\n else:\r\n print(-1)\r\nelse:\r\n while n<k:\r\n if (n+1==k):\r\n if (d<x):\r\n s+=1\r\n break\r\n if d<x*2:\r\n s+=1\r\n d=b\r\n n+=1\r\n d-=x*2\r\n if (n+1==k):\r\n if (d<f):\r\n s+=1\r\n break\r\n if d<f*2:\r\n s+=1\r\n d=b\r\n n+=1\r\n d-=f*2\r\n print(s)\r\n", "a, b, f, k = map(int, input().split())\r\nc, v = b, 0\r\ndef t(d):\r\n global c, v\r\n if c < d:\r\n c, v = b, v + 1\r\n if c < d:\r\n print(-1)\r\n exit()\r\n c -= d\r\nt(f)\r\nfor i in range(k - 1):\r\n t(2 * f if i % 2 else 2 * (a - f))\r\nt(a - f if k % 2 else f)\r\nprint(v)", "a, b, f, k = map(int, input().split())\r\n \r\nfuel = b\r\nres = 0\r\n \r\nfor i in range(k):\r\n fuel -= f\r\n #print(fuel)\r\n if fuel < 0:\r\n print(-1)\r\n exit(0)\r\n if i == k - 1:\r\n if a - f > fuel:\r\n fuel = b\r\n res += 1\r\n fuel -= a - f\r\n break\r\n if (a - f) * 2 > fuel:\r\n fuel = b\r\n res += 1\r\n fuel -= a - f\r\n f = a - f\r\n #print(res)\r\nif fuel < 0:\r\n print(-1)\r\n exit(0)\r\nprint(res)\r\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nfrom queue import Queue\r\na,b,f,k = map(int,input().split())\r\nx = a-f\r\nlst = [2*x,2*f]*(k//2)\r\nlst = [f] + lst\r\nif k%2!=0:\r\n lst += [x]\r\nelse:\r\n lst[-1] -= f\r\nans = 0\r\nfuel = b-f\r\nif fuel >= 0:\r\n count = 0\r\n ans = 0\r\n y = 1\r\n while y < len(lst):\r\n if fuel < lst[y]:\r\n if fuel == b:\r\n ans = -1\r\n break\r\n else:\r\n fuel = b\r\n ans += 1\r\n else:\r\n fuel -= lst[y]\r\n y += 1\r\n print(ans)\r\nelse:\r\n print(-1)", "def impossible():\n\tprint(-1)\n\texit()\ndest, cap, station, journey = map(int, input().strip().split())\nleft, right = 2 * station, 2*(dest-station)\n\nif journey == 1 and (cap < station or cap < dest-station):\n\timpossible()\nif journey == 2 and (cap < station or cap < right):\n\timpossible()\nif journey >= 3 and (cap < left or cap < right):\n\timpossible()\n\ntime= 0\nconsume = station\nfor i in range(journey-1):\n\tgo = left if (i&1) else right\n\tif consume + go > cap:\n\t\ttime += 1\n\t\tconsume = go\n\telse:\n\t\tconsume += go\nif ((journey & 1) == 0 and consume + station > cap) or ((journey & 1) and (consume + dest - station > cap)):\n\tprint(time+1)\nelse:\n\tprint(time)\n", "a, b, f, k = map(int, input().split())\r\ncurr, res = b, 0\r\nfor i in range(k):\r\n prev = curr\r\n curr -= a\r\n if i % 2 == 0:\r\n if curr < a-f and i < k-1 or curr < 0:\r\n curr = b - a + f\r\n res += 1\r\n if curr < a-f and i < k-1 or curr < 0 or prev < f:\r\n print(-1)\r\n exit()\r\n else:\r\n if curr < f and i < k-1 or curr < 0:\r\n curr = b - f\r\n res += 1\r\n if curr < f and i < k-1 or curr < 0 or prev < a-f:\r\n print(-1)\r\n exit()\r\nprint(res)\r\n", "\nimport sys\nimport os\nimport math\nimport re\n\n\na,b,f,k = map(int,input().split())\n\nfuel = b\ntrips = 0\nfirst = f\nsecond = a -f\nfor i in range(k):\n fuel -= first\n if fuel < 0:\n print(-1)\n exit(0)\n if i == k-1:\n if fuel < second:\n fuel = b\n trips += 1\n else:\n if fuel < 2*second:\n fuel = b\n trips += 1\n\n fuel -= second\n if fuel < 0:\n print(-1)\n exit(0)\n temp = first\n first = second\n second = temp\n\nprint(trips)\n", "def solve(a, b, f, k):\r\n origb = b\r\n disa = 2*f\r\n disb = 2*(a-f)\r\n trava = False\r\n counter = 0\r\n\r\n b -= disa/2\r\n if b < 0:\r\n return -1\r\n\r\n while k > 0:\r\n if trava:\r\n trava = False\r\n if k == 1:\r\n disa = disa / 2\r\n if disa > b:\r\n counter += 1\r\n b = origb -disa\r\n if b < 0:\r\n return -1\r\n k -= 1\r\n else:\r\n b -= disa\r\n if b < 0:\r\n return -1\r\n k -= 1\r\n else:\r\n trava = True\r\n if k == 1:\r\n disb= disb/2\r\n if disb > b:\r\n counter += 1\r\n b = origb - disb\r\n if b < 0:\r\n return -1\r\n k -= 1\r\n else:\r\n b -= disb\r\n if b < 0:\r\n return -1\r\n k -= 1\r\n return counter\r\ninputs = input(\"\")\r\nafind = inputs.find(\" \")\r\na = int(inputs[0:afind])\r\ninputs = inputs[afind+1:]\r\n\r\nafind = inputs.find(\" \")\r\nb = int(inputs[0:afind])\r\ninputs = inputs[afind+1:]\r\n\r\nafind = inputs.find(\" \")\r\nf = int(inputs[0:afind])\r\ninputs = inputs[afind+1:]\r\n\r\nk = int(inputs[0:])\r\nprint(solve(a, b, f, k))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, f, k = map(int, input().split())\r\nx = []\r\nx.append(f)\r\nu, v = 2 * f, 2 * (a - f)\r\nfor i in range(k - 1):\r\n if i % 2:\r\n x.append(u)\r\n else:\r\n x.append(v)\r\nif k % 2:\r\n x.append(a - f)\r\nelse:\r\n x.append(f)\r\nif max(x) > b:\r\n ans = -1\r\nelse:\r\n ans, now = 0, b\r\n for i in x:\r\n if now - i < 0:\r\n now = b\r\n ans += 1\r\n now -= i\r\nprint(ans)", "# import sys\r\n# sys.stdin = open('in.txt')\r\n\r\ndef can_make_route():\r\n can_return_to_station = bus['gasoline'] - (abs(bus['position'] - bus['direction']) + abs(bus['direction'] - station)) >= 0\r\n is_last_route = (bus['qty_routs'] + 1 == cnt_routes) and (bus['gasoline'] - abs(bus['position'] - bus['direction']) >= 0)\r\n return can_return_to_station or is_last_route\r\n\r\ndef make_route():\r\n bus['gasoline'] = bus['gasoline'] - abs(bus['position'] - bus['direction'])\r\n bus['position'] = bus['direction']\r\n bus['direction'] = start if bus['direction'] == end else end\r\n bus['qty_routs'] += 1\r\n\r\ndef goto_station():\r\n bus['gasoline'] = max_gasoline\r\n bus['position'] = station\r\n\r\ndef is_input_correct():\r\n return max_gasoline - station >= 0\r\n\r\nend, max_gasoline, station, cnt_routes = map(int, input().split())\r\n\r\nstart, res = 0, 0\r\nbus = {\r\n 'position': start,\r\n 'gasoline': max_gasoline,\r\n 'direction': end,\r\n 'qty_routs': 0\r\n}\r\n\r\nif is_input_correct():\r\n while bus['qty_routs'] != cnt_routes:\r\n if can_make_route():\r\n make_route()\r\n elif bus['position'] == station:\r\n res = -1\r\n break\r\n else:\r\n goto_station()\r\n res += 1\r\nelse:\r\n res = -1\r\nprint(res)", "def calculate_minimal_refueling(obj_pos, fuel_capacity, gas_station_pos, trip_required):\r\n # current_fuel = fuel_capacity - gas_station_pos\r\n # if current_fuel < 0 or \\\r\n # fuel_capacity - 2 * (obj_pos - gas_station_pos) < 0 or \\\r\n # fuel_capacity - 2 * gas_station_pos < 0:\r\n # if trip_required == 0:\r\n # return 0\r\n # elif trip_required == 1:\r\n # if fuel_capacity >= gas_station_pos:\r\n # return 0\r\n # elif fuel_capacity - gas_station_pos < 0 or fuel_capacity - (obj_pos - gas_station_pos) < 0:\r\n # return -1\r\n # else:\r\n # return 1\r\n # return -1\r\n # refueling_count = 0\r\n # print(\"gas on start:\", current_fuel)\r\n # for _ in range(trip_required // 2):\r\n # # direct direction\r\n # print(\"gf<->o,\", current_fuel, '->', current_fuel - 2 * (obj_pos - gas_station_pos))\r\n # current_fuel -= 2 * (obj_pos - gas_station_pos)\r\n # if current_fuel < 0:\r\n # refueling_count += 1\r\n # current_fuel = fuel_capacity - 2 * (obj_pos - gas_station_pos)\r\n # print(\"refueled,\", current_fuel)\r\n # # backward direction\r\n # print(\"home<->gf,\", current_fuel, '->', current_fuel - 2 * gas_station_pos)\r\n # current_fuel -= 2 * gas_station_pos\r\n # if current_fuel < 0:\r\n # refueling_count += 1\r\n # current_fuel = fuel_capacity - 2 * gas_station_pos\r\n # print(\"refueled,\", current_fuel)\r\n # if trip_required % 2 != 0 and current_fuel - (obj_pos - gas_station_pos) - obj_pos < 0:\r\n # refueling_count += 1\r\n # print(\"refueled at the end\")\r\n # return refueling_count\r\n direction = True\r\n current_gas = fuel_capacity\r\n refuel_count = 0\r\n for trip in range(trip_required):\r\n if direction:\r\n current_gas -= gas_station_pos\r\n if current_gas < 0:\r\n return -1\r\n elif (trip + 1 != trip_required and current_gas < 2 * (obj_pos - gas_station_pos)) or \\\r\n current_gas < obj_pos - gas_station_pos:\r\n current_gas = fuel_capacity\r\n refuel_count += 1\r\n current_gas -= obj_pos - gas_station_pos\r\n if current_gas < 0:\r\n return -1\r\n direction = False\r\n else:\r\n current_gas -= obj_pos - gas_station_pos\r\n if current_gas < 0:\r\n return -1\r\n elif (trip + 1 != trip_required and current_gas < 2 * gas_station_pos) or \\\r\n current_gas < gas_station_pos:\r\n current_gas = fuel_capacity\r\n refuel_count += 1\r\n current_gas -= gas_station_pos\r\n if current_gas < 0:\r\n return -1\r\n direction = True\r\n return refuel_count\r\n\r\n\r\ndef main():\r\n a, b, f, k = map(int, input().split())\r\n print(calculate_minimal_refueling(a, b, f, k))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b, f, k = tuple(map(int, input().split()))\r\n\r\nd1 = f - 0\r\nd2 = a - f\r\n\r\ndef sim():\r\n x = b\r\n c = 0\r\n for i in range(1, k + 1, 2):\r\n if x < d1:\r\n return -1\r\n x -= d1\r\n \r\n if x < d2 or (i < k and x < 2 * d2):\r\n x = b\r\n c += 1\r\n \r\n if x < d2:\r\n return-1\r\n x -= d2\r\n\r\n if i == k:\r\n break\r\n\r\n if x < d2:\r\n return -1\r\n x -= d2\r\n \r\n if x < d1 or (i + 1 < k and x < 2 * d1):\r\n x = b\r\n c += 1\r\n\r\n if x < d1:\r\n return -1\r\n x -= d1\r\n \r\n return c\r\n\r\nprint(sim())\r\n", "a, b, f, k = map(int, input().split())\r\ncounter = 0\r\nb2 = b-f\r\nif (b2 >= 0):\r\n dist2 = (a-f)*2\r\n for i in range (k):\r\n if (i == k-1):\r\n dist2 /= 2\r\n if (b2 < dist2):\r\n b2 = b\r\n counter += 1\r\n b2 -= dist2\r\n if (b2 < 0):\r\n counter = (-1)\r\n break\r\n dist2 = 2*a - dist2\r\n\r\n print (counter)\r\nelse:\r\n print (-1)\r\n", "import sys\r\n\r\na, b, f, k = map(int, input().split())\r\n\r\n\r\ndef game_over():\r\n print(-1)\r\n sys.exit()\r\n\r\n\r\nfuel = b\r\nadd_fuel_count = 0\r\ndistance_to_stop = f\r\nfuel_on_next_stop = fuel - distance_to_stop\r\nif fuel_on_next_stop < 0:\r\n game_over()\r\n\r\nfor i in range(1, k + 1):\r\n fuel = fuel_on_next_stop\r\n # calculate distance\r\n if i == k:\r\n if i % 2:\r\n distance_to_stop = a - f\r\n else:\r\n distance_to_stop = f\r\n else:\r\n if i % 2:\r\n distance_to_stop = 2 * (a - f)\r\n else:\r\n distance_to_stop = 2 * f\r\n # calculate fuel\r\n if fuel < distance_to_stop:\r\n fuel, add_fuel_count = b, add_fuel_count + 1\r\n fuel_on_next_stop = fuel - distance_to_stop\r\n if fuel_on_next_stop < 0:\r\n game_over()\r\n\r\nprint(add_fuel_count)\r\n", "a, b, f, k = list(map(int, input().split()))\n\nt = b\nans = 0\n\ndef go(dist):\n global ans, t\n if dist > b:\n print(-1)\n exit()\n\n if t < dist:\n t = b\n ans += 1\n\n t -= dist\n\ngo(f)\nfw = True\nfor _ in range(k-1):\n go(2* (a-f if fw else f))\n fw = not fw\ngo(a-f if fw else f)\nprint(ans)\n\n", "import sys\r\n\r\nDEBUG = False\r\na, b, f, k = map(int, input().split())\r\n\r\n\r\ndef game_over():\r\n print(-1)\r\n sys.exit()\r\n\r\n\r\nfuel = b\r\nadd_fuel_count = 0\r\nfuel_on_next_stop = fuel - f\r\nif fuel_on_next_stop < 0:\r\n game_over()\r\ndistance = 0\r\n\r\nfor i in range(1, k + 1):\r\n fuel = fuel_on_next_stop\r\n\r\n if DEBUG:\r\n print(\"i= {} : \".format(i))\r\n print(\"\\t fuel_on_station = {} \".format(fuel))\r\n\r\n # calculate distance\r\n if i == k:\r\n if i % 2:\r\n distance = a - f\r\n else:\r\n distance = f\r\n else:\r\n if i % 2:\r\n distance = 2 * (a - f)\r\n else:\r\n distance = 2 * f\r\n # calculate fuel\r\n if fuel < distance:\r\n fuel, add_fuel_count = b, add_fuel_count + 1\r\n fuel_on_next_stop = fuel - distance\r\n if fuel_on_next_stop < 0:\r\n game_over()\r\n\r\n if DEBUG:\r\n # init distance\r\n print(\"\\t distance = {} \".format(distance))\r\n print(\"\\t fuel_on_next_stop = {} \".format(fuel_on_next_stop))\r\n if fuel == b:\r\n print(\"\\t YES\")\r\n\r\nprint(add_fuel_count)\r\n", "l=[int(x) for x in input().split()]\r\na=[]\r\nb=l[1]\r\nf=0\r\nc=0\r\n \r\na.append(0)\r\n \r\nfor i in range(l[3]):\r\n if(i%2==0):\r\n a.append(i*l[0]+l[2])\r\n else:\r\n a.append((i+1)*l[0]-l[2])\r\na.append(l[0]*l[3])\r\n \r\nfor j in range(1,l[3]+2):\r\n \r\n if(b>=(a[j]-a[j-1])):\r\n b=b-a[j]\r\n b=b+a[j-1]\r\n \r\n else:\r\n \r\n b=l[1]\r\n if(b>=a[j]-a[j-1]):\r\n f=f+1\r\n b=b-(a[j]-a[j-1])\r\n else:\r\n c=-1 \r\n break\r\nif(c==-1):\r\n print(c)\r\nelse:\r\n print(f)", "init = list(map(int, input().split()))\nfinalPoint = init[0]\nfuelCapacity = init[1]\nrefuelPoint = init[2]\nvoyageCount = init[3]\n\ncurrentVoyageCount = 0\ncurrentFuelCapacity = fuelCapacity\ncurrentPosition = 0\n\nrefuelCount = 0\nisEnd = False\nerror = False\nstepSide = 1 #right\n\ndef isHaveToRefuel():\n global currentFuelCapacity\n global refuelCount\n if currentVoyageCount + 1 == voyageCount:\n if stepSide == 1:\n if currentFuelCapacity >= (finalPoint - refuelPoint):\n return\n else:\n currentFuelCapacity = fuelCapacity\n refuelCount += 1\n else:\n if currentFuelCapacity >= (refuelPoint - 0):\n return\n else:\n currentFuelCapacity = fuelCapacity\n refuelCount += 1\n else:\n if stepSide == 1:\n if currentFuelCapacity >= (finalPoint - refuelPoint) * 2:\n return\n else:\n currentFuelCapacity = fuelCapacity\n refuelCount += 1\n else:\n if currentFuelCapacity >= (refuelPoint - 0) * 2:\n return\n else:\n currentFuelCapacity = fuelCapacity\n refuelCount += 1\n\n\ndef makeStep():\n global currentPosition\n global currentFuelCapacity\n global error\n\n if currentPosition == refuelPoint:\n isHaveToRefuel()\n if stepSide == 1:\n currentFuelCapacity = currentFuelCapacity - (finalPoint - refuelPoint)\n currentPosition = finalPoint\n else:\n currentFuelCapacity = currentFuelCapacity - (refuelPoint - 0)\n currentPosition = 0\n else:\n if stepSide == 1:\n currentFuelCapacity = currentFuelCapacity - (refuelPoint - 0)\n currentPosition = refuelPoint\n else:\n currentFuelCapacity = currentFuelCapacity - (finalPoint - refuelPoint)\n currentPosition = refuelPoint\n if currentFuelCapacity < 0:\n error = True\n\n\n\nwhile currentVoyageCount < voyageCount:\n makeStep()\n if error == True:\n isEnd = False\n break\n\n if currentPosition == 0 or currentPosition == finalPoint:\n currentVoyageCount += 1\n\n if currentPosition == 0:\n stepSide = 1\n elif currentPosition == finalPoint:\n stepSide = -1\n\nif currentVoyageCount == voyageCount:\n isEnd = True\n\nif isEnd == True:\n print(refuelCount)\nelse:\n print(\"-1\")", "a,b,f,k=map(int,input().split())\r\nreq=0\r\nlive_fuel=b\r\n\r\nwhile(k>0):\r\n live_fuel-=f\r\n # print(live_fuel)\r\n k-=1\r\n if(live_fuel<0):\r\n \treq=-1\r\n \tbreak\r\n else:\r\n \tif(live_fuel>=2*(a-f) or (k==0 and live_fuel>=a-f)):\r\n \t\tlive_fuel-=(a-f)\r\n \telse:\r\n \t\tlive_fuel=b\r\n \t\treq+=1\r\n \t\tlive_fuel-=(a-f)\r\n \t# print(req,live_fuel)\r\n \tif(live_fuel<0):\r\n \t\treq=-1\r\n \t\tbreak\r\n \telse:\r\n \t\tif(k<=0):\r\n \t\t\tbreak\r\n \t\t# print(\"d\")\r\n \t\tk-=1\r\n\r\n \t\tlive_fuel-=(a-f)\r\n \t\t# print(live_fuel)\r\n \t\tif(live_fuel<0):\r\n \t\t\treq=-1\r\n \t\t\tbreak\r\n \t\telse:\r\n \t\t\tif(live_fuel>=2*f or (k==0 and live_fuel>=f)):\r\n \t\t\t\tlive_fuel-=f\r\n \t\t\telse:\r\n \t\t\t\tlive_fuel=b-f\r\n \t\t\t\treq+=1\r\n \t\t\tif(live_fuel<0):\r\n \t\t\t\treq=-1\r\n \t\t\t\tbreak\r\n \t# print(req,live_fuel)\r\n\r\nprint(req)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 2 13:40:41 2017\r\n\r\n@author: BAB\r\n\"\"\"\r\n\r\n\r\na, b, f, k = list(map(int,input().split(' ')))\r\n\r\nfuel_level = b\r\npoint = 0\r\ndirection = 1 #1 - right, -1 - left\r\njournays = 0\r\nimpossible = 0\r\nrefuel_counter = 0\r\nif k==1 and (b<a-f or b<f):\r\n print(-1)\r\nelif k==2 and (b<f or b<2*(a-f)):\r\n print(-1)\r\nelif k>2 and (b<2*f or b<2*(a-f)):\r\n print(-1)\r\nelse:\r\n while journays < k:\r\n if point == 0 and direction == 1:\r\n fuel_level -= f\r\n point = f\r\n elif point == f and direction == 1:\r\n if (fuel_level < 2*(a-f) and journays < k-1) or (fuel_level < (a-f) and journays == k-1):\r\n refuel_counter += 1\r\n fuel_level = b-(a-f)\r\n journays += 1\r\n direction = -1\r\n point = a\r\n else:\r\n fuel_level -= (a-f)\r\n journays += 1\r\n direction = -1\r\n point = a\r\n elif point == a and direction == -1:\r\n fuel_level -= a-f\r\n point = f\r\n elif point == f and direction == -1:\r\n if (fuel_level < 2*f and journays < k-1) or (fuel_level < f and journays == k-1):\r\n refuel_counter += 1\r\n fuel_level = b-f\r\n journays += 1\r\n direction = 1\r\n point = 0\r\n else:\r\n fuel_level -= f\r\n journays += 1\r\n direction = 1\r\n point = 0\r\n print(refuel_counter)\r\n \r\n", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\n\r\na,b,f,k = map(int,stdin.readline().split())\r\n\r\ncan = b\r\n\r\nL = f\r\nR = a-f\r\n\r\nans = 0\r\nfor lp in range(k):\r\n\r\n if lp % 2 == 0:\r\n\r\n #first\r\n can -= L\r\n if can < 0:\r\n print (-1)\r\n sys.exit()\r\n\r\n #gas L->R\r\n if lp != k-1:\r\n if can < 2*R:\r\n can = b\r\n ans += 1\r\n else:\r\n if can < R:\r\n can = b\r\n ans += 1\r\n \r\n\r\n can -= R\r\n if can < 0:\r\n print (-1)\r\n sys.exit()\r\n\r\n else:\r\n can -= R\r\n if can < 0:\r\n print (-1)\r\n sys.exit()\r\n \r\n\r\n #gas R->L\r\n if lp != k-1:\r\n if can < 2*L:\r\n can = b\r\n ans += 1\r\n else:\r\n if can < L:\r\n can = b\r\n ans += 1\r\n\r\n can -= L\r\n if can < 0:\r\n print (-1)\r\n sys.exit()\r\n\r\nprint (ans)\r\n\r\n \r\n \r\n \r\n", "import sys\r\na, b, f, k = map(int, input().split())\r\nl1 = 2 * (a-f)\r\nl2 = 2 * f\r\nt = b\r\ncnt = 0\r\nr = True\r\nif t >= f:\r\n t -= f\r\n for i in range(k-1):\r\n if r:\r\n if t >= l1:\r\n t -= l1\r\n r = False\r\n elif b >= l1:\r\n cnt += 1\r\n t = b - l1\r\n r = False\r\n else:\r\n print(-1)\r\n sys.exit()\r\n else:\r\n if t >= l2:\r\n t -= l2\r\n r = True\r\n elif b >= l2:\r\n cnt += 1\r\n t = b - l2\r\n r = True\r\n else:\r\n print(-1)\r\n sys.exit()\r\n if k % 2 == 1:\r\n if t >= a-f:\r\n print(cnt)\r\n elif b >= a-f:\r\n print(cnt+1)\r\n else:\r\n print(-1)\r\n else:\r\n if t >= f:\r\n print(cnt)\r\n elif b >= f:\r\n print(cnt+1)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)\r\n", "import sys\r\n\r\nabfk = list(map(int,input().split()))\r\n\r\nfaf = 2*(abfk[0]-abfk[2])\r\nf0f = 2*abfk[2]\r\n\r\nif abfk[1]<abfk[2]:\r\n print(-1)\r\n exit()\r\n\r\ngas = abfk[1]-abfk[2]\r\nj = 0\r\ngases = 0\r\nforward = True\r\n\r\nwhile j<abfk[3]-1:\r\n if(forward):\r\n if faf>gas:\r\n gas = abfk[1]\r\n gases += 1\r\n if faf>gas:\r\n print(-1)\r\n exit()\r\n forward = False\r\n gas -= faf\r\n j+=1\r\n \r\n else:\r\n if f0f>gas:\r\n gas = abfk[1]\r\n gases += 1\r\n if f0f>gas:\r\n print(-1)\r\n exit()\r\n forward = True\r\n gas -= f0f\r\n j+=1\r\n\r\nif forward:\r\n if gas >= (abfk[0]-abfk[2]):\r\n print(gases)\r\n elif abfk[1]>=(abfk[0]-abfk[2]):\r\n print(gases+1)\r\n else:\r\n print(-1) \r\nelse:\r\n if gas >= abfk[2]:\r\n print(gases)\r\n elif abfk[1]>=abfk[2]:\r\n print(gases+1)\r\n else:\r\n print(-1)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/4 19:43\r\n\r\n\"\"\"\r\n\r\na, b, f, k = map(int, input().split())\r\n\r\nif b < f or f+b < a:\r\n print(-1)\r\n exit(0)\r\n\r\nr = a-f\r\n\r\nres = 0\r\nfuel = b\r\nfor i in range(k):\r\n if i % 2 == 0:\r\n # 0->a\r\n if i == k-1:\r\n if fuel >= a:\r\n break\r\n elif fuel >= f:\r\n res += 1\r\n break\r\n else:\r\n print(-1)\r\n exit(0)\r\n else:\r\n if fuel < f:\r\n print(-1)\r\n exit(0)\r\n if fuel >= a + r:\r\n fuel -= a\r\n else:\r\n res += 1\r\n fuel = b - r\r\n else:\r\n # a->0\r\n if i == k-1:\r\n if fuel < r:\r\n print(-1)\r\n exit(0)\r\n if fuel >= a:\r\n break\r\n elif fuel >= r:\r\n res += 1\r\n break\r\n else:\r\n print(-1)\r\n exit(0)\r\n else:\r\n if fuel >= a + f:\r\n fuel -= a\r\n else:\r\n res += 1\r\n fuel = b - f\r\nprint(res)", "a,b,f,k = map(int,input().split())\r\n\r\ntf = a-f\r\ngas = b-f\r\n\r\nif gas < 0:\r\n print(-1)\r\n exit()\r\n\r\nans = 0\r\nfor i in range(k):\r\n if i%2 == 0:\r\n if i == k-1:\r\n if gas < tf:\r\n gas = b\r\n ans +=1 \r\n else:\r\n if gas < tf*2:\r\n gas = b\r\n ans +=1\r\n if i == k-1:\r\n gas -= tf\r\n else:\r\n gas -= tf*2\r\n if gas < 0:\r\n print(-1)\r\n exit()\r\n else:\r\n if i == k-1:\r\n if gas < f:\r\n gas = b\r\n ans +=1 \r\n else:\r\n if gas < f*2:\r\n gas = b\r\n ans +=1\r\n if i == k-1:\r\n gas -= f\r\n else:\r\n gas -= f*2\r\n if gas < 0:\r\n print(-1)\r\n exit()\r\nprint(ans)", "a, b, f, k = map(int, input().split())\n\nstart = True\ntank = b\nrefuels = 0\npossible = True\n\nwhile k > 0 and possible:\n\tif k == 1:\n\t\t# can reach end\n\t\tif tank >= a:\n\t\t\tk -= 1\n\t\t\tcontinue\n\n\t\tif start:\n\t\t\t# need to refuel\n\t\t\t# can reach fuel gas station, and can go from gas station to end\n\t\t\tif tank >= f and b >= (a - f):\n\t\t\t\trefuels += 1\n\t\t\telse:\n\t\t\t\tpossible = False\n\t\telse:\n\t\t\t# we are at end \n\t\t\tif tank >= (a - f) and b >= f:\n\t\t\t\trefuels += 1\n\t\t\telse:\n\t\t\t\tpossible = False\n\telse:\n\t\t# check if we need to refuel at each step\n\t\tif start:\n\t\t\tif tank < f:\n\t\t\t\tpossible = False\n\t\t\telif tank >= (a + (a - f)):\n\t\t\t\t# we don't need to refuel\n\t\t\t\ttank -= a\n\t\t\telse:\n\t\t\t\t# need to refuel\n\t\t\t\ttank = (b - (a - f))\n\t\t\t\trefuels += 1\n\t\telse:\n\t\t\tif tank < (a - f):\n\t\t\t\tpossible = False\n\t\t\telif tank >= (a + f):\n\t\t\t\ttank -= a\n\t\t\telse:\n\t\t\t\t# need to refuel\n\t\t\t\ttank = b - f\n\t\t\t\trefuels += 1\n\n\t\tstart = not start\n\tk -= 1\n\nif not possible:\n\tprint(-1)\nelse:\n\tprint(refuels)\n\n", "a, bm, f, k = [int(i) for i in input().split()]\r\nb = bm\r\nr1, r2 = f, a - f\r\ncount = 0\r\nfor i in range(k):\r\n b -= r1\r\n if b < 0:\r\n print(-1)\r\n exit(0)\r\n if b < 2 * r2 and i != k - 1:\r\n b = bm\r\n count += 1\r\n elif i == k - 1:\r\n if b < r2:\r\n b = bm\r\n count += 1\r\n b -= r2\r\n if b < 0:\r\n print(-1)\r\n exit(0)\r\n r1, r2 = r2, r1\r\nprint(count)", "a,b,f,k=map(int,input().split())\r\nfrom sys import exit\r\nitem,res=b,0\r\nif item<f:print(-1);exit()\r\nitem-=f\r\nx,y=f*2,(a-f)*2\r\nfor i in range(1,k):\r\n if i%2==1:\r\n if item<y:res+=1;item=b-y\r\n else:item-=y\r\n if item<0:print(-1);exit()\r\n else:\r\n if item<x:res+=1;item=b-x\r\n else:item-=x\r\n if item<0:print(-1);exit()\r\nif k%2==1:\r\n if item<(a-f):res+=1;item=b-(a-f)\r\n else:item-=(a-f)\r\n if item<0:print(-1);exit()\r\nelse:\r\n if item<f:res+=1;item=b-f\r\n else:item-=f\r\n if item<0:print(-1);exit()\r\nprint(res)" ]

[ "class Cie:\n def __init__(self, id, start, end):\n self.id = id\n self.start = start\n self.end = end\n self.range = end - start + 1\n\n def lte(self, k):\n return min(self.range, max(0, k - self.start + 1))\n\n def gte(self, k):\n return min(self.range, max(0, 1 + self.end - k))\n\nN = int(input())\ntotal = 1\ncies = []\nfor i in range(N):\n start, end = map(int, input().split())\n cie = Cie(i, start, end)\n cies.append(cie)\n total *= cie.range\n\n\ncnt = 0\nfor second in cies:\n for score in range(second.start, second.end+1):\n \n for first in cies:\n pos = 1\n if first == second:\n continue\n #print(f\"{first.id}.\", end='')\n if first.id < second.id:\n pos *= first.gte(score)\n #print(f\"{score}+ ({first.gte(score)})|\", end='')\n else:\n pos *= first.gte(score+1)\n #print(f\"{score+1}+ ({first.gte(score+1)}|\", end='')\n\n #print(f\" {second.id}.{score} |\", end = '')\n for other in cies:\n if other == second or other == first:\n continue\n #print(f\" {other.id}.\", end = '')\n if other.id < second.id:\n pos *= other.lte(score-1)\n #print(f\"{score-1}- |\", end = '')\n else:\n pos *= other.lte(score)\n #print(f\"{score}- |\", end = '')\n #print(f\"{pos}\")\n cnt += pos * score\n\n#print(cnt)\n#print(total)\nprint(cnt / total)\n", "import sys\n\nMaxV = int(1e4)\n\ndata = []\nreadIdx = 0\nfor line in sys.stdin.readlines():\n\tdata += line.split()\n\ndef read():\n\tglobal readIdx\n\treadIdx += 1\n\treturn data[readIdx - 1]\n\nn, average, power, mul = int(read()), 0, 1, 1\nfroms, tos, r = [], [], []\n\ndef generate(i, maxIdx, secondMax, equal, ways):\n\tglobal n, r\n\tif i < n:\n\t\tfor state in range(3):\n\t\t\tif state < 2:\n\t\t\t\tnewWays = ways\n\t\t\t\tnewEqual = equal\n\t\t\t\tif state == 0:\n\t\t\t\t\tnewWays *= max(0, min(secondMax - 1, tos[i]) + 1 - froms[i])\n\t\t\t\telse:\n\t\t\t\t\tnewEqual += 1\n\t\t\t\t\tif froms[i] > secondMax or tos[i] < secondMax:\n\t\t\t\t\t\tnewWays = 0\n\t\t\t\tif newWays > 0:\n\t\t\t\t\tgenerate(i + 1, maxIdx, secondMax, newEqual, newWays)\n\t\t\telif maxIdx == None:\n\t\t\t\tgreaterFrom = max(secondMax + 1, froms[i])\n\t\t\t\tgreaterTo = tos[i]\n\t\t\t\tnewWays = ways\n\t\t\t\tif greaterFrom > greaterTo:\n\t\t\t\t\tnewWays = 0\n\t\t\t\tnewWays *= max(0, greaterTo + 1 - greaterFrom)\n\t\t\t\tif newWays > 0:\n\t\t\t\t\tgenerate(i + 1, i, secondMax, equal, newWays)\n\telif ways > 0 and ((maxIdx != None and equal > 0) or (maxIdx == None and equal >= 2)):\n\t\tr += [ways * secondMax]\n\t\t\n\nfor i in range(n):\n\tfroms += [int(read())]\n\ttos += [int(read())]\n\tpower *= 3\n\tmul *= (tos[i] + 1 - froms[i])\nfor secondMax in range(MaxV + 1):\n\tgenerate(0, None, secondMax, 0, 1)\nprint(sum(r) / mul)\n", "n=int(input())\nL=[]\nfor i in range(n):\n l,r=map(int, input().split(' '))\n L.append([l,r])\nfor i in range(n,5) :\n L.append([0,0])\nans = 0.0\nfor s in range(1,10001):\n P=[0]*5\n for i in range(5):\n P[i]=max(min((L[i][1]-s+1)/(L[i][1]-L[i][0]+1),1.0),0.0)\n P0=1.0\n for i in range(5):P0*=(1-P[i])\n P1=0.0\n for i in range(5):\n t=P[i]\n for j in range(5) :\n if i==j:continue\n t*=(1-P[j])\n P1+=t\n ans+=1.0-P0-P1\nprint(ans)\n", "def p2pl(p1,p2,p3,p4,p5):\r\n prob0 = (1-p1)*(1-p2)*(1-p3)*(1-p4)*(1-p5)\r\n prob1 = p1*(1-p2)*(1-p3)*(1-p4)*(1-p5) + \\\r\n p2*(1-p1)*(1-p3)*(1-p4)*(1-p5) + \\\r\n p3*(1-p1)*(1-p2)*(1-p4)*(1-p5) + \\\r\n p4*(1-p1)*(1-p2)*(1-p3)*(1-p5) + \\\r\n p5*(1-p1)*(1-p2)*(1-p3)*(1-p4)\r\n return 1-(prob1+prob0)\r\n\r\nn = int(input())\r\nc1 = input().split(' ')\r\nc1 = [int(c1[0]),int(c1[1])]\r\n\r\nc2 = input().split(' ')\r\nc2 = [int(c2[0]),int(c2[1])]\r\n\r\nif n >= 3:\r\n c3 = input().split(' ')\r\n c3 = [int(c3[0]),int(c3[1])]\r\nelse:\r\n c3 = [0,0]\r\n\r\nif n >= 4:\r\n c4 = input().split(' ')\r\n c4 = [int(c4[0]),int(c4[1])]\r\nelse:\r\n c4 = [0,0]\r\n\r\nif n >= 5:\r\n c5 = input().split(' ')\r\n c5 = [int(c5[0]),int(c5[1])]\r\nelse:\r\n c5 = [0,0]\r\n\r\nans = 0\r\nfor x in range(1,10001):\r\n p1 = min(1,max(c1[1]-x+1,0)/(c1[1]-c1[0]+1))\r\n p2 = min(1,max(c2[1]-x+1,0)/(c2[1]-c2[0]+1))\r\n p3 = min(1,max(c3[1]-x+1,0)/(c3[1]-c3[0]+1))\r\n p4 = min(1,max(c4[1]-x+1,0)/(c4[1]-c4[0]+1))\r\n p5 = min(1,max(c5[1]-x+1,0)/(c5[1]-c5[0]+1))\r\n ans += p2pl(p1,p2,p3,p4,p5)\r\nprint(ans)\r\n", "import itertools\n\nn = int(input())\npairs = []\nfor i in range(n):\n\tpairs.append([int(x) for x in input().split()])\nallPairs = [x for x in (itertools.product((0,1,2), repeat = len(pairs))) if (x.count(0) == 1 and x.count(1) >= 1) or (x.count(0) == 0 and x.count(1) >= 2)]\n\ndef analyze_sec_price_prob(companiesProb):\n\tsecPriceProb = 0\n#\tprint(companiesProb, \"||||||||||\")\n\tfor oneChoice in allPairs:\n\t\tcompChain = 1\n\t\tfor index in range(len(companiesProb)):\n\t\t\tcompChain *= companiesProb[index][oneChoice[index]]\n\t\tsecPriceProb += compChain\n#\t\tif compChain > 0:\n#\t\t\tprint(oneChoice, \"&&&&&&&&&\")\n\treturn secPriceProb\n\ndef math_exp_sec(pairs):\n\tresult = 0\n\tfor secondPrice in range(1, 10001):\n\t\tcurProb = []\n\t\tfor limit in pairs:\n\t\t\tif secondPrice < limit[0]:\n\t\t\t\tsecondPriceLess = 1\n\t\t\t\tsecondPriceEq = 0\n\t\t\t\tsecondPriceBig = 0\n\t\t\telif limit[0] <= secondPrice <= limit[1]:\n\t\t\t\tsecondPriceLess = (limit[1] - secondPrice) / (limit[1] - limit[0] + 1.0)\n\t\t\t\tsecondPriceEq = 1.0 / (limit[1] - limit[0] + 1.0)\n\t\t\t\tsecondPriceBig = (secondPrice - limit[0]) / (limit[1] - limit[0] + 1.0)\n\t\t\telse:\n\t\t\t\tsecondPriceLess = 0\n\t\t\t\tsecondPriceEq = 0\n\t\t\t\tsecondPriceBig = 1\n\t\t\tcurProb.append((secondPriceLess, secondPriceEq, secondPriceBig))\n\t\tresult += secondPrice * analyze_sec_price_prob(curProb)\n\treturn result\n\nprint(math_exp_sec(pairs))", "d = [list(map(int, input().split())) for i in range(int(input()))]\r\ns = 0\r\nfor k in range(1, 10001):\r\n p = [min(max((k - l) / (r - l + 1), 1e-20), 1) for l, r in d]\r\n u = v = 1\r\n for r in p: u *= r\r\n for r in p:\r\n v *= r\r\n s += (u - v) * (r - 1) / r\r\nprint(s)", "n = int(input())\r\nL = []\r\nfor i in range(n) :\r\n l,r = map(int, input().split(' '))\r\n L.append([l,r])\r\nfor i in range(n, 5) :\r\n L.append([0,0])\r\nans = 0.0\r\nfor s in range(1, 10001) :\r\n P = [0]*5\r\n for i in range(5) :\r\n P[i] = max(min((L[i][1] - s+1)/(L[i][1]-L[i][0]+1), 1.0), 0.0)\r\n P0 = 1.0\r\n for i in range(5) :\r\n P0 *= (1-P[i])\r\n P1 = 0.0\r\n for i in range(5) :\r\n t = P[i]\r\n for j in range(5) :\r\n if i == j : continue\r\n t *= (1-P[j])\r\n P1 += t\r\n ans += 1.0 - P0 - P1\r\nprint(ans)" ]

[ "import sys\nn,m,t=[int(i)for i in sys.stdin.readline().split()]\na,b,k,c=[0]*n,[0]*n,[0]*n,0\nfor i in range(n):x,y=sys.stdin.readline().split();a[i]=int(x)-1;b[i]=(a[i],i);d=1 if y==\"R\"else -1;w,u=divmod(a[i]+t*d,m);a[i],c=u,c+w\na,b=sorted(a),sorted(b)\nfor i in range(n):k[b[i][1]]=a[(i+c)%n]+1\nprint(\" \".join(str(x)for x in k))\n \t \t \t \t\t\t \t\t\t \t", "# https://atcoder.jp/contests/agc013/submissions/34325270\r\n\r\nfrom sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn,l,t=map(int,input().split())\r\nants=[]\r\nlast=[]\r\nxwi=[]\r\n\r\nfor i in range(n):\r\n x,w=input().split()\r\n x=int(x)-1\r\n if w=='L':\r\n w=2\r\n else:\r\n w=1\r\n xwi.append((x,w,i))\r\nxwi.sort(key=lambda x:x[0])\r\n\r\nfor i in range(n):\r\n x,w=xwi[i][:2]\r\n ants.append((x,w))\r\n if w==1:\r\n last.append(((x+t)%l,1,i))\r\n else:\r\n last.append(((x-t)%l,0,i))\r\n\r\nans=[]\r\nif ants[0][1]==1:\r\n last.sort()\r\n for i in range(n):\r\n if last[i][2]==0:\r\n idx0=i\r\n\r\n x0=ants[0][0]\r\n cross=0\r\n for x,w in ants[1:]:\r\n if w==2:\r\n cross+=(l-(x-x0)+2*t)//l\r\n cross%=n\r\n\r\n for i in range(n):\r\n ans.append(last[(idx0-cross+i)%n][0])\r\n\r\nelse:\r\n last.sort()\r\n for i in range(n):\r\n if last[i][2]==0:\r\n idx0=i\r\n \r\n x0=ants[0][0]\r\n cross=0\r\n for x,w in ants[1:]:\r\n if w==1:\r\n cross+=(x-x0+2*t)//l \r\n cross%=n\r\n\r\n for i in range(n):\r\n ans.append(last[(idx0+cross+i)%n][0])\r\n\r\nANS=[0]*n\r\nfor i in range(n):\r\n res=ans[i]+1\r\n res%=l\r\n if res==0:\r\n res=l\r\n ANS[xwi[i][2]]=res\r\nprint(*ANS)", "import sys\r\nn,m,t=[int(i)for i in sys.stdin.readline().split()]\r\na,b,k,c=[0]*n,[0]*n,[0]*n,0\r\nfor i in range(n):x,y=sys.stdin.readline().split();a[i]=int(x)-1;b[i]=(a[i],i);d=1 if y==\"R\"else -1;w,u=divmod(a[i]+t*d,m);a[i],c=u,c+w\r\na,b=sorted(a),sorted(b)\r\nfor i in range(n):k[b[i][1]]=a[(i+c)%n]+1\r\nprint(\" \".join(str(x)for x in k))" ]

[ "for _ in range(int(input())):\r\n a, b, k = map(float, input().split())\r\n print(\"{:.9f}\".format(1 / (1 / (a - b) + k * k * (a - b) / a / b)))\r\n", "#!/usr/bin/env python3\r\n\r\ndef solve(R,r,k):\r\n # Thanks to Numberphile's \"Epic circles\" video\r\n # Use the formula for radii of circles in Pappus chain\r\n r = r / R\r\n n = k\r\n answer = ((1-r)*r)/(2*((n**2)*((1-r)**2)+r))\r\n # Note that in a Pappus chain the diameter of the circle is 1, so we need to scale up:\r\n answer = 2*R * answer\r\n print(\"%.10f\" % answer)\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n R,r,k = map(int, input().split())\r\n solve(R,r,k)", "# Code written for Jasnah\r\n\r\ndef res(R, r, k):\r\n r = r / R\r\n result = ((1 - r) * r) / (2 * ((k ** 2) * ((1 - r) ** 2) + r)) * 2 * R\r\n print(\"%.10f\" % result)\r\n\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n R, r, k = map(int, input().split())\r\n res(R, r, k)", "def res(R,r,k):\r\n r = r / R\r\n result = ((1-r)*r)/(2*((k**2)*((1-r)**2)+r))*2*R\r\n print(\"%.10f\" % result)\r\n \r\nt = int(input())\r\nfor i in range(t):\r\n R,r,k = map(int, input().split())\r\n res(R,r,k)# 1697177251.3011422" ]

[ "from math import inf\n\nn, x = map(int, input().split())\na = list(map(int, input().split()))\nx -= 1\n\nmx = inf\nmi = None\nfor i in range(x, x - n, -1):\n if a[i] < mx:\n mx = a[i]\n mi = i\n\nmi %= n\n\nfor i in range(n):\n a[i] -= mx\n\na[mi] = mx * n + (x - mi) % n\n\nfor i in range(mi + 1 - (n if x < mi else 0), x + 1):\n a[i] -= 1\n\nprint(' '.join(map(str, a)))\n\n\t \t \t \t \t\t \t\t\t \t\t\t \t\t\t", "n,x=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nx-=1\r\nif 0 in A[:x]:\r\n cnt=0\r\n while A[x]!=0:\r\n cnt+=1\r\n A[x]-=1\r\n x-=1\r\n A[x]=cnt\r\nelif 0 in A[x+1:]:\r\n cnt=0\r\n for i in range(x+1):\r\n A[i]-=1\r\n cnt+=1\r\n for i in range(n-1,-1,-1):\r\n if A[i]==0:\r\n A[i]+=cnt\r\n break\r\n A[i]-=1\r\n cnt+=1\r\nelse:\r\n m=min(A)\r\n idx=-1\r\n for i in range(x,-1,-1):\r\n if A[i]==m:\r\n idx=i\r\n break\r\n if idx==-1:\r\n for i in range(x+1,n):\r\n if A[i]==m:\r\n idx=i\r\n break\r\n cnt=0\r\n for i in range(n):\r\n A[i]-=m\r\n cnt+=m\r\n if (idx<=x and idx<=i<=x) or (idx>x and not (x<i<=idx)):\r\n A[i]-=1\r\n cnt+=1\r\n A[idx]+=cnt\r\nprint(*A)", "n,l=input().split()\r\nn=int(n)\r\nl=int(l)\r\nl=l-1\r\na=list(map(int,input().split()))\r\nmin=float('inf')\r\nfor i in range(n-1,-1,-1):\r\n if(a[i]<min):\r\n min=a[i]\r\n pos=i\r\nif(a[l]==min):\r\n pos=l\r\nif(l>=pos):\r\n for i in range(0,n):\r\n a[i]-=min\r\n for i in range(pos+1,l+1):\r\n a[i]-=1\r\n a[pos]=n*min+l-pos\r\nelse:\r\n found=0\r\n for i in range(l,-1,-1):\r\n if(a[i]==min):\r\n pos=i\r\n found=1\r\n break\r\n if(found==1):\r\n for i in range(0,n):\r\n a[i]-=min\r\n for i in range(pos+1,l+1):\r\n a[i]-=1\r\n a[pos]=n*min+l-pos\r\n else:\r\n for i in range(0,n):\r\n a[i]-=min\r\n for i in range(pos+1,n):\r\n a[i]-=1\r\n for i in range(0,l+1):\r\n a[i]-=1\r\n a[pos]=n*min+n-pos+l\r\n \r\n \r\n\r\nfor i in range(0,n):\r\n print(a[i],end=' ')\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n ", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = min(a)\r\nif t != 0:\r\n for i in range(n):\r\n a[i] -= t - 1\r\ni = x - 1\r\nc = 0\r\nwhile a[i] != 0:\r\n a[i] -= 1\r\n c += 1\r\n i -= 1\r\n if i == -1:\r\n i = n - 1\r\na[i] += c + max(t - 1, 0) * n\r\nfor i in a:\r\n print(i, end = ' ')", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n for ele in ans:\n sys.stdout.write(str(ele) + \" \")\n sys.stdout.write(\"\\n\")\n\n\ndef solve(init, balls):\n\n mn = MAXNUM\n k = 0\n dist = 0\n for i in range(len(balls)):\n curdist = (init - i) % (len(balls))\n if balls[i] < mn:\n mn = balls[i]\n k = i\n dist = (init - i) % (len(balls))\n elif balls[i] == mn and curdist < dist:\n mn = balls[i]\n k = i\n dist = curdist\n\n rounds = balls[k] # loop times\n\n cur = (k + 1) % len(balls)\n\n while cur != (init + 1) % len(balls):\n balls[cur] -= rounds + 1\n balls[k] += rounds + 1\n cur += 1\n cur %= len(balls)\n\n cur = (init + 1) % len(balls)\n while cur != (k):\n balls[cur] -= rounds\n balls[k] += rounds\n cur += 1\n cur %= len(balls)\n\n return balls\n\n\ndef readinput():\n n, x = getInts()\n balls = list(getInts())\n printOutput((solve((x - 1), balls)))\n\n\nreadinput()\n", "n,x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nm = min(a)\r\na = [i-m for i in a]\r\nx = x-1\r\nd = m*n\r\nwhile a[x]>0:\r\n d+=1\r\n a[x]-=1\r\n x-=1\r\n if x<0:\r\n x=n-1\r\na[x]=d\r\nprint(*a)\r\n ", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nidx = x % n\r\nfor j in range(x, x+n):\r\n if a[j % n] <= a[idx]:\r\n idx = j % n\r\ntemp = a[idx]\r\na[idx] += n * temp\r\na = [i - temp for i in a]\r\nj = idx + 1\r\nwhile j % n != x % n:\r\n a[j % n] -= 1\r\n j += 1\r\n a[idx] += 1\r\nprint(*a)\r\n", "import math\r\nfrom os import startfile\r\nimport random \r\nfrom queue import Queue\r\nimport time \r\nimport heapq\r\nimport sys \r\ndef sub(arr,val):\r\n\r\n ans=[arr[i]-val for i in range(len(arr))]\r\n return ans\r\ndef main(arr,x):\r\n\r\n\r\n x-=1 \r\n\r\n start=x \r\n\r\n dist=0\r\n min_arr=min(arr)\r\n min_sub=float('inf')\r\n for i in range(len(arr)):\r\n\r\n if min_arr>=arr[start] and min_sub>=arr[start]:\r\n ans=sub(arr,arr[start]) \r\n if dist!=0:\r\n\r\n j=(start+1)%len(arr) \r\n\r\n while j!=x:\r\n \r\n ans[j]-=1 \r\n j=(j+1)%len(arr) \r\n ans[x]-=1\r\n ans[start]+=(arr[start]*len(arr)+dist)\r\n print(*ans)\r\n return\r\n else:\r\n min_sub=min(min_sub,arr[start]) \r\n start=(start-1)%len(arr)\r\n dist+=1\r\n \r\n\r\nn,x=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nmain(arr,x)\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\nm = min(a)\r\nf = x-1\r\nfor i in range(n):\r\n\tif(a[f] == m):\r\n\t\tst = f\r\n\t\tbreak\r\n\tf = (f-1)%n\r\nc = m+1\r\nct = 0\r\nfor i in range(n):\r\n\ta[st] -= c\r\n\tct += c\r\n\tif(st == x-1): c -= 1\r\n\tst = (st+1)%n\r\na[st] = ct-1\r\nprint(*a)", "'''input\n3 3\n2 3 1\n'''\nfrom sys import stdin, setrecursionlimit\nimport math\nfrom collections import defaultdict, deque\n\nsetrecursionlimit(15000)\n\n\ndef transform(arr, ans):\n\tfor i in range(len(arr)):\n\t\tarr[i] -= ans \n\n\ndef find_index(x, arr, ):\n\ti = x - 1 \n\n\twhile True:\n\t\tif arr[i] == 0:\n\t\t\tbreak\n\t\tarr[i] -= 1\n\t\ti -= 1\n\t\tif i == -1:\n\t\t\ti = n - 1\n\treturn i\n\n\ndef add_remain(x, arr, index):\n\ti = x - 1\n\tcount = 0\n\twhile True:\n\t\tif i == index:\n\t\t\tbreak\n\t\tcount += 1\n\t\ti -= 1\n\t\tif i == -1:\n\t\t\ti = len(arr) - 1\n\treturn count\n\n\n# main starts\nn, x = list(map(int, stdin.readline().split()))\narr = list(map(int, stdin.readline().split()))\ncarr = arr[:]\nmn = min(arr)\ntransform(carr, mn)\nans = mn * n\nindex = find_index(x, carr)\nans += add_remain(x, arr, index)\n\nfor i in range(n):\n\tarr[i] -= mn\narr[index] = ans\ni = x - 1\nwhile True:\n\tif i == index:\n\t\tbreak\n\tarr[i] -= 1\n\ti -= 1\n\tif i < 0:\n\t\ti = n - 1\nprint(*arr)\n\n", "n, dest = map(int, input().split())\ndest -= 1\na = list(map(int, input().split()))\n\nm1 = float('inf'); m2 = float('inf')\npos1 = -1; pos2 = -1\n\nfor i in range(dest + 1):\n if a[i] <= m1:\n m1 = a[i]\n pos1 = i\n\n\nfor i in range(dest + 1, n):\n if a[i] <= m2:\n m2 = a[i]\n pos2 = i\n\n\nif m2 < m1:\n c = 0\n for i in range(n):\n if dest + 1 <= i <= pos2:\n c += m2\n a[i] -= m2\n else:\n c += (m2+1)\n a[i] -= (m2+1)\n a[pos2] = c\nelse:\n c = 0\n for i in range(n):\n if pos1 + 1 <= i <= dest:\n c += m1 + 1\n a[i] -= m1 + 1\n else:\n c += m1\n a[i] -= m1\n a[pos1] = c\n \nprint(*a)\n", "n,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nm = min(arr)\r\nk -= 1\r\nov = m*n\r\nfor i in range(n):\r\n arr[i] -= m\r\nwhile arr[k] > 0:\r\n ov += 1\r\n arr[k] -= 1\r\n k = (k-1)%n\r\narr[k] = ov\r\nprint(*arr) ", "n,x = map(int, input().split())\na = list(map(int, input().split()))\nm = min(a)\na = [i-m for i in a]\nx = x-1\nd = m*n\nwhile a[x]>0:\n d+=1\n a[x]-=1\n x-=1\n if x<0:\n x=n-1\na[x]=d\nprint(*a)\n \n \t \t \t\t \t\t \t\t \t \t\t \t \t", "\r\ndef solve(n, x, seq):\r\n x -= 1\r\n _min = min(seq)\r\n s = sum(seq)\r\n idx = -1\r\n for i in range(x, -1, -1):\r\n if seq[i] == _min:\r\n idx = i\r\n break\r\n else:\r\n for j in range(n - 1, x, -1):\r\n if seq[j] == _min:\r\n idx = j\r\n break\r\n\r\n for i in range(n):\r\n seq[i] -= _min\r\n\r\n if idx <= x:\r\n for j in range(idx + 1, x + 1):\r\n seq[j] -= 1\r\n else:\r\n for j in range(x, -1, -1):\r\n seq[j] -= 1\r\n\r\n for j in range(n - 1, idx, -1):\r\n seq[j] -= 1\r\n\r\n seq[idx] = s - sum(seq)\r\n return seq\r\n\r\n\r\ndef main():\r\n n, x = map(int, input().split())\r\n seq = [int(c) for c in input().split()]\r\n ans = solve(n, x, seq)\r\n print(*ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, x = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nm = min(A)\r\nmi = A.index(m)\r\nfor i in range(n):\r\n A[i] -= m\r\n\r\nj = x - 1\r\nval = n * m\r\nwhile(A[j]):\r\n A[j] -= 1\r\n val += 1\r\n j = ((j - 1) % n + n) % n\r\nA[j] = val\r\nprint(*A)", "def main():\r\n n, x = map(int,input().split())\r\n a = [int(i) for i in input().split()]\r\n j = x - 1\r\n z = min(a)\r\n while a[j] != z:\r\n if j == 0:\r\n j = n - 1\r\n else:\r\n j -= 1\r\n m = a[j]\r\n k = 0\r\n if x - 1 > j:\r\n for i in range(n):\r\n if j < i <= x - 1:\r\n a[i] -= (m + 1)\r\n k += (m + 1)\r\n else:\r\n a[i] -= m\r\n k += m\r\n a[j] += k\r\n elif x - 1 < j:\r\n for i in range(n):\r\n if x - 1 < i <= j:\r\n a[i] -= m\r\n k += m\r\n else:\r\n a[i] -=(m + 1)\r\n k += (m + 1)\r\n a[j] += k\r\n else:\r\n for i in range(n):\r\n a[i] -= m\r\n k += m\r\n a[j] += k\r\n print(*a)\r\nmain()", "n, x = map(int, input().split())\r\nx = x - 1\r\nl = list(map(int, input().split()))\r\n\r\nmin_index, min_value = -1, 10 ** 9 + 7\r\nnb_seen = 0\r\ncur = x\r\nwhile nb_seen != n:\r\n if min_value > l[cur]:\r\n min_value = l[cur]\r\n min_index = cur\r\n cur = (n - 1 + cur) % n\r\n nb_seen += 1\r\n\r\nmin_value = l[min_index]\r\nfor i in range(n):\r\n l[i] -= min_value\r\n\r\nnb_el = 0\r\ncur = x\r\nwhile l[cur] != 0:\r\n l[cur] -= 1\r\n cur = (n - 1 + cur) % n\r\n nb_el += 1\r\n\r\nl[min_index] += n * min_value + nb_el\r\n\r\nprint(' '.join(list(map(str, l))))\r\n" ]

[ "T = int( input() )\r\n\r\nMAX = 33000\r\n\r\nbePrime = [0] * MAX;\r\nprimNum = []\r\n\r\nfor j in range(2, MAX):\r\n if bePrime[j] == 0: \r\n primNum.append( j )\r\n i = j\r\n while i < MAX:\r\n bePrime[i] = 1\r\n i = i + j\r\n\r\ndef isPrime( a ):\r\n for j in primNum:\r\n if j >= a:\r\n return True\r\n if a % j == 0:\r\n return False\r\n return True\r\n\r\ndef gcd( a, b ):\r\n if b == 0:\r\n return a\r\n return gcd( b, a % b );\r\n\r\nwhile T > 0:\r\n num = 0;\r\n n = int( input() )\r\n\r\n m = n\r\n while isPrime(m) == False:\r\n m -= 1\r\n while isPrime(n + 1) == False:\r\n n += 1\r\n num += 1\r\n\r\n a = n - 1\r\n b = 2 * ( n+1 )\r\n\r\n a = a * (n+1) * m - num * b\r\n b = b * (n+1) * m\r\n\r\n g = gcd( a, b)\r\n a //= g\r\n b //= g\r\n\r\n\r\n print( '{0}/{1}'.format( a, b ) )\r\n T -= 1;\r\n\r\n", "def isPrime(n):\n i = 2\n while i * i <= n:\n if n % i == 0:\n return False\n i += 1\n return True\n\ndef prevPrime(n):\n while not isPrime(n):\n n -= 1\n return n\n\ndef nextPrime(n):\n n += 1\n while not isPrime(n):\n n += 1\n return n\n\ndef gcd(a, b):\n while(a):\n b %= a\n a, b = b, a\n return b;\n\ndef solve():\n n = int(input())\n prev = prevPrime(n);\n next = nextPrime(n);\n num1 = prev - 2;\n den1 = prev * 2;\n g = gcd(num1, den1);\n num1 //= g;\n den1 //= g;\n num2 = n - prev + 1;\n den2 = prev * next;\n g = gcd(num2, den2);\n num2 //= g;\n den2 //= g;\n g = gcd(num1 * den2 + num2 * den1, den1 * den2);\n x = (num1 * den2 + num2 * den1) // g;\n y = den1 * den2 // g;\n print('{}/{}'.format(x, y))\n\nt = int(input())\nwhile t:\n t -= 1\n solve()\n", "from math import gcd\r\n\r\n\r\ndef checkp(x):\r\n d = 2\r\n while d * d <= x:\r\n if x % d == 0:\r\n return False\r\n d += 1\r\n return True\r\n\r\n\r\nfor i in range(int(input())):\r\n n = int(input())\r\n p = n\r\n while not checkp(p):\r\n p -= 1\r\n q = n + 1\r\n while not checkp(q):\r\n q += 1\r\n \r\n a = p*q - 2*q - 2*p + 2*n+2\r\n b = 2 * p * q\r\n g = gcd(a, b)\r\n a //= g\r\n b //= g\r\n print(a, b, sep='/')" ]

[ "def is_prime(n):\r\n return n > 1 and all(n % i != 0 for i in range(2, int(n**0.5)+1))\r\n\r\n\r\nn, m = map(int, input().split())\r\nnext_prime = n + 1\r\nwhile not is_prime(next_prime):\r\n next_prime += 1\r\nprint(\"YES\" if next_prime == m else \"NO\")", "s, k = list(map(int, input().split()))\r\ncount, prime = 0, 0\r\nfor i in range(2, (k // 2) + 1):\r\n if k % i == 0:\r\n count += 1\r\nif count > 0:\r\n print(\"NO\")\r\n exit()\r\n\r\ncount, prime = 0, 0\r\n\r\nfor j in range(s, k + 1):\r\n count = 0 \r\n for i in range(2, (j // 2) + 1):\r\n if j % i == 0:\r\n count += 1\r\n\r\n if count == 0:\r\n prime += 1\r\n\r\nif prime == 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b = map(int,input().split(\" \"))\r\nstatus = True\r\n\r\ndef isPrime(num):\r\n i =2 \r\n while i <=num//2:\r\n if num%i ==0:\r\n return False\r\n i+=1 \r\n return True\r\n\r\ni =a \r\nwhile i <=b:\r\n if not isPrime(i) and (i ==a or i ==b):\r\n status = False\r\n break\r\n if isPrime(i) and i != a and i !=b:\r\n status = False\r\n break\r\n \r\n i+=1 \r\nif status:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "m,n=map(int,input().split())\r\nwhile(1):\r\n m=m+1\r\n for i in range(2,m):\r\n if(m%i==0):\r\n break\r\n else:\r\n v=m\r\n break\r\nif(v==n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "[n, m] = list(map(int, input().split(\" \")))\n\nnumber = n + 1\nisNotPrime = True\n\nwhile (isNotPrime):\n temp = number - 1\n isNotPrime = False\n\n while (temp > 1):\n if (number % temp == 0):\n isNotPrime = True\n temp -= 1\n\n number += 1\n\nif (number - 1 == m):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def isprime(n):\n for i in range(2, n // 2 + 1):\n if n % i == 0:\n return False\n return True\n\n\nn, m = map(int, input().split())\nif not isprime(m):\n ans = \"NO\"\nelse:\n ans = \"YES\"\n for k in range(n + 1, m):\n if isprime(k):\n ans = \"NO\"\n break\nprint(ans)\n", "a = input('')\r\nlista = []\r\ns = 0\r\ndiv = 0\r\n\r\nfor j in a.split():\r\n lista.append(int(j))\r\n\r\nn = lista[0]\r\nm = lista[1]\r\n\r\nfor i in range(1, n+1):\r\n div = n%i\r\n if div == 0:\r\n s = s + 1\r\n\r\n\r\nif s == 2:\r\n while True:\r\n s = 0\r\n n = n + 1\r\n for i in range(1, n+1):\r\n div = n%i\r\n if div == 0:\r\n s = s + 1\r\n if s == 2:\r\n if m == n:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\n break\r\n \r\nelse:\r\n print('NO')\r\n\r\nif s != 2:\r\n print('NO')\r\n", "n, m = map(int, input().split())\nprime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]\nfor i in range(0, len(prime)):\n if n==prime[i]:\n if m==prime[i+1]:\n print(\"YES\")\n else:\n print(\"NO\")\n\t\t\t \t\t\t\t \t\t\t \t\t\t\t\t\t \t\t \t\t \t", "n , m = map(int,input().split())\r\nl = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nindexn = l.index(n)\r\nif m in l:\r\n\tindexm = l.index(m)\r\n\tif indexn+1==indexm:\r\n\t\tprint(\"YES\")\r\n\telse:print(\"NO\")\t\r\nelse:print(\"NO\")\t", "x,y= map(int,input().split())\r\ndef isPrime(n):\r\n for i in range(2,n):\r\n if(n%i==0):\r\n return False\r\n return True\r\nn=x+1\r\nwhile(True):\r\n \r\n if(isPrime(n)):\r\n break\r\n n+=1\r\nif(y==n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "arr=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nn,m=map(int,input().split())\r\nif n in arr and n!=47:\r\n ind=arr.index(n)\r\n if arr[ind+1]==m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\ndef seiveMatrix():\r\n primes = [True]*(51)\r\n n = 50\r\n for j in range(2,round(math.sqrt(n))+1,1):\r\n if(primes[j]==True):\r\n for k in range(j*j, n+1, j):\r\n primes[k]=False\r\n return primes\r\n\r\nn,m = map(int,input().split())\r\nprimesArray = seiveMatrix()\r\n#print(len(primesArray))\r\nidx = -1\r\nfor i in range(n+1,51):\r\n if(primesArray[i] == True):\r\n idx = i\r\n break\r\n#print(idx)\r\nif(idx>2 and m==idx):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\nn , m = map(int,input().split())\r\n\r\ndef isprime(x) :\r\n if x < 2 or (x % 2 == 0) :\r\n return False\r\n if x == 2 or x == 3 :\r\n return True\r\n for i in range(3, int(math.sqrt(x))+1 , 2) :\r\n if x % i == 0 :\r\n return False\r\n return True\r\nif isprime(m) :\r\n res = True\r\n for i in range(n+1,m) :\r\n if isprime(i) :\r\n res = False\r\n break\r\n else :\r\n res = True \r\n if res == True :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\nelse :\r\n print(\"NO\")\r\n\r\n \r\n \r\n", "n,m=tuple(map(int,input().split()))\r\ndef check_prime(n):\r\n for i in range(2,n//2+1):\r\n if n%i==0:\r\n return False\r\n return True\r\nx=n+1\r\nwhile True:\r\n if check_prime(x):\r\n break\r\n x+=1\r\n\r\nif m==x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def isprime(n):\r\n for i in range(2,n//2 + 1):\r\n if n%i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn,m = input().split(' ')\r\nn,m = int(n),int(m)\r\nflag = 0\r\nif isprime(m):\r\n for i in range(n+1,m):\r\n if isprime(i):\r\n print('NO')\r\n flag = 1\r\n break\r\n if flag == 0:\r\n print('YES')\r\n \r\nelse:\r\n print('NO')\r\n", "def isprime(x):\r\n for i in range(2, int(x**0.5) + 1):\r\n if n%i == 0:\r\n return False\r\n return True\r\n\r\nn,m = map(int, input().split(\" \"))\r\nwhile(True):\r\n n += 1\r\n if isprime(n):\r\n if n == m:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break", "def easy(a):\r\n for j in range(2, int(a ** 0.5) + 1):\r\n if a % j == 0:\r\n return 0\r\n return 1\r\n\r\n\r\nn, m = map(int, input().split())\r\ncnt = 0\r\nfor i in range(n + 1, m):\r\n cnt += easy(i)\r\nif cnt == 0 and easy(m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,51]\r\nn,m=map(int,input().split())\r\nprint(l[l.index(n)+1]==m and \"YES\" or \"NO\")\r\n", "n, m = list(map(int, input().split()))\r\n\r\nans = \"YES\"\r\nfor i in range(2, m):\r\n if m%i == 0:\r\n ans = \"NO\"\r\n \r\nfor num in range(n+1, m):\r\n flag = 1\r\n for j in range(2, num):\r\n if num%j == 0:\r\n flag = 0\r\n \r\n if flag == 1:\r\n ans = \"NO\"\r\n\r\nprint(ans)\r\n", "a=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nx,y=map(int,input().split())\r\nb=a.index(x)\r\nif a[b+1]==y:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "p=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\nn,m=map(int, input().split())\r\nif p[p.index(n)+1]==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m = map(int,input().split())\r\n \r\nprime = [x for x in range(m+1)]\r\nprime[0] = 0\r\nprime[1] = 0\r\nl = 2\r\nwhile l*l < m+1:\r\n if prime[l]:\r\n for x in range(2*l,m+1,l):\r\n prime[x] = 0\r\n l+=1\r\nprime = [x for x in prime if x!=0]\r\nif m <= prime[-1] and m in prime and prime.index(m)-prime.index(n) == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\nm=n.split()\r\na=int(m[0])\r\nb=int(m[1])\r\n\r\ndef isPrime(n):\r\n for i in range(2,n):\r\n if n%i==0 : return False\r\n return True\r\n\r\n\r\nif isPrime(b)==False : print(\"NO\")\r\nelse : \r\n j=a+1\r\n while isPrime(j)==False:\r\n j+=1\r\n if j==b : print(\"YES\") \r\n else : print(\"NO\")\r\n ", "n, m = map(int, input().split())\nif m >= 2:\n for i in range(2, m):\n if m%i == 0:\n x = False\n break\n else:\n x = True\nif x:\n for i in range(n+1, m):\n if x:\n for l in range(2, i):\n if i%l == 0:\n x = True\n break\n else:\n x = False\n else:\n break\n \nif x:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t\t \t \t\t \t\t \t \t\t\t\t\t \t\t", "n,m=[int(x) for x in input().split()]\r\ncnt=0\r\ndef isPrime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n\r\n return True\r\nfor i in range(n+1,m):\r\n if isPrime(i):\r\n cnt+=1 \r\nif cnt>0 or not isPrime(m) or not isPrime(n):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "def func(n):\r\n for i in range(2,n):\r\n if n%i==0:\r\n return 0\r\n return 1\r\nn,m=map(int,input().split())\r\ni=n+1\r\nwhile i<=m:\r\n a=func(i)\r\n if a==1 and i==m:\r\n print(\"YES\")\r\n exit()\r\n elif a==1 and i!=m:\r\n break\r\n i+=1\r\nprint(\"NO\")", "def Sol(n,k):\r\n\tprime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\n\tfor i in range(len(prime)-1):\r\n\t\tif prime[i] == n:\r\n\t\t\tif prime[i+1] == k:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\treturn\r\n\t\t\telse:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\treturn\r\n\tprint(\"NO\")\r\n\treturn\t\r\n\r\n\r\n#for t in range(int(input())):\r\nn,k = map(int,input().split())\r\nSol(n,k)\r\n", "primes_50 = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n# print(len(primes_50))\r\nn = list(map(int, input().split()))\r\nif n[0] in primes_50:\r\n j = primes_50.index(n[0])\r\n if j < len(primes_50)-1:\r\n if primes_50[j+1] == n[1]:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "def isPrime(x):\n i = 2\n while i*i <= x:\n if x % i == 0:\n return False\n i += 1\n return x > 1\n\nn, m = map(int, input().split() )\nok = not any([isPrime(x) for x in range(n+1, m) ] )\nprint('YES' if ok and isPrime(m) else 'NO')\n", "a,b=map(int,input().split())\r\ndef valid(n):\r\n c=0\r\n for i in range(1,n+1):\r\n if n%i==0:\r\n c=c+1\r\n if c==2:\r\n return 1\r\n else:\r\n return 0 \r\n#print(valid(5))\r\nt=0\r\nfor i in range(a+1,b+1):\r\n if valid(i):\r\n k=i\r\n t=t+1\r\n if k==b:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\") \r\n break\r\nif t==0:\r\n print(\"NO\")", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\ndef is_prime(n):\r\n for i in range(2, int(n ** 0.5) + 1):\r\n if n % i == 0:\r\n return False\r\n return True \r\n\r\nfor i in range(n + 1, m):\r\n if is_prime(i):\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\" if is_prime(m) else \"NO\")\r\n", "import math\n\nn, m = list(map(int, input().split()))\n\ndef isPrime(x):\n\tfor i in range(2, int(math.sqrt(x)+1)):\n\t\tif x % i == 0:\n\t\t\treturn False\n\n\treturn True\n\nres = False\nfor i in range(n + 1, 51):\n\tif isPrime(i) is True:\n\t\tif i == m:\n\t\t\tres = True\n\n\t\tbreak\n\nif res:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "P = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 1)\r\nn, m = map(int,input().split())\r\nfor i in range(len(P)):\r\n if n == P[i]:\r\n a = i\r\n break\r\nif m == P[a+1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\nd = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nif a in d and b in d:\r\n if d.index(a) + 1 == d.index(b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_prime(number: int) -> bool:\r\n if number == 2: \r\n return True\r\n if number%2 == 0:\r\n return False\r\n for i in range(2, number):\r\n if number%i == 0:\r\n return False\r\n return True\r\n\r\nn, m = list(map(int, input().split()))\r\nnext_prime = n+1\r\nwhile not is_prime(next_prime):\r\n next_prime += 1\r\n\r\nprint('YES' if next_prime == m else 'NO')", "n,m=map(int,input().split())\r\na=[ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\r\nif n in a and m in a and a.index(m)-a.index(n)==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def prime(num):\r\n if num > 1:\r\n s = int(num / 2)\r\n for i in range(2, s + 1):\r\n if num % i == 0:\r\n return False\r\n break\r\n return True\r\n\r\n\r\nm = list(input().split(\" \"))\r\nx = int(m[0])+1\r\ny = int(m[1])\r\nwhile True:\r\n if prime(x):\r\n if y == x:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n x = x + 1", "a,b = input().split(\" \")\r\na,b = int(a),int(b)\r\nimport math\r\ndef isPrime(n):\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\nif not isPrime(a):\r\n print(\"NO\")\r\nelse:\r\n if not isPrime(b):\r\n print(\"NO\")\r\n else:\r\n for i in range(a+1,b):\r\n if isPrime(i):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "import sys\n\n\ndef is_prime(m):\n for i in range(2, m):\n if m % i == 0:\n return False\n return True\n\n\nn, m = map(int, input().split(\" \"))\nnext_prime = n\nfor i in range(n + 1, m + 1):\n if(is_prime(i)):\n next_prime = i\n break\nif(next_prime != m):\n print(\"NO\")\nelse:\n print(\"YES\")\n", "\r\na,b=map(int,input().split())\r\nwhile True:\r\n a=a+1\r\n f=0\r\n for i in range(2,a):\r\n if a%i==0:\r\n f=1\r\n break\r\n if f==0:\r\n break\r\nif a==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m=map(int, input().split())\r\nn=n+1\r\nwhile(n):\r\n p=1\r\n for i in range(2, n):\r\n if(n%i==0):\r\n p=0\r\n break\r\n if(p==1):\r\n x=n\r\n break\r\n else:\r\n n=n+1\r\nif(x==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\ndef primeCheck(n):\r\n if n == 2:\r\n return n\r\n else:\r\n mx = math.ceil(n ** 0.5)\r\n for i in range(2, mx + 1):\r\n if n % i == 0:\r\n return -1\r\n break\r\n elif i == mx:\r\n return n\r\n\r\nn, m = map(int, input().split())\r\n\r\nfor i in range(n + 1, m + 1):\r\n if primeCheck(i) == i:\r\n break\r\n\r\nif i != m:\r\n print(\"NO\")\r\nelif i == m:\r\n if primeCheck(i) == i:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a = [True, True, True, True, False, True, False, True, False, False, False, True, False, True, False, False, False, True, False, True, False, False, False, True, False, False, False, False, False, True, False, True, False, False, False, False, False, True, False, False, False, True, False, True, False, False, False, True, False, False,False]\r\nm,n = map(int, input().split())\r\nif a[n]==False:\r\n print('NO')\r\n exit()\r\nelse:\r\n if a[m:n+1].count(True)>2:\r\n print('NO')\r\n else:\r\n print(\"YES\")", "def prost(chislo):\r\n for i in range(2,int(chislo**0.5+1)):\r\n if chislo % i == 0:\r\n return False\r\n else:\r\n return True\r\n\r\natot_den,sled_den = map(int,input().split())\r\n\r\nfor den in range(atot_den+1,sled_den):\r\n if prost(den):\r\n print(\"NO\")\r\n break\r\nelse:\r\n if prost(sled_den):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\na=0\r\n\r\ndef prime(x):\r\n i=2\r\n while i<x:\r\n if x%i==0:\r\n return False\r\n break\r\n i+=1\r\n return True\r\n\r\nfor i in range(n+1,m+1):\r\n if prime(i):\r\n a=i\r\n break\r\nif a==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "import math\n\ndef is_prime(num):\n num = abs(num)\n\n if num == 1:\n return False\n if num == 2:\n return True\n if not num % 2:\n return False\n\n i = 3\n while i <= math.sqrt(num):\n if num % i == 0:\n return False\n i += 2\n \n return True\n\nnums = input().split(\" \")\nn = int(nums[0])\nm = int(nums[1])\n\nis_prime_before = False\nif not is_prime(m):\n print('NO')\nelse:\n for i in range(n+1, m):\n if is_prime(i):\n is_prime_before = True\n\n if is_prime_before:\n print('NO')\n else:\n print('YES')\n", "def is_prime(n):\r\n if n<=1:\r\n return False\r\n elif n==2:\r\n return True\r\n elif n>2 and n%2==0:\r\n return False\r\n max_div = int(n**0.5)\r\n for i in range(3,max_div+1,2):\r\n if n%i==0:\r\n return False\r\n return True\r\nn,m=map(int,input().split())\r\nc=0\r\nwhile True:\r\n n+=1\r\n x=is_prime(n)\r\n if x:\r\n break\r\n else:\r\n pass\r\nif n == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def solve():\r\n n, m = map(int, input().split())\r\n for j in range(2, m):\r\n if m % j == 0:\r\n print('NO')\r\n return\r\n for i in range(n + 1, m):\r\n pos = True\r\n for j in range(2, i):\r\n if i % j == 0:\r\n pos = False\r\n if pos:\r\n print('NO')\r\n return\r\n print('YES')\r\n \r\nsolve()", "def isprime(n):\r\n for i in range(2, int((n**0.5)+1)):\r\n if n%i==0:\r\n return False\r\n return True\r\nn, m = map(int, input().split())\r\nl = []\r\nfor i in range(1, m+1):\r\n if isprime(i):\r\n l.append(i)\r\nif isprime(m) and (l.index(m)-l.index(n) == 1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "prime= [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\n\r\nx= input().split()\r\na=int(x[0])\r\nb=int(x[1])\r\nif a not in prime or b not in prime:\r\n print(\"NO\")\r\nelse:\r\n pos1= prime.index(a)\r\n pos2= prime.index(b)\r\n if pos2-pos1==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def isPrime(Number):\r\n return 2 in [Number,2**Number%Number]\r\na,b=map(int, input().split())\r\nif (isPrime(a) == False or isPrime(b)==False) :\r\n print('NO')\r\nelse:\r\n re=\"YES\"\r\n for i in range(a+1,b):\r\n if(isPrime(i)):\r\n re=\"NO\"\r\n break\r\n print(re)", "m,n = map(int,input().split())\r\ncount = 0\r\nnew_count = 0\r\nfirst_count =0\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n count+=1\r\nif count==2:\r\n new_count+=1\r\ncount = 0\r\nfor i in range(1,m+1):\r\n if m%i==0:\r\n count+=1\r\nif count==2:\r\n new_count+=1\r\nmin = min(m,n)\r\nmax = max(m,n)\r\ncount = 0\r\nif max!=min:\r\n for i in range(min+1,max):\r\n for j in range(1,i+1):\r\n if i%j == 0:\r\n count+=1\r\n\r\n\r\n if count>2:\r\n first_count=0\r\n elif count==2:\r\n first_count+=1\r\n break\r\n\r\n count=0\r\n\r\n\r\n if new_count==2 and first_count==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "import math\r\ndef prime(x):\r\n for i in range(2, int(math.sqrt(x)) + 1):\r\n if x % i == 0: return 0\r\n return 1\r\nn, m = map(int, input().split())\r\nch = 0\r\nfor i in range(n + 1, m + 1):\r\n if prime(i):\r\n ch = 1\r\n if i == m: print(\"YES\")\r\n else: print(\"NO\")\r\n break\r\nif ch == 0: print(\"NO\")", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\np=0\r\nfor i in range(n+1,m+1):\r\n f=0\r\n for j in range(1,i+1):\r\n if int(i%j)==0:\r\n f+=1\r\n if f == 2:\r\n p = i\r\n break;\r\nif p==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m= [int(i) for i in input().split()]\r\ndef checkPrime(x):\r\n if x==1:\r\n return False\r\n for i in range(2,x//2+1):\r\n if x%i==0:\r\n return False\r\n return True\r\nif checkPrime(m)==False:\r\n print('NO')\r\n quit()\r\nfor i in range(n+1,m):\r\n if checkPrime(i)==True:\r\n print('NO')\r\n quit()\r\nprint('YES')", "\r\n\r\nimport math\r\n\r\n\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\r\n if n == 2:\r\n return True\r\n if n > 2 and n % 2 == 0:\r\n return False\r\n\r\n max_div = math.floor(math.sqrt(n))\r\n for i in range(3, 1 + max_div, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nm, mn = [int(x) for x in input().split()]\r\n\r\nc = 0\r\nfor n in range(m+1, mn+1):\r\n ans = is_prime(n)\r\n\r\n if ans == True and mn == n:\r\n print(\"YES\")\r\n break\r\n\r\n elif ans == True and mn != n:\r\n print(\"NO\")\r\n break\r\n\r\n\r\nelse:\r\n print(\"NO\")\r\n", "a=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,999]\r\nb,c=map(int,input().split())\r\nl=0\r\nfor i in range(len(a)):\r\n if b==a[i]:\r\n l=i\r\n break\r\nif a[l+1]==c:\r\n print('YES')\r\nelse:\r\n print('NO')", "def soda(n):\r\n for i in range(2, n):\r\n if n % i == 0:\r\n return False\r\n return True\r\nn, m = map(int, input(). split())\r\nans = 'YES'\r\nif not soda(n) or not soda(m):\r\n print('NO')\r\nelse:\r\n for i in range(n + 1, m):\r\n if soda(i):\r\n ans = 'NO'\r\n break\r\n print(ans)\r\n", "d={}\r\nd[2]=3\r\nd[3]=5\r\nd[4]=5\r\nd[5]=7\r\nd[6]=7\r\nd[7]=11\r\nd[8]=11\r\nd[9]=11\r\nd[10]=11\r\nd[11]=13\r\nd[12]=13\r\nd[13]=17\r\nd[14]=17\r\nd[15]=17\r\nd[16]=17\r\nd[17]=19\r\nd[18]=19\r\nd[19]=23\r\nd[20]=23\r\nd[21]=23\r\nd[22]=23\r\nd[23]=29\r\nd[24]=29\r\nd[25]=29\r\nd[26]=29\r\nd[27]=29\r\nd[28]=29\r\nd[29]=31\r\nd[30]=31\r\nd[31]=37\r\nd[32]=37\r\nd[33]=37\r\nd[34]=37\r\nd[35]=37\r\nd[36]=37\r\nd[37]=41\r\nd[38]=41\r\nd[39]=41\r\nd[40]=41\r\nd[41]=43\r\nd[42]=43\r\nd[43]=47\r\nd[44]=47\r\nd[45]=47\r\nd[46]=47\r\nd[47]=53\r\nd[48]=53\r\nd[49]=53\r\nd[50]=53\r\nn,m=map(int,input().split())\r\nif (d[n]==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def prime(n):\r\n if n == 2:\r\n return True\r\n elif n%2 == 0:\r\n return False\r\n elif n%2 == 1:\r\n count = 0\r\n for i in range(2,n):\r\n if n % i == 0:\r\n count += 1\r\n if count > 0:\r\n return False\r\n return True\r\n\r\nn,m = list(map(int,input().split()))\r\nn += 1\r\nwhile True:\r\n if prime(n):\r\n break\r\n n += 1\r\n\r\nif n == m:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "def is_prime(n):\r\n for i in range(2, n):\r\n if n % i == 0:\r\n return False\r\n \r\n return True\r\n\r\ndef panoramix():\r\n m, n = input().split()\r\n\r\n for i in range(int(m) + 1, int(n)):\r\n if is_prime(i): return 'NO'\r\n \r\n if not is_prime(int(n)): return 'NO'\r\n \r\n return 'YES'\r\n \r\nprint(panoramix())", "#https://codeforces.com/problemset/problem/80/A\r\n\r\ninp = input()\r\ninp = inp.split(\" \")\r\n\r\nnum_1 = int(inp[0])\r\nnum_2 = int(inp[1])\r\n\r\n#num_1,num_2 = 7,9\r\nprime_numbers = [2,3]\r\n\r\ndef has_divisor(number_to_check,list_of_nums):\r\n for current_divisor in list_of_nums:\r\n if number_to_check % current_divisor == 0:\r\n return True\r\n return False\r\n\r\nfor current_num in range(2,num_2+1):\r\n if has_divisor(current_num,prime_numbers) == False:\r\n prime_numbers.append(current_num)\r\n\r\nif prime_numbers[-1] != num_1:\r\n if prime_numbers[prime_numbers.index(num_1)+1] == num_2:\r\n print (\"YES\")\r\n else:\r\n print (\"NO\")\r\nelse:\r\n print (\"NO\")", "from math import isqrt\r\n\r\ndef main(n, m):\r\n arr = [True] * m\r\n\r\n arr[0] = False\r\n\r\n for i in range(2, isqrt(m) + 1):\r\n for j in range(i * i, m + 1, i):\r\n arr[j - 1] = False\r\n\r\n for i in range(len(arr)):\r\n if arr[i] and i + 1 == n:\r\n for j in range(i + 1, len(arr)):\r\n if arr[j]:\r\n if j + 1 == m:\r\n return \"YES\"\r\n else:\r\n break\r\n\r\n return \"NO\"\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n\r\n print(main(n, m))", "a,b = map(int,input().split())\r\ns = ([x for x in range(a,a+b) if not [t for t in range(2,x) if not x%t]])\r\nif a == s[0] and b == s[1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import math\r\nimport sys\r\n\r\nINF = 2e18 + 99\r\n\r\ndef debug(n):\r\n print(n)\r\n\r\ndef prime_check(m):\r\n if m % 2 == 0:\r\n return False\r\n for i in range(3, int(math.sqrt(m)) + 1, 2):\r\n if m % i == 0:\r\n return False\r\n return True\r\n\r\nn, m = map(int, sys.stdin.readline().split())\r\n\r\nreal_m = None\r\nfor i in range(n + 1, m + 1):\r\n if prime_check(i):\r\n real_m = i\r\n break\r\n\r\nprint(\"YES\" if real_m == m else \"NO\")\r\n", "n, m = map(int, input().split())\r\ndef is_prime(n):\r\n for i in range(2, int(n**0.5)+1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\ncheck = True\r\nfor i in range(n+1, m+1):\r\n if (i!=m and is_prime(i)) or (i==m and not is_prime(i)):\r\n print(\"NO\")\r\n check = False\r\n break\r\n\r\nif check:\r\n print(\"YES\")", "prime=[True for i in range(10**6+4)]\r\nmajor=[]\r\ndef SOE():\r\n p=2\r\n while p<=10**6+2:\r\n if prime[p]==True:\r\n for i in range(p*p,10**6+2,p):\r\n prime[i]=False\r\n p+=1\r\n for i in range(2,10**6):\r\n if prime[i]:\r\n major.append(i)\r\nSOE()\r\nn,nn=map(int,input().split())\r\nfor i in range(n+100):\r\n if major[i]==n:\r\n break\r\nif major[i+1]==nn:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "def find_prime_in_range(a, b):\r\n for p in range(a, b):\r\n for i in range(2, p):\r\n if p % i == 0:\r\n break\r\n else:\r\n return p\r\n return None\r\n\r\nn,m = map(int,input().split())\r\na = find_prime_in_range(n+1, 2*n)\r\nif m==a:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "n, m = input().split()\r\n\r\nn = int(n)\r\nm = int(m)\r\n\r\nd = 2\r\nwhile m % d != 0:\r\n d += 1\r\nif m == d:\r\n k = False\r\nelse:\r\n k = True\r\n \r\n\r\nfor i in range(n+1, m+1):\r\n d = 2\r\n while i % d != 0:\r\n d += 1\r\n if i == d:\r\n \r\n break\r\n\r\nif i == m and k == False:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\n\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\r\n for i in range(2, int(n**0.5)+1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\ndef next_prime(n):\r\n i = n + 1\r\n while not is_prime(i):\r\n i += 1\r\n return i\r\n\r\nn, m = map(int, input().split())\r\n\r\nif is_prime(m) and next_prime(n) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = map(int, input().split(' '))\r\na = n\r\nb = m\r\np = []\r\n\r\nif a == 1:\r\n\tp.append(a)\r\n\ta += 1\r\n\tif b >= 2:\r\n\t\tp.append(a)\r\n\t\ta += 1\r\nif a == 2:\r\n\tp.append(a)\r\nif a % 2 == 0:\r\n\ta += 1\r\nfor i in range(a, b+1, 2):\r\n\tflag = 1\r\n\tj = 2\r\n\twhile j * j <= i:\t\r\n\t\tif i % j == 0:\r\n\t\t\tflag = 0\r\n\t\t\tbreak\r\n\t\tj += 1\r\n\tif flag == 1:\r\n\t\tp.append(i)\r\n# print(p)\r\nfor i, v in enumerate(p):\r\n\t# print(i, v)\r\n\t# print(n)\r\n\t# print(p[i+1])\r\n\tif v == n and m in p:\r\n\t\tif p[i+1] == m:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\n\r\n", "entered_list=input().split()\r\nnum_list=list(map(int,entered_list))\r\n\r\na=num_list[0]\r\nb=num_list[1]\r\nc=0\r\nfor i in range(b):\r\n if b%(i+1)==0:\r\n c+=1\r\nd=[]\r\nif c!=2:\r\n print('NO')\r\nif c==2:\r\n for i in range(b):\r\n if i>a:\r\n d.append(i)\r\n \r\n m=0\r\n f=0\r\n s=0\r\n# print(d)\r\n for num in d: #i это число в списке от a до b, типа 4\r\n f=0\r\n for i in range(num):\r\n if num%(i+1)==0:\r\n f+=1\r\n if f==2:\r\n s+=1\r\n if s==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "def is_prime(n):\r\n count = 0\r\n for i in range(1, int(n ** 0.5)+1):\r\n if n % i == 0:\r\n count += 1\r\n if count == 1:\r\n return True\r\n return False\r\n\r\nn, m = map(int, input().split())\r\nn += 1\r\n\r\nwhile not is_prime(n):\r\n n += 1\r\n\r\nif n == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "\"\"\"\r\n Panoramix's Prediction\r\n\"\"\"\r\ndef nextPrime(n):\r\n while True:\r\n if(n == 2):\r\n return 3\r\n elif(n == 3):\r\n return 5\r\n elif(n == 5):\r\n return 7\r\n else:\r\n n += 2\r\n if(n % 3 != 0 and n%5 != 0 and n%7 != 0):\r\n return n\r\nn, m = [int(x) for x in input().split()]\r\nnextP = nextPrime(n)\r\nif(nextP == m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\ndef is_prime(n):\r\n for i in range(2, math.ceil(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\nf = n\r\nfor i in range(n+1, m+1):\r\n if is_prime(i):\r\n f = i\r\n break\r\nif f == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "nm=input().split(\" \")\r\nn=int(nm[0])\r\nm=int(nm[1])\r\nprimes=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nni=primes.index(n)\r\nif m in primes and primes.index(m)==ni+1:\r\n print('YES')\r\nelse:\r\n print('NO')", "\n\nfrom math import sqrt\ndef is_prime(n):\n for i in range(2, int(sqrt(n)) + 1):\n if (n % i == 0):\n return False\n return True\n\ndef check_ok(start, end):\n for i in range(start, end, 1):\n if is_prime(i):\n return False\n return True\n\nx, y = map(int, input().split())\nif not is_prime(x) or not is_prime(y):\n print(\"NO\")\nelif not check_ok(x+1, y):\n print(\"NO\")\nelse:\n print(\"YES\")\n", "prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,47]\r\nx , y =map(int,input().split())\r\nif x in prime and y in prime :\r\n if prime.index(y) - prime.index(x) == 1 :\r\n print('YES')\r\n else :\r\n print('NO')\r\nelse:\r\n print('NO')", "# Problem: A. Panoramix's Prediction\n# Contest: Codeforces - Codeforces Beta Round 69 (Div. 2 Only)\n# URL: https://codeforces.com/problemset/problem/80/A\n# Memory Limit: 256 MB\n# Time Limit: 2000 ms\n# \n# Powered by CP Editor (https://cpeditor.org)\n\nn, m = map(int, input().split())\ndef _sieve(m):\n\tsize = m//2\n\tsieve = [1] * size\n\tlimit = int(m**0.5)\n\tfor i in range(1, limit):\n\t\tif sieve[i]:\n\t\t\tval = 2 * i + 1\n\t\t\ttemp = ((size-1) - i) // val\n\t\t\tsieve[i + val :: val] = [0] * temp\n\treturn [2] + [i * 2 + 1 for i, v in enumerate(sieve) if v and i > 0]\n\t\ntry:\n\tif _sieve(m + 1).index(m) - _sieve(m + 1).index(n) == 1: print(\"YES\")\n\telse: print(\"NO\")\nexcept:\n\tprint(\"NO\")\n", "n, m = map(int, input().split())\r\nnextPrime = 0\r\nfor x in range(n+1, m+1):\r\n prime = True\r\n for y in range(2, x):\r\n if (x % y == 0):\r\n prime = False\r\n break\r\n if prime:\r\n nextPrime = x\r\n break\r\nif nextPrime == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n ", "def is_prime(num):\r\n if num <= 1:\r\n return False\r\n if num <= 3:\r\n return True\r\n if num % 2 == 0 or num % 3 == 0:\r\n return False\r\n i = 5\r\n while i * i <= num:\r\n if num % i == 0 or num % (i + 2) == 0:\r\n return False\r\n i += 6\r\n return True\r\n\r\ndef find_next_prime(num):\r\n next_num = num + 1\r\n while not is_prime(next_num):\r\n next_num += 1\r\n return next_num\r\n\r\nn, m = map(int, input().split())\r\n\r\nif find_next_prime(n) == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\nn, k = list(map(int, input().split()))\ndef isPrime(n) :\n for i in range(2, int(math.sqrt(n))+1) :\n if(n % i == 0) : return False\n return True\n\nif(not(isPrime(k))) : print(\"NO\")\nelse :\n c = 0\n for i in range(n+1, k) :\n if(isPrime(i)) : c += 1\n if(c == 0) : print(\"YES\")\n else : print(\"NO\")\n", "n,m=map(int, input().split())\r\ndef is_prime(p):\r\n if p<=1:\r\n return False\r\n if p<=3:\r\n return True\r\n if p%2==0 or p%3==0:\r\n return False\r\n i = 5\r\n while i*i<=p:\r\n if p%i==0 or p%(i+2)==0:\r\n return False\r\n i+=6\r\n return True\r\nnex=n+1\r\nwhile not is_prime(nex):\r\n nex+=1\r\nif m==nex:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "MAX = 100\r\nprime = [ True for i in range(MAX)]\r\ndef sieve():\r\n p = 2\r\n while(p*p < MAX):\r\n if(prime[p] == True):\r\n for i in range(2*p, MAX, p):\r\n prime[i] = False\r\n p += 1\r\nsieve()\r\nn, m = map(int, input().split())\r\nif prime[n] and prime[m]:\r\n nextN = n + 1\r\n while((not prime[nextN]) and nextN < 100):\r\n nextN += 1\r\n if nextN == m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "a=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(a[0],a[1]+1):\r\n if i>1:\r\n for j in range(2,i):\r\n if i%j==0:\r\n break\r\n else:\r\n b.append(i)\r\nif a==b[:2]:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "def isprime(n):\r\n for i in range(2, n):\r\n if n%i==0:\r\n return False\r\n else: return True\r\n\r\n\r\nn,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nfor i in range(n+1, 51):\r\n if isprime(i):\r\n if i == m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\r\nif i==50:\r\n print(\"NO\")\r\n", "l=[2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47, 52]\r\nn,m=map(int,input().split())\r\nfor i in range(len(l)):\r\n k=l.index(n)\r\n if l[k+1]==m:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n", "n, m = map(int, input().split()); \r\ndef prime(n):\r\n for i in range(2, (n // 2) + 1, 1): \r\n if n % i == 0:\r\n return False; \r\n return True; \r\n \r\ndef next_prime(n):\r\n x = n + 1;\r\n while True: \r\n if prime(x):\r\n return x; \r\n else: \r\n x += 1; \r\n \r\nif m == next_prime(n):\r\n print(\"YES\");\r\nelse:\r\n print(\"NO\"); ", "n,m=list(map(int,input().split()))\r\nfor i in range(n+1,m+1) :\r\n\ttype=True\r\n\tfor j in range(2,i):\r\n\t\tif i%j==0:\r\n\t\t\ttype=False\r\n\t\t\tbreak\r\n\tif type:\r\n\t\tif i==m:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\t\texit(0)\r\n\r\nprint(\"NO\")", "#Panoramix's Prediction\r\n\r\nn = list(map(int, input().split()))\r\n\r\nnextPrime = n[0]\r\nprime = False\r\ncount = 0\r\n\r\nwhile not prime:\r\n nextPrime += 1\r\n prime = True\r\n for i in range(2, int(nextPrime ** 0.5) + 1):\r\n if nextPrime % i == 0:\r\n prime = False\r\n break\r\n\r\nif nextPrime == n[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n", "'''\nAuthor : knight_byte\nFile : A_Panoramix_s_Prediction.py\nCreated on : 2021-04-19 15:00:28\n'''\nimport math\n\n\ndef is_prime(n):\n if n <= 1:\n return False\n max_div = math.floor(math.sqrt(n))\n for i in range(2, 1 + max_div):\n if n % i == 0:\n return False\n return True\n\n\ndef main():\n a, b = map(int, input().split())\n\n if not is_prime(a) or not is_prime(b):\n print(\"NO\")\n else:\n for i in range(a+1, b+1):\n if is_prime(i) and i == b:\n print(\"YES\")\n break\n elif is_prime(i) and i != b:\n print(\"NO\")\n break\n\n\nif __name__ == '__main__':\n main()\n", "def is_prime(num):\r\n if num <= 1:\r\n return False\r\n if num <= 3:\r\n return True\r\n if num % 2 == 0 or num % 3 == 0:\r\n return False\r\n i = 5\r\n while i * i <= num:\r\n if num % i == 0 or num % (i + 2) == 0:\r\n return False\r\n i += 6\r\n return True\r\nn, m = map(int, input().split())\r\nnext_prime = n + 1\r\nwhile not is_prime(next_prime):\r\n next_prime += 1\r\n\r\nif m == next_prime:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = list(map(int,input().split()))\r\ndef prime(x):\r\n\tc=0\r\n\tfor j in range(1,x+1):\r\n\t\tif x%j==0:\r\n\t\t\tc+=1\r\n\tif c==2:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn 0\r\n\t\t\r\nfor i in range(n+1,m+1):\r\n\tif prime(i) == 1:\r\n\t\tb = i\r\n\t\tbreak\r\n\telse:\r\n\t\tb = -1\r\n\r\nif b==m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def isPrime(n):\r\n for i in range(2,n):\r\n if n%i==0:\r\n return False\r\n return True\r\nn, m = map(int,input().split())\r\ni = n+1\r\nwhile True:\r\n if isPrime(i):\r\n if i==m:\r\n print('YES')\r\n else:\r\n print('NO')\r\n break\r\n i+=1", "n,k=map(int,input().split())\r\nl=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nif k in l:\r\n p=l.index(k)-l.index(n)\r\n if p==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\n\nimport math\n\ndef sieve(n):\n ass = []\n is_prime = [True]*(n+1)\n is_prime[0] = False\n is_prime[1] = False\n\n for i in range(2, int(math.sqrt(n))+1):\n if not is_prime[i]:\n continue\n for j in range(i*2, n+1, i):\n is_prime[j] = False\n for i in range(n+1):\n if is_prime[i]:\n ass.append(i)\n return(ass)\n\ns = sieve(100)\nfor i in range(len(s)):\n if s[i] == n:\n break\n\nfor j in range(len(s)):\n if s[j] == m:\n break\n\nelse:\n print('NO')\n exit()\n\nif j-i == 1:\n print('YES')\nelse:\n print('NO')\n", "from math import sqrt\r\n\r\ndef is_prime(n):\r\n n = int(n)\r\n for i in range(2, int(sqrt(n))+1):\r\n if(n%i == 0):\r\n return 0\r\n return 1\r\n\r\nf, n = map(int, input().split())\r\n\r\nif (not is_prime(n)):\r\n print(\"NO\")\r\n exit()\r\n \r\nfor i in range(f+1,n):\r\n if (is_prime(i)):\r\n print(\"NO\")\r\n exit()\r\n \r\nprint(\"YES\")", "def prime(a):\r\n if a==1:\r\n return False\r\n if a==2:\r\n return True\r\n for i in range(2,int(a**0.5)+1):\r\n if a%i==0:\r\n return False\r\n return True\r\n\r\nn,m=map(int,input().split())\r\nx = n+1\r\nwhile not prime(x):\r\n x+=1\r\nif x==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "def main():\n n, m = map(int, input().split())\n pp = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53)\n print(('NO', 'YES')[pp[pp.index(n) + 1] == m])\n\n\nif __name__ == '__main__':\n main()\n", "def is_prime(n):\r\n if n <= 1:\r\n return False\r\n if n <= 3:\r\n return True\r\n if n % 2 == 0 or n % 3 == 0:\r\n return False\r\n i = 5\r\n while i * i <= n:\r\n if n % i == 0 or n % (i + 2) == 0:\r\n return False\r\n i += 6\r\n return True\r\ndef next_prime(after):\r\n if after < 2:\r\n return 2\r\n if after == 2:\r\n return 3\r\n \r\n candidate = after + 1 if after % 2 == 0 else after + 2\r\n while True:\r\n if is_prime(candidate):\r\n return candidate\r\n candidate += 2\r\na,b = map(int,input().split(\" \"))\r\nnext_prime_number = next_prime(a)\r\nif is_prime(a) and is_prime(b):\r\n if next_prime_number == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\na,b = map(int,input().split())\r\nx = prime.index(a)\r\nif a == 47:\r\n print('NO')\r\nelif prime[x+1]==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_prime(num):\r\n if num > 1:\r\n for i in range(2, num):\r\n if (num % i) == 0:\r\n return False\r\n\r\n else:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nn, m = map(int, input().split())\r\nfor j in range(n + 1, m):\r\n if is_prime(j):\r\n print(\"NO\")\r\n break\r\nelse:\r\n if is_prime(m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "inp = list(map(int, input().split()))\r\nfor i in range(inp[0]+1,inp[1] + 1 ):\r\n flag = 0\r\n for j in range(2,i):\r\n if i % j == 0:\r\n flag = 0\r\n break\r\n else:\r\n flag += 1\r\n if flag != 0:\r\n if i < inp[1]:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nif flag == 0:\r\n print(\"NO\")", "a = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,53]\r\nn,m=map(int,input().split())\r\nb = a.index(n)\r\nif a[b+1] == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "c=0\r\np=0\r\nn,m=map(int,input().split())\r\nf=True\r\nfor i in range(2, int(m/2)+1):\r\n if (m % i) == 0:\r\n print('NO')\r\n f=False\r\n break\r\n \r\n \r\n \r\n \r\n \r\nfor i in range(n+1,m+1):\r\n for j in range(2, m+1):\r\n if (i % j) == 0:\r\n c+=1\r\n \r\n if c==1:\r\n p+=1\r\n c=0\r\nif f:\r\n if p==0 or p>1:\r\n print('NO')\r\n elif p==1:\r\n print('YES')", "a, b = map(int, input().split())\nl = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\nif l[l.index(a)+1] == b:\n print(\"YES\")\nelse:print(\"NO\")\n\t\t \t\t \t \t \t\t \t \t\t\t\t \t\t\t \t", "import math\n\ndef isPrime(num): \n i = 2 \n while i < math.sqrt(num)+1: \n if num % i == 0:\n return False\n i += 1\n return True\n\nn, m = map(int, input().split())\nif not isPrime(m): \n print(\"NO\")\n exit()\nfor i in range(n+1, m): \n if isPrime(i): \n print(\"NO\")\n exit()\nprint(\"YES\")\n", "def prime(x):\r\n flag=0\r\n for i in range(2,x+1):\r\n if x%i==0 and i!=x:\r\n flag=1\r\n if x==2:\r\n return True\r\n elif flag==1:\r\n return False\r\n else:\r\n return True\r\n\r\nn,m=map(int,input().split())\r\n\r\ndef nextprime(n2):\r\n p=prime(n2)\r\n if p:\r\n return n2\r\n else:\r\n return nextprime(n2+1)\r\n \r\nnp=nextprime(n+1)\r\nif np==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nc,d=map(int,input().split())\r\nflag=False\r\nfor i in range(1,len(a)):\r\n if c==a[i-1] and d==a[i]:\r\n flag=True\r\n print('YES')\r\nif flag==False:\r\n print('NO')\r\n", "def isprime(n):\r\n\tif n <= 4 or n%2 == 0:\r\n\t\treturn n == 2 or n == 3\r\n\tfor i in range(3, int(n**0.5)+1, 2):\r\n\t\tif n%i == 0:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\r\nn, m = map(int, input().split())\r\nf = not isprime(m)\r\nfor x in range(n+1,m):\r\n\tf += isprime(x)\r\n\tif f: break\r\nprint('YNEOS'[f>0::2])\r\n", "a=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,51]\nn,m=map(int,input().split())\nif a[a.index(n)+1]==m:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t\t \t \t\t\t \t \t\t\t \t\t\t \t\t \t\t", "n, m = map(int, input().split())\r\nx = []\r\nfor i in range(2, 48):\r\n count = 0\r\n for j in range(i-1, 1, -1):\r\n if i % j == 0:\r\n count += 1\r\n if count == 0:\r\n x.append(i)\r\nif x.index(n) == (len(x) - 1):\r\n print(\"NO\")\r\nelif x[x.index(n) + 1] == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A, B = map(int, input().split())\r\nC = []\r\n\r\nfor i in range(A+1, B + 1):\r\n f = 0\r\n for j in range(2, int(i ** 0.5) + 1):\r\n if i % j == 0:\r\n f = 1\r\n break\r\n\r\n if f == 0 and i > 1:\r\n C.append(i)\r\n\r\n\r\n\r\nif C and C[0] == B:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "pr = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nx, y = map(int, input().split())\r\nif y in pr:\r\n if pr.index(y) == pr.index(x) + 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def prime_check(x):\r\n for i in range(2,x):\r\n if(x%i==0):\r\n return False\r\n return True\r\ndef next_prime(y):\r\n while True:\r\n if(prime_check(y+1)==True):\r\n return y+1\r\n else:\r\n return next_prime(y+1)\r\nn,m=map(int,input().split())\r\nif(prime_check(m)==True):\r\n if(next_prime(n)==m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\n\r\ndef isPrime(n):\r\n if (n <= 1):\r\n return False\r\n if (n <= 3):\r\n return True\r\n if (n % 2 == 0 or n % 3 == 0):\r\n return False\r\n for i in range(5, int(math.sqrt(n) + 1), 6):\r\n if (n % i == 0 or n % (i + 2) == 0):\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef nextPrime(N):\r\n if (N <= 1):\r\n return 2\r\n\r\n prime = N\r\n found = False\r\n while (not found):\r\n prime = prime + 1\r\n\r\n if (isPrime(prime) == True):\r\n found = True\r\n\r\n return prime\r\n\r\n\r\nn = input().split(\" \")\r\nnext = nextPrime(int(n[0]))\r\nif next == int(n[1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "arr = []\r\narr1 = [2, 3, 5, 7]\r\nfinal = []\r\n\r\nimport sys\r\nfor x in range(2, 10000):\r\n arr.append(x)\r\n \r\narr.remove(2)\r\narr.remove(3)\r\narr.remove(5)\r\narr.remove(7)\r\n\r\nfor x in arr: \r\n if x % 2 != 0 and x % 3 != 0 and x % 5 != 0 and x % 7 != 0:\r\n arr1.append(x)\r\n \r\na = str(input()).split()\r\nb = [int(x) for x in a]\r\n\r\nfor x in range(0, len(arr1)):\r\n if arr1[x] == b[0] and arr1[x+1] == b[1]:\r\n print(\"YES\")\r\n sys.exit()\r\n\r\nprint(\"NO\")", "M,N=input().split()\r\nM,N=int(M),int(N)\r\nl,n=[],[]\r\nfor i in range(2,N+1):\r\n l.append(i)\r\n n.append(0)\r\nln=len(l)\r\nk=1\r\nfor i in range(ln):\r\n k=l[i]\r\n for j in range(i+1,ln):\r\n if l[j]%k==0:\r\n n[j]=1\r\nif n[l.index(N)]==1:\r\n print(\"NO\")\r\nelse:\r\n for i in range(l.index(M)+1,l.index(N)):\r\n if n[i]==0:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n", "list=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m=map(int,input().split()) \r\nif m not in list:\r\n print(\"NO\")\r\nelif m in list:\r\n p=list.index(n)\r\n q=list.index(m)\r\n r=p+1\r\n s=q+1\r\n if r+1==s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "c = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nn, m = map(int, input().split())\r\na = c.index(n)\r\nif c[a+1] == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\ndef es_primo(numero):\r\n if numero == 2 and numero == 3:\r\n return True\r\n elif numero % 2 == 0:\r\n return False\r\n else:\r\n i = 3\r\n while i <= numero // 2:\r\n if numero % i == 0:\r\n return False\r\n i = i+2\r\n return True\r\n\r\ndatos = input().split()\r\nn = int(datos[0]) \r\nm = int(datos[1])\r\n\r\nif es_primo(m):\r\n i = n + 1\r\n while i<m:\r\n if es_primo(i):\r\n print('NO')\r\n break\r\n i = i+1\r\n if i == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "a,b=map(int,input().split())\r\nlst=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nprint(\"NO\" if b!=lst[lst.index(a)+1] or a==47 else \"YES\")", "from math import ceil, pow\r\n\r\nx, z = map(int, input().split())\r\n\r\nnext_prime = 0\r\n\r\nfor i in range(x + 1, 54):\r\n \r\n isPrime = True\r\n for y in range(2, ceil(pow(z, 0.5)) + 1):\r\n if i % y == 0:\r\n isPrime = False\r\n break\r\n \r\n if isPrime: \r\n if x == 2:\r\n next_prime = 3\r\n else:\r\n next_prime = i \r\n break\r\n \r\nif next_prime == z:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "import math\r\nn,m = map(int,input().split())\r\nc = 0\r\nl = []\r\nfor i in range(n+1, m+1):\r\n if i>1:\r\n for j in range(2,i):\r\n if(i % j==0):\r\n break\r\n else:\r\n l.append(i)\r\n c = c+1\r\n#print(l)\r\n#print(c)\r\nif c>=1:\r\n if l[0] == m:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "from math import sqrt\r\ndef isPrime(n):\r\n for i in range(int(sqrt(n)),1,-1):\r\n if n%i==0:\r\n return False\r\n return True\r\nn,m=map(int,input().split())\r\nn=n+1\r\nwhile not isPrime(n):\r\n n=n+1\r\nif n==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "\r\ndef is_prime(num):\r\n if num>1:\r\n for i in range(2,num):\r\n if num%i == 0:\r\n return False\r\n \r\n return True\r\n \r\n \r\n#print(is_prime(2))\r\n\r\nline = input().split(' ')\r\na = int(line[0])\r\nb = int(line[1])\r\n\r\n#print(a)\r\n#print(b)\r\n\r\nlist_prime = []\r\n\r\nfor i in range(b+1):\r\n if is_prime(i):\r\n list_prime.append(i)\r\n #print(i,' ', end = '')\r\n \r\n#print(list_prime) \r\n#print(list_prime[-1])\r\n#print(list_prime[-2])\r\n\r\nif b == list_prime[-1] and a == list_prime[-2]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Apr 16 04:33:41 2020\r\n\r\n@author: Kashem Pagla\r\n\"\"\"\r\n\r\nm1=''\r\na=0\r\nn,m=map(int, input().split())\r\n\r\nfor i in range(n+1,m+1):\r\n for j in range(2,i):\r\n if(i%j==0) :\r\n m1=\"NO\"\r\n# print(m1)\r\n break\r\n else:\r\n m1=\"YES\"\r\n a=i\r\n# print(m1)\r\n if(m1==\"YES\"): break \r\n \r\nprint(m1 if a==m else \"NO\") ", "def nex(n):\r\n for i in range(2,n+1):\r\n if (n+1)%i==0:\r\n return nex(n+1)\r\n return n+1\r\n(a,b)=map(int,input().split())\r\nif b==nex(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=map(int,input().split())\r\nif(a>b):\r\n print(\"NO\")\r\nelse:\r\n i=a+1\r\n while(1):\r\n count=0\r\n for j in range(1,i+1):\r\n if(i%j==0):\r\n count+=1\r\n if(count==2):\r\n c=i\r\n break\r\n i+=1\r\n if(b==c):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\n\n\ndef is_prime(n):\n if n % 2 == 0:\n return False\n\n for i in range(3, math.floor(math.sqrt(n)) + 1, 2):\n if n % i == 0:\n return False\n\n return True\n\n\n[x, y] = input().split()\n\nisNext = is_prime(int(y))\nfor i in range(int(x) + 1, int(y)):\n if is_prime(i):\n isNext = False\n break\n\nif isNext:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "\r\ndef isprime(num):\r\n for i in range(2, num):\r\n if num%i == 0:\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\n\r\nnext_prime = -1\r\nfor num in range(n+1, m+1):\r\n if isprime(num):\r\n next_prime = num\r\n break\r\n\r\nprint('YES' if next_prime == m else 'NO')\r\n", "l=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m=map(int,input().split())\r\nx=l.index(n)\r\nif(n!=47):\r\n if(m==l[x+1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def isPrime(n):\r\n for i in range(2,int(pow(n,0.5))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\nn,m=map(int,input().split())\r\nprime=0\r\nfor i in range(n+1,m+1):\r\n if isPrime(i):\r\n prime=i\r\n break\r\nif prime==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\ndef primecheck(num):\r\n count=0\r\n for i in range(1,num+1):\r\n if num%i==0:\r\n count=count+1\r\n if count==2:\r\n mylist.append(i)\r\n \r\nmylist=[]\r\nip, exp=map(int,(input().split()))\r\nfor i in range( ip+1,50):\r\n primecheck(i)\r\nif len(mylist)>0:\r\n actual= (min(mylist))\r\n if actual==exp:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "i=input().split()\r\ni[0],i[1]=int(i[0]),int(i[1])\r\nflag=True\r\na=i[0]+1\r\ndef chek(q):\r\n j,count=0,0\r\n flag=True\r\n for i in range(q,0,-1):\r\n if q%i==0:\r\n count+=1\r\n if count>2:\r\n flag=False\r\n break\r\n if flag==True:\r\n return True\r\nwhile flag==True:\r\n if chek(a)==True:\r\n prime=a\r\n flag=False\r\n else:\r\n a+=1\r\nif prime==i[1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\n\"\"\"\nCreated on Fri Jan 8 09:33:24 2021\n\n@author: king\n\"\"\"\n\nres=0\nst=input().split()\nn=int(st[0])\nm=int(st[1])\n\nfor i in range(n+1, m+1): \n if i>1: \n \tfor j in range(2,i): \n \t\tif(i % j==0): \n \t\t\tbreak\n \telse:\n res=i\n break\n \nif res==m:\n print('YES')\nelse:\n print('NO')\n", "a, b = map(int, input().split())\r\nn = a+1\r\nwhile(True):\r\n flag = False\r\n for i in range(2,n):\r\n if(n%i == 0):\r\n flag = True\r\n break\r\n if(flag):n+=1\r\n elif(n > b): break\r\n else: break\r\nif(n == b):print(\"YES\")\r\nelse: print(\"NO\")", "def is_prime(n: int) -> bool:\n if n <= 3:\n return n > 1\n if n & 1 == 0 or n % 3 == 0:\n return False\n i = 5\n while i ** 2 <= n:\n if n % i == 0 or n % (i + 2) == 0:\n return False\n i += 6\n return True\n\ndef next_prime(n):\n if n < 2: return 2\n\n p = None\n\n while p is None:\n n += 1\n if is_prime(n):\n p = n\n\n return n\n\nn = list(map(int, input().split()))\n\nprint(\"YES\" if next_prime(n[0]) == n[1] else \"NO\")\n", "n,m = map(int,input().split())\r\n\r\ndef prime(num):\r\n\r\n\tfor i in range(2,num):\r\n\t\tif num%i == 0:\r\n\t\t\treturn \tFalse\r\n\r\n\treturn True\r\n\r\n\r\nfor i in range(n+1,m):\r\n\tif prime(i) == True:\r\n\t\tprint(\"NO\")\r\n\t\tquit()\r\n\r\nif prime(m):\r\n\tprint(\"YES\")\r\n\r\nelse:\r\n\tprint(\"NO\")", "a=list(map(int,input().split()))\r\nfor i in range(a[0]+1,2**31):\r\n for j in range(2,(i//2)+1):\r\n if i%j==0:\r\n break\r\n else:\r\n b=i\r\n break\r\nif b==a[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "n,m=map(int,input().split())\r\na=[]\r\nt=0;\r\nfor i in range(n+1,100):\r\n k=0;\r\n\r\n for j in range(2,i//2+1):\r\n if i%j==0:\r\n k+=1;\r\n if k<=0:\r\n t=i;\r\n break;\r\nif t==m:\r\n print('YES');\r\nelse:\r\n print('NO');\r\n", "pros_chi = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m = map(int,input().split())\r\nif n > m:\r\n print('NO')\r\n exit()\r\nelse:\r\n pass\r\nfor i in range(len(pros_chi)-1):\r\n if n == pros_chi[i] and m == pros_chi[i+1]:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "def isPrime(x):\r\n for fact in range(2,x):\r\n if x%fact == 0:\r\n return False\r\n return True\r\nn,m = map(int,input().split())\r\n\r\nisPrimeFound = False\r\nfor i in range(n+1,m):\r\n if isPrime(i):\r\n isPrimeFound = True\r\n break\r\n\r\nif not isPrimeFound:\r\n print('YES' if isPrime(m) else 'NO')\r\nelse:\r\n print('NO')\r\n\r\n ", "n, m = map(int, input().split())\r\n\r\nfor j in range(n + 1, m + 1):\r\n\tfor i in range(2, j):\r\n\t\tif j % i == 0:\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif j == m:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\n[n, m] = list(map(int, input().split(\" \")))\npos = p.index(n)\nprint(\"YES\" if m == p[pos+1] else \"NO\")\n", "n, m= map(int, input().split())\r\nl = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nif m in l:\r\n if l.index(n) == l.index(m) - 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def prime(n):\r\n if n==1: return 0\r\n elif n==2: return 1\r\n elif n%2==0: return 0\r\n else:\r\n z=1\r\n for i in range(3,n,2):\r\n if n%i==0: z=0\r\n return z\r\nn,m=map(int,input().split())\r\nn+=1\r\nk=1\r\nwhile n<=m:\r\n if prime(n) and n<m:\r\n k=0\r\n break\r\n elif n==m:\r\n if not(prime(m)):\r\n k=0\r\n n+=1\r\nprint(\"YES\" if k else \"NO\")\r\n", "n, m = map(int, input().split())\r\ns = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,]\r\nif m in s and s.index(m) - s.index(n) == 1:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')", "next_prime = {2: 3, 3: 5, 5: 7, 7: 11, 11: 13, 13: 17, 17: 19, 19: 23, 23: 29, 29: 31, 31: 37, 37: 41, 41: 43, 43: 47, 47: 51}\r\nfirst_prime, second_prime = tuple(map(int, input().split()))\r\nif next_prime[first_prime] == second_prime:\r\n print(\"YES\", end = '')\r\nelse:\r\n print('NO', end = '')", "def isPrime(x):\r\n y = x // 2 + 1\r\n for i in range(2, y):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\ninp = [int(x) for x in input().split()]\r\nn = inp[0]\r\nm = inp[1]\r\n\r\nnt = True\r\nfor i in range(n+1, m, 1):\r\n if isPrime(i):\r\n nt = False\r\n break\r\n\r\nif nt == False:\r\n print('NO')\r\nelse:\r\n if isPrime(m):\r\n print('YES')\r\n else:\r\n print('NO')", "import math\r\ndef isPrime(n): \r\n \r\n # Corner cases \r\n if(n <= 1): \r\n return False\r\n if(n <= 3): \r\n return True\r\n \r\n # This is checked so that we can skip \r\n # middle five numbers in below loop \r\n if(n % 2 == 0 or n % 3 == 0): \r\n return False\r\n \r\n for i in range(5,int(math.sqrt(n) + 1), 6): \r\n if(n % i == 0 or n % (i + 2) == 0): \r\n return False\r\n \r\n return True\r\ndef nextPrime(N): \r\n \r\n # Base case \r\n if (N <= 1): \r\n return 2\r\n \r\n prime = N \r\n found = False\r\n \r\n # Loop continuously until isPrime returns \r\n # True for a number greater than n \r\n while(not found): \r\n prime = prime + 1\r\n \r\n if(isPrime(prime) == True): \r\n found = True\r\n \r\n return prime\r\n\r\nN,m =[int(x) for x in input().split()] \r\nm1=nextPrime(N) \r\nif m==m1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def isprime(n):\r\n p=1\r\n for i in range(2,n):\r\n if n%i==0:\r\n p=0\r\n return p\r\nn,m=input().split()\r\nm=int(m)\r\nn=int(n)\r\nnext=n+1\r\nwhile(True):\r\n if isprime(next)==1:\r\n break\r\n next=next+1\r\nif m==next:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "a,b=map(int,input().split())\nwhile(a>0):\n count=0\n a=a+1\n for i in range(2,a):\n if(a%i==0):\n count=count+1\n if(count==0):\n m=a\n break\nif(m==b): \n print(\"YES\")\nelse:\n print(\"NO\")", "x=input().split()\r\nm=int(x[0])\r\nn=int(x[1])\r\ny=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nd={2: 0, 3: 1, 5: 2, 7: 3, 11: 4, 13: 5, 47: 14, 17: 6, 37: 11, 19: 7, 43: 13, 23: 8, 29: 9, 31: 10,41:12}\r\nif d[m]+1<=14 and n==y[d[m]+1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\ndef is_prime(val):\r\n if val == 1:\r\n return True\r\n for i in range(2, int(val/2) +1):\r\n if val % i == 0:\r\n return False\r\n else:\r\n return True\r\n\r\n\r\n\r\ni = input()\r\ni = i.split()\r\nx = int(i[1])\r\nif is_prime(x):\r\n for n in range(int(i[0]) + 1, x):\r\n if is_prime(n):\r\n print(\"NO\")\r\n break\r\n\r\n else:\r\n print(\"YES\")\r\nif not is_prime(x):\r\n print(\"NO\")\r\n\r\n", "def prime(num):\r\n i1=2\r\n if(num==2):\r\n return True\r\n for i in range(2,num):\r\n if(num%i==0):\r\n return False\r\n return True\r\n \r\nlistinputs = [int(num) for num in input().split()]\r\nn = listinputs[0]\r\nm = listinputs[1]\r\ni = n+1\r\nc=0\r\nwhile(i<=m):\r\n if(prime(i)==True):\r\n if(i==m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n c=1\r\n break;\r\n else:\r\n i+=1\r\nif(c==0):\r\n print(\"NO\")\r\n ", "a=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nn,m=map(int,input().split())\r\nflag=True\r\nfor i in range(len(a)-1):\r\n if(a[i]==n and a[i+1]==m):\r\n print(\"YES\")\r\n flag=False\r\n break\r\nif flag:\r\n print(\"NO\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n n,m = [int(item) for item in input().split(\" \")]\r\n prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97]\r\n mulai = prime.index(n)\r\n if(prime[mulai+1] == m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == '__main__':\r\n main()", "import math\r\nn,m=map(int,input().split())\r\n\r\ndef check_for_prime(m):\r\n is_prime=0\r\n for i in range(2,int(math.sqrt(m))+1):\r\n if m%i==0:\r\n is_prime=1\r\n\r\n if is_prime==1:\r\n return 0\r\n else:\r\n return 1\r\n\r\n# arr=[] \r\n# for i in range(2,50):\r\n# if check_for_prime(i):\r\n# arr.append(i)\r\narr=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nif m not in arr:\r\n print(\"NO\") \r\nelse:\r\n if arr.index(m)-arr.index(n)==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nx=n+1\r\nans=0\r\nwhile x<=m:\r\n f=True\r\n z=2\r\n while z<=x/2:\r\n if x%z==0:\r\n f=False\r\n break\r\n z+=1\r\n if z>x/2 and f:\r\n ans=x\r\n break\r\n x+=1\r\nprint([\"NO\",\"YES\"][m==ans])", "initNo,finNo=input().split(\" \")\r\ninitNo=int(initNo)\r\nfinNo=int(finNo)\r\n\r\nt=1\r\nflag=True\r\nfor j in range(initNo+1,finNo):\r\n flag=True\r\n for i in range(2,j//2+1):\r\n if j%i==0:\r\n flag=False\r\n break\r\n \"\"\"print(flag)\"\"\"\r\n if(flag==True):\r\n t=0\r\n print(\"NO\")\r\n break\r\n\"\"\"\"\"print(flag)\"\"\"\"\"\r\nif flag==True and t!=0 or flag==False:\r\n flag=True\r\n for i in range(2,finNo//2+1):\r\n if finNo%i==0:\r\n flag=False\r\n break\r\n\r\n if flag==True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def isprime(x):\r\n for i in range(2, int(x**0.5)+1):\r\n if x%i == 0:\r\n return False\r\n break\r\n return True\r\n \r\nn, m = map(int, input().split())\r\nt = n+1\r\nwhile True:\r\n if isprime(t):\r\n break\r\n else:\r\n t += 1\r\nprint(['NO', 'YES'][m == t])\r\n", "t = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nn,m=map(int,input().split())\r\nif n in t and m in t:\r\n if(t.index(m)==t.index(n)+1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "# A. Panoramix's Prediction\r\n\r\nl=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\r\nn,m=map(int,input().split())\r\ncount=0\r\nfor i in range(len(l)-1):\r\n if n==l[i] and m==l[i+1]:\r\n count+=1\r\n break\r\n\r\n\r\nif count==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "# len(str(n)) == len(set(str(n))) - проверка, явяляются ли все цифры в числе различными\n\n\na, b = map(int, input().split())\nspisok = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 51]\ncounter = 0\nfor i in range(len(spisok) - 1):\n if spisok[i] == a and spisok[i + 1] == b:\n counter += 1\nif counter != 0:\n print('YES')\nelse:\n print('NO')\n\n\n\n", "n,m=map(int,input().split())\r\na=[]\r\ndef isprime(n):\r\n\tflag=0\r\n\tfor i in range(2,n):\r\n\t\tif n%i==0:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\tif flag==1:\r\n\t\treturn False\r\n\telse:\r\n\t\treturn True\r\nfor i in range(2,max(n,m)+1):\r\n\tif isprime(i):\r\n\t\ta.append(i)\r\nif a[-2]==min(n,m) and a[-1]==max(n,m):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import math\r\ndef prime(n):\r\n if(n==0 or n==1 or n%2==0):\r\n return False\r\n elif(n==2):\r\n return True\r\n else:\r\n for i in range(3,math.floor(n**0.5)+1,2):\r\n if(n%i==0):\r\n return False\r\n return True\r\nn,m=map(int,input().split())\r\ns=0\r\nfor i in range(n+1,m+1):\r\n if(prime(i)):\r\n if(i==m):\r\n s=1\r\n else:\r\n s=0\r\n break\r\nif(s==1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from math import floor\r\ndef isPrime(num):\r\n for i in range(2, floor(num ** (1/2)) + 1):\r\n if num % i == 0 and i != num:\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\ndoom = True\r\n\r\nfor i in range(n + 1, m):\r\n if isPrime(i):\r\n doom = False\r\n break\r\n \r\nif not isPrime(m):\r\n doom = False\r\nif doom:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# n = int(input())\r\n\r\n\r\nt = 1#int(input())\r\nfor q in range(0, t):\r\n # n = int(input())\r\n lenght = 2\r\n s = input().split(\" \")\r\n\r\n ch = 0\r\n for i in range(0, lenght):\r\n s[i] = int(s[i])\r\n mas = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 0]\r\n for i in range(0, len(mas)):\r\n if s[0] == mas[i]:\r\n num = i\r\n if s[1] == mas[num + 1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "l = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,51]\r\n\r\nn=input().split()\r\n\r\nm=int(n[1])\r\nn=int(n[0])\r\n\r\nif l[l.index(n)+1] ==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=map(int,input().split())\r\nfor i in range(a+1,b):\r\n h=i**0.5\r\n for j in range(2,int(i**0.5)+2):\r\n if i%j==0:\r\n break\r\n if j==int(i**0.5)+1:\r\n print('NO')\r\n exit()\r\nfor i in range(2,int(b**0.5)+1):\r\n if b%i==0:\r\n print('NO')\r\n exit()\r\nprint(\"YES\")", "#t = int(input())\r\n#for _ in range(t):\r\n#n = int(input())\r\ndef isprime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n \r\n return True\r\nn, m = map(int, input().split())\r\nfor i in range(n+1, m):\r\n if isprime(i):\r\n print(\"NO\")\r\n break\r\nelse:\r\n if isprime(m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n,m=input().split()\r\nn,m=int(n),int(m)\r\nli=[]\r\ndef prime(n):\r\n c=0\r\n for i in range(1,n+1):\r\n if(n%i==0):\r\n c+=1\r\n if(c==2):\r\n return True\r\n else:\r\n return False\r\nfor i in range(n+1,m+1):\r\n if(prime(i) is True):\r\n li.append(i)\r\nif(len(li)==0):\r\n print(\"NO\")\r\nelif(min(li)==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#t=int(input())\r\nn,m=map(int,input().split())\r\nk=0\r\nfor i in range(n,m+1,1):\r\n c=0\r\n for j in range(2,i,1):\r\n if((i+1)%j==0):\r\n c=1\r\n break\r\n if(c==0):\r\n k+=1\r\nif(k==1):\r\n z=0\r\n for i in range(2,int((m)**0.5+1),1):\r\n if(m%i==0):\r\n z=1\r\n break\r\n if(z==0): \r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m = map(int,input().split())\r\nx = []\r\nfor i in range(n+1,m+1):\r\n for j in range(2,i):\r\n if i % j == 0:\r\n break\r\n else:\r\n x.append(i)\r\nif len(x) != 0:\r\n if min(x) == m:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "n,m=list(map(int,input().split()))\r\np=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\ni=p.index(n)\r\nif p[i+1]==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "def pn(): \r\n arr = []\r\n for i in range(2,50): \r\n cnt = 0\r\n for j in range(1,i+1): \r\n if i%j == 0: \r\n cnt += 1\r\n if cnt == 2:\r\n arr.append(i)\r\n return arr \r\n \r\n\r\ndef solve(arr):\r\n n,m = map(int, input().split())\r\n ind = arr.index(n)\r\n \r\n if ind != len(arr)-1 and arr[ind+1] == m: \r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n arr = pn()\r\n solve(arr)", "a,b=list(map(int,input().split()))\r\nfor i in range(a+1,55):\r\n for j in range(2,i):\r\n c=True\r\n if i%j==0:\r\n c=False\r\n break\r\n if i%j!=0:\r\n c=True\r\n if c==True :\r\n break\r\nif i==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "prime_list = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\nprime_dict = dict()\nfor i in range(len(prime_list)-1):\n prime_dict[prime_list[i]] = prime_list[i+1]\nn, m = [int(i) for i in input().split()]\nif n >= 44 or prime_dict[n] != m:\n print(\"NO\")\nelse:\n print(\"YES\")", "a, b = map(int, input().split())\r\ncheck_a, check_b = 0, 0\r\ncheck_flag = True\r\n\r\nfor i in range(1, a + 1):\r\n if a % i == 0:\r\n check_a += 1\r\n\r\nfor i in range(1, b + 1):\r\n if b % i == 0:\r\n check_b += 1\r\n\r\nfor i in range(a+1, b):\r\n check_numb = 0\r\n for j in range(1, i+1):\r\n if i % j == 0:\r\n check_numb += 1\r\n if check_numb == 2:\r\n check_flag = False\r\n\r\n\r\nif check_a == 2 and check_b == 2 and a < b and check_flag == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isPrime(x):\r\n for i in range( 2 , (int(x / 2)+1) ):\r\n if x % i == 0:\r\n return False\r\n return True\r\nt=input()\r\nx,y=t.split()\r\nc=False\r\ny = int(y)\r\nx = int(x)\r\nz = x + 1\r\nwhile(True):\r\n if isPrime(z):\r\n if z == y:\r\n print('YES')\r\n else:\r\n print('NO')\r\n break\r\n z += 1", "n, m = input().split()\r\nn, m = int(n), int(m)\r\nh = n + 1\r\nk = 0\r\nwhile True:\r\n for s in range(1,h+1):\r\n if h % s == 0:\r\n k += 1\r\n if k == 2:\r\n break\r\n h += 1\r\n k = 0\r\nif h == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nprimes = []\r\nfor i in range(2, 50):\r\n if all(i % el for el in primes):\r\n primes.append(i)\r\nprint(\"YES\" if m in primes and primes.index(m) - primes.index(n) == 1 else \"NO\")", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\n\r\nx=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,51]\r\n\r\n\r\nif a>=b:\r\n print(\"NO\")\r\nelse:\r\n i=x.index(a)\r\n \r\n if i>=0 and b==x[i+1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n ", "n,m=map(int,input().split(\" \"))\r\nc=0\r\nfor x in range(n+1,m):\r\n f=0\r\n for y in range(2,(x//2)+1):\r\n if x%y==0:\r\n f=1\r\n break\r\n if f==0:\r\n c+=1\r\nfor z in range(2,(m//2)+1):\r\n if m%z==0:\r\n c+=1\r\n break\r\nif c==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nh=0\r\nn,m = map(int,input().split())\r\nfor i in range(len(prime)):\r\n if m == 50 or m==49 or m ==48:\r\n h=0\r\n break\r\n if n ==prime[i] and m == prime[i+1]:\r\n h=h+1\r\n break;\r\n\r\nif h==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "a,b=map(int,input().split())\r\nz=-2\r\ne=max(a,b)-1\r\nq=[]\r\ng=[]\r\nk=-2\r\nl=-2\r\ny=a\r\nu=b\r\nfor i in range(a):\r\n if a%y==0:\r\n k=k+1\r\n else:\r\n k=k\r\n y=y-1\r\nfor i in range(b):\r\n if b%u==0:\r\n l=l+1\r\n else:\r\n l=l\r\n u=u-1\r\nif k!=0 or l!=0:\r\n print('NO')\r\nelif max(a,b)-min(a,b)>1:\r\n for i in range(max(a,b)-min(a,b)-1):\r\n q.append(e)\r\n e=e-1\r\n for i in range(len(q)):\r\n f=q[i]\r\n t=f\r\n z=-2\r\n for i in range(f):\r\n if f%t==0:\r\n z=z+1\r\n else:\r\n z=z\r\n t=t-1\r\n if z==0:\r\n g.append(1)\r\n else:\r\n g.append(0)\r\n if sum(g)==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('YES')", "def prime(x):\r\n for i in range(2, int(x ** 0.5) + 1):\r\n if x % i == 0:\r\n return False\r\n return True\r\ns = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\nif not prime(b):\r\n print(\"NO\")\r\n exit(0)\r\nfor j in range(a + 1, b - 1):\r\n if prime(j):\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n\r\n\r\n", "def is_prime(n):\r\n if n <= 3:\r\n return n >= 2\r\n i = 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\nn, m = map(int, input().split())\r\nfor i in range(n + 1, m):\r\n if is_prime(i):\r\n print('NO')\r\n exit(0)\r\nprint('YES' if is_prime(m) else 'NO')", "from itertools import count\nfrom math import isqrt\n\n\ndef is_prime(n):\n return all(n % i for i in range(2, isqrt(n) + 1))\n\n\nn, m = map(int, input().split())\nfor i in count(n + 1):\n if is_prime(i):\n print(\"YES\" if i == m else \"NO\")\n break\n", "# https://codeforces.com/problemset/problem/80/A\r\n\r\n\r\nfrom typing import Dict\r\n\r\n\r\n# def is_prime(k: int) -> bool:\r\n# for d in range(2, (k // 2) + 1):\r\n# if k % d == 0:\r\n# return False\r\n# return True\r\n\r\n\r\n# def next_prime(n: int) -> int:\r\n# curr: int = n + 1\r\n\r\n# while not is_prime(curr):\r\n# curr += 1\r\n# return curr\r\n\r\n\r\nlookup: Dict[int, int] = {\r\n 2: 3,\r\n 3: 5,\r\n 5: 7,\r\n 7: 11,\r\n 11: 13,\r\n 13: 17,\r\n 17: 19,\r\n 19: 23,\r\n 23: 29,\r\n 29: 31,\r\n 31: 37,\r\n 37: 41,\r\n 41: 43,\r\n 43: 47,\r\n 47: 53,\r\n}\r\n\r\n\r\ndef main() -> None:\r\n [n, m] = list(map(int, input().split()))\r\n if lookup[n] == m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n # lookup: Dict[int, int] = {}\r\n # for n in range(2, 50):\r\n # if is_prime(n):\r\n # lookup[n] = next_prime(n)\r\n # print(lookup)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\n\r\na = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\r\nif m in a:\r\n if n == a[a.index(m) - 1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\np=0\r\nif m>n and (m-n)<=n//2+1:\r\n for q in range(m):\r\n if m%(int(q)+1)==0:\r\n p+=1\r\nif p==2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\ndef prime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return 0\r\n return 1\r\nf=0\r\nif prime(n) and prime(m):\r\n for i in range(n+1,m):\r\n if prime(i):\r\n f=1\r\nelse:\r\n f=1\r\nif f==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split())\r\na=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,0]\r\nif a[a.index(n)+1]==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import math\r\ndef isPrime(n) :\r\n for i in range(2, int(math.sqrt(n)) + 1) :\r\n if n % i == 0 :\r\n return False\r\n return True\r\nn, m = map(int, input().split())\r\nfoundPrime = False\r\nfor i in range(n + 1, m):\r\n if isPrime(i) :\r\n print(\"NO\")\r\n foundPrime = True\r\n break\r\nif not foundPrime :\r\n if isPrime(m) :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "n,m=map(int,input().split())\r\narr=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nfor i in range(0,15):\r\n\tif n==arr[i] and m==arr[i+1]:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\n\telif m>47:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "def isPrime(n):\r\n if n < 2:\r\n return False\r\n cnt = 0\r\n for i in range(2, n):\r\n if n % i == 0:\r\n cnt += 1\r\n return cnt == 0\r\nn, m = [int(x) for x in input().split()]\r\ni = n + 1\r\nwhile True:\r\n if isPrime(i):\r\n break\r\n i += 1\r\n \r\nif i != m:\r\n print(\"NO\")\r\n \r\nelse:\r\n print(\"YES\")", "import math\n\n# Problem with 2\ndef prime_test(n):\n i = 2\n while i < math.sqrt(n) + 1:\n if n % i == 0:\n return False\n i += 1\n return True\n \nn, m = map(int, input().split())\nfor i in range(n + 1, m, 1):\n if prime_test(i) == True:\n print(\"NO\")\n exit()\nif prime_test(m) == True:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n,m=map(int,input().split())\r\n\r\nans=0\r\nfor i in range(n+1,m+1):\r\n j=1\r\n count=0\r\n while(j<=i):\r\n if i%j==0:\r\n count+=1\r\n j+=1\r\n\r\n if count==2:\r\n ans=i\r\n break\r\n \r\nif ans==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "numbers = input().split()\r\nprimeNumbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]\r\nif (int(numbers[1]) == primeNumbers[primeNumbers.index(int(numbers[0]))+1]):\r\n print('YES')\r\nelse:\r\n print('NO')", "def isPrime(t):\r\n if t % 2 == 0:\r\n return False\r\n \r\n else:\r\n for i in range(3, int(t ** 0.5) + 1, 2):\r\n if t % i == 0:\r\n return False\r\n else:\r\n return True\r\n\r\ndef solve(n, k):\r\n if isPrime(k):\r\n for i in range(n + 1, k):\r\n if isPrime(i):\r\n return False\r\n else:\r\n return True\r\n else:\r\n return False\r\n\r\nn , k = map(int, input().split())\r\nt = solve(n, k)\r\nif t == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = [int(i) for i in input().split()]\r\n\r\ndef is_prime(m):\r\n for i in range(2, m):\r\n if m%i == 0:\r\n return False\r\n return True\r\n \r\nis_next = is_prime(m) \r\nfor i in range(n+1, m):\r\n if is_prime(i):\r\n is_next = False\r\n break\r\n\r\nif is_next:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "l=[ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\r\nx,y=map(int,input().split())\r\nflag=0\r\nfor i in range(len(l)-1):\r\n if(l[i]==x and l[i+1]==y):\r\n flag=1\r\n\r\n\r\nif flag :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def prime(m):\n if m == 1: return False\n elif m == 2 or m == 3: return True\n cont = 0\n for i in range(2, int(m**0.5)+1):\n if m % i == 0:\n cont += 1\n if cont > 0:\n return False\n return True\n\na,b = list(map(int, input().split()))\nv = a+1\nwhile True:\n if prime(v):\n if v == b:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n break\n v += 1\n\n", "l = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m = map(int,input().split())\r\nc = 0\r\nfor i in range(len(l)-1):\r\n if n==l[i] and m==l[i+1]:\r\n c+=1\r\nif c>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def isPrime(n):\r\n for i in range(2, int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\nn , m = list(map(int, input().split()))\r\nif not isPrime(m):\r\n print(\"NO\")\r\n exit()\r\n\r\nfor i in range(n+1, m):\r\n if isPrime(i):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "from operator import truediv\n\n\ninput1 = input()\n\n\ndef isPrime(num:int)->bool:\n if(num==2):\n \n return True\n \n if(num==3):\n \n return True\n \n if(num==5):\n \n return True\n if(num==7):\n \n return True\n\n\n \n if(num%2==0):\n \n return False\n \n if(num%3==0):\n \n return False\n \n if(num%5==0):\n \n return False\n if(num%7==0):\n \n return False\n\n return True\n\n\nnums = input1.split(\" \")\nans = True\n\n\nnum1 = int(nums[0])\nnum2 = int(nums[1])\n\nif(isPrime(num1)==False):\n ans = False\n\nif(isPrime(num2)==False):\n ans = False\n\n\nfor i in range(num1+1, num2):\n if(isPrime(i)==True):\n ans=False\n\nprint(\"YES\" if(ans==True) else \"NO\")\n\n", "class Code:\r\n def __init__(self):\r\n self.n, self.m = list(map(int, input().split()))\r\n self.prime = [1 for _ in range(51)]\r\n self.sieve()\r\n\r\n def sieve(self):\r\n i = 2\r\n while i * i <= 50:\r\n if self.prime[i] == 1:\r\n for j in range(i * i, 51, i):\r\n self.prime[j] = 0\r\n i += 1\r\n\r\n def process(self):\r\n for i in range(self.n + 1, 51):\r\n if i == self.m:\r\n print('YES' if self.prime[i] == 1 else 'NO')\r\n break\r\n elif i < self.m:\r\n if self.prime[i]:\r\n print('NO')\r\n break\r\n\r\n\r\nif __name__ == '__main__':\r\n code = Code()\r\n code.process()\r\n", "n, m = map(int, input().split())\r\n\r\ns = 0\r\ndef is_prime(n):\r\n for i in range(2,n):\r\n if (n%i) == 0:\r\n return False\r\n return True\r\n\r\nfor i in range(n + 1, 50):\r\n if is_prime(i):\r\n s = i\r\n break \r\n\r\nif m == s:\r\n print('YES') \r\nelse:\r\n print('NO') ", "l=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,-1]\r\na,b=input().split()\r\nif(b==str(l[l.index(int(a))+1])):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "primes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nt = list(map(int,input().split()))\r\nif t[0] in primes and t[-1] in primes and (abs(primes.index(t[0])-primes.index(t[-1])) == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = map(int, input().split())\r\n\r\nprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\n\r\n\r\nind = primes.index(n)\r\nif primes[ind+1] == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=list(map(int,input().split()))\r\nl=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nx=l.count(m)\r\nif x==0:\r\n print(\"NO\")\r\nelse:\r\n y=l.index(m)\r\n if y==l.index(n)+1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "# 7 11\r\n#7 13 \r\n# 7 8 9 10 11 12 13\r\n\r\nx,*y=input().split(' ')\r\nx=int(x)\r\ny=int(*y)\r\ncounter=0\r\ni=2\r\nj=x+1\r\n# if x==2:\r\n# if y==3:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n# else:\r\nwhile i<=j:\r\n if j%i==0:\r\n counter+=1\r\n i+=1\r\n if counter >1 and j<y:\r\n j+=1\r\n counter=0\r\n i=2\r\nif counter in {0,1} and j == y:\r\n print('YES')\r\nelse:\r\n print('NO')", "def isprime(n):\r\n if n<2: return False\r\n if n==2 or n==3: return True\r\n if n%2==0 or n%3==0 : return False\r\n i=5\r\n while i*i<=n:\r\n if n%i==0 or n%(i+2)==0: \r\n return False\r\n i+=6\r\n return True\r\nn,m=map(int,input().split())\r\n\r\nwhile(True):\r\n n+=1\r\n if isprime(n):\r\n break\r\n \r\nif n==m: print(\"YES\")\r\nelse:print(\"NO\") ", "primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nn, m = map(int, input().split())\r\nfor i in range(15):\r\n if primes[i] == n:\r\n if primes[(i+1)%15] == m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\r\n\r\n", "\r\nn, m = map(int, input().split())\r\nt = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nif m in t and t.index(n) + 1 == t.index(m):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# هی", "n,m = map(int,input().split())\ndone = False\nprimes = [True] * 100\nprimes[1] = False\nx = 2\nwhile x < 100:\n if x:\n for i in range(x+x,100,x):\n primes[i] = False \n x+=1\n\nn+=1\nwhile n <=m:\n if primes[n]:\n break\n n+=1\n\nprint([\"NO\",\"YES\"][n==m])\n", "n, m = map(int, input().split())\r\nfor i in range(2, m):\r\n if m % i == 0:\r\n print(\"NO\")\r\n exit(0)\r\nfor i in range(n + 1, m):\r\n for j in range(2, i):\r\n if i % j == 0:\r\n break\r\n if j == i - 1:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "def isprime(i):\r\n ss=int(i**0.5)\r\n ss+=1\r\n for j in range(2,ss):\r\n if i%j==0:\r\n return 0\r\n return 1\r\nn,m=map(int,input().split())\r\nf=0\r\nif m>n and isprime(m):\r\n for i in range(n+1,56):\r\n if isprime(i):\r\n f=1\r\n break\r\n if f:\r\n if i==m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def prime(n):\r\n\r\n if n%2 == 0 and n != 2:\r\n return('c')\r\n\r\n else:\r\n j = 3\r\n while True:\r\n if n%j == 0 and j < n:\r\n return('c')\r\n break\r\n\r\n elif n%j != 0:\r\n j += 1\r\n if j == n:\r\n return('p')\r\n break\r\nn, m = [int(x) for x in input().split()]\r\nj = n\r\nwhile True:\r\n j += 1\r\n if prime(j) == 'p' and j == m:\r\n print('YES')\r\n break\r\n elif prime(j) == 'p' and j != m:\r\n print('NO')\r\n break\r\n", "l=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,53,59];n,m=map(int,input().split());print('YES' if l[l.index(n)+1]==m else 'NO')", "a,b = map(int,input().split())\r\nlst = []\r\nfor i in range(a,60+1):\r\n\tif (i > 1):\r\n\t\tfor j in range(2,i):\r\n\t\t\tif (i % j == 0):\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tlst.append(i)\r\nans = lst.index(a)\r\nif (lst[ans++1] == b):\r\n\tprint(\"YES\")\r\nelse:\r\n\t\tprint(\"NO\")", "arr = [True] * 51\r\nfor i in range(2, 50):\r\n for j in range(2, 50):\r\n if i*j > 50:\r\n break\r\n arr[i*j] = False\r\n\r\na, b = map(int, input().split())\r\nans = \"NO\"\r\nfor i in range(a+1, b+1):\r\n if arr[i]:\r\n if i == b:\r\n ans = \"YES\"\r\n break\r\nprint(ans)", "def q(x, y):\r\n\r\n prime = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47)\r\n\r\n if y not in prime:\r\n return \"NO\"\r\n\r\n return [\"YES\", \"NO\"][prime.index(y) - prime.index(x) != 1]\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\nprint(q(n, m))", "num = [int(i) for i in input().split()]\r\n\r\nfor i in range(num[0]+1, num[1]+1):\r\n if i == 2 or i == 3 or i == 5 or i ==7:\r\n n = i\r\n break\r\n elif i %2 != 0 and i%3 != 0 and i%5 != 0 and i%7 !=0:\r\n n = i\r\n break\r\n else:\r\n n = 0\r\n\r\nif n == num[1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "z=list(map(int,input().split()))\r\ns=[]\r\ns.append(z[0])\r\nfor i in range(z[0]+1,z[1]+1):\r\n c=-1\r\n for o in range(2,z[1]+1):\r\n if i%o==0:\r\n c+=1\r\n if c>1:\r\n break\r\n if c==0:\r\n s.append(i)\r\nif len(s)==2 and s[1]==z[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m = map(int,input().split())\r\n\r\ndef is_prime(n):\r\n from math import sqrt\r\n # p = True\r\n for i in range(2,int(sqrt(n))+1):\r\n if n % i == 0 :\r\n return False\r\n return True\r\n\r\nres = \"YES\"\r\nfor i in range(n+1,m) :\r\n if is_prime(i):\r\n res = \"NO\"\r\nif not is_prime(m) :\r\n res = \"NO\"\r\nprint(res)\r\n\r\n ", "n, m = map(int, input().split())\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\nprint(\"YES\" if m in primes and primes.index(n) + 1 == primes.index(m) else \"NO\")\n", "primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nn , m = map(int, input().split())\r\nif m in primes:\r\n if primes.index(m) - primes.index(n) == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "l = list(map(int, input().split()))\r\nn = l[0]\r\nm = l[1]\r\n\r\ndef isPrime(x):\r\n\tfor i in range(2,x):\r\n\t\tif x%i == 0:\r\n\t\t\treturn False\r\n\treturn True\r\nc = 0\r\nfor i in range(n+1,m):\r\n\tif isPrime(i):\r\n\t\tc = 1\r\n\t\tbreak\r\nif c == 1 or isPrime(m) == False:\r\n\tprint(\"NO\")\r\nelif c == 0:\r\n\tprint(\"YES\")", "\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\r\n for i in range(2, int(n**0.5) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\ndef n_prime(n, m):\r\n n_p = n+1\r\n while not is_prime(n_p):\r\n n_p+=1\r\n return \"YES\" if n_p == m else \"NO\"\r\n\r\nn, m = map(int, input().split())\r\nprint(n_prime(n, m) )", "#80A Panoramix's Prediction\r\n\r\na, b, h = 0, 0, 0\r\nprimeNO = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53] \r\n\r\na,b = map(int,input().split())\r\n\r\nfor i in range(0,15):\r\n if (a == primeNO[i] and b == primeNO[i + 1]):\r\n h = h+1\r\n break\r\n\r\nif (h == 0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def is_prime(x):\n if(x%2==0):\n return False\n start=3\n end=int(pow(x,1/2))+1\n for i in range(start,end,2):\n if(x%i==0):\n return False\n return True\n\nn,m=map(int,input().split())\ndone=False\nfor i in range(n+1,m):\n if(is_prime(i)):\n print(\"NO\")\n done=True\n break\nif(not done):\n if(is_prime(m)):\n print(\"YES\")\n else:\n print(\"NO\")\n", "def main():\n n, m = map(int,input().split(\" \"))\n if m <= n:\n print(\"NO\")\n return;\n for num in range(n+1,100):\n d = 2\n f = 1\n while d*d <= num:\n if num % d == 0:\n f = 0\n break\n d += 1\n if f == 1:\n if num == m:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\n\nif __name__ == \"__main__\":\n main()", "a,b = map(int,input().split())\r\nl = [int(x) for x in range(1,b**2)]\r\nl2 = []\r\nl2.append(2); l2.append(3); l2.append(5); l2.append(7)\r\nfor i in range(8,len(l)):\r\n if l[i]%2!=0 and l[i]%3!=0 and l[i]%5!=0 and l[i]%7 !=0:\r\n l2.append(l[i])\r\ni = 0\r\nflag = False\r\nfor i in range(len(l2)):\r\n if a == l2[i] and b == l2[i+1]:\r\n flag = True\r\n break\r\nif flag == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int, input().split())\r\nis_prime = lambda a: sum([a%i==0 for i in range(1,a+1)])==2\r\nwhile True:\r\n n+=1\r\n if is_prime(n): break\r\nprint(\"YNEOS\"[not n==m::2])", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\ndef isPrime(n):\r\n if n == 2 or n == 3:\r\n return True\r\n for i in range(2,n):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nn,m = li()\r\nflag = True\r\nfor i in range(n+1,m):\r\n if isPrime(i):\r\n flag = False\r\nprint('YES' if flag and isPrime(m) else 'NO')", "def prime(n):\r\n cnt=0\r\n for i in range(1,n+1):\r\n if n%i==0:\r\n cnt+=1\r\n if cnt==2:\r\n return True\r\n else:\r\n return False\r\nn,m=map(int,input().split())\r\ne='YES'\r\nif prime(m)==True:\r\n for i in range(n+1,m):\r\n if prime(i)==True:\r\n e='NO'\r\n break\r\nelse:\r\n e=\"NO\"\r\nprint(e)", " # BISMILLAH\n # ITS NOT OVER WHEN YOU FAIL\n # ITS OVER WHEN YOU QUIT\n\ndef sieve(n):\n import math\n number = int(n)\n\n primes = []\n for i in range(2,number+1):\n primes.append(i)\n\n i = 2\n while(i <= int(math.sqrt(number))):\n if i in primes:\n for j in range(i*2, number+1, i):\n if j in primes:\n primes.remove(j)\n i = i+1\n return primes;\n\np = sieve(1000)\nn, m = list(map(int, input().strip().split()))\nfor i in range(0, 51):\n\tif n == p[i] and m == p[i+1]:\n\t\tprint(\"YES\")\n\t\texit()\nprint(\"NO\")\n\n\n", "# Lang: pypy3.6-v7.1.0-win32\\pypy3.exe\r\n# Problem Name: PanoramixsPrediction\r\n# Problem Serial No: 80\r\n# Problem Type: A\r\n# Problem Url: https://codeforces.com/problemset/problem/80/A \r\n# Solution Generated at: 2019-10-19 16:49:10.777439 UTC\r\n\r\n\r\ncache = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]\r\n\r\nn, m = map(int, input().split())\r\n\r\nif cache[cache.index(n) + 1] == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n# Accepted\r\n", "#t = int(input())\r\n#for _ in range(t):\r\n#n = int(input())\r\nn, m = map(int, input().split())\r\nfor i in range(n+1, m):\r\n prime = 1\r\n for j in range(2, int(i**0.5)+1):\r\n if i%j == 0:\r\n prime = 0\r\n break\r\n if prime:\r\n print(\"NO\")\r\n break\r\nelse:\r\n for j in range(2, int(m**0.5)+1):\r\n if m%j == 0:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "def is_prime(n):\n for i in range(2,n):\n if (n%i) == 0:\n return False\n return True\n\nnumbers = input()\nlist = numbers.split()\nf_p = int(list[0])\ns_p = int(list[1])\ncount = 0\n\nif is_prime(s_p):\n for i in range(f_p+1, s_p):\n if is_prime(i):\n count += 1\n if count > 0:\n print('NO')\n else:\n print('YES')\nelse:\n print('NO')", "def is_prime(n):\r\n d = 2\r\n while n % d != 0 and d * d <= n:\r\n d += 1\r\n if d * d > n:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nn, m = map(int, input().split())\r\ngi = False\r\nif is_prime(n) and is_prime(m):\r\n for i in range(n+1, m):\r\n if is_prime(i):\r\n gi = True\r\n if gi:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def prime(x):\r\n n = True\r\n for i in range(2,x):\r\n if x % i == 0:\r\n n = False\r\n return n\r\na = list(map(int , input().split()))\r\nn = a[0]\r\nm = a[1]\r\ndef nextprime(x):\r\n i = x+1\r\n while True:\r\n if prime(i):\r\n break\r\n else:\r\n i = i +1\r\n return i\r\nif m == nextprime(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "from math import sqrt, ceil\nnums = input().split()\nn = int(nums[0])\nm = int(nums[1])\n\n\ndef is_prime(num):\n if n < 2:\n return False\n\n for i in range(2, ceil(sqrt(num))+1):\n if num % i == 0:\n return False\n\n return True\n\n\nnext_prime = False\nfor i in range(n+1, m+1):\n if is_prime(i):\n if i == m:\n next_prime = True\n break\n\nif next_prime:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n,m=[int(n) for n in input().split()]\r\nlis=[]\r\nx=0\r\nfor i in range(2,m-1):\r\n if m%i==0:\r\n print(\"NO\")\r\n x=x+1\r\n break\r\nif x==0:\r\n for i in range(n + 1, m + 1):\r\n lis.append(i)\r\n for j in range(2, i):\r\n if i % j == 0:\r\n\r\n lis.remove(i)\r\n break\r\n if lis[0] == m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "a = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\nn,m = map(int,input().split())\r\nif a[a.index(n)+1] == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "X,Y = map(int,input().split())\r\nt=X+1\r\nwhile True:\r\n flag=0\r\n for i in range(2,t):\r\n if t%i==0:\r\n flag=1\r\n break\r\n if flag==0:\r\n break \r\n t+=1\r\nif t==Y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "prims = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]\r\n\r\nn, m = map(int, input().split())\r\n\r\n# Check if n and m are within the specified range\r\nif 2 <= n <= 50 and 2 <= m <= 50:\r\n # Check if n is present in the list of primes and m is the next prime\r\n if n in prims and m == prims[prims.index(n) + 1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "### MAVERICK ###\r\nimport os, sys, math, heapq, itertools, bisect\r\nfrom collections import deque,defaultdict\r\nii = lambda : int(input()) \r\nsi = lambda : input() \r\nmi = lambda : map(int,input().strip().split(\" \")) \r\nmsi = lambda : map(str,input().strip().split(\" \")) \r\nli = lambda : list(mi()) \r\nlsi = lambda : list(msi()) \r\niseven = lambda num : num%2==0 \r\nisodd = lambda num : num%2==1 \r\nlower_alphabets = \"abcdefghijklmnopqrstuvwxyz\"\r\nupper_alphabets = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nstore,dick,c,s,flag = [],{},0,0,False\r\npostive_inf = math.inf \r\nnegative_inf = -math.inf\r\nisint = lambda num : isinstance(num, int)\r\nisfloat = lambda num : isinstance(num, float)\r\ndef swap(array,a,b)->None:temp=array[b];array[b]=array[a];array[a]=temp\r\ndef flush()->None: store.clear();dick.clear();c=0;s=0\r\ndef debug(*var) -> None:\r\n try: import master; master.debug(*var)\r\n except (ModuleNotFoundError,FileNotFoundError): pass \r\ntry: import master; master.read()\r\nexcept (ModuleNotFoundError,FileNotFoundError): pass\r\n\r\n\r\n \r\n\r\n\r\n\r\ndef findMinDiff(arr, n):\r\n arr = sorted(arr)\r\n diff = 10**20\r\n for i in range(n-1):\r\n if arr[i+1] - arr[i] < diff: diff = arr[i+1] - arr[i]\r\n return diff\r\n\r\n\r\n\r\n\r\ndef seive(n):\r\n allprime = [1]\r\n prime = [True for i in range(n + 1)] \r\n p = 2\r\n while (p * p <= n): \r\n if (prime[p] == True): \r\n for i in range(p ** 2,n + 1,p): prime[i] = False\r\n p = p + 1\r\n for p in range(2,n + 1): \r\n if prime[p]: allprime.append(p)\r\n return(allprime)\r\n\r\nprimes = seive(55)\r\na,b = mi()\r\nidx = 0\r\nfor i, p in enumerate(primes):\r\n if p==a: idx=i; break\r\nidx+=1\r\nif primes[idx]==b: print(f\"YES\",end=\"\\n\")\r\nelse: print(f\"NO\",end=\"\\n\")", "def Is_Prime(x):\r\n i=0\r\n y=1\r\n while y<=x:\r\n if x%y==0:\r\n i=i+1\r\n y=y+1\r\n if i==2:return 1\r\n return 0\r\ns=1\r\nx,y=map(int,input().split())\r\nif Is_Prime(x)==0 or Is_Prime(y)==0:\r\n print('NO')\r\n s=0\r\nif Is_Prime(x)==1 and Is_Prime(y)==1:\r\n while x<=y:\r\n x=x+1\r\n if Is_Prime(x)==1 and x==y:\r\n print('YES')\r\n s=0.\r\n if Is_Prime(x)==1 and x!=y:\r\n break\r\nif s==1:\r\n print('NO')\r\n", "l=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,0]\r\n\r\nn=(input()).split()\r\n# print(n)\r\nm=int(n[1])\r\nn=int(n[0])\r\n# print(n,m)\r\n# m=int(input())\r\n\r\nif l[l.index((n))+1] == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "def sieve(n):\r\n np1 = n + 1\r\n s = list(range(np1))\r\n s[1] = 0\r\n sqrtn = int(round(n**0.5))\r\n for i in range(2, sqrtn + 1):\r\n if s[i]:\r\n s[i*i: np1: i] = [0] * len(range(i*i, np1, i))\r\n return filter(None, s)\r\n\r\nn, m = [int(i) for i in input().split()]\r\nnumbers = list(sieve(50))\r\nif m in numbers and numbers.index(n)==numbers.index(m)-1:\r\n print('YES')\r\nelse: print('NO')", "def is_prime(num):\r\n if num > 1:\r\n for i in range(2, num):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\ndef mid_prime(x, y):\r\n for num in range(x + 1, y):\r\n if num > 1:\r\n for i in range(2, num):\r\n if num % i == 0:\r\n break\r\n else:\r\n return True\r\n return False\r\n\r\nx, y = map(int, input().split())\r\nif not is_prime(y):\r\n print(\"NO\")\r\nelse:\r\n if mid_prime(x, y):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "a,b=map(int,input().split())\r\nr=[]\r\nfor i in range(a+1,b+1):\r\n def isPrime(i):\r\n d=2\r\n while i % d != 0:\r\n d+=1\r\n if d==i:\r\n r.append(\"YES\")\r\n else:\r\n r.append(\"NO\")\r\n isPrime(i)\r\nif r.count(\"YES\")>=2 or r.count(\"YES\")<1 or r[-1]==\"NO\":\r\n print(\"NO\")\r\nelif r.count(\"YES\")==1:\r\n print(\"YES\")\r\n", "t = [int(num) for num in input().split()]\na = t[0]\nb = t[1]\nlist1 = []\n\nfor num in range(2, b + 1):\n if num > 1:\n for i in range(2, num):\n if (num % i) == 0:\n break\n else:\n list1.append(num)\n\n\nif t[0] and t[1] in list1:\n if list1.index(t[1]) - list1.index(t[0]) == 1:\n print('YES')\n else:\n print('NO')\nelse:\n print('NO')\n", "import math\r\ndef is_prime(number):\r\n for x in range(2,int(math.sqrt(number))+1):\r\n if number%x==0:\r\n return False\r\n return True\r\n\r\n\r\n\r\ndef next_prime(number):\r\n num = number+1\r\n while not(is_prime(num)):\r\n num+=1\r\n return num\r\n \r\nnumbers = [int(i) for i in input().split()]\r\nif numbers[1]==next_prime(numbers[0]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = list(map(int, input().split()))\r\np = [x for x in range(2, 100) if x not in [i for sub in [list(range(2 * j, 100, j)) for j in range(2, 100 // 2)] for i in sub]]\r\nprint('YES' if n in p and m in p and p.index(m) - p.index(n) == 1 else 'NO')", "def prime(num):\r\n flag = 1\r\n for i in range(2, num//2+1):\r\n if num % i == 0:\r\n flag = 0\r\n return flag\r\n\r\nn=input()\r\na,b=map(int,n.split(' '))\r\n\r\nwhile True:\r\n a+=1\r\n if prime(a):\r\n break\r\nif a==b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def nextPrime(N):\r\n i = (N + 1 if N % 2 == 0 else N + 2)\r\n while True:\r\n Prime = True\r\n for j in range(2, int(i / 2)):\r\n if i % j == 0:\r\n Prime = False\r\n break\r\n if Prime:\r\n return i\r\n i += 2\r\n\r\n\r\nX = list(map(int, input().split()))\r\nprint(\"YES\" if nextPrime(X[0]) == X[1] else \"NO\")", "a, b = map(int, input().split())\r\nprime = []\r\nfor i in range(2,50):\r\n flag = True\r\n for c in range(i-1, 1, -1):\r\n if i % c == 0:\r\n flag = False\r\n break\r\n if flag == True:\r\n prime.append(i)\r\n elif flag == False:\r\n continue\r\nif (b in prime) and prime.index(b) == (prime.index(a) + 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\nx = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\n\r\ndef is_prime(a):\r\n i = 2\r\n found = False\r\n while i <= math.sqrt(a) and not found:\r\n if a % i == 0:\r\n found = True\r\n i += 1\r\n else:\r\n i += 1\r\n return not found\r\n\r\n\r\nif not is_prime(m):\r\n print(\"NO\")\r\nelse:\r\n i = n + 1\r\n f = False\r\n while n < i < m and not f:\r\n if is_prime(i):\r\n f = True\r\n else:\r\n i += 1\r\n\r\n if f:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jun 1 07:45:20 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\n\r\nn,m=list(map(int,input().split()))\r\nans=False\r\ndef check(n):\r\n \r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n \r\n return False\r\n return True\r\nfor i in range(n+1,m+1):\r\n if check(i) :\r\n if i==m:\r\n ans=True\r\n \r\n break\r\n else:\r\n break\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "def check_prime(n):\r\n flag = 1\r\n for i in range(2,n):\r\n if n%i==0:\r\n flag =0\r\n break\r\n if flag==1:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nx,y = map(int,input().split())\r\nif y>x:\r\n i = x+1\r\n while check_prime(i)==False:\r\n i = i+1\r\n if i==y:\r\n print('YES')\r\n else:\r\n print('NO')", "a,b=map(int,input().split())\r\nc=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nif a in c and b in c and c.index(b)-c.index(a)==1:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "lower, upper = list(map(int,input().split()))\n\nls=[]\nfor num in range(lower,70): \n if num > 1: \n for i in range(2,num): \n if (num % i) == 0: \n break \n else:\n if num==lower:\n continue\n ls.append(num) \n# print(ls)\nif ls[0]==upper:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def is_prime(n):\r\n count = 0\r\n \r\n if n == 1:\r\n return True\r\n elif n == 2:\r\n return True\r\n \r\n for i in range(2, n):\r\n if n % i == 0:\r\n return False\r\n \r\n return True \r\n \r\n\r\na,b = map(int, input().split())\r\nflag = False\r\nfor i in range(a+1, b+1):\r\n if i == 2 and i == b:\r\n print('YES')\r\n flag = True\r\n break\r\n \r\n \r\n if i % 2 != 0:\r\n \r\n if is_prime(i):\r\n if i == b:\r\n print('YES')\r\n flag = True \r\n break\r\n else:\r\n break\r\n \r\n \r\nif flag != True:\r\n print('NO') \r\n \r\n \r\n \r\n ", "import math\r\ndef is_prime(nu):\r\n if nu < 2:\r\n return False\r\n for i in range(2, int(math.sqrt(nu)) + 1):\r\n if nu % i == 0:\r\n return False\r\n return True\r\nn, m = map(int, input().split())\r\nn += 1 \r\nwhile True:\r\n if is_prime(n):\r\n if n == m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\r\n n += 1\r\n", "def prime(x):\r\n for i in range(2,int(x**0.5) +2):\r\n if x%i==0:\r\n return False\r\n return True\r\n\r\nn,m= map(int,input().split())\r\n\r\nif prime(m):\r\n ans=True\r\n \r\n for i in range(n+1,m):\r\n if prime(i):\r\n ans=False\r\n \r\nelse:\r\n ans=False\r\n\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "a, b = map(int, input().split())\r\ncheck = [True] * 100\r\nfor i in range(2, 51):\r\n for j in range(2 * i, 51, i):\r\n check[j] = False\r\n\r\nfor i in range(a + 1, b):\r\n if check[i]:\r\n print('NO')\r\n exit()\r\nif not check[b]:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n\r\n", "n,m=map(int,input().split())\r\nl=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,0]\r\nprint(\"YES\" if l[l.index(n)+1]==m else \"NO\")", "from sys import stdin, stdout\r\nimport sys\r\nimport math\r\nINF=1e9\r\ndef get_int(): return int(stdin.readline().strip())\r\ndef get_ints(): return map(int,stdin.readline().strip().split()) \r\ndef get_array(): return list(map(int,stdin.readline().strip().split()))\r\ndef get_string(): return stdin.readline().strip()\r\ndef op(c): return stdout.write(c)\r\n#from collections import defaultdict \r\n#for _ in range(int(stdin.readline())):\r\ndef isPrime(n) : \r\n # Corner cases \r\n if (n <= 1) : \r\n return False\r\n if (n <= 3) : \r\n return True\r\n if (n % 2 == 0 or n % 3 == 0) : \r\n return False\r\n \r\n i = 5\r\n while(i * i <= n) : \r\n if (n % i == 0 or n % (i + 2) == 0) : \r\n return False\r\n i = i + 6\r\n return True\r\n\r\nn,m=get_ints()\r\nans=0\r\ni=n+1\r\nwhile i<=50:\r\n if isPrime(i)==True:\r\n break\r\n i+=1\r\nif i==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "a, b = list(map(int, input().split()))\r\n\r\nflag = 0\r\n\r\ndef isprime(number):\r\n for i in range(2, number, 1):\r\n if number%i==0:\r\n return False\r\n\r\n return True\r\n\r\nfor i in range(a+1, b+1):\r\n j = isprime(i)\r\n if j and i==b:\r\n flag = 1\r\n break\r\n elif j==False:\r\n continue\r\n else:\r\n flag = 0\r\n break\r\n\r\nif flag == 1:\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\n\nni = primes.index(n) if n in primes else None\nmi = primes.index(m) if m in primes else None\nprint(\"YES\" if mi is not None and ni is not None and mi == ni + 1 else \"NO\")\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Apr 14 03:59:44 2020\r\n\r\n@author: DELL\r\n\"\"\"\r\nn,m=list(map(int,input().split()))\r\nr=True\r\nwhile r:\r\n n+=1\r\n j=True\r\n for i in range(2,(n//2)+1):\r\n if n%i==0:\r\n j=False\r\n break\r\n if j :\r\n if n==m:\r\n print('YES')\r\n else:\r\n print('NO')\r\n r=False\r\n break\r\n if n>m:\r\n print('NO')\r\n r=False\r\n break\r\n \r\n \r\n \r\n ", "def prime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nflag = False\r\nx,y = map(int,input().split())\r\nif prime(y) and y>x:\r\n for i in range(x+1,y):\r\n flag = prime(i)\r\n if flag:\r\n print(\"NO\")\r\n break\r\n if not flag :\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "import sys\r\ni = [1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47] \r\n\r\nn, m = map(int, input().split())\r\n\r\nif m not in i:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\nif i.index(n)+1 == i.index(m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isprime(num):\r\n if num==2:\r\n return True\r\n else:\r\n for i in range(2,int(num**(0.5))+1):\r\n if num%i==0:\r\n return False\r\n return True\r\n\r\n\r\nn,m=tuple(map(int,input().split()))\r\nif isprime(m):\r\n if m==n+1:\r\n print(\"YES\")\r\n else:\r\n c=0\r\n for i in range(n+1,m):\r\n if isprime(i):\r\n print(\"NO\")\r\n c+=1\r\n break\r\n if c==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\ndef solve():\r\n x,y = map(int, input().split(' '))\r\n flag = False\r\n temp = x\r\n while(True):\r\n temp += 1\r\n for i in range(2, temp):\r\n if temp % i == 0:\r\n flag = False\r\n break\r\n else:\r\n flag = True\r\n if flag:\r\n break\r\n if y == 3 or temp == y:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nsolve()", "def isPrime(n) : \r\n if (n <= 1) : \r\n return False\r\n if (n <= 3) : \r\n return True\r\n if (n % 2 == 0 or n % 3 == 0) : \r\n return False\r\n i = 5\r\n while(i * i <= n) : \r\n if (n % i == 0 or n % (i + 2) == 0) : \r\n return False\r\n i = i + 6\r\n return True\r\n \r\ndef nextPrime(n):\r\n for i in range(n+1,48):\r\n if isPrime(i)==True:\r\n return i\r\n break\r\na,b = map(int,input().split())\r\n\r\nif nextPrime(a)==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\nl=[int(i) for i in input().split(\" \")]\nif p[p.index(l[0])+1]==l[1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import math\n\n\ndef is_p(n):\n if n <= 1:\n return False\n if n%2 == 0:\n return False\n\n if n == 2:\n return True\n\n for i in range(3,int(math.sqrt(n)+1),2):\n if n%i == 0:\n return False\n\n return True\n \n\ndef primes():\n l = []\n\n l.append(2)\n\n for k in range(3, 50):\n if is_p(k):\n l.append(k)\n return l\n\na = list(map(int,input().split()))\nt = primes()\nif a[0] not in t or a[1] not in t: \n print(\"NO\")\nelse:\n if t.index(a[1]) == t.index(a[0]) + 1:\n print(\"YES\")\n else: \n print(\"NO\")\n\n# 1512824964474\n", "import math\r\ndef prime(n):\r\n if(n <= 1):\r\n return False\r\n if(n <= 3):\r\n return True\r\n \r\n if(n % 2 == 0 or n % 3 == 0):\r\n return False\r\n \r\n for i in range(5,int(math.sqrt(n) + 1), 6):\r\n if(n % i == 0 or n % (i + 2) == 0):\r\n return False\r\n \r\n return True\r\n\r\n\r\nn,m=map(int,input().split())\r\nwhile(True):\r\n n+=1\r\n if prime(n):\r\n break\r\n\r\nif m==n:\r\n print('YES')\r\nelse:\r\n print('NO')", "def prime(n):\r\n if n==2 or n==3:\r\n return 1\r\n for i in range(2,n):\r\n if n%i==0:\r\n return 0\r\n return 1\r\n(n,m)=map(int,input().split())\r\nl=[]\r\nif m>n:\r\n for i in range(n+1,m+1):\r\n f=prime(i)\r\n if f==1:\r\n l.append(i)\r\n if len(l)>0 and m==l[0]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\ndef isPrime(x):\n\tfor i in range(2,round(math.sqrt(x))+1):\n\t\tif x%i==0:\n\t\t\treturn(False)\n\treturn(True)\n\nn,m=list(map(int,input().split()))\nfor i in range(n+1,m+1):\n\tif isPrime(i):\n\t\tif i==m:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\t\tbreak\nelse:\n\tprint(\"NO\")", "n, m = map(int, input().split())\r\ni = 0\r\nn+=1\r\nwhile n <= m:\r\n col = 0\r\n for i in range(2, n-1):\r\n if n%i == 0: col += 1\r\n if col == 0:\r\n if n == m:\r\n print(\"YES\")\r\n exit()\r\n print(\"NO\")\r\n exit()\r\n n += 1\r\nprint(\"NO\")", "def isprime(a):\r\n for i in range(2, a):\r\n if(a % i == 0):\r\n return False\r\n return True\r\n \r\nres=\"NO\"\r\n\r\nn,m=map(int,input().split())\r\nfor i in range(n+1,m+1):\r\n if isprime(i):\r\n if i==m:\r\n res=\"YES\"\r\n else:\r\n break\r\n \r\nprint(res)", "def isPrime(n) : \r\n if (n <= 1) : \r\n return False\r\n if (n <= 3) : \r\n return True\r\n if (n % 2 == 0 or n % 3 == 0) : \r\n return False\r\n i = 5\r\n while(i * i <= n) : \r\n if (n % i == 0 or n % (i + 2) == 0) : \r\n return False\r\n i = i + 6\r\n \r\n return True\r\n\r\nn,k = map(int,input().split())\r\nnum = 0\r\nfor i in range(n+1,k+1) :\r\n out = isPrime(i)\r\n if out :\r\n num = i\r\n break\r\nif num == k :\r\n print('YES')\r\nelse :\r\n print('NO')", "n, m = map(int, input().split())\r\n\r\ndef check_prime(x) :\r\n for i in range(2, x) :\r\n if x % i == 0 :\r\n return False\r\n else :\r\n return True\r\n \r\ni = n + 1\r\nwhile not check_prime(i) :\r\n i += 1\r\n\r\nprint(\"NO\" if i != m else \"YES\")", "n,m=map(int,input().split())\r\nx=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nif n in x and m in x and x.index(m)-x.index(n)==1: print(\"YES\")\t\r\nelse: print(\"NO\")\r\n", "n,m=[int(i) for i in input().split()]\r\na=0\r\ndef prime(n):\r\n for i in range(2,n-1):\r\n if n%i==0:\r\n return 0\r\n return 1\r\nn=n+1\r\nwhile (n<=m):\r\n if prime(n)==1:\r\n a=n\r\n break\r\n n=n+1\r\nif a==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n,m=input().split()\r\nn,m=[int(n),int(m)]\r\ni=n+1\r\nwhile True:\r\n j=2\r\n flag=0\r\n while j*j<=i:\r\n if i%j==0:\r\n flag=1\r\n break\r\n j+=1\r\n if flag==0:\r\n break\r\n i+=1\r\nif i==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=[int(x) for x in input().split()]\r\nprime=n[0]\r\nfor i in range(n[0]+1,n[1]+1):\r\n div=0\r\n for j in range(2,i):\r\n if(i%j==0):\r\n div=1\r\n if div==0:\r\n prime=i\r\n break\r\nif prime==n[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "import math\ndef che(n):\n ans=0\n for i in range(2,int(math.sqrt(n))+1):\n if(n%i==0):\n ans=1\n break\n return ans\na,b=map(int,input().split())\nk=0\nif(che(b)==0):\n for i in range(a+1,b):\n if(che(i)==0):\n k+=1\n if(k==0):\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")\n", "def generatePrime(n):\n prime = [2]\n for i in range(3, n, 2):\n for j in prime:\n if i % j == 0:\n break\n else:\n prime.append(i)\n return prime\n\n\nprime_list = generatePrime(50)\n\na, b = map(int, input().split())\n\nif a in prime_list and b in prime_list:\n if prime_list.index(a) + 1 == prime_list.index(b):\n print('YES')\n else:\n print('NO')\n\nelse:\n print('NO')\n\n\t \t \t\t \t\t\t \t\t \t \t\t \t \t \t", "n,m=list(map(int,input().strip().split()))\r\ndef isPrime(a):\r\n if a==2:\r\n return True\r\n if a%2==0:\r\n return False\r\n for i in range(3,a):\r\n if a%i==0:\r\n return False\r\n return True\r\nfor i in range(n+1,m):\r\n if isPrime(i):\r\n print('NO')\r\n exit()\r\nif isPrime(m):\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys; input = sys.stdin.readline\r\n\r\nis_prime = [False] * 2 + [True] * 49\r\nfor i in range(2, int(51 ** 0.5) + 1):\r\n if is_prime[i]:\r\n for j in range(i * 2, 51, i):\r\n is_prime[j] = False\r\n\r\nn, m = map(int, input().split())\r\nif not is_prime[n] or not is_prime[m]:\r\n print('NO')\r\nelse:\r\n for i in range(n + 1, m):\r\n if is_prime[i]:\r\n print('NO')\r\n break\r\n else:\r\n print('YES')", "x,y=map(int,input().split())\r\nc1=0\r\nn=0\r\nv1=0\r\ncount=0\r\nfor j in range(2,x):\r\n if x%j==0:\r\n c1=c1+1\r\nif c1>0:\r\n v1=1\r\n \r\n \r\nfor i in range(x+1,y+1):\r\n c=0\r\n for j in range(2,i):\r\n if i%j!=0:\r\n continue\r\n else:\r\n c=c+1\r\n if c==0:\r\n n=i\r\n break\r\n \r\nif n==y:\r\n print(\"YES\")\r\nelse:\r\n \r\n print(\"NO\")\r\n ", "def isPrime(x):\r\n for i in range(2,x//2+1):\r\n if x%i==0:\r\n return -1\r\n return 1\r\nx,y=map(int,input().split())\r\nc=0\r\nx-=1\r\nwhile(c!=2 and x<=y):\r\n x+=1\r\n if isPrime(x)==1:\r\n c+=1\r\nprint(\"YES\" if (x==y and c==2 )else \"NO\")", "u,i=map(int,input().split())\r\nlst=[]\r\nfor x in range(2, i + 1):\r\n if i % x == 0 and x != i:\r\n break\r\n elif i % x == 0 and x == i:\r\n lst.append(1)\r\ni-=2\r\nfor x in range(2, i + 1):\r\n if i % x == 0 and x != i:\r\n i-=2\r\n elif i % x == 0 and x == i and i>u:\r\n lst.append(2)\r\nif 2 in lst:\r\n print(\"NO\")\r\nelif 1 in lst:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(map(int, input().rstrip().split()))\r\nb=[1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\nif a[1] not in b:\r\n print(\"NO\")\r\nelse:\r\n if b.index(a[1])-b.index(a[0])==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nl1=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]\r\nn1=l1.index(n)\r\nif l1[n1+1]==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "inputme=input().split()\r\nques=int(inputme[0])+1\r\nresult=int(inputme[1])\r\nwhile True:\r\n u=0\r\n for i in range(2,ques):\r\n if ques % i == 0:\r\n u+=1\r\n break\r\n if u == 0 and ques == result:\r\n print(\"YES\")\r\n break\r\n elif u == 0 and ques != result:\r\n print(\"NO\")\r\n break\r\n ques+=1\r\n\r\n", "n,m=map(int, input().split())\r\na=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nb=a.index(n)\r\ntry:\r\n\tif a[b+1]==m:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\nexcept:\r\n\tprint('NO')\r\n\t", "def t(s):\r\n for i in range(2, int(s ** 0.5) + 2):\r\n if s % i == 0:\r\n return False\r\n return True\r\n\r\n\r\na, b = map(int, input().split())\r\nfor j in range(a + 1, b):\r\n if t(j):\r\n print(\"NO\")\r\n exit()\r\nif t(b):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "def isprime(num):\r\n for n in range(2, int(num**0.5)+1, 1):\r\n if num%n == 0:\r\n return False\r\n return True\r\nn, m = [int(x) for x in input().split()]\r\nif isprime(m):\r\n for i in range(n+1, m, 1):\r\n if isprime(i):\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "n,m = map(int, input().split())\r\nif n==2 and m==3:\r\n print(\"YES\")\r\nelif n==3 and m==5:\r\n print(\"YES\")\r\nelif n==5 and m==7:\r\n print(\"YES\")\r\nelif n==7 and m==11:\r\n print(\"YES\")\r\nelif n==11 and m==13:\r\n print(\"YES\")\r\nelif n==13 and m==17:\r\n print(\"YES\")\r\nelif n==17 and m==19:\r\n print(\"YES\")\r\nelif n==19 and m==23:\r\n print(\"YES\")\r\nelif n==23 and m==29:\r\n print(\"YES\")\r\nelif n==29 and m==31:\r\n print(\"YES\")\r\nelif n==31 and m==37:\r\n print(\"YES\")\r\nelif n==37 and m==41:\r\n print(\"YES\")\r\nelif n==41 and m==43:\r\n print(\"YES\")\r\nelif n==43 and m==47:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n, m = map(int, input().split())\r\ns = list()\r\ns += (p for p in range(n+1, m+1) if 0 not in [p % d for d in range(2, p//2+1)])\r\nf = bool\r\nif m > 1:\r\n for i in range(2, m):\r\n if m % i == 0:\r\n f = False\r\n break\r\nif f == False:\r\n print('NO')\r\nelse:\r\n if len(s) == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "def isprime(num):\n flag = False\n if num > 1:\n for i in range(2, num):\n if (num % i) == 0:\n flag = True\n break\n return flag\n\nn , m = map(int , input().split())\n\nif(not isprime(m)):\n flag = False\n while True and n <= m:\n n += 1\n if(not isprime(n) and n != m):\n print('NO')\n flag = True\n break\n if(flag == False):\n print('YES')\nelse:\n print('NO')\n", "def isPrime(n):\r\n for i in range(2,n):\r\n if n%i==0:\r\n return 0\r\n return 1\r\n \r\na,b=list(map(int,input().split()))\r\nn=a+1\r\nl=1\r\nwhile(l==1):\r\n if isPrime(n):\r\n l=0\r\n else:\r\n n=n+1\r\nif b==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nn,m=map(int,input().split())\r\nNO=0\r\nYES=0\r\nif n==2 and m==3:\r\n print(\"YES\")\r\n sys.exit()\r\nif n==3 and m==5:\r\n print(\"YES\")\r\n sys.exit()\r\nif n==5 and m==7:\r\n print(\"YES\")\r\n sys.exit()\r\nif n==2 and m!=3:\r\n print(\"NO\")\r\n sys.exit()\r\nif n==3 and m!=5:\r\n print(\"NO\")\r\n sys.exit()\r\nif n==5 and m!=7:\r\n print(\"NO\")\r\n sys.exit() \r\nif m%2==0 or m%3==0 or m%4==0 or m%5==0 or m%6==0 or m%7==0 or m%8==0 or m%9==0:\r\n print(\"NO\")\r\nelse:\r\n for i in range(n,m):\r\n if (i%2!=0) and (i%3!=0) and (i%4!=0) and (i%5!=0) and (i%6!=0) and (i%7!=0) and (i&8!=0) and (i%9!=0) and i!=n:\r\n NO+=1\r\n \r\n \r\n else:\r\n YES+=1\r\n if NO>=1:\r\n print(\"NO\") \r\n else:\r\n print(\"YES\")", "def isprime(n):\n for i in range(2, n):\n if n % i == 0:\n return False\n return True\n\nn, m = map(int, input().split())\n\nprimes = [x for x in range(m+10) if isprime(x)]\n\nprint(\"YES\") if primes[primes.index(n) + 1] == m else print(\"NO\")\n ", "from sys import stdin\r\nn,m = map(int, stdin.readline().rstrip().split(' '))\r\n\r\nnxt = True\r\n\r\nfor i in range(n+1, 100, 1):\r\n is_prime = True\r\n for j in range(2, i, 1):\r\n if i % j == 0:\r\n is_prime = False\r\n break\r\n \r\n if is_prime:\r\n if i == m:\r\n print('YES')\r\n exit()\r\n else:\r\n print('NO')\r\n exit()\r\n\r\nprint('NO')\r\nexit()", "l1=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nm,n=map(int,input().split())\r\nif n not in l1 : print(\"NO\")\r\nelse : \r\n if l1.index(m)==l1.index(n)-1 : print(\"YES\")\r\n else : print(\"NO\")", "ls = list(map(int,input().split()))\r\nn = ls[0]\r\nm = ls[1]\r\nflag = 1\r\np = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nfor i in range(1,15):\r\n if p[i] == m and p[i-1] == n:\r\n print('YES')\r\n flag = 0\r\n break\r\nif flag == 1:\r\n print('NO')", "inn = list(map(int, input().split(\" \")))\ndef isprime(n):\n d = 0\n for i in range(1,n+1):\n if n%i==0:\n d += 1\n if d == 2:\n return True\n else:\n return False\n\nfor i in range(inn[0]+1,inn[1]+2):\n if i<=inn[1]:\n if isprime(i):\n if i == inn[1]:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n break\n else:\n print(\"NO\")", "from math import sqrt\n\ndef checkPrime(n):\n if n<=1:\n return False\n for i in range(2,int(sqrt(n))+1):\n if n%i==0:\n return False\n return True\n\nn,m = map(int,input().split())\nflg = True\nif not (checkPrime(m)):\n print('NO')\nelse:\n for i in range(n+1,m):\n if checkPrime(i):\n print('NO')\n flg= False\n break\n if(flg):\n print(\"YES\")\n", "p=[True]*(51)\r\ni=2\r\nwhile(i*i<=50):\r\n if(p[i]==True):\r\n for j in range(i*i,51,i):\r\n p[j]=False\r\n i+=1\r\nans=[i for i in range(2,51) if(p[i])]\r\n# print(ans)\r\n\r\n\r\nn,m=map(int,input().split())\r\n\r\nif(n<47 and m==ans[ans.index(n)+1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b = map(int, input().split())\n\nprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\n\ni = primes.index(a)\nif i < len(primes) - 1 and primes[i+1] == b:\n print('YES')\nelse:\n print('NO')\n\t \t \t\t \t\t\t\t \t\t \t \t\t \t\t \t\n \t\t\t\t \t \t\t \t\t\t\t\t\t \t\t \t \t\t \t", "\r\ndef isprime(n):\r\n for i in range(n):\r\n\r\n if i!=0 and i!=1 and n%i==0 :\r\n return False\r\n return True\r\n\r\nn,m=list(map(int,input().split()))\r\nwhile n!=m:\r\n n+=1\r\n if isprime(n):\r\n if n==m:print('YES')\r\n else:print('NO')\r\n exit()\r\nprint('NO')\r\n", "import itertools\r\nimport sys\r\nimport decimal\r\nimport collections\r\nimport math\r\nimport itertools as it\r\n\r\ndef readArray(type= int):\r\n line = input()\r\n return [type(x) for x in line.split()]\r\n\r\nprimes = None\r\n\r\ndef genPrimes():\r\n global primes\r\n\r\n n = 100\r\n primes = [True] * n\r\n\r\n primes[0] = primes[1] = False\r\n lim = round(math.sqrt(n))\r\n\r\n for x in range(3, lim, 2):\r\n if not primes[x]:\r\n continue\r\n\r\n for nx in range(x*x, n, 2*x):\r\n primes[nx]= False\r\n\r\n return primes\r\n\r\ndef isPrime(n):\r\n global primes\r\n return n == 2 or primes[n] and n%2 != 0\r\n\r\ndef getNextPrime(x):\r\n global primes\r\n\r\n if x == 2:\r\n return 3\r\n\r\n for i in range(x+2, 100, 2):\r\n if primes[i]:\r\n return i\r\n\r\ndef solve():\r\n global primes\r\n primes = genPrimes()\r\n\r\n a, b = readArray()\r\n\r\n\r\n print('YES' if b == getNextPrime(a) else 'NO')\r\n\r\n # for p, x in enumerate(primes):\r\n # if x and p % 2 != 0:\r\n # print(p)\r\n\r\nif __name__ == '__main__':\r\n # sys.stdin = open('input.txt')\r\n solve()\r\n\r\n", "n,m = map(int, input().split())\r\ns = []\r\nfor i in range(1,m + 1):\r\n s.append(i)\r\nfor i in range(1,len(s)):\r\n for j in range(i + 1,len(s)):\r\n if s[j] == 0 or s[i] == 0:\r\n continue\r\n if s[j] % s[i] == 0:\r\n s[j] = 0\r\nwhile 0 in s:\r\n s.remove(0)\r\nif m not in s:\r\n print(\"NO\")\r\nelse:\r\n if s.index(m) - s.index(n) == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\r\ndef get_ints ():\r\n return map (int, sys.stdin.readline ().strip ().split ())\r\ndef eratosthenes (n, to_print = False, to_list = False):\r\n \"\"\"\r\n This is the sieve of Eratosthenes.As far as I can see implementation of the algorithm is correct. But I am not sure if it is efficient.This function\r\n gives us the sieve in the form of a dictionary. After the function returns, if a given number is not in the dictionary, then it is prime.\r\n Parameters\r\n\r\n to_print - if set True, it will print the sieve, and the list of the prime.\r\n list_prime - if set True, it will print the list of primes.\r\n \"\"\"\r\n sieve = {}\r\n if to_list:\r\n list_prime = []\r\n for i in range (2, n + 1):\r\n if i in sieve:\r\n continue\r\n list_prime.append (i)\r\n for u in range (i**2, n + 1, i):\r\n sieve [u] = i\r\n if to_print:\r\n pass\r\n #print ('sieve:', sieve)\r\n #print ('list of prime:', list_prime)\r\n return list_prime \r\n\r\nn , m = get_ints ()\r\ns= eratosthenes (m, to_list = True)\r\ntry:\r\n if s [ s.index (n) + 1] == m:\r\n print ('YES')\r\n else:\r\n print ('NO')\r\nexcept:\r\n print ('NO')\r\n", "upper_bound = 51\r\nnums = list(range(2, upper_bound))\r\nfor i in range(2, upper_bound // 2):\r\n factor = 2\r\n multiplier = i * factor\r\n while(multiplier < upper_bound):\r\n try:\r\n nums.remove(multiplier)\r\n except ValueError:\r\n pass\r\n factor += 1\r\n multiplier = i * factor\r\n\r\nstr_input = input()\r\nn, m = str_input.split()\r\nn = int(n)\r\nm = int(m)\r\ntry:\r\n if nums.index(n) + 1 == nums.index(m):\r\n print('YES')\r\n else:\r\n print('NO')\r\nexcept ValueError:\r\n print('NO')", "P=(2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,1)\r\nn,m=map(int,input().split())\r\nfor i in range(len(P)):\r\n if n==P[i]:\r\n a=i\r\n break\r\nif m==P[a+1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# LUOGU_RID: 101454592\ndef sieve(n):\r\n primes = set(range(2, n + 1))\r\n for i in range(2, int(n**0.5 + 1)):\r\n primes.difference_update(range(i * 2, n + 1, i))\r\n return list(primes)\r\n\r\n\r\nn, m = map(int, input().split())\r\np = sieve(50)\r\nprint((n in p and m in p and not sum(x in p for x in range(n+1, m))) and 'YES' or 'NO')\r\n", "k=0\r\na,b=map(int,input().split())\r\nfor i in range(a+1,b+1):\r\n k=0\r\n for j in range(2,i):\r\n if i%j==0:\r\n k+=1\r\n else:\r\n if k==0 and i==b:\r\n print(\"YES\")\r\n break\r\n elif k==0 and i!=b:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"NO\")", "from math import sqrt\r\nfrom itertools import count, islice\r\n\r\ndef isPrime(n):\r\n if n < 2:\r\n return False\r\n\r\n for number in islice(count(2), int(sqrt(n) - 1)):\r\n if n % number == 0:\r\n return False\r\n\r\n return True\r\n\r\nm = input()\r\nips = []\r\nips.append(m.split())\r\nfirst = int(ips[0][0])\r\nsecond = int(ips[0][1])\r\nchecker = first\r\nflag = 0\r\nwhile(checker <= second):\r\n checker += 1\r\n if(isPrime(checker)):\r\n flag = 0\r\n if(checker == second):\r\n flag = 1\r\n break\r\n else:\r\n flag = 0\r\n break\r\nif(flag == 0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "n,m = map(int,input().split())\r\nans = 0\r\nz,x = 0,0\r\nfor i in range(n+1,m+1):\r\n for j in range(2,i):\r\n if i%j==0:\r\n ans = 1\r\n if ans == 0:\r\n if i==m:\r\n print('YES')\r\n else:\r\n print('NO')\r\n break\r\n if ans == 1 and i==m:\r\n print('NO')\r\n ans = 0\r\n \r\n", "list1=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nindex_n=0\r\nif n in list1 and m in list1:\r\n index_n=list1.index(n)\r\n if list1.index(m) == list1.index(n)+1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n\tprint(\"NO\")", "n_m = input().split()\nn = int(n_m[0])\nm = int(n_m[1])\n\ndef find_next_prime(n, m):\n while True:\n n += 1 \n for i in range(2, n):\n if n % i == 0:\n break\n else:\n n = n \n break\n\n if n == m:\n print('YES')\n else:\n print('NO')\n\nfind_next_prime(n, m)", "def prime(n):\r\n i=2\r\n while True:\r\n for i in range(2,n+1):\r\n if (n+1)% i == 0:\r\n break\r\n else:\r\n return (n+1)\r\n n+=1\r\n\r\nn,m = map(int,input().split())\r\nnext_prime = prime(n)\r\n# if m == next_prime:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n \r\nprint(\"YES\" if m == next_prime else \"NO\")", "n, m = map(int, input().split())\r\nwhile True:\r\n k = 0\r\n n += 1\r\n for i in range(1, n + 1):\r\n if n % i == 0:\r\n k += 1\r\n if k == 2:\r\n break\r\nif n == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,m=map(int,input().split())\r\nfor i in range(n+1,m+1):\r\n for j in range(2,i):\r\n if i%j==0:\r\n break\r\n else:\r\n if i==m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"NO\")", "import math\r\ndef isPrime(n):\r\n if n<1:\r\n return 1\r\n \r\n for i in range(2,math.floor(math.sqrt(n))+1):\r\n if n%i==0: return 0\r\n \r\n return 1\r\n\r\na,b=map(int,input().split())\r\nif isPrime(b)==0: \r\n print(\"NO\")\r\n exit()\r\nfor i in range(a+1,b):\r\n if isPrime(i):\r\n print(\"NO\")\r\n exit()\r\n \r\nprint(\"YES\")\r\n\r\n ", "def isprime(n):\n for i in range(2, n):\n if n % i == 0 :\n return False\n return True\na, b = map(int, input().split())\ni = a + 1\nwhile True:\n if isprime(i):\n prime = i\n break\n i += 1\nif b == prime:\n print('YES')\nelse:\n print('NO')\n\n\n\n", "class solution:\r\n def __init__(self,n,m):\r\n self.n = n\r\n self.m = m\r\n self.answer = ''\r\n def caluclation(self):\r\n for i in range(self.n+1,self.m):\r\n prime = True\r\n for j in range(2,i):\r\n if i % j == 0:\r\n prime =False\r\n if prime:\r\n self.answer = 'NO'\r\n break\r\n if self.answer:\r\n pass\r\n else:\r\n prime = True\r\n for k in range(2,self.m):\r\n if self.m % k == 0:\r\n prime = False\r\n if prime:\r\n self.answer = 'YES'\r\n else:\r\n self.answer = 'NO'\r\nn,m=map(int,input().split())\r\nroot = solution(n,m)\r\nroot.caluclation()\r\nprint(root.answer)", "import math\r\nn,m=input().strip().split()\r\nn,m=int(n),int(m)\r\nif n==2:\r\n if m==3:\r\n print (\"YES\")\r\n else:\r\n print (\"NO\")\r\n\r\nelse:\r\n flag2=0\r\n\r\n l=n+2\r\n\r\n while flag2==0 and l<=m:\r\n for i in range(2,int(math.sqrt(l))+1):\r\n flag=1\r\n if l%i==0:\r\n flag=0\r\n break\r\n if flag==0:\r\n l+=2\r\n else:\r\n flag2=1\r\n\r\n if l==m:\r\n print (\"YES\")\r\n else:\r\n print (\"NO\")", "\r\ndef solve(n,m):\r\n sieve = [True] * (m + 1)\r\n primes = []\r\n for i in range(2, m + 1):\r\n if sieve[i]:\r\n primes.append(i)\r\n for j in range(i, m + 1, i): \r\n sieve[j] = False \r\n l=len(primes) \r\n if(primes[l-2]==n and m in primes):\r\n print(\"YES\") \r\n else:\r\n print(\"NO\")\r\n \r\nn,m=list(map(int,input().split()))\r\nsolve(n,m)\r\n", "import math\nx,y = map(int,input().split())\n\ndef prime(n):\n if n==0 or n==1 or n%2==0:\n return False\n if n==2 or n==3:\n return True\n m = int(math.sqrt(n))\n for i in range(3,m+1,2):\n if n%i ==0:\n return False\n return True\n\nif not prime(y):\n print(\"NO\")\nelse:\n i = x+1\n while i<y:\n if prime(i):\n print(\"NO\")\n break\n i+=1\n else:\n print(\"YES\")", "def checkPrime(n):\r\n for i in range(2, n):\r\n if(n%i == 0):\r\n return 0\r\n return 1\r\n\r\n# for _ in range(int(input())):\r\nn, m = map(int, input().split())\r\nnum = 0\r\nfor i in range(n + 1, m+1):\r\n if(i%2 == 0):\r\n pass\r\n else:\r\n if(checkPrime(i) == 1):\r\n num = i\r\n break\r\n else:\r\n continue\r\nif(num == m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=map(int,input().split())\r\nx=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nc=x.index(a)\r\nif a==47:\r\n print(\"NO\")\r\nelif b==x[c+1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import sqrt\r\n\r\n\r\nm,n=map(int,input().split())\r\nwhile(m<=n):\r\n m+=1\r\n i=0\r\n for i in range(2,int(sqrt(m))+1):\r\n if(m%i==0):\r\n i=-1\r\n break\r\n if(i!=-1):\r\n break\r\nif(m==n and i!=-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "lst=list(map(int,input().split()))\r\nn=lst[0]\r\nm=lst[1]\r\nlstp=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nif n in lstp and m in lstp:\r\n if lstp.index(n)+1==lstp.index(m):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "import math\r\n\r\nn, m = [int(s) for s in input().split()]\r\n\r\nprimes = []\r\n\r\ndef is_prime(i):\r\n max_divisor = math.floor(math.sqrt(i))\r\n for d in range(2, 1+ max_divisor):\r\n if i % d == 0:\r\n return False\r\n return True\r\n\r\nfor i in range(2, max(n, m)+1):\r\n \r\n if is_prime(i) == True:\r\n primes.append(i)\r\n\r\n\r\nif n not in primes or m not in primes:\r\n print('NO')\r\nelif abs(primes.index(n) - primes.index(m)) != 1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "import math\n\nn, m = [int(x) for x in input().split()]\n\ndef is_prime(n):\n for d in range(2, int(math.sqrt(n))+1):\n if n % d == 0:\n return False\n return True\n\np = n+1\nwhile True:\n if is_prime(p):\n break\n p += 1\n\nprint('YES' if p == m else 'NO')\n", "list1 = [1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n(a, b) = list(map(int, input().split(\" \")))\r\nif b in list1:\r\n if list1.index(b) == list1.index(a)+1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "n,x=map(int, input().split())\r\na=([i for i in range(2,x+1) if all([i%j for j in range(2,i)])])\r\nfor i in range(len(a)):\r\n\tif a[i-1]==n:\r\n\t\tif a[i]==x:\r\n\t\t\tprint('YES')\r\n\t\telse:\r\n\t\t\tprint('NO')", "import sys\na,b = map(int, sys.stdin.readline().strip().split())\n\ndef next_prime(n):\n while True:\n n += 1\n for i in range(2,n):\n if n%i == 0:\n break\n else:\n return n\nif b == next_prime(a):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "from math import sqrt\r\ndef isprime(n):\r\n flag=0\r\n for i in range(2,int(sqrt(n)+1)):\r\n if(n%i==0):\r\n flag=1\r\n break\r\n if flag==1:\r\n return 0\r\n else: \r\n return 1\r\na=list(map(int,input().split()))\r\nif not isprime(a[1]):\r\n print(\"NO\")\r\nelse:\r\n flag=0\r\n for i in range(a[0]+1,a[1]):\r\n if isprime(i):\r\n flag=1\r\n break\r\n if flag==1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\") ", "def isNotPrime(num):\r\n flag = False\r\n for i in range(2, int(num/2+1)):\r\n if num%i==0:\r\n flag=True\r\n return flag\r\n\r\ndef isPrime(num):\r\n flag = True\r\n for i in range(2, int(num/2+1)):\r\n if num%i==0:\r\n flag=False\r\n return flag\r\n\r\n\r\na, b = map(int, input().split())\r\n\r\nif isNotPrime(b):\r\n print(\"NO\")\r\n\r\nelse:\r\n count = 0\r\n for m in range(a+1 ,b):\r\n if isPrime(m):\r\n count+=1\r\n break\r\n if count==1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "a=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m=map(int,input().split())\r\nif m in a and a.index(m)-a.index(n)==1:print('YES')\r\nelse:print('NO')", "def simple(ch):\r\n count = 0\r\n for i in range (1,ch+1):\r\n if (ch%i == 0):\r\n count+=1\r\n if (count == 2):\r\n return 1\r\n else:\r\n return 0\r\na, b = map(int, input().split())\r\nflag = 0\r\nwhile flag == 0:\r\n sh = 0\r\n for i in range(a + 1,b):\r\n if (simple(i) == 1):\r\n sh += 1\r\n if (simple(a) == 1 and simple(b) == 1 and sh == 0 ):\r\n print(\"YES\")\r\n flag = 1\r\n else:\r\n print(\"NO\")\r\n flag = 1", "def checkPrime ( num ):\r\n n = num - 1\r\n while n > 1:\r\n if num % n == 0:\r\n return False\r\n n = n - 1\r\n return True\r\nn , m = input().split() \r\nn = int (n)\r\nm = int (m)\r\ni = n + 1\r\np = 0\r\nif checkPrime(m) == True:\r\n while i < m:\r\n if checkPrime(i) == True:\r\n p = p + 1\r\n break\r\n i = i + 1\r\n if p == 0:\r\n print (\"YES\")\r\n else:\r\n print (\"NO\") \r\nelse:\r\n print (\"NO\")", "t=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\na,b=map(int,input(\"\").split())\r\nif a in t and b in t:\r\n c=t.index(a)\r\n d=t.index(b)\r\n if d-c==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def prime(n):\r\n np=[]\r\n isprime=[]\r\n for i in range (n+1,n+200):\r\n np.append(i)\r\n for j in np:\r\n val_is_prime = True\r\n for x in range(2,j-1):\r\n if j % x == 0:\r\n val_is_prime = False\r\n break\r\n if val_is_prime:\r\n isprime.append(j)\r\n return min(isprime)\r\na,b=list(map(int,input().split()))\r\nif(prime(a)==b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = list(map(int, input().split()))\np = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\nfor i in range(len(p)-1):\n if n == p[i]:\n if m == p[i+1]:\n print(\"YES\")\n else:\n print(\"NO\")\n", "from math import sqrt\n\nn, m = (int(i) for i in input().split())\nnxt = None\nfor i in range(n + 1, m + 1):\n if all(i % j != 0 for j in range(2, int(sqrt(i)) + 1)):\n nxt = i\n break\nres = \"YES\" if nxt == m else \"NO\" \nprint(res)\n", "n,m = map(int,input().split())\r\ndef isPrime(x):\r\n if(x == 2):\r\n return True\r\n for i in range(int(x/2+1),1,-1):\r\n if x%i == 0:\r\n return False\r\n return True\r\nif isPrime(m):\r\n for i in range(n+1,m):\r\n if(isPrime(i)):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "pr = True\r\nn, m = map(int,input().split())\r\nfor i in range(n+1,m+1):\r\n pr = True\r\n for j in range(2, i):\r\n if i%j == 0:\r\n pr = False\r\n if pr == True and i != m:\r\n print (\"NO\")\r\n break\r\n elif pr == False and i == m:\r\n print (\"NO\")\r\n elif pr == True and i == m:\r\n print (\"YES\")", "def next_prime(n,m) :\r\n for num in range(n+1,51) :\r\n if num%2 != 0 :\r\n i = 3\r\n is_prime = True\r\n while i < num/2 :\r\n if num%i == 0 :\r\n is_prime = False\r\n break\r\n i += 1\r\n if is_prime :\r\n return num == m\r\n return False\r\n\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\nif (next_prime(n,m)) :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "\r\ndef is_prime(x):\r\n if x == 1:\r\n return False\r\n elif x in [2, 3, 5, 11, 13]:\r\n return True\r\n elif x % 2 == 0:\r\n return False\r\n else:\r\n for i in range(3, int(x ** 0.5) + 1, 2):\r\n if x % i == 0:\r\n return False\r\n return True\r\n \r\nn, m = map(int, input().split())\r\ntmp = n+1\r\nwhile True:\r\n if is_prime(tmp):\r\n if tmp == m:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n tmp += 1\r\n\r\n\r\n ", "n,m=map(int,input().split())\r\nc=n+1\r\nwhile c<=m:\r\n for i in range(c-1,1,-1):\r\n if c%i==0:\r\n break\r\n else:\r\n if c<m:\r\n print('NO')\r\n elif c==m:\r\n print('YES')\r\n break\r\n c+=1\r\nelse:\r\n print('NO')", "def prime(k):\r\n if k==1:\r\n return False\r\n for i in range(2, int(k/2)+1):\r\n if (k% i) == 0:\r\n return False\r\n return True\r\n\r\nm,n=map(int,input().split())\r\nc=1\r\nif prime(n)==False:\r\n print(\"NO\")\r\nelse:\r\n for i in range(m+1,n):\r\n if prime(i)==True:\r\n c=0\r\n print(\"NO\")\r\n break\r\n if c==1:\r\n print(\"YES\")", "def isPrime(n):\r\n if (n <= 1) : \r\n return False\r\n if (n <= 3) : \r\n return True\r\n \r\n if (n % 2 == 0 or n % 3 == 0) : \r\n return False\r\n \r\n i = 5\r\n while(i * i <= n) : \r\n if (n % i == 0 or n % (i + 2) == 0) : \r\n return False\r\n i = i + 6\r\n \r\n return True\r\n\r\nn,m = map(int,input().split())\r\nflag=0\r\nfor i in range(n+1,m+1):\r\n if isPrime(i):\r\n if i == m:\r\n print(\"YES\")\r\n else:\r\n print('NO')\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"NO\")\r\n ", "def is_prime(n):\r\n s = 0\r\n for i in range(1,n + 1):\r\n if n % i == 0:\r\n s += 1\r\n if s == 2:\r\n return True\r\n else:\r\n return False\r\n\r\nn,m = map(int,input().split())\r\nt = 0\r\nfor i in range(n,m+1):\r\n if is_prime(i):\r\n t += 1\r\n else:\r\n t += 0\r\nif is_prime(m) and is_prime(n) and t == 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\nimport math\ninput = sys.stdin.readline\n\na = [2]\nfor i in range(3, 55):\n ok = 1\n for j in range(2, int(math.sqrt(i)) + 1):\n if i % j == 0: ok = 0\n if ok: a.append(i)\nn, m = map(int, input().strip().split())\nif n in a and m in a and a.index(m) - a.index(n) == 1: print('YES')\nelse: print('NO')\n", "import math\r\nn, m = map(int, input().split())\r\n# checking is the num is prime or not\r\ndef is_prime(num):\r\n if num <= 1:\r\n return False\r\n for i in range(2, int(math.sqrt(num)) + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\n# the next num\r\nnext_prime_n = n + 1\r\nwhile not is_prime(next_prime_n):\r\n next_prime_n += 1\r\n\r\n# Checking and print\r\nif m == next_prime_n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_prime(n1):\n n1 = n1+1\n for i in range(2,n1):\n if (n1 % i) == 0:\n return check_prime(n1)\n return n1\nn = [int(x) for x in input().split()]\nn1 = n[0]\nn2 = n[1]\nn1 = check_prime(n1)\nif n1 == n2:\n print(\"YES\") \nelse:\n print(\"NO\")", "# Time: 2021-06-16 11:13:35\ndef ss(n):\n if n <= 2:\n return []\n else:\n sieve = [True] * (n + 1)\n for x in range(3, int(n ** 0.5) + 1, 2):\n for y in range(3, int(n // x) + 1, 2):\n sieve[(x * y)] = False\n return [2] + [i for i in range(3, n + 1, 2) if sieve[i]]\n\nx, y = map(int, input().split())\nl = ss(y)\nif x in l and y in l:\n a = l.index(x); b = l.index(y)\n print(\"YES\" if b - a == 1 else \"NO\")\nelse:\n print(\"NO\")\n", "def isPrime(n):\r\n for j in range(2,int(n**(1/2)+1),1):\r\n if n % j == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, m = map(int,input().split())\r\nflag = True\r\nfor i in range(n+1,m+1,1):\r\n if i < m and isPrime(i):\r\n #print(i)\r\n flag = False\r\n break\r\nif flag and isPrime(m):\r\n print('YES')\r\nelse:\r\n print('NO')", "n , m = map(int , input().split())\r\n\r\ndef solve(n , m) :\r\n nums = [True] * (m + 1)\r\n i = 2 \r\n while( i <= m) :\r\n a = 2 \r\n while a * i <= m : \r\n nums[a * i] = False\r\n a += 1 \r\n i += 1 \r\n n += 1\r\n while n < m + 1 and nums[n] == False :\r\n n += 1\r\n\r\n if n == m : return \"YES\" \r\n else : return \"NO\"\r\n\r\n\r\n\r\nprint(solve(n,m))", "import math\n\n\ndef is_prime(number):\n if number <= 1:\n return False\n\n for divisor in range(2, int(math.sqrt(number)) + 1):\n if number % divisor == 0:\n return False\n\n return True\n\n\nn, m = map(int, input().split())\nflag = 0\nif is_prime(n) and is_prime(m):\n for i in range(n + 1, m):\n if is_prime(i):\n flag = 1\nelse:\n flag = 1\nif flag == 0:\n print(\"YES\")\nelif flag == 1:\n print(\"NO\")\n\n \t\t \t \t\t \t \t\t\t\t\t", "prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\n\r\nnm = list(map(int,input().split(\" \")))\r\nn = nm[0]\r\n\r\nif prime[prime.index(n)+1] == nm[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\nx,y=map(int,input().split())\r\nif y%2==0 or y%3==0:\r\n\tif y!=2 and y!=3:\r\n\t\tprint('NO')\r\n\telse:\r\n\t\tprint('YES')\r\nelse:\r\n\tx=x+1\r\n\tfor i in range(x,y+2):\r\n\t\tc=[t for t in range(1,round(math.sqrt(i))+1) if i%t==0]\r\n\t\tif i>y:\r\n\t\t\texit(print('NO'))\r\n\t\tif len(c)==1 and i!=y:\r\n\t\t\texit(print('NO'))\r\n\t\tif len(c)==1 and i==y:\r\n\t\t\texit(print('YES'))\r\n\t\tc=c.clear()\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness\r\n", "prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 51]\r\nn, m = map(int, input().split())\r\nprint(\"YNEOS\"[prime[prime.index(n) + 1] != m::2])\r\n", "x,y = map(int,input().split())\r\n\r\n\r\ndef is_prime(x):\r\n return all(x % i for i in range(2, x))\r\n\r\ndef next_prime(x):\r\n return min([a for a in range(x+1, 2*x) if is_prime(a)])\r\n\r\nt = next_prime(x)\r\n \r\nif t==y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n \r\n\r\n \r\n \r\n ", "import math\r\ndef is_prime(n):\r\n if n % 2 == 0 and n > 2:\r\n return False\r\n for i in range(3, int(math.sqrt(n)) + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nn,m = map(int, input().split())\r\nb = is_prime(m)\r\nfor i in range(n+1+n%2,m,2):\r\n if is_prime(i):\r\n b = False\r\n break\r\nif b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nj = n+1\r\nnum = 0\r\nwhile True:\r\n count = 0\r\n for i in range(1, j+1):\r\n if j%i == 0:\r\n count += 1\r\n if count == 2:\r\n num = j\r\n break\r\n j +=1\r\nif num == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\nif n==2:\r\n if m == 3:\r\n print(\"YES\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\ndef IsPrime(n):\r\n d = 2\r\n while n % d != 0:\r\n d += 1\r\n return d == n\r\n\r\nk = n + 2\r\nwhile k < m:\r\n if IsPrime(k) == True:\r\n print(\"NO\")\r\n exit()\r\n k += 2\r\nif IsPrime(m) == True: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x, y = map(int, input().split(' '))\nprime = []\nfor i in range(x, y + 1):\n for j in range(2, i):\n if (i % j) == 0:\n break\n else:\n prime.append(i)\n\nfor key, elem in enumerate(prime):\n if prime[key] == x:\n if len(prime) > 1 and prime[key + 1] == y:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n break\n", "first_prime,next_prime = input().split()\r\nreal_next_prime = 0\r\nfor num in range(int(first_prime)+1,int(next_prime)+1):\r\n factors =0\r\n for factor in range(1,(num//2)+1): \r\n if num % factor ==0:\r\n factors +=1\r\n if factors == 1:\r\n real_next_prime = num\r\n break\r\n \r\nif real_next_prime == int(next_prime):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nc=[1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nif m in c:\r\n l=c.index(m)\r\n g=c.index(n)\r\nelse:\r\n print('NO')\r\n exit()\r\nif l-g==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=[int(x) for x in input().split()]\r\nfor i in range(a[0]+1,a[1]+20):\r\n d=0\r\n for j in range(1,i):\r\n if i%j==0:\r\n d+=1\r\n if d<=1 and i==a[1]:\r\n print(\"YES\")\r\n break\r\n elif d<=1:\r\n print(\"NO\")\r\n break", "def getInput():\r\n enemies = input()\r\n numbers = list(map(int, enemies.split()))\r\n isDDay(numbers[0], numbers[1])\r\n\r\ndef isDDay(casualty1, casualty2):\r\n i = casualty1 + 1\r\n while(i < casualty2):\r\n if(isPrimeNumber(i)):\r\n print('NO')\r\n return\r\n else:\r\n i += 1\r\n if(isPrimeNumber(casualty2)):\r\n print('YES')\r\n return\r\n else:\r\n print('NO')\r\n return\r\n\r\ndef isPrimeNumber(number) -> bool:\r\n i = 2\r\n isPrime = False\r\n while(i < number):\r\n if(number % i != 0):\r\n i += 1\r\n else:\r\n return isPrime\r\n return not isPrime\r\n\r\n\r\n\r\nif(__name__ == '__main__'):\r\n getInput()", "primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 , 53]\r\n\r\nn,m = map(int , input().split() )\r\nres = \"\"\r\ni = primes.index(n)\r\nif primes[i+1] == m:\r\n res = \"YES\"\r\nelse:\r\n res = \"NO\"\r\nprint(res)", "import math\r\n\r\na, b = map(int, input().split())\r\n\r\nl = [2]\r\n\r\nfor num in range(3, 101, 2):\r\n if all(num % i != 0 for i in range(3, int(math.sqrt(num)) + 1, 2)):\r\n l.append(num)\r\n\r\nif b == l[l.index(a) + 1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=list(map(int,input().split(\" \")))\r\nfor i in range(a[0]+1,a[1]+1):\r\n count=0\r\n for j in range(2,a[1]+1):\r\n if i%j==0:\r\n count+=1\r\n if count==1:\r\n if i==a[1]:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n elif count>1 and i==a[1]:\r\n print(\"NO\")\r\n break", "def prime (n):\r\n if n==2:\r\n return n\r\n elif n==3:\r\n return n\r\n else:\r\n for i in range(2,n):\r\n if n%i==0:\r\n return 0\r\n else:\r\n return n\r\na,b=map(int,input().split())\r\nc=[]\r\nfor i in range(a,b+1):\r\n if prime(i)>0:\r\n c+=[i]\r\nif len(c)>=2 and c[0]==a and c[1]==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\na, b = input().split()\r\na, b = int(a), int(b)\r\n\r\nif a not in primes:\r\n print(\"NO\")\r\nelif b not in primes:\r\n print(\"NO\")\r\nelse:\r\n if primes.index(b) == primes.index(a) + 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\n\r\ndef prime(a):\r\n l = 0\r\n for x in range(2, a):\r\n if a % x == 0:\r\n l += 1\r\n if l > 0:\r\n return False\r\n else:\r\n return True\r\n\r\nif prime(m):\r\n for i in range(n+1, n*2):\r\n if prime(i):\r\n if i == m:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('NO')\r\n", "def prime(x):\r\n if x == 2:\r\n return True\r\n for i in range(2, x//2+1):\r\n if x % i == 0:\r\n return False\r\n return True\r\n \r\n\r\nn, m = map(int,input().split(' '))\r\n\r\nc = 0\r\nfor x in range(n+1, m+1):\r\n if prime(x):\r\n c += 1\r\n\r\nif prime(m) and c == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def ispr(n):\r\n for i in range(2,abs(-1*n//2)+1):\r\n if n% i == 0:\r\n return 0\r\n return 1\r\nm,n = map(int,input().split())\r\nif ispr(n):\r\n for i in range(n-1,m,-1):\r\n if ispr(i):\r\n print('NO')\r\n exit()\r\n if ispr(m):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n ", "n, m = map(int,input().split())\r\nprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\nif primes[primes.index(n)+1] == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=map(int,input().split())\nn=120\nprimes=[]\nprime=[True for i in range(n+1)]\np=2\nwhile(p*p<=n):\n if(prime[p]==True):\n for i in range(p*2,n+1,p):\n prime[i]=False\n p+=1\nfor p in range(2,n):\n if prime[p]:\n primes.append(p)\nni=primes.index(a)\n#print(ni)\n#print(primes)\nif(primes[ni+1]==b):\n print('YES')\nelse:\n print('NO')\n", "def prime(n):\r\n for i in range(2, n):\r\n k = True\r\n if n % i != 0 or n == 2:\r\n k = True\r\n else:\r\n k = False\r\n break\r\n return k\r\nn,m = map(int , input().split())\r\nc = True\r\nc2 = True\r\nc3 = True\r\nfor i in range(2 , n):\r\n if n == 2 or n%i != 0:\r\n c = True\r\n else:\r\n c = False\r\n break\r\nfor i in range(2 , m):\r\n if m == 2 or m%i != 0:\r\n c2 = True\r\n else:\r\n c2 = False\r\n break\r\nc1 = 0\r\nif c and c2:\r\n for i in range(n+1 ,m):\r\n if prime(i):\r\n c3 = False\r\n break\r\n else:\r\n c3 = True\r\n\r\nif c3 and c2 and c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_simple(x):\r\n d = 2\r\n while d * d <= x:\r\n if x % d == 0:\r\n return False\r\n d += 1\r\n return True\r\n\r\n\r\nn, m = map(int, input().split())\r\nn += 1\r\nwhile not is_simple(n):\r\n n += 1\r\nif m == n:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=map(int,input().split())\r\nco=0\r\nl=0\r\nfor i in range(a+1,b+1):\r\n c=2\r\n flag=0\r\n while(c*c<=i):\r\n if(i%c==0):\r\n flag=1\r\n c=c+1\r\n if(flag==0):\r\n co=co+1\r\n if(i==b):\r\n l=1\r\n c=2\r\nif(co==1 and l==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a=list(map(int,input().split()))\r\nb=[]\r\nfor num in range(2, 100):\r\n for i in range(2,num):\r\n if ((num % i) == 0):\r\n break\r\n else:\r\n b.append(num)\r\ny=0\r\nfor i in range(len(b)):\r\n if(b[i]==a[0]):\r\n if(b[i+1]==a[1]):\r\n y=1\r\nif(y==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "a,b = map(int,input().split())\r\nwhile True:\r\n a+=1\r\n for i in range(2,a):\r\n if a%i==0:\r\n break\r\n else:\r\n k=a\r\n break\r\nif(k==b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "primes = [0, 0] + [1] * 99\r\nfor p in range(2, 101):\r\n if not primes[p]: continue\r\n for n in range(p * p, 101, p):\r\n primes[n] = 0\r\n\r\nN, M = map(int, input().split())\r\nprint(\"NYOE S\"[int(not sum(primes[N + 1: M]) and primes[M])::2])\r\n", "n, m = map(int, input().split())\r\n\r\nans = 'NO'\r\n\r\ndef isPrime(m):\r\n if m % 2 == 0:\r\n return False\r\n else:\r\n f = 0\r\n for i in range(3, m):\r\n if m % i == 0:\r\n # print(i)\r\n f += 1\r\n break\r\n \r\n if f == 0:\r\n # print(f)\r\n return True\r\n return False\r\n\r\nfor i in range(n + 1, m + 1):\r\n if isPrime(i):\r\n if i == m:\r\n # print(i)\r\n ans = 'YES'\r\n else:\r\n ans = 'NO'\r\n break\r\n \r\nprint(ans)\r\n# print(isPrime(m))\r\n# if isPrime(m):\r\n# print('YES')\r\n# else:\r\n# print('NO')", "\ndef next_prime(n):\n \"\"\"Find next prime\"\"\"\n p=n+1\n while(p>n):\n c=0\n for i in range(2,p):\n if(p%i==0):\n break\n else:c+=1\n if(c>=p-2):\n break\n p+=1\n return p\n\ndef main():\n \"\"\"if/else h == next prime/ h != next prime \"\"\"\n if next_prime(n) == h:\n print(\"YES\")\n else:\n print(\"NO\")\n\nif __name__ == '__main__':\n n, h = map(int, input().split())\n next_prime(n)\n main()", "n,m = input().split()\r\nimport math\r\nn = int(n)\r\nm = int(m)\r\nprime = [1]*51\r\nprime[0] = prime[1] = 0\r\nrang= 50**(1/2)\r\nfor i in range(2,int(rang+1)):\r\n if prime[i] ==1:\r\n \tfor j in range(i*i,50+1,i):\r\n\t \tprime[j] = 0\r\n\r\ncheck = -1\r\nfor x,y in enumerate(prime):\r\n if x == n:\r\n for j in range(x+1,m+1):\r\n if prime[j] == 1:\r\n check = j\r\n break\r\nif check == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import math\r\ndef prime(n):\r\n if n == 2:\r\n return True\r\n else:\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if (n%i) == 0:\r\n return False\r\n return True\r\n\r\nn,m = map(int,input().split())\r\nif not prime(m):\r\n print('NO')\r\nelse:\r\n flag = 0\r\n for i in range(n+1,m):\r\n if prime(i):\r\n flag = 1\r\n if flag:\r\n print('NO')\r\n else: print('YES')", "l=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m=map(int,input().split())\r\nif m not in l:\r\n print(\"NO\")\r\nelif l.index(m)-l.index(n)!=1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def p(x):\r\n if x==1:\r\n return False\r\n if x==2:\r\n return True\r\n\r\n for i in range(2,int(x**0.5)+1):\r\n if x%i==0:\r\n return False\r\n return True\r\n\r\nn,m=map(int,input().strip().split(' '))\r\n\r\nwhile not p(n+1):\r\n n+=1\r\n\r\nif n+1==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "n, m = map(int,input().split())\r\na = list(range(m+1))\r\na[1] = 0\r\nfor i in a:\r\n if i != 0:\r\n for j in range(2*i,m+1,i):\r\n a[j] = 0\r\na = sorted(list(set(a)-{0}))\r\nif m in a:\r\n if a.index(n)+1 == a.index(m):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "primes=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\na,b=map(int,input().split())\r\nif a not in primes or b not in primes or (primes.index(b)-primes.index(a))!=1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\nn,m = map(int,input().split())\r\nif a[a.index(n) + 1] == m: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "a=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,57]\r\nb,c=map(int,input().split())\r\nd=a.index(b)\r\nif(c==a[d+1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,53]\r\nn,m=map(int,input().split())\r\np=l.index(n)\r\nif(m==l[p+1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_prime_basic(number):\r\n if number < 2:\r\n return False\r\n for value in range(2, number):\r\n if number % value == 0:\r\n return False\r\n return True\r\nnumbers = list(map(int, input().split(\" \")))\r\nif is_prime_basic(numbers[1]):\r\n for num in range(numbers[0] + 1,numbers[1]):\r\n if is_prime_basic(num):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\ndef prime_check(m):\r\n count=0\r\n for i in range(1,m+1):\r\n if m%i==0:\r\n count+=1\r\n if count>2:\r\n return False\r\n return True\r\nprinted=False\r\nfor j in range(n+1,m+1):\r\n if prime_check(j):\r\n if j==m:\r\n print('YES')\r\n printed=True\r\n break\r\n else:\r\n print('NO')\r\n printed=True\r\n break\r\nif not printed:\r\n print('NO')", "# def c2I(array):\r\n# newArra=[]\r\n# for i in range(len(array)):\r\n# newArra.append(int(array[i]))\r\ndef isPrime(n):\r\n if n == 1:\r\n return False\r\n if n == 2:\r\n return True\r\n if n % 2 == 0:\r\n return False\r\n i = 2\r\n while(i < (n/2)+1):\r\n if n % i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\n\r\nnums = input()\r\n\r\na = int(nums.split(\" \")[0])\r\nb = int(nums.split(\" \")[1])\r\n\r\n\r\ndef xyz():\r\n if isPrime(b) == False:\r\n return \"NO\"\r\n if(b-a == 1 and isPrime(a+1)):\r\n return \"YES\"\r\n for i in range(a+1, b):\r\n if isPrime(i):\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\nprint(xyz())\r\n", "current, next = map(int, input().split())\r\n\r\ndef is_prime(number):\r\n for n in range(2, int(number**0.5)+1):\r\n if number%n == 0:\r\n return False\r\n return True\r\nflag = False\r\nfor i in range(current+1, next+1):\r\n if is_prime(i) and i == next:\r\n print('YES')\r\n flag = True\r\n break\r\n elif is_prime(i) and i != next:\r\n print('NO')\r\n flag = True\r\n break\r\n\r\nif flag == False:\r\n print('NO')", "import sys\r\n\r\n\r\ndef is_prime(n) -> int:\r\n i = 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n return False\r\n i += 1\r\n\r\n return True\r\n\r\n\r\ndef main() -> None:\r\n read = sys.stdin.readline\r\n n, m = (int(i) for i in read().split())\r\n if not is_prime(m):\r\n print('NO')\r\n return\r\n for i in range(n + 1, m):\r\n if is_prime(i):\r\n print('NO')\r\n return\r\n print('YES')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import math\r\nn,m=map(int,input().split(\" \"))\r\nk=0\r\nfor j in range(n+1,m+1):\r\n ct=0\r\n for i in range(2,int(math.sqrt(j))+1):\r\n if not j%i:\r\n ct+=1\r\n if not ct and j!=m:\r\n print(\"NO\")\r\n k+=1\r\n break\r\n elif not ct and j==m:\r\n k+=1\r\n print(\"YES\")\r\nif k==0:\r\n print(\"NO\")\r\n\r\n ", "n,m=map(int,input().split())\r\na=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\np=len(a)\r\nfor i in range(p):\r\n if a[i]==n:\r\n if a[(i+1)%p]==m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n,m = tuple([int(x) for x in input().strip().split()])\r\ndef prime(i):\r\n for k in range(2,i):\r\n if(i%k == 0):\r\n return 0\r\n return 1\r\n\r\n\r\nj = n + 1\r\nwhile True:\r\n if prime(j) == 1:\r\n if j == m:\r\n print(\"YES\")\r\n exit()\r\n print(\"NO\")\r\n exit()\r\n j+=1", "import math\ndef isPrime(n):\n\tif(n <= 1):\n\t\treturn False\n\tif(n <= 3):\n\t\treturn True\n\tif(n % 2 == 0 or n % 3 == 0):\n\t\treturn False\n\tfor i in range(5,int(math.sqrt(n) + 1), 6):\n\t\tif(n % i == 0 or n % (i + 2) == 0):\n\t\t\treturn False\n\treturn True\ndef nextPrime(N):\n\tif (N <= 1):\n\t\treturn 2\n\tprime = N\n\tfound = False\n\twhile(not found):\n\t\tprime = prime + 1\n\t\tif(isPrime(prime) == True):\n\t\t\tfound = True\n\treturn prime\n\nN,M = [int(i) for i in input().split()]\nif nextPrime(N)==M:\n print(\"YES\")\nelse:\n print(\"NO\")", "from math import sqrt\n\nn,m = map(int, input().split())\n\ndef Prime(n): \n\tF = 1\n\ti = 2\n\twhile (F == 1) and (i <= int(sqrt(n)) + 1):\n\t\tF += 1 if n % i == 0 else 0\n\t\ti += 1\n\treturn F == 1\n\t\nn += 1\nwhile Prime(n) == False: \n\tn += 1\nprint(\"YES\" if n == m else \"NO\")", "lower = 3\r\nupper = 50\r\nlist=[2]\r\nfor num in range(lower, upper + 1):\r\n if num > 1:\r\n for i in range(2, num):\r\n if (num % i) == 0:\r\n break\r\n else:\r\n list.append(num)\r\nn,m=map(int,input().split())\r\nif n in list and m in list:\r\n if list.index(n)+1==list.index(m):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print(\"NO\")", "def prime(p):\r\n if p<= 1:\r\n return False\r\n for i in range(2, int(p**0.5) + 1):\r\n if p%i == 0:\r\n return False\r\n return True\r\np,q=map(int, input().split())\r\na=p+ 1\r\nwhile not prime(a):\r\n a+= 1\r\nif a==q:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l=[int(e) for e in input().split()]\r\np=l[0]+1\r\ndef prime(p):\r\n verif=True\r\n for i in range(2,(p//2)+1):\r\n if(p%i==0):\r\n verif=False\r\n break\r\n return verif\r\nwhile(1):\r\n if(prime(p)==True):\r\n break\r\n p+=1\r\nif(p==l[1]): \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\ndef prime(n):\r\n for i in range(2,n):\r\n if n%i == 0:\r\n return False\r\n return True\r\n\r\nn,m=map(int,input().split())\r\nt = 0\r\nfor i in range(n+1,m+1):\r\n if prime(i):\r\n t = i\r\n break\r\nif t == m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def isPrime(n, i):\r\n \r\n # Corner cases\r\n if (n == 0 or n == 1):\r\n return False\r\n \r\n # Checking Prime\r\n if (n == i):\r\n return True\r\n \r\n # Base cases\r\n if (n % i == 0):\r\n return False\r\n \r\n i += 1\r\n \r\n return isPrime(n, i)\r\n\r\n# prime number from 1 to 50 collect in list\r\nprime_list = []\r\nfor i in range(1, 51):\r\n if isPrime(i, 2):\r\n prime_list.append(i)\r\na,b = map(int, input().split())\r\nfor i in range(len(prime_list)-1):\r\n if prime_list[i] == a and prime_list[i+1] == b:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "a,b = map(int,input().split())\na_index = -1\nb_index = -1\n\nprimes = []\n\nfor x in range(500):\n isPrime = True\n for i in range(x):\n if(i > 1):\n if(x % i == 0):\n isPrime = False\n if(isPrime == True):\n primes.append(x)\n\nfor x in range(len(primes)):\n if(a == primes[x]):\n a_index = x\n if(primes[x+1] == b):\n b_index = x+1\nif(a_index != -1 and b_index != -1):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "a, b = map(int, input().split(' '))\r\nq = True\r\nwhile q:\r\n a += 1\r\n w = 0\r\n for i in range(1, a + 1):\r\n if a % i == 0:\r\n w += 1\r\n if w == 2:\r\n q = False\r\nif b == a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nx=n\r\nwhile True:#when \"True\" is used in \"while\" then loop will move infinity times\r\n n+=1\r\n for i in range(2,n):\r\n if n%i==0: #checking next prime number\r\n break\r\n else:\r\n if n==m:print('YES')\r\n else:print('NO')\r\n break", "def main():\r\n n,m=map(int,input().split())\r\n d=[0]*(m+1)\r\n d1=[]\r\n for i in range(2,m+1):\r\n if d[i]==0:\r\n d1.append(i)\r\n for j in range(i*2,m+1,i):\r\n d[j]=1\r\n if m in d1 and d1.index(m)==d1.index(n)+1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nmain()", "from math import *\r\nn,m = map(int,input().split())\r\ndef prime(x):\r\n if x==1:\r\n return False\r\n else:\r\n for i in range(2,int(sqrt(x))+1):\r\n if(x%i==0):\r\n return False\r\n else:\r\n return True\r\nl=[]\r\nfor i in range(1,100):\r\n if prime(i)==True:\r\n l.append(i)\r\nfor i in range(len(l)):\r\n if l[i]==n:\r\n if l[i+1]==m:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break", "primes=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]\r\na,b=map(int,input().split())\r\nprint(\"YES\" if primes[primes.index(a)+1] == b else \"NO\")", "a,b=input().split()\r\nn=int(a)\r\nm=int(b)\r\ndef ans(i,n):\r\n if n<2:\r\n return \"Invalid\"\r\n else:\r\n if i==n:\r\n return \"Prime\"\r\n else :\r\n if n%i==0:\r\n return \"Not Prime\"\r\n else :\r\n return ans (i+1,n)\r\ndef ans2(i,n,ans ):\r\n if ans(i,n+1)==\"Prime\":\r\n return n+1\r\n else :\r\n return ans2(i,n+1,ans)\r\nc=ans2(2,n,ans)\r\nif c==m:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n=list(map(int,input().split()))\r\nc=0\r\na=n[0]+1\r\nx=0\r\np_lst=[]\r\nwhile True:\r\n for i in range(1,a+1):\r\n if a%i==0:\r\n c+=1\r\n if c==2:\r\n x+=1\r\n p_lst.append(a)\r\n if x==2:\r\n break \r\n a=a+1\r\n c=0 \r\nc=0 \r\nfor i in range(1,n[1]+1):\r\n if n[1]%i==0:\r\n c+=1\r\nif c==2 and n[0]<n[1]<p_lst[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#\r\n\r\n\r\nn,m=map(int,input().split())\r\na=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,0];print('YNEOS'[a[a.index(n)+1]!=m::2])", "lower, higher = [int(x) for x in input().split(\" \")]\r\n\r\ndef isPrime(num):\r\n for z in range(2, int(num**0.5) + 1):\r\n if num % z == 0:\r\n return False\r\n return True\r\n\r\nfor i in range(lower + 1, higher + 1):\r\n if isPrime(i):\r\n if i == higher:\r\n print(\"YES\")\r\n quit()\r\n print(\"NO\")\r\n quit()\r\n\r\nprint(\"NO\")\r\nquit()", "user = [int(x) for x in input().split()]\r\nn, m = user[0], user[1]\r\ntemp = n+1\r\n\r\ndef findNextPrime(temp):\r\n \"\"\"Find next prime\"\"\"\r\n while temp <= 50:\r\n for i in range(2, temp):\r\n if not (temp / i % 1):\r\n break\r\n else:\r\n return temp\r\n temp += 1\r\n\r\nif findNextPrime(temp) == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "def isprime(n):\r\n if n <= 1:\r\n return False\r\n if n <= 3:\r\n return True\r\n\r\n if (n%2 == 0 or n%3==0):\r\n return False\r\n\r\n i = 5\r\n while(i*i<=n):\r\n if (n%i == 0 or n % (i+2)==0):\r\n return False\r\n i+=6\r\n return True\r\n\r\nn,m = map(int,input().split())\r\nans = 'YES'\r\nif isprime(m):\r\n for i in range(n+1,m):\r\n if isprime(i):\r\n ans = 'NO'\r\n break\r\nelse:\r\n ans = 'NO'\r\nprint(ans)", "import math\r\ndef isPrime(n):\r\n if(n<=3):\r\n return True\r\n if(n%2==0 or n%3==0):\r\n return False\r\n for i in range(5,int(math.sqrt(n))+1,6):\r\n if(n%i==0 or n%(i+2)==0):\r\n return False\r\n return True\r\ndef nextPrime(n,m):\r\n prime=n+1\r\n while(prime<m):\r\n ans=isPrime(prime)\r\n if(ans==True):\r\n return False\r\n prime+=1\r\n if(isPrime(m)==True):\r\n #print(\"true\")\r\n return True\r\n else:\r\n return False\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nif(nextPrime(n,m)==True):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 27 22:55:19 2021\r\n\r\n@author: cheehong\r\n\"\"\"\r\ndef prime(num):\r\n flag=False\r\n if num > 1:\r\n # check for factors\r\n for i in range(2, num):\r\n if (num % i) == 0:\r\n # if factor is found, set flag to True\r\n flag = True\r\n # break out of loop\r\n break\r\n return flag\r\nl=list(map(int, input().split()))\r\nn=l[0]\r\nm=l[1]\r\nn+=1\r\nt=0\r\nwhile n<=m:\r\n if n==m:\r\n if prime(n)==False:\r\n print('YES')\r\n t+=1\r\n break\r\n if prime(n)==False:\r\n print('NO')\r\n t+=1\r\n break\r\n n+=1\r\nif t==0:\r\n print('NO')", "m,n=map(int,input().split())\r\nwhile True:\r\n m=m+1\r\n c=0\r\n for i in range(2,m):\r\n if m%i==0:\r\n c=1\r\n break\r\n if c==0:\r\n k=m\r\n break\r\nif k==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def iprime(x):\r\n for p in range(2, x):\r\n if x % p == 0:\r\n return False\r\n else:\r\n return True\r\n\r\nA, B = map(int, input().split())\r\nC = 0\r\n\r\nif iprime(B) == False:\r\n print(\"NO\")\r\nelse:\r\n for p in range(A + 1, B):\r\n if iprime(p) == True:\r\n print(\"NO\")\r\n C = 1\r\n break\r\n else:\r\n continue\r\n if C == 0:\r\n print(\"YES\")\r\n", "from collections import defaultdict\r\nimport math\r\n\r\n\r\ndef SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n ans=[]\r\n for p in range(2, n + 1):\r\n if prime[p]:\r\n ans.append(p)\r\n return ans\r\n\r\n# n=int(input())\r\nn,t=list(map(int,input().split()))\r\n# s=input()\r\n# lis=[]\r\n# for ele in s:\r\n# lis.append(ele)\r\n# print(s)\r\n\r\n# x,y,z=0,0,0\r\n# s1=s.upper()\r\nlis=SieveOfEratosthenes(100)\r\nind = lis.index(n)\r\nif(lis[ind+1]==t):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\ndef is_prime(num):\r\n if num <= 1:\r\n return False\r\n if num == 2:\r\n return True\r\n if num % 2 == 0:\r\n return False\r\n for i in range(3, int(num**0.5) + 1, 2):\r\n if num % i == 0:\r\n return False\r\n return True\r\nnext_num = n + 1\r\nwhile True:\r\n if is_prime(next_num):\r\n break\r\n next_num += 1\r\nif next_num == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\nn,m = map(int,input().split())\r\nnums = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,51]\r\nans = \"NO\"\r\nfor i in range(len(nums)):\r\n if nums[i] == n:\r\n if nums[i+1] == m:\r\n ans = \"YES\"\r\n break\r\nprint(ans)\r\n", "n1,m1=input().split()\r\nn=int(n1)\r\nm=int(m1)\r\ni=2\r\nwhile(i<=m):\r\n if(m%i==0):\r\n break\r\n else:\r\n i+=1\r\nif(i==m):\r\n for i in range(n+1,m+1):\r\n j=2\r\n #print(i)\r\n while(j<=i):\r\n if(i%j==0):\r\n # print(\"OUT\")\r\n break\r\n else:\r\n j+=1\r\n if(j==i and i!=m):\r\n print(\"NO\")\r\n break\r\n elif(j==i and i==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input().split(\" \")\r\n\r\nfor no in range(len(n)):\r\n n[no] = int(n[no])\r\n\r\nflag = False\r\nprime = 0\r\nfor a in range(n[0]+1,n[1]+1):\r\n if flag == True:\r\n break\r\n for b in range(2,a+1):\r\n if b < a and a%b == 0:\r\n break\r\n elif b ==a :\r\n prime = a\r\n flag = True\r\n \r\nif prime == n[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\n\r\nout = False\r\n\r\n\r\ndef check_prime(num):\r\n for l in range(2, 10):\r\n\r\n if (num / l - int(num / l) == 0) and num != l:\r\n return False\r\n\r\n\r\nfor i in range(n + 1, m + 1):\r\n if (check_prime(i)) is None:\r\n\r\n if i != m:\r\n out = False\r\n break\r\n else:\r\n\r\n out = True\r\n else:\r\n\r\n out = False\r\nif out:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def prime(y):\r\n s1=0\r\n for j in range(2,y):\r\n if y%j==0:\r\n s1=1\r\n break\r\n if s1==0:\r\n return True\r\n else:\r\n return False\r\n \r\n\r\nn,m=[int(x) for x in input().split()]\r\ns=0\r\nfor i in range (n+1,m+1):\r\n if prime(i):\r\n if i==m:\r\n print('YES')\r\n exit()\r\n else:\r\n print('NO')\r\n exit()\r\nprint('NO')", "def prost(a):\r\n if a < 2:\r\n return False\r\n for i in range(2, int(a ** 0.5) + 1):\r\n if a % i == 0:\r\n return False\r\n return True\r\nx, y = map(int, input().split())\r\nsled = x + 1\r\nwhile not prost(sled):\r\n sled += 1\r\n\r\nif sled == y:\r\n print('YES')\r\nelse:\r\n print('NO')", "L=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m=map(int,input().split())\r\nfor i in range(len(L)):\r\n if L[i]==n:\r\n if i==len(L)-1:\r\n print(\"NO\")\r\n break\r\n else:\r\n if L[i+1]==m:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break", "import sys\r\nimport os.path\r\nimport math\r\nimport heapq\r\nfrom sys import stdin,stdout\r\nfrom collections import*\r\nfrom math import gcd,ceil,floor\r\nmod = int(1e9+7)\r\n##input=sys.stdin.readline\r\nif os.path.exists('Updated prg/Input3d.txt'):\r\n sys.stdout=open(\"Updated prg/Output3d.txt\",\"w\")\r\n sys.stdin=open(\"Updated prg/Input3d.txt\",\"r\")\r\ndef sinp():return input()\r\ndef ninp():return int(sinp())\r\ndef mapinp():return map(int,sinp().split())\r\ndef linp():return list(mapinp())\r\ndef sl():return list(sinp())\r\ndef prnt(a):print(a)\r\ndef sieve(n):\r\n l2=[]\r\n l1=[1 for _ in range(n+1)]\r\n a=int(math.sqrt(n))\r\n for i in range(2,a+1):\r\n if l1[i]==1:\r\n for j in range(i*i,n+1,i):\r\n l1[j]=0\r\n for i in range(2,n+1):\r\n if l1[i]==1:\r\n l2.append(i)\r\n return l2\r\nn,m=mapinp()\r\nl1=sieve(50)\r\n##prnt(l1)\r\nif n not in l1 or m not in l1:\r\n prnt(\"NO\")\r\nelse:\r\n a=l1.index(n)\r\n b=l1.index(m)\r\n if abs(a-b)==1:\r\n prnt(\"YES\")\r\n else:\r\n prnt(\"NO\")", "a = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nn, m = map(int, input().split())\r\nif n in a and m in a:\r\n ind1 = a.index(n)\r\n ind2 = a.index(m)\r\n if abs(ind1 - ind2) == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\ndef checkprime(n):\r\n if n<2:\r\n return False\r\n if n==2:\r\n return True\r\n for i in range(2,round(math.sqrt(n))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\na,b=map(int,input().split())\r\nout=0\r\nif checkprime(b):\r\n for i in range(a+1,b+1):\r\n if checkprime(i):\r\n out=i\r\n break\r\n else:\r\n out=0\r\n if out==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n ", "import sys\nimport math\n\nnext_prime = {2: 3, 3: 5, 5: 7, 7: 11, 41: 43, 11: 13, 13: 17, 17: 19, 37: 41, 19: 23, 43: 47, 23: 29, 31: 37, 29: 31, None: 2}\n\ndef main(n, m):\n return n in next_prime and next_prime[n] == m\n\nif __name__ == \"__main__\":\n for e, line in enumerate(sys.stdin.readlines()):\n n, m = map(int, line.strip().split())\n\n # Proof by induction that sorting is that\n # same as solving this problem.\n print(\"YES\" if main(n, m) else \"NO\")\n", "n , m = [int(i) for i in input().split()] \r\n\r\ndef isPrime(n):\r\n for i in range(2 , n):\r\n if n % i == 0:\r\n return False\r\n\r\n return True \r\n\r\nfirstPrime = None\r\nfor i in range(n + 1 , 51):\r\n if isPrime(i):\r\n firstPrime = i\r\n break\r\n\r\nif firstPrime == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "def sieve(n):\r\n ls = [i for i in range(n + 1)]\r\n for i in range(2, int(n ** 0.5) + 1):\r\n if ls[i] == i:\r\n for j in range(i * 2, n+1, i):\r\n ls[j] = -1\r\n while -1 in ls:\r\n ls.remove(-1)\r\n ls.remove(0)\r\n ls.remove(1)\r\n return ls\r\nn, m = map(int, input().split())\r\nls = sieve(m)\r\nif m not in ls:\r\n print('NO')\r\nelse:\r\n m_idx = ls.index(m)\r\n n_idx = ls.index(n)\r\n if m_idx - n_idx != 1:\r\n print('NO')\r\n else:\r\n print('YES')\r\n\r\n", "numbers = input().split()\r\n\r\nn = int(numbers[0])\r\nm = int(numbers[1])\r\n\r\ndef isPrime(x):\r\n for i in range(2,(x//2) + 1):\r\n if x%i==0:\r\n return 0\r\n \r\n return 1\r\n \r\nflag=1\r\n\r\nif isPrime(m) == 1: #checking if m prime\r\n for i in range(n+1,m): #checking if any other prime within n,m\r\n if isPrime(i) == 1:\r\n print(\"NO\")\r\n exit(0)\r\nelse:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")", "#problem 1 solution\nn,m=input().split(\" \")\nn=int (n)\nm=int (m)\n \ndef isprime(x): \n if x == 0 or x == 1:\n return False\n elif x == 2:\n return True\n for n in range(2,x-1): \n if x % n == 0: \n return False\n else: \n return True\n# checks if the number is prime or not\n\ndef primelist(primes):\n prime_list=[]\n for k in range (2,primes):\n if isprime(k):\n prime_list.append(k)\n if isprime(primes):\n prime_list.append(primes)\n return prime_list\n# returns the list of primes\n\ndef nextprime(np):\n dalist=primelist(np)\n if np>n:\n if isprime(np):\n if n == dalist[-2]:\n print(\"YES\")\n else:\n print(\"NO\")\n else: print(\"NO\")\n else: \n print(\"NO\")\n# reurns the next prime\nnextprime(m)\n\n \n\n\n \t\t \t \t\t \t\t \t \t \t \t\t\t\t \t \t", "a=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nc,b=map(int,input().split())\r\n\r\nif (not c in a) or not b in a:\r\n print(\"NO\")\r\n \r\nelse:\r\n if (a.index(b)-a.index(c))==1:\r\n print(\"YES\")\r\n \r\n else:\r\n print(\"NO\")\r\n ", "import math\r\nx , y = map(int,input().split())\r\ndef is_prime(num):\r\n for i in range(2,int(math.sqrt(num))+1):\r\n if num % i == 0:\r\n return False\r\n return True \r\n \r\nnext_prim = x + 1\r\nwhile not is_prime(next_prim):\r\n next_prim+=1\r\n\r\nif y == next_prim:\r\n print(\"YES\")\r\nelse:\r\n print('NO') \r\n", "import sys\r\nn, m = map(int, sys.stdin.read().strip().split())\r\nis_prime = lambda x: all(x%i for i in range(2, int(x**.5+1)))\r\ndef chk_next(n, m):\r\n if not is_prime(m): return 'NO'\r\n for i in range(n+1, m):\r\n if is_prime(i):\r\n return 'NO'\r\n return 'YES'\r\nprint(chk_next(n, m))", "from math import sqrt\r\na, b = map(int, input().split())\r\n\r\ndef isPrime(n):\r\n for i in range(2, int(sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nif isPrime(b) == False or a == b:\r\n print(\"NO\")\r\n exit()\r\n \r\nfor i in range(a + 1, b):\r\n if isPrime(i):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n ", "def is_prime(z):\r\n return not any(bool(z % k == 0) for k in range(2, z))\r\n\r\nn, m = map(int, input().split())\r\n\r\nis_next_prime = not any(is_prime(k) for k in range(n+1, m)) and is_prime(m)\r\nprint(['NO', 'YES'][int(is_next_prime)])", "def listInput():\r\n return [int(x) for x in input().split()]\r\n \r\nn,m = listInput()\r\nprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nif m in primes and primes.index(n)+1 == primes.index(m):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = map(int,input().split())\r\nk=0\r\nl=0\r\nfor i in range (1, m+1):\r\n\tif m%i==0:\r\n\t\tk += 1\r\nif k==2:\r\n\tfor i in range (n+1, m):\r\n\t\tc=0\r\n\t\tfor j in range (1, i+1):\r\n\t\t\tif i%j==0:\r\n\t\t\t\tc += 1\r\n\t\tif c==2:\r\n\t\t\tl += 1\r\n\tif l==0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelse:\r\n\tprint(\"NO\")\r\n\t", "'''input\n7 11\n'''\ndef is_prime(n):\n\tif n < 2: return False\n\telif n == 2: return True\n\telif n % 2 == 0: return False\n\telif all(n % i != 0 for i in range(3, int(n**0.5)+1, 2)): return True\n\treturn False\nn, m = map(int, input().split())\nif n == 2:\n\tprint(\"YES\" if m == 3 else \"NO\")\nelse:\n\tif is_prime(m):\n\t\tfor x in range(n+2, m, 2):\n\t\t\tif is_prime(x):\n\t\t\t\tprint(\"NO\")\n\t\t\t\tbreak\n\t\telse:\n\t\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n\n\n\n\n", "n,m=map(int,input().split())\r\na,b=0,0\r\nx=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nfor i in range(0,len(x)):\r\n if(x[i]==n):\r\n a=i+1\r\n elif(x[i]==m):\r\n b=i+1\r\nif(a==0 or b==0):\r\n print(\"NO\")\r\nelif(b-a>1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split())\r\nfound=0\r\nfor i in range(n+1,51):\r\n if (i==2 or i==3 or i==5 or i==7 ) or (i%2!=0 and i%3!=0 and i%5!=0 and i%7!=0):\r\n found=i\r\n #print(found)\r\n break\r\n else:\r\n continue\r\n\r\nif found==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n", "import math\r\n\r\n\r\ndef isPrime(n):\r\n if 4 > n > 1:\r\n return True\r\n for i in range(2,int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef nextPrime(n):\r\n x = n + 1\r\n while not isPrime(x):\r\n x += 1\r\n return x\r\n\r\n\r\nn, m = [int(x) for x in input().split()]\r\nh = nextPrime(n)\r\nif h == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_prime(n):\n i = 2\n while (i ** 2) <= n:\n if n % i == 0:\n return False\n i += 1\n return True\n\nn, m = [int(x) for x in input().split()]\n\nprimes = [x for x in range(n + 1, m) if is_prime(x)]\n\nif primes == [] and is_prime(m):\n print('YES')\nelse:\n print('NO')\n", "import math\r\n\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\ndef are_consecutive_primes(a, b):\r\n if not is_prime(a):\r\n return False\r\n for num in range(a + 1, b + 1):\r\n if is_prime(num):\r\n if num == b:\r\n return True\r\n elif num < b:\r\n break\r\n return False\r\n \r\nnumbers = input().split()\r\nnum1 = int(numbers[0])\r\nnum2 = int(numbers[1])\r\n \r\nif are_consecutive_primes(num1, num2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "tm = input().split()\r\nn, m = int(tm[0]), int(tm[1])\r\nx = 0\r\nprime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nfor i in range(len(prime)):\r\n if prime[i] > n:\r\n x = prime[i]\r\n break\r\nif x == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "prime = []\r\ndef isPrime(num):\r\n if num in prime:\r\n return True\r\n\r\n i = 0\r\n while i < len(prime) and prime[i] <= (num) ** (0.5):\r\n if num % prime[i] == 0:\r\n return False\r\n\r\n i += 1\r\n\r\n prime.append(num)\r\n return True\r\n\r\n\r\ndef solution(n, m):\r\n for i in range(2, m+1):\r\n isPrime(i)\r\n\r\n if m in prime:\r\n index = prime.index(n)\r\n if index + 1 < len(prime) and prime[index + 1] == m:\r\n return True\r\n\r\n return False\r\n\r\n\r\nn, m = [int(i) for i in input().split()]\r\nres = \"YES\" if solution(n, m) else \"NO\"\r\nprint(res)\r\n", "from math import sqrt\n\ndef isPrime(i):\n for j in range(2, int(sqrt(i))+1):\n if i % j == 0:\n return 0\n return 1\n\ndef main():\n n, m = [int(i) for i in input().split(' ')]\n \n for i in range(n+1, m):\n if isPrime(i):\n print('NO')\n exit()\n \n if isPrime(m):\n print('YES')\n else:\n print('NO')\n \n \nif __name__ == \"__main__\":\n main()", "n,m = [int(i) for i in input().split()]\r\n\r\nl = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nfor i in range(len(l) - 1):\r\n if l[i] == n and l[i+1] == m:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "d=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,51]\r\nn,m=map(int,input().split())\r\nind=d.index(n)\r\nif d[ind+1]==m:\r\n print('YES')\r\nelse:\r\n print('NO')", "def isprime(x):\r\n\tfor i in range(2,x+1):\r\n\t\tif(x%i == 0):\r\n\t\t\tif(i==x):\r\n\t\t\t\treturn True\r\n\t\t\telse:\r\n\t\t\t\treturn False\r\n\r\na, b = map(int, input().split())\r\nprime = []\r\n\r\nfor k in range(a,b+1):\r\n\tif(isprime(k)):\r\n\t\tprime.append(k)\r\n\r\nif(prime==list([a,b])):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import math\r\n\r\nline = input().split(\" \")\r\n\r\nn = int(line[0])\r\nm = int(line[1])\r\n\r\nnew_val = n+1\r\nprime_val = 0\r\n\r\nwhile(new_val<=m):\r\n sqrt_val = int(math.sqrt(new_val))\r\n flag_val = 0\r\n \r\n for i in range(2,(sqrt_val+1)):\r\n if(new_val%i==0):\r\n flag_val = 1\r\n break\r\n \r\n if(flag_val==0):\r\n prime_val = new_val\r\n break\r\n \r\n new_val+=1\r\n\r\nif(prime_val==m):\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n\r\n\r\n \r\n \r\n ", "from math import factorial\na,b = map(int,input().split())\nfor i in range(a + 1, b +1):\n\tif factorial(i - 1) % i == i -1:\n\t\tif i == b:\n\t\t\tprint(\"YES\")\n\t\t\texit()\n\t\telse:\n\t\t\tprint(\"NO\")\n\t\t\texit()\nprint(\"NO\")\n", "def simp(n):\r\n if n!=2 and n!=3 and n!=5 and n!=7 and n!=11:\r\n if n%2!=0 and n%3!=0 and n%5!=0 and n%7!=0 and n%11!=0:\r\n return True\r\n else:\r\n return True\r\ndef solve():\r\n n,m=map(int,input().split())\r\n k=n+1\r\n while not simp(k):\r\n k+=1\r\n if m==k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n#\\\\\\\r\n \r\nsolve()\r\n\r\n#\\\\\\\r\n", "n,m=list(map(int,input().split()))\r\nfor x in range(2,n//2+1):\r\n if n%x==0:\r\n print(\"NO\")\r\n exit()\r\nfor x in range(2,m//2+1):\r\n if m%x==0:\r\n print(\"NO\")\r\n exit()\r\nk=0\r\nfor x in range(n+1,51):\r\n a=0\r\n for i in range(2,x//2+1):\r\n if x%i==0:\r\n a+=1\r\n break\r\n if a==0:\r\n k=x\r\n break\r\nif k==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n l = list(input().split())\r\n ls = [int(i) for i in l]\r\n lw = [2, 3, 5, 7]\r\n for i in range(11, 51, 2):\r\n if i % 3 != 0 and i % 5 != 0 and i % 7 != 0:\r\n lw.append(i)\r\n lw.append(0)\r\n a = lw.index(ls[0])\r\n if ls[1] == lw[a + 1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "(n,m)=map(int,input().split(' '))\r\n\r\n\r\nl=[]\r\nfor number in range (2, 51): \r\n if number > 1: \r\n for i in range (2, number): \r\n if (number % i) == 0: \r\n break \r\n else: \r\n l.append(number) \r\n\r\n\r\nif m in l and l.index(m)-l.index(n)==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "inputs = input().split(' ')\r\nn = int(inputs[0])\r\nm = int(inputs[1])\r\n\r\nnextNum = n + 1\r\nmIsNext = True\r\n\r\nfor i in range(n + 1, m + 1):\r\n dividedCount = 0\r\n for j in range(2, nextNum):\r\n if nextNum % j == 0:\r\n dividedCount += 1\r\n if dividedCount == 0 and nextNum != m or dividedCount > 0 and nextNum == m:\r\n mIsNext = False\r\n break\r\n nextNum += 1\r\n\r\nif mIsNext:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "primes=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nn, m=[int(k) for k in input().split()]\r\nif primes[primes.index(n)+1]==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nprime = False\r\n\r\ndef isPrime(x):\r\n\tfor i in range(2,x):\r\n\t\tif x%i == 0:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nfor i in range(n+1, m):\r\n if isPrime(i) == True:\r\n prime = True\r\n break\r\n \r\nif prime is True or isPrime(m) is False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "is_prime = lambda p: not any(d for d in range(2, p) if p % d == 0)\nn, m = map(int, input().split())\nprint('YES' if is_prime(n) and is_prime(m) and not any(is_prime(p) for p in range(n + 1, m)) else 'NO')\n", "import math\r\nn, m = [int(x) for x in input().split()]\r\n\r\n\r\ndef is_prime(n):\r\n if n == 2:\r\n return True\r\n if n < 2 or n % 2 == 0:\r\n return False\r\n\r\n upper_bound = int(math.sqrt(n))+1\r\n for i in range(3, upper_bound, 2):\r\n if n % i == 0:\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef count_prime(first, second):\r\n for i in range(first+1, second+1):\r\n if is_prime(i):\r\n return i\r\n\r\n\r\nresult = count_prime(n, m)\r\nif result == m:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "def isPrime(num):\r\n for i in range(2, int(num/2)+1):\r\n if (num % i) == 0:\r\n return False\r\n return True\r\n\r\ndef solve(n,m):\r\n if n == 2:\r\n return \"YES\" if m==3 else \"NO\"\r\n x = n + 2\r\n while True:\r\n if isPrime(x):\r\n return \"YES\" if x == m else \"NO\"\r\n x+=1 \r\n if x > m:\r\n return \"NO\"\r\n\r\nn,m = map(int,input().split())\r\n# a = input()\r\n# b = input()\r\n\r\nprint(solve(n,m))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "primes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,None]\n\nn,m = map(int, input().split())\nif primes[primes.index(n) + 1] == m:\n print(\"YES\")\nelse:\n print(\"NO\")", "t = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\na, b = map(int, input().split())\r\nprint(['NO', 'YES'][t[t.index(a) + 1] == b])", "n,m=map(int,input().split())\r\nfor i in range(n+1,n*n):\r\n k=0\r\n for j in range(2,i): \r\n if (i % j) == 0:\r\n k=1\r\n break\r\n if k==0:\r\n break\r\nprint([\"NO\",\"YES\"][i==m])", "def checkPrime(n):\r\n for i in range(2, int(n ** 0.5) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nx, y = [int(i) for i in input().split()]\r\nif not checkPrime(x):\r\n print(\"NO\")\r\nelse:\r\n z = x + 1\r\n while not checkPrime(z):\r\n z += 1\r\n if z == y:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\nindex = 0\r\nc = a + 1\r\nfor i in range(c, 51):\r\n cnt = 0\r\n for j in range(2, i):\r\n if(i % j == 0):\r\n cnt += 1\r\n break\r\n if(cnt == 0):\r\n index = i\r\n break\r\nif(index == b):\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b= [int(i) for i in input().split()]\r\nif a==2:\r\n if b==3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n def prime(num):\r\n for i in range (2,(num//2)+1):\r\n if num%i==0:\r\n return 0\r\n return num\r\n a+=2\r\n while True:\r\n x=prime(a)\r\n if x==0:\r\n a+=2\r\n else:\r\n if x==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break", "l=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 ,53]\r\np=input().split()\r\n\r\nm=int(p[0])\r\nn=int(p[1])\r\n\r\nif m not in l:\r\n print(\"NO\")\r\nelif n not in l:\r\n print(\"NO\")\r\nelse:\r\n\r\n for i in range(len(l)):\r\n if l[i]==m:\r\n if l[i+1]==n:\r\n print(\"YES\")\r\n break\r\n else:\r\n print( \"NO\")\r\n break", "def prime(n):\r\n if (n == 0 or n == 1):\r\n return False\r\n \r\n if (n & 1 == False):\r\n if (n == 2):\r\n return True\r\n else:\r\n return False\r\n \r\n for i in range(2, int(n / 2) + 1):\r\n if (n % i == 0):\r\n return False\r\n \r\n return True\r\n\r\nn, m = map(int, input().split())\r\nk = n + 1\r\na = 0\r\nwhile(k):\r\n if (prime(k)):\r\n a += k\r\n break\r\n k += 1\r\n \r\n \r\nif a == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nlst=[]\r\nfor i in range(n,m+1):\r\n \"\"\"for j in range(2,i):\r\n if i%j!=0:\r\n flag=1\r\n else:\r\n break\"\"\"\r\n if all(i%j!=0 for j in range(2,i)):\r\n lst.append(i)\r\nif m in lst:\r\n if lst[1]==m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "l=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nk=list(map(int,input().split()))\r\nif k[1] in l:\r\n if l.index(k[1])-l.index(k[0])==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\nn,m = [int(x) for x in input().split()]\r\npos = prime.index(n)\r\npos = pos+1\r\nif m == prime[pos]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m=map(int,input().split())\r\nc=0\r\nfor num in range(n+1,m+1):\r\n if num > 1:\r\n \r\n for i in range(2, int(num/2)+1):\r\n if (num % i) == 0:\r\n break\r\n else:\r\n c+=num\r\n break\r\nif c==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_prime(num):\r\n if num < 2:\r\n return False\r\n for i in range(2, int(num**0.5)+1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\n\r\nnext_prime = n+1\r\nwhile not is_prime(next_prime):\r\n next_prime += 1\r\n\r\nif m == next_prime:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "prime=[ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nn,m=map(int,input().split())\r\nif n in prime and m in prime:\r\n x=prime.index(n)\r\n y=prime.index(m)\r\n y1=x+1\r\n if y1==y:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "l=[1]*1000001\r\nl[0]=0\r\nl[1]=0\r\nfor i in range(1000001):\r\n if l[i]==1:\r\n l[i]=i\r\n for j in range(i*i,1000001,i):\r\n l[j]=0\r\n# print(l[:51])\r\na,b=map(int,input().split())\r\nfor i in range(l[a]+1,1000001):\r\n if l[i]!=0:\r\n if l[i]==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\r\n ", "x, y = input(\"\").split()\r\nx=int(x)\r\ny=int(y)\r\nh=True\r\nfor i in range(2, y):\r\n\tif y%i==0:\r\n\t\tprint(\"NO\")\r\n\t\th=False\r\n\t\tbreak\r\nif h:\r\n\t\ti=0\r\n\t\tj=False\r\n\t\tfor i in range(x+1, y+1):\r\n\t\t\t \r\n\t\t\t if j:\r\n\t\t\t \tbreak\r\n\t\r\n\t\t\t for k in range(2, i):\r\n\t\t\t \t if i%k==0:\r\n\t\t\t \t \t pass\r\n\t\t\t \t \t break\r\n\t\t\t else:\r\n\t\t\t \t j=True\r\n\t\tif i == y:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\t\t\r\n\t\t\t \t\r\n\t", "n=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\na,b=map(int,input().split())\r\n\r\nif b in n:\r\n if n.index(a)+1==n.index(b):\r\n print(\"YES\")\r\n else:print(\"NO\") \r\nelse:print(\"NO\") ", "def nxt_prime(num):\r\n\tfor i in range(2,(num//2)+1):\r\n\t\tif num%i==0:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nn, m =map(int, input().split())\r\n\r\nfor j in range(n+1, m+n):\r\n\tif nxt_prime(j):\r\n\t\tbreak\r\nif j==m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import sys\r\ninput = sys.stdin.buffer.readline\r\n \r\n# t = int(input())\r\n# for _ in range(t):\r\nn, m = map(int, input().split())\r\n \r\nMAX_SIZE = 1000\r\n \r\nisprime = [True] * MAX_SIZE\r\nprime = []\r\nSPF = [None] * (MAX_SIZE)\r\n \r\ndef manipulated_seive(N):\r\n \r\n isprime[0] = isprime[1] = False\r\n \r\n \r\n for i in range(2, N):\r\n \r\n if isprime[i] == True:\r\n \r\n prime.append(i)\r\n \r\n SPF[i] = i\r\n \r\n j = 0\r\n while (j < len(prime) and\r\n i * prime[j] < N and\r\n prime[j] <= SPF[i]):\r\n \r\n isprime[i * prime[j]] = False\r\n \r\n SPF[i * prime[j]] = prime[j]\r\n \r\n j += 1\r\n \r\n \r\nN = m+1\r\n \r\nmanipulated_seive(N)\r\n \r\ni = 0\r\nwhile i < len(prime) and prime[i] <= N:\r\n if prime[i] == n:\r\n break\r\n # print(prime[i], end = \" \")\r\n i += 1\r\n# print(prime)\r\nif m in prime and m == prime[i+1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def prime(i):\r\n for j in range(2,(i//2)):\r\n if(i%j==0):\r\n return False\r\n return True\r\ndef pano(n,m):\r\n if(m%2==0):\r\n return \"NO\"\r\n for i in range(n+1,m+1):\r\n if(i%2!=0 and prime(i)):\r\n if(i==m):return \"YES\"\r\n else:return \"NO\"\r\n return \"NO\"\r\nn,m=map(int,input().split())\r\nprint(pano(n,m))\r\n\r\n\r\n", "def checkprime(n):\r\n for i in range(2,(n//2)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\nm,n=input().split()\r\nm,n=int(m),int(n)\r\nl=[]\r\nfor i in range(m+1,n+1):\r\n if checkprime(i):\r\n l.append(i)\r\n\r\nif len(l)>0:\r\n if l[0]==n:\r\n print('YES') \r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "# cook your dish here\r\ntry:\r\n a,b=map(int,input().split())\r\n x=['2','3','5','7','11','13','17','19','23','29','31','37','41','43','47'] \r\n x=list(map(int,x))\r\n f=0\r\n for i in range(0,len(x)-1):\r\n if x[i]==a and x[i+1]==b:\r\n # print(\"a\")\r\n f=1\r\n break\r\n \r\n if f==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\nexcept:\r\n pass", "arr = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\n\r\nn,m = map(int, input().split())\r\n\r\nx = 0\r\n\r\nfor item in arr:\r\n \r\n if item == n:\r\n \r\n break\r\n \r\n x += 1\r\n \r\nindex_n = x\r\n \r\nx = 0\r\n\r\nfor item in arr:\r\n \r\n if item == m:\r\n \r\n break\r\n \r\n x += 1\r\n \r\nprint(\"NO\" if n == 47 else \"YES\" if x-index_n == 1 else \"NO\")", "l=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m=map(int,input().split())\r\nfor i in l:\r\n if i>n:\r\n break\r\nif i==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isprime(n):\r\n for j in range(2,n):\r\n if n%j==0:\r\n return False\r\n break\r\n else:\r\n return True\r\ni=[int(x) for x in input().split()]\r\nc=True\r\nif isprime(i[0]) and isprime(i[1]):\r\n for f in range(i[0]+1,i[1]):\r\n if isprime(f):\r\n c=False\r\n break\r\nelse:\r\n c=False\r\nif c==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\n\na = list(map(int, input().split()))\nif a[0] not in prime or a[1] not in prime:\n print('NO')\nelse:\n print(\"YES\") if prime.index(a[1]) - prime.index(a[0]) == 1 else print(\"NO\")", "def solve(n, m):\n primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\n try:\n if primes.index(n) + 1 == primes.index(m):\n return \"YES\"\n except:\n pass\n return \"NO\"\n\n\ndef main():\n n, m = list(map(int, input().split()))\n print(solve(n, m))\n\n\nmain()\n", "x, y = map(int, input().split())\r\nisPrime=lambda x: all(x % i != 0 for i in range(2,int(x**0.5)+1))\r\nprint(('YES' if len([item for item in range(x,y+1) if isPrime(item)]) == 2 else 'NO') if isPrime(y) else 'NO')\r\n", "def isPrime(n):\n for i in range(2,int(n**0.5)+1):\n if n%i==0:\n return False\n\n return True\n\ndef solve(n1, n2):\n n1 += 1\n while n2 >= n1:\n if isPrime(n1):\n break\n else:\n n1 += 1\n print('YES' if n1 == n2 else 'NO')\n\nif __name__ == \"__main__\":\n n1, n2 = input().split()\n n1, n2 = int(n1), int(n2)\n if not isPrime(n2):\n print('NO')\n else:\n solve(n1, n2)", "# Panoramix's Prediction ----------- problem/80/A\r\n\r\ns=input()\r\nn,m = [int(k) for k in s.split(\" \")]\r\nprime = True\r\n\r\nfor i in range(2,m):\r\n if m%i==0:\r\n print('NO')\r\n quit()\r\nfor i in range(n+1,m):\r\n for j in range(2,i):\r\n if i%j==0:\r\n prime = False\r\n break\r\n else:\r\n print('NO')\r\n quit()\r\n\r\n\r\nprint('YES')", "a,b = [int(i) for i in input().split(' ')]\nfor j in range(a+1, b+1):\n tmp = 0\n for i in [2,3,5,7,11,13,17,19,23]:\n if i<j and j%i==0:\n tmp=1\n break\n if tmp==0:\n break\nif j!=b or tmp==1:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "# 80A\r\n\r\n# Need to determine if the second number of the input is the very\r\n# next prime number in a sequence of prime numbers.\r\n\r\n# ie: if the first number is a 2 and the second number is a 3,\r\n# then we output \"YES\" because 3 is the next number in the sequence\r\n# of prime numbers.\r\n\r\n# This problem is limited to numbers equal to or less than 50, so\r\n# we can iterate or hard code the answer.\r\n\r\n# To solve we can just hard code out prime numbers from 2-50 and\r\n# compare the two numbers.\r\n\r\nnumbers = [int(i) for i in input().split()]\r\n\r\nnumber1 = numbers[0]\r\n\r\nnumber2 = numbers[1]\r\n\r\nnextPrime = 0\r\n\r\n\r\nprimeNumbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\r\ntry:\r\n nextPrime = primeNumbers[(primeNumbers.index(number1)+1)]\r\n\r\nexcept:\r\n pass\r\n \r\nif number2 == nextPrime:\r\n output = \"YES\"\r\nelse:\r\n output = \"NO\"\r\n\r\nprint(output)", "l1=[int(i) for i in input().split()]\r\nn=l1[0]\r\nm=l1[-1]\r\n\r\nl2=[]\r\ni=2\r\nwhile i<=50:\r\n count=0\r\n for j in range(2,i):\r\n if i%j==0:\r\n count+=1\r\n if count==0:\r\n l2.append(i)\r\n i+=1\r\n\r\nx=l2.count(n)\r\ny=l2.count(m)\r\n\r\nif x==1:\r\n p=l2.index(n)\r\n if y==1:\r\n q=l2.index(m)\r\n if q==p+1:\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n else :\r\n print(\"NO\")\r\nelse :\r\n print(\"NO\")", "### Hello! World ... ###\nimport math\nn, m = input().split()\nn = int(n); m=int(m)\ndef is_prime(n): #O(sqrt(n))\n for i in range(2,int(math.sqrt(n))+1):\n if n%i == 0:\n return False\n return True\nflag =True\nfor j in range(n+1, m+1):\n if is_prime(j) == True:\n if j == m:\n print('YES')\n flag = False\n else:\n print('NO')\n flag = False\n break \nif flag:\n print('NO')\n", "n, m = map(int, input().split())\r\np = 0\r\nfor i in range(n + 1,m + 1):\r\n p = i\r\n for j in range(2, i):\r\n if i % j == 0:\r\n p = 0\r\n break\r\n if p != 0:\r\n break\r\nif p == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def inp():\r\n return map(int, input().split())\r\n\r\ndef prime(n):\r\n for i in range(2,n//2+1):\r\n if(n%i==0):\r\n return 0\r\n return 1\r\n\r\nn,m=inp()\r\nif(prime(m)==0):\r\n exit(print('NO'))\r\nelse:\r\n for i in range(1,m-n):\r\n if(prime(n+i)==1):\r\n exit(print('NO'))\r\nprint('YES')\r\n\r\n", "def foo(n):\r\n for i in range(2,n):\r\n if n%i==0:\r\n return False\r\n return True \r\n\r\n\r\na, b = map(int,input().split())\r\nres = 0\r\nfor i in range(a+1,b+1):\r\n if foo(i):\r\n res = i\r\n break \r\n\r\nif res == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_prime(n):#判断n是不是素数\n if n < 2:\n return False\n i = 2\n while i*i <= n:\n if n % i == 0:\n return False\n i += 1\n return True\nn,m = map(int,input().split())\ncalculate = {}\nindex = 0\nfor i in range(n,m+1):\n if is_prime(i):\n calculate.update({i: index})\n index += 1\n\nif n in calculate and m in calculate:\n if calculate.get(n) - calculate.get(m) == 1 or calculate.get(n) - calculate.get(m) == -1:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")\n \t\t \t\t \t\t\t \t\t \t\t\t\t\t\t\t\t\t\t", "n,m=map(int,input().split())\r\n\r\nq=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\n\r\nfor i in range(n+1,m+1):\r\n \r\n if i in q and i==m:\r\n print(\"YES\")\r\n break\r\n \r\n elif i in q and i!=m:\r\n print(\"NO\")\r\n break\r\n \r\n elif i not in q and i==m:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n ", "n = list(map(int, input().split()))\r\ncount = 0\r\ny = []\r\nfor i in range(0, n[1]-n[0]):\r\n for j in range(2, n[0]+1+i):\r\n if (n[0]+1+i) % j == 0:\r\n count += 1\r\n if count > 0:\r\n count = 0\r\n else:\r\n y.append(n[0]+1+i)\r\n count = 0\r\nif len(y) == 1 and n[1] in y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(a:int,b:int):\r\n if not isPrime(b):\r\n return \"NO\"\r\n for i in range(a+1,b):\r\n if isPrime(i):\r\n return \"NO\"\r\n return \"YES\"\r\n\r\ndef isPrime(w:int):\r\n if w%2 == 0:\r\n return False\r\n for i in range(2,(w//2)+1):\r\n if w % i == 0:\r\n return False\r\n return True\r\n\r\n# num_inputs = int(input())\r\nnum_inputs = 1\r\nfor _ in range(num_inputs):\r\n a,b = map(int, input().split())\r\n ans = solve(a,b)\r\n print(ans)\r\n", "n, m = map(int,input().split())\r\n\r\ndef is_prime(num):\r\n \"\"\"\r\n Helper function to check if a number is prime.\r\n \"\"\"\r\n if num < 2:\r\n return False\r\n for i in range(2, int(num**0.5)+1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\ndef next_prime(num):\r\n \"\"\"\r\n Finds the next prime number greater than num.\r\n \"\"\"\r\n num += 1\r\n while not is_prime(num):\r\n num += 1\r\n return num\r\n\r\nprint(\"YES\" if m == next_prime(n) else \"NO\")", "k=list(map(int,input().split()))\r\nli=[]\r\nfor j in range(k[0],k[1]+1):\r\n s=j\r\n c=0\r\n for i in range(1,s+1):\r\n if s%i==0:\r\n c+=1\r\n if c<3:\r\n li.append(s)\r\nif len(li)>1:\r\n t=int(li[1])\r\n if k[1]==t:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def is_prime(num):\r\n counter = 2\r\n while counter*counter <= num:\r\n if num % counter == 0:\r\n return 0\r\n counter += 1\r\n return 1\r\n\r\ndef func(n,m):\r\n if is_prime(m) == 0:\r\n return \"NO\"\r\n for count in range(n+1,m):\r\n if is_prime(count) == 1:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nlst = input().split()\r\nn=int(lst[0])\r\nm=int(lst[1])\r\nprint(func(n,m))", "x,y=list(map(int,input().split()))\r\nm=str(x)+str(y)\r\nn=''\r\nfor i in range(x,y+1):\r\n count=0\r\n for j in range(1,i+1):\r\n if(i%j==0):\r\n count+=1\r\n if(count==2):\r\n n+=str(i)\r\nif m in n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nflag = 1\r\ng=0\r\nfor i in range(a+1,b+1):\r\n flag = 1\r\n \r\n if i==1:\r\n flag= flag*0\r\n else:\r\n\r\n for j in range(2,i):\r\n if i%j==0:\r\n flag = flag*0\r\n else: \r\n flag = flag*1\r\n\r\n if flag ==1 and i==b:\r\n print('YES')\r\n g = 1\r\n break\r\n elif flag ==1 and i!=b:\r\n print('NO')\r\n g = 1\r\n break\r\n \r\n \r\nif g==0:\r\n print(\"NO\")", "def is_prime(n):\r\n for i in range(2,n):\r\n if (n%i) == 0:\r\n return False\r\n return True\r\nm,n= map(int,input().split())\r\nzura=1\r\nfor i in range(55):\r\n m+=1\r\n if is_prime(m)==True and m!=n:\r\n print('NO')\r\n zura-=1\r\n break\r\n if is_prime(m)==True and m==n:\r\n print('YES')\r\n zura-=1\r\n break\r\n \r\nif zura==1:\r\n print('NO')\r\n\r\n \r\n", "def prime(n):\r\n\tt=True\r\n\tn=n+1\r\n\twhile t:\r\n\t\tc=0\r\n\t\tfor i in range(2,n):\r\n\t\t\tif(n%i==0):\r\n\t\t\t\tc+=1\r\n\t\tif c==0:\r\n\t\t\t\tt=False\r\n\t\telse:\r\n\t\t\t\tn+=1\r\n\treturn n\r\n\r\ndata=input()\r\nval=[]\r\nval.append(list(map(lambda x:int(x),data.split(\" \"))))\r\nif(val[0][1]==prime(val[0][0])):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n,m=map(int,input().split())\r\nl=[]\r\ndef isPrime(n):\r\n if (n <= 1):\r\n return False\r\n if (n <= 3):\r\n return True\r\n if (n % 2 == 0 or n % 3 == 0):\r\n return False\r\n i = 5\r\n while (i * i <= n):\r\n if (n % i == 0 or n % (i + 2) == 0):\r\n return False\r\n i = i + 6\r\n return True\r\nfor i in range(n+1,m+1):\r\n if(isPrime(i)):\r\n l.append(i)\r\nif(len(l)==0):\r\n print(\"NO\")\r\nelse:\r\n if (l[0] == m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n", "import math\r\n\r\ndef isPrime(n):\r\n if n == 0 or n == 1:\r\n return False\r\n for i in range(2, math.ceil(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n \r\ndef nextPrime(n):\r\n n += 1\r\n while True:\r\n if isPrime(n):\r\n return n\r\n n += 1\r\n return n\r\n\r\ndef isNextPrime(n, m):\r\n return nextPrime(n) == m\r\n\r\n\r\nn, m = map(int, input().split())\r\nprint(\"YES\" if isNextPrime(n, m) else \"NO\")", "def isprime(k):\n a=0\n for i in range(1,k+1):\n if k%i==0:\n a+=1\n if a>2:\n return False\n return True\n\ninp=[int(i) for i in input().split()]\nn,m=inp[0],inp[1]\nfor i in range(n+1,2*n):\n if isprime(i):\n prime=i\n break\nif prime==m:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a=input().split()\r\nx=[]\r\nfor i in range(int(a[0]),int(a[1])+1):\r\n c=0\r\n for j in range(2,i):\r\n if i%j==0:\r\n c+=1 \r\n if c==0:\r\n x.append(i)\r\nif len(x)==1:\r\n print(\"NO\")\r\nelif x[1]==int(a[1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def ans(x,y):\r\n prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\n if x > y:\r\n x,y = y,x\r\n if x not in prime or y not in prime:\r\n return 'NO'\r\n if prime[prime.index(x)+1] == y:\r\n return 'YES'\r\n return 'NO'\r\nx,y = list(map(int,input().split()))\r\nprint(ans(x,y))", "a, b = map(int, input().split())\r\ncount = 0\r\ncount1 = 0\r\nlst = []\r\nfor i in range(1, a + 1):\r\n if a % i == 0:\r\n count += 1\r\nfor i in range(1, b + 1):\r\n if b % i == 0:\r\n count1 += 1\r\n\r\nif count == 2 and count1 == 2:\r\n for i in range(a + 1, b):\r\n count2 = 0\r\n for j in range(1, i + 1):\r\n if i % j == 0:\r\n count2 += 1\r\n lst.append(count2)\r\n\r\n if lst.count(2) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int, input().split())\r\nans = 0\r\nkeep_going = True\r\nflag = True\r\nr = n\r\n\r\nwhile keep_going:\r\n r += 1\r\n \r\n for i in range(2,r):\r\n if r % i == 0:\r\n flag = False\r\n break\r\n \r\n if flag:\r\n ans = \"YES\"\r\n keep_going = False\r\n elif (r+1) > m and flag == False:\r\n ans = \"NO\"\r\n keep_going = False\r\n flag = True\r\n\r\nif r < m:\r\n print(\"NO\")\r\nelse:\r\n print(ans)", "def isprime(n):\r\n if n==2:\r\n return True\r\n for i in range(2,int(n**(1/2))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\ns=input().split()\r\nn,m=int(s[0]),int(s[1])\r\nif isprime(m):\r\n for i in range(n+1,m):\r\n if isprime(i):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isprime(n):\r\n if n<=1:\r\n return False\r\n if n<=3:\r\n return True\r\n if n%2==0 or n%3==0:\r\n return False\r\n i = 5\r\n while i*i<=n:\r\n if n%i==0 or n%(i+2)==0:\r\n return False\r\n i+=6\r\n return True\r\n\r\nf = False\r\nn, m = map(int, input().split())\r\nfor i in range(n+1, m):\r\n if isprime(i):\r\n f = True\r\n break\r\nif f:\r\n print(\"NO\")\r\nelse:\r\n if isprime(m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def is_simple(x):\r\n for i in range(2,int(x ** 0.5 + 1)):\r\n if x % i == 0:\r\n return False\r\n else:\r\n return True\r\n\r\na,b = map(int,input().split())\r\nfor i in range(a+1,b):\r\n met = is_simple(i)\r\n if met:\r\n print(\"NO\") \r\n break\r\nelse:\r\n met = is_simple(b)\r\n if met:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def isprime(n):\n flag=1\n for i in range(2,int(n**0.5)+1):\n if n%i==0:\n flag=0\n break\n if flag==1:\n return True\n else:\n return False\nn,m=map(int,input().split())\nls=list(range(n,m+1))\nflag=1\nif isprime(ls[0])==False or isprime(ls[-1])==False:\n flag=0\nfor i in range(n+1,m):\n if isprime(i)==True:\n flag=0\n break\nif flag==1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t\t \t\t\t\t \t\t\t \t\t\t\t \t \t", "def isprime(num):\r\n test =1\r\n for i in range(2,num):\r\n if(num%i==0):\r\n test = 0\r\n return test\r\nnum1, num2 = map(int,input().split())\r\nsit = 1\r\nfor i in range(num1+1,num2+1):\r\n if(isprime(i) == 1):\r\n if(i == num2):\r\n print(\"YES\")\r\n sit = 0\r\n break\r\n else:\r\n print(\"NO\")\r\n\r\n sit = 0\r\n break\r\nif(sit == 1):\r\n print('NO')\r\n\r\n", "MAX = 50\r\n\r\nprimes = []\r\nfor i in range(2, MAX+1):\r\n prime = True\r\n for j in range(2, i):\r\n if i % j == 0:\r\n prime = False\r\n\r\n if prime:\r\n primes.append(i)\r\n\r\n#print(primes)\r\n\r\nn, m = list(map(int, input().split()))\r\n\r\nen = primes.index(n)\r\nem = -1\r\nif m in primes:\r\n em = primes.index(m)\r\n\r\nif (en == em - 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\ns=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,51]\r\nfor i in range(len(s)):\r\n if n == s[i]:\r\n a=s[i]\r\n b=s[i+1]\r\n \r\n if m == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "\nimport math\n\nn, m = input().split()\nn = int(n)\nm = int(m)\n\n# Step 1 : We will create a function that will check if a number is prime or not\n\n\ndef prime_check(num):\n num = int(num)\n if num == 1:\n return False\n if num == 2:\n return True\n for i in range(2, int(math.sqrt(num)//1) + 2):\n if num % i == 0:\n return False\n\n return True\n\n\n# Step 2 : We will now create a loop that\n# checks prime condition for numbers starting from x\nn = n + 1\nwhile not prime_check(n):\n n = n + 1\n\nif n == m:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def isprime(n):\r\n result=True\r\n for i in range(2,n//2 +1):\r\n if n%i==0:\r\n result = False\r\n break\r\n return result\r\na,b = map(int,input().split())\r\nnextp=a+1 \r\nwhile True:\r\n if isprime(nextp):\r\n break\r\n nextp +=1\r\n\r\nif nextp==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import sqrt\r\ns=input().split()\r\ndef isPrime(n):\r\n\tif(n <= 1):\r\n\t\treturn False\r\n\tif(n <= 3):\r\n\t\treturn True\r\n\tif(n % 2 == 0 or n % 3 == 0):\r\n\t\treturn False\r\n\tfor i in range(5,int(sqrt(n) + 1), 6):\r\n\t\tif(n % i == 0 or n % (i + 2) == 0):\r\n\t\t\treturn False\r\n\treturn True\r\ndef nextPrime(N):\r\n\tif (N <= 1):\r\n\t\treturn 2\r\n\tprime = N\r\n\tfound = False\r\n\twhile(not found):\r\n\t\tprime = prime + 1\r\n\t\tif(isPrime(prime) == True):\r\n\t\t\tfound = True\r\n\treturn prime\r\nif isPrime(int(s[1]))!=True:\r\n\tprint(\"NO\")\r\nelse:\r\n\tif nextPrime(int(s[0]))!=int(s[1]):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")", "a = list(map(int, input().split(' ')))\r\nc = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\r\ndef nxtprime(a):\r\n\tglobal c\r\n\tb = 0\r\n\tfor x in c:\r\n\t\tif x>a:\r\n\t\t\tb = x\r\n\t\t\tbreak\r\n\r\n\treturn b\r\n\r\nif a[1] == nxtprime(a[0]):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\n\r\n\r\n#print(dist(str(1000),str(1023)))\r\n\r\ndef prime(n):\r\n if n<2:\r\n return False\r\n i=2\r\n while(i*i<=n):\r\n if n%i==0:\r\n return False\r\n i+=1\r\n \r\n return True\r\n\r\nn,m=map(int,input().split())\r\n\r\n\r\nmid=False\r\n\r\nfor i in range(n+1,m):\r\n if prime(i):\r\n mid=True\r\n break\r\n\r\nif prime(n) and prime(m) and not mid:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n#carpe diem \r\n#carpe diem", "z=[int(i) for i in range(2,60)]\r\nf=[]\r\nfor i in z:\r\n c=0\r\n for j in range(2,i):\r\n if i%j==0:\r\n c+=1\r\n if c==0:\r\n f.append(i)\r\nn,m=[int(i) for i in input().split()]\r\nif n in f:\r\n x=f.index(n)\r\n if m == f[x+1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\ncurr, nexts = [int(x) for x in input().split()]\r\nif primes[primes.index(curr) + 1] == nexts:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_prime(n):\r\n for i in range(2, int(n ** .5) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, m = map(int, input().split())\r\nif not is_prime(m):\r\n print('NO')\r\nelse:\r\n for i in range(n + 1, m):\r\n if is_prime(i):\r\n print('NO')\r\n break\r\n else:\r\n print('YES')", "# A. Panoramix's Prediction\r\n\r\narr = list(map(int, input().rstrip().split()))\r\n\r\nn = arr[0]\r\nm = arr[1]\r\n\r\n\r\ndef is_prime(num):\r\n for i in range(2, num // 2+2):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef solve(n, m):\r\n if not is_prime(m):\r\n return \"NO\"\r\n for i in range(n + 1, m):\r\n if is_prime(i):\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\nprint(solve(n, m))\r\n", "nums = list(map(int,input().split()))\r\n\r\nfor i in range(nums[0] + 1 , nums[1]) :\r\n count = 0\r\n for j in range(2 , i) :\r\n if i % j == 0 : count += 1\r\n if count == 0 : exit(print(\"NO\"))\r\n\r\ncount = 0\r\nfor j in range(2 , nums[1]) :\r\n if nums[1] % j == 0 : count += 1\r\nif count == 0 : exit(print(\"YES\"))\r\nprint(\"NO\") ", "full_list = input().split()\r\nfirst = int(full_list[0])\r\nsecond = int(full_list[1])\r\n\r\n\r\ndef prime_checker(num):\r\n counter = 0\r\n for i in range(2, (num // 2) + 1):\r\n if num % i == 0:\r\n counter += 1\r\n break\r\n if counter == 1:\r\n return 'Not prime'\r\n else:\r\n return 'prime'\r\n\r\n\r\ndef order_prime(first, second):\r\n if prime_checker(second) == 'Not prime':\r\n print('NO')\r\n else:\r\n storage = [i for i in range(first + 1, second + 1) if prime_checker(i) == 'prime']\r\n if len(storage) > 1:\r\n print('NO')\r\n else:\r\n print('YES')\r\n \r\norder_prime(first, second)", "def isprime(x):\n if x % 2 == 0:\n return False\n else:\n for i in range(3, (x // 2) + 1, 2):\n if x % i == 0:\n return False\n return True\n\ndef main():\n n, m = map(int, input().split())\n if n == m or n > m:\n print(\"NO\")\n return\n\n if not isprime(m):\n print(\"NO\")\n return\n\n for i in range(n + 1, m):\n if isprime(i):\n print(\"NO\")\n return\n\n print(\"YES\")\n\nmain()\n", "p=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m=list(map(int,input().split()))\r\nif n!=47 and m==p[p.index(n)+1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def prime(x):\r\n p = []\r\n for i in range(1,x+1):\r\n a = x/i\r\n if int(a) == a:\r\n p.append(int(a))\r\n if p == [x,1]: \r\n return True\r\n else:\r\n return False\r\ndef nextprime(n,m):\r\n np = []\r\n if prime(m) == True and m > n and m - n > 1:\r\n for i in range(n+1,m):\r\n np.append(prime(i))\r\n elif prime(m) == True and m > n and m - n == 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n \r\n if len(np) > 0:\r\n if True in np: \r\n print('NO')\r\n else:\r\n print('YES')\r\ng = list(map(int,input().split(' ')))\r\nnextprime(g[0],g[1])", "def isprime(a):\r\n for i in range(2, a):\r\n if a%i == 0:\r\n return False\r\n return True\r\nn, m = map(int, input().split())\r\ncheck = False\r\nif isprime(m) == True:\r\n for i in range(n+1, m):\r\n if isprime(i) == True:\r\n check = True\r\n break\r\nelse:\r\n check = True\r\nif check == False:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\n\r\ndef prime(n):\r\n for i in range(n+1, n + 20):\r\n for j in range(2, i-1):\r\n if i%j == 0:\r\n break\r\n else:\r\n return i\r\n\r\nc = prime(a)\r\nif c == b:\r\n print('YES')\r\nelse:\r\n print('NO')", "def isPrime(n):\r\n if n != 1:\r\n for i in range(2, n):\r\n if n%i == 0:\r\n return False\r\n return True\r\n\r\narr = list(map(int, input().split()))\r\nx = arr[0]\r\nm = arr[1]\r\nresult = \"YES\"\r\n\r\nif isPrime(m) == True:\r\n for i in range(x+1, m):\r\n if isPrime(i) == True:\r\n result = \"NO\"\r\n print(result)\r\nelse:\r\n print(\"NO\")\r\n\r\n", "# Panoramix's Prediction\r\ns = input().split(\" \")\r\ns = [int(i) for i in s]\r\nstart = s[0]\r\nend = s[1]\r\ncount = 0\r\nflag = False\r\nfor i in range(s[0]+1,s[1]+1):\r\n j = 2\r\n while j*j <= i:\r\n if i % j == 0:\r\n flag = True\r\n break\r\n else:\r\n flag = False\r\n j += 1\r\n if flag == False:\r\n count += 1\r\nif count > 1 or flag != False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "m,n=map(int,input().split())\r\nt=m+1\r\nwhile True:\r\n j=2\r\n ctr=0\r\n while j<=t:\r\n if t%j==0:\r\n ctr+=1\r\n j+=1\r\n if ctr==1:\r\n if t==n:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n t+=1", "import math\r\n\r\n\r\ndef is_prime(x):\r\n\r\n for i in range(2, int(math.sqrt(x))+1):\r\n\r\n if x % i == 0:\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef solve(n, m):\r\n\r\n for i in range(n+1, m):\r\n\r\n if is_prime(i):\r\n return 'NO'\r\n\r\n return 'YES' if is_prime(m) else 'NO'\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n print(solve(n, m))", "def prime_number(x):\r\n flag=1\r\n for i in range(2,(x//2)+1):\r\n if x%i==0:\r\n flag=0\r\n break\r\n if flag==1:\r\n return True\r\n else:\r\n return False\r\n \r\ndef next_prime(x):\r\n x+=1\r\n while prime_number(x)!=True:\r\n x+=1\r\n return x\r\n\r\nwhile True:\r\n try:\r\n n,m=map(int,input().split())\r\n r=prime_number(m)\r\n if r==True:\r\n next=next_prime(n)\r\n if next==m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n except:\r\n break", "def isprime(x):\r\n for i in range (2, int(x / 2) + 1):\r\n if x % i == 0:return False\r\n return True\r\n\r\na, b = [int(x) for x in input().split()]\r\nres = \"YES\"\r\nfor i in range (a + 1, b + 1):\r\n if isprime(b) == False: res = \"NO\"\r\n elif isprime(i) and b != i:res = \"NO\"\r\nprint(res)", "n, m = map(int, input().split())\r\na = False\r\n\r\n\r\ndef esPrimo(numero):\r\n for i in range(2, numero):\r\n if numero % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nfor i in range(n+1, m+1):\r\n if esPrimo(i):\r\n if i == m:\r\n a = True\r\n break\r\n\r\nprint('YES' if a == True else 'NO')", "from math import sqrt\r\n\r\ndef is_prime(n):\r\n for i in range(2, int(sqrt(n) + 1)):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\n\r\nfound = False\r\nfor i in range(n + 1, m):\r\n if is_prime(i):\r\n found = True\r\n break\r\nprint(\"YES\" if not found and is_prime(m) else \"NO\")\r\n", "p = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m = map(int,input().split())\r\nyes = False\r\nfor i in range(len(p)-1):\r\n if p[i]==n and p[i+1]==m:\r\n yes = True\r\nif yes:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = map(int, input().split())\r\n\r\na = 0\r\nwhile a == 0:\r\n n += 1\r\n u = 0\r\n for _ in range(2, n):\r\n if n % _ == 0:\r\n u = 1\r\n break\r\n if u == 0:\r\n a = 1\r\n print(\"YES\" if n == m else \"NO\")", "a , b = map(int, input().split())\r\nlst = []\r\ndef find_prime_in_range(a, b):\r\n for p in range(a+1, b+1):\r\n for i in range(2, p):\r\n if p % i == 0:\r\n break\r\n else:\r\n return lst.append(p)\r\n return None\r\nfind_prime_in_range(a,b)\r\nif(len(lst)==0):\r\n print(\"NO\")\r\nelif(lst[0]==b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t,s=map(int,input().split())\r\ndef isprin(a):\r\n c=0\r\n i=1\r\n while(i*i<=a):\r\n if a%i==0:\r\n c+=1\r\n i+=1\r\n return c==1\r\nf=0\r\nfor i in range(t+1,s):\r\n if isprin(i):\r\n f=1\r\n break\r\nif not isprin(s):\r\n f=1\r\nif f==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\na=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,0]\r\nprint(\"YES\"if a[a.index(n)+1]==m else \"NO\")", "def is_prime(x):\r\n j = 2\r\n while j * j <= x:\r\n if x % j == 0:\r\n return False\r\n j += 1\r\n return True\r\n\r\nn, m = [int(s) for s in input().split(' ')]\r\nprimes = []\r\ni = 2\r\nwhile i <= 100:\r\n if is_prime(i):\r\n primes.append(i)\r\n i += 1\r\n\r\nif m == primes[primes.index(n) + 1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n,m= list(map(int,input().split()))\r\nprime= 0\r\nfor i in range(n+1,m+1):\r\n j= 2\r\n c= 0\r\n while j**2<=i:\r\n if i%j!= 0:\r\n c+= 1\r\n j+= 1\r\n if c== j-2:\r\n prime= i\r\n break\r\nprint(\"YES\" if prime== m else \"NO\")\r\n", "n,m=list(map(int,input('').split()))\r\nflag=True\r\nwhile(flag):\r\n n=n+1\r\n c=0\r\n for i in range(1,n+1):\r\n if (n%i==0):\r\n c+=1\r\n if c==2:\r\n flag=False\r\n break\r\nif n==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\ndef prime(n):\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if(n%i==0):\r\n return False\r\n return True\r\nn,m=map(int,input().split())\r\nn+=1\r\nwhile(not prime(n)):\r\n n+=1\r\nif(n==m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import*\nn, m = map(int,input().split())\nans = \"YES\"\nfor i in range(2,int(sqrt(m)) + 1):\n if m % i == 0:\n print(\"NO\")\n exit()\nfor i in range(n + 1, m):\n for j in range(2,int(sqrt(i)) + 1):\n if i % j == 0:\n break\n else:\n ans = \"NO\"\nprint(ans)\n", "\r\nn,m=map(int,input().split())\r\nx=((m-2)**(m-1))%m\r\nif x!=1:\r\n print(\"NO\")\r\nelse:\r\n for i in range(n+1,51):\r\n x=((i-2)**(i-1))%i\r\n if x==1 and m==i:\r\n print(\"YES\")\r\n break\r\n elif (x==1 and m!=i):\r\n print(\"NO\")\r\n break", "def isprime(a):\r\n if a>1:\r\n for i in range(2,int(a ** 0.5)+1):\r\n if a%i==0:\r\n return False\r\n\r\n return True\r\nprime=[]\r\nn, m = map(int,input().split())\r\nfor i in range(2,m+n+1):\r\n if isprime(i):\r\n prime.append(i)\r\nfor i in range(len(prime)):\r\n if n==prime[i]:\r\n d=i\r\n break\r\nif prime[d+1]==m:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "def isPrime(n):\r\n i=2\r\n while i*i <= n:\r\n if n%i==0:\r\n return False\r\n i +=1\r\n return True\r\nnum=[]\r\n \r\nfor i in range(2,54):\r\n if isPrime(i)==True:\r\n num.append(i)\r\nnextPrime={}\r\nfor j in range(len(num)-1):\r\n nextPrime[num[j]]=num[j+1]\r\nAst,Ob=map(int,input().split())\r\nif Ob == nextPrime[Ast]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n \r\n", "n,m=map(int,input().split())\r\ndef Prime(val):\r\n c=0\r\n for x in range(2,val//2+1):\r\n if val%x==0:\r\n c+=1\r\n if c>0:\r\n return False\r\n return True\r\nans='NO'\r\nfor x in range(n+1,51):\r\n if Prime(x)==True and x!=m:\r\n break\r\n if Prime(x)==True and x==m:\r\n ans='YES'\r\n break\r\nprint(ans)\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\ndef is_prime(num):\r\n if num < 2:\r\n return False\r\n for i in range(2, int(num**0.5) + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\ndef find_next_prime(n, k):\r\n if k <= n:\r\n print(\"NO\")\r\n return\r\n \r\n for i in range(n + 1, k):\r\n if is_prime(i):\r\n print(\"NO\")\r\n return\r\n \r\n if is_prime(k):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\nfind_next_prime(n, k)\r\n", "p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\n\r\nn, m = map(int, input().split())\r\n\r\nprint(\"YES\" if p[p.index(n) + 1] == m else \"NO\")", "n, m = map(int, input().split())\r\ni = 1\r\na=0\r\nwhile i < m:\r\n x = n + i\r\n lr = []\r\n for j in range(1, x+1):\r\n if x % j == 0:\r\n lr.append(j)\r\n if len(lr) == 2:\r\n a = x\r\n break\r\n else:\r\n i += 1\r\nif a == m:\r\n print('YES')\r\nelse:\r\n print('NO')", "t=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]\r\na,b=map(int,input().split())\r\nk=t[t.index(a)+1]\r\nif b==k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "pr = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47] \r\na, b = map(int, input().split())\r\nprint([\"NO\",\"YES\"][b in pr and pr.index(b) == 1 + pr.index(a)])\r\n", "criba=[ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nn,m=map(int,input().split())\r\nif(criba.index(n)!=14):\r\n if(criba[criba.index(n)+1]==m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=list(map(int,input().split()))\r\nx=n+1\r\nwhile True :\r\n for i in range(2,x):\r\n \tif x%i==0:\r\n \t\tx+=1\r\n \t\tbreak\r\n else:\r\n \tr=x\r\n \tbreak\r\nif r==m:\r\n \tprint(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "\r\na = input()\r\nc = a.split()\r\nb = []\r\nfor l in c:\r\n k = int(l)\r\n b.append(k)\r\nd=[]\r\nfor i in range(b[0],b[1]+1):\r\n d.append(i)\r\ni = b[0]+1\r\nwhile i > b[0] and i <= b[1]:\r\n for j in range(2,i):\r\n if i%j == 0:\r\n j+=1\r\n d.remove(i)\r\n break\r\n i+=1\r\nif len(d)==2:\r\n if b[1] == d[1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "a,b=list(map(int,input().split()))\r\na+=1\r\nwhile a<=b:\r\n f=True\r\n for i in range(2,a):\r\n if a%i==0:\r\n f=False\r\n break\r\n if f:\r\n if a==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\r\n a+=1\r\n if a>b:\r\n print(\"NO\")", "def is_prime(n):\r\n if n < 2:\r\n return False\r\n else:\r\n for i in range(2, n//2+1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef is_next_prime(n, m):\r\n if not is_prime(m):\r\n return False\r\n for i in range(n+1, m+1):\r\n if is_prime(i) and i != m:\r\n return False\r\n return True\r\n\r\n\r\ndef main():\r\n n, m = [int(i) for i in input().split()]\r\n if is_next_prime(n, m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def find(n,m):\r\n for i in range(n + 1, m + 1):\r\n count = 0\r\n for j in range(2,int(i**0.5)+1):\r\n if(i%j==0):\r\n count = 1\r\n if(count == 0):\r\n return i\r\n\r\nn,m = map(int, input().split())\r\nif(find(n,m) == m):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a,b = [int(x) for x in input().split()]\r\nli = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\ntry:\r\n if b == li[li.index(a) + 1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nexcept IndexError:\r\n print(\"NO\")", "def primes(x, y):\r\n prime = [2]\r\n if x < 2:\r\n raise Exception(\"Arg1 is under 2\")\r\n if x == 2:\r\n return prime\r\n if y < x:\r\n raise Exception(\"Arg1 is greater than Arg2\")\r\n for i in range(x, y + 1):\r\n if all(i % j != 0 for j in range(2, i // 2 + 1)):\r\n prime.append(i)\r\n return prime\r\na,b = map(int, input().split())\r\nprint(\"YES\" if len(primes(a + 1, b)) <= 2 and b in primes(a + 1, b) else \"NO\")\r\n#print(primes(a + 1, b))", "n,m=map(int,input().split())\r\ndef nextprime(n):\r\n if n==2:\r\n return 3\r\n else:\r\n \r\n \r\n i=2\r\n while True:\r\n for x in range(2,int((n+i)**0.5)+1):\r\n if (n+i)%x==0:\r\n x=0\r\n break\r\n if x!=0:\r\n break\r\n else:\r\n i=i+2\r\n \r\n \r\n return n+i\r\nif m==nextprime(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(a+1,b):\r\n for j in range(2,int(i**.5)+1):\r\n if i%j==0:\r\n break\r\n else:c+=1\r\nif c:print(\"NO\")\r\nelse:\r\n for j in range(2,int(b**.5)+1):\r\n if b%j==0:\r\n print(\"NO\")\r\n break\r\n else:print(\"YES\")\r\n\r\n\r\n", "a , b = list(map(int,input().split()))\r\ndef solve(a):\r\n if a == 1:\r\n return False\r\n else:\r\n b = a ** 0.5\r\n for i in range(2,int(b)+1):\r\n if a % i == 0:\r\n return False\r\n return True\r\nc = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53,\r\n 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113,\r\n 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181,\r\n 191, 193, 197, 199, 211, 223, 227, 229]\r\n\r\nif b not in c:\r\n print(\"NO\")\r\nelif c[c.index(a)+1] == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def prime(n,m):\n k=0\n for i in range(1,n+1):\n if n%i==0:\n k+=1\n \n if k==2:\n if n==m:\n return True\n else:\n return False\n\nn,m=map(int,input().split())\nfor i in range(n+1,m+1):\n if prime(i,m)==True:\n print(\"YES\")\n break\n elif prime(i,m)==False or i==m:\n print('NO')\n break\n # elif :\n\n else:\n continue", "inp = input(\"\")\r\ninp_lst = [int(i) for i in inp.split()]\r\nn = inp_lst[0]\r\nm = inp_lst[1]\r\ngo_on = True\r\n\r\nfor i in range(2, m):\r\n if m%i == 0:\r\n go_on = False\r\n break\r\n\r\nif go_on:\r\n nxt_prime = None\r\n while nxt_prime is None:\r\n n += 1\r\n prime = True\r\n for i in range(2, n):\r\n if n % i == 0:\r\n prime = False\r\n if prime is True:\r\n nxt_prime = n\r\n break\r\n if nxt_prime == m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nans = 0\r\nfor i in range(n + 1, m + 1):\r\n c = 0\r\n for j in range(2, i - 1):\r\n if i % j == 0:\r\n c = 1\r\n break\r\n if c == 0:\r\n ans = i\r\n break\r\nif c == 0 and m == ans:\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\r\ndef prime(b):\r\n i=2\r\n while i<=math.ceil(b**0.5):\r\n if b%i==0:\r\n return False\r\n i=i+1\r\n return True\r\nlis=list(map(int,input().strip().split()))\r\nn=lis[0]\r\nm=lis[1]\r\nb=n+1\r\nwhile True:\r\n #print(b, m, prime(b), b==m)\r\n if prime(b) and b==m:\r\n print(\"YES\")\r\n break\r\n elif prime(b) and b!=m:\r\n print(\"NO\")\r\n break\r\n elif b>m:\r\n print(\"NO\")\r\n break\r\n else:\r\n b=b+1\r\n", "def isprime(n):\n if n == 2 or n == 3:\n return True\n if n % 2 == 0 or n < 2:\n return False\n for i in range(3, int(n ** 0.5) + 1, 2):\n if n % i == 0:\n return False\n\n return True\n\n\nans = 0\nn, m = map(int, input().split())\nif isprime(n):\n for i in range(n + 1, m + 1):\n if isprime(i) and i == m:\n print('YES')\n break\n elif isprime(i) and i != m:\n print('NO')\n break\n else:\n print('NO')\n\n", "def isprime(a):\r\n c = 0\r\n for j in range(2,a):\r\n if(a % j == 0):\r\n c += 1\r\n \r\n if(c == 0):\r\n return True\r\n else:\r\n return False\r\n \r\n\r\nx, y = map(int,input().split())\r\ncount = 0\r\n \r\nfor i in range(x+1,y+1):\r\n if(isprime(i)):\r\n if(i == y):\r\n count += 1\r\n else:\r\n count = 0\r\n break\r\n \r\nif(count == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isprime(n):\r\n n = abs(int(n))\r\n if n < 2:\r\n return False\r\n if n == 2: \r\n return True\r\n if not n & 1: \r\n return False\r\n for x in range(3, int(n**0.5)+1, 2):\r\n if n % x == 0:\r\n return False\r\n return True\r\n\r\ndef next_prime(number):\r\n next_number = number + 1\r\n while not isprime(next_number):\r\n next_number += 1\r\n return next_number\r\n\r\nf_line = input()\r\nf_arr = [int(y) for y in f_line.split()]\r\n\r\nlower = f_arr[0]\r\nnext_n = f_arr[1] \r\n\r\ntemp = next_prime(lower)\r\n\r\nif temp == next_n:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')", "def is_prime(y):\r\n d = 2\r\n flag = 0\r\n while d < y:\r\n if y%d == 0:\r\n flag = 1\r\n break\r\n else:\r\n d +=1\r\n if flag == 0:\r\n return y\r\n else :\r\n return None\r\n\r\nn, m = [int(x) for x in input().split()]\r\ny= n+1\r\nfor i in range(m-n):\r\n t= is_prime(y)\r\n if t == None:\r\n y = y +1\r\n else:\r\n break\r\nif y==m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def main():\r\n\tprime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\tn, m = map(int, input().split())\r\n\r\n\tif n not in prime or m not in prime:\r\n\t\tprint('NO')\r\n\telse:\r\n\t\tif prime.index(m) == prime.index(n) + 1:\r\n\t\t\tprint('YES')\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "import math\r\nprime=list()\r\nd=list()\r\ndef sieve():\r\n for i in range(0, 100): d.append(i)\r\n for i in range(2, int(math.sqrt(100))):\r\n if d[i]==i: \r\n for j in range(i, 55, i):\r\n if d[j]>i: d[j]=i \r\n for i in range(2, 100):\r\n if d[i]==i: prime.append(i) \r\n\r\n#main\r\nsieve()\r\nn,m=map(int, input().split())\r\nif prime[prime.index(n)+1]==m: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "prime = [1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nx,y = map(int, input().split())\r\nif x not in prime or y not in prime:\r\n print(\"NO\")\r\nelse:\r\n a = prime.index(x)\r\n b = prime.index(y)\r\n if a+1 == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def isPrime(N):\r\n for i in range(2,int(N**0.5)+1):\r\n if N % i == 0:\r\n return False\r\n return True\r\nN, M = map(int,input().split())\r\nnextPrime = -1\r\nfor X in range(N+1,M+1):\r\n if isPrime(X):\r\n nextPrime = X\r\n break\r\nprint('YES') if nextPrime==M else print('NO')", "# Function to check if a number is prime\r\ndef is_prime(num):\r\n if num <= 1:\r\n return False\r\n if num <= 3:\r\n return True\r\n if num % 2 == 0 or num % 3 == 0:\r\n return False\r\n i = 5\r\n while i * i <= num:\r\n if num % i == 0 or num % (i + 2) == 0:\r\n return False\r\n i += 6\r\n return True\r\n\r\n# Read the numbers n and m\r\nn, m = map(int, input().split())\r\n\r\n# Find the next prime number after n\r\nnext_prime = n + 1\r\nwhile not is_prime(next_prime):\r\n next_prime += 1\r\n\r\n# Check if m is prime and if it's the next prime after n\r\nif is_prime(m) and m == next_prime:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n ,m = map(int , input().split())\r\nprime = False\r\nc =1\r\n\r\ndef isprime(x):\r\n ans = True\r\n if x == 1 :\r\n ans = False\r\n for i in range(2,x):\r\n if x%i == 0:\r\n ans = False\r\n return ans\r\n\r\nwhile not prime:\r\n ans = isprime(n+c)\r\n if ans:\r\n prime = True\r\n if (n+c )== m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n c+=1\r\n \r\n ", "prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nn,m = map(int,input().split())\r\nif m in prime and prime.index(m)-prime.index(n)==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n, m = map(int,input().split())\r\nwhile True:\r\n n += 1\r\n for i in range(2, n):\r\n if n % i == 0:\r\n break\r\n else:\r\n temp = n\r\n break\r\n \r\nif(temp == m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/python3\n\nimport sys\nimport argparse\nimport json\nfrom pprint import pprint\n\ndef main():\n n, m = map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n ints = [0]*51\n ints[1] = 1\n for i in range(2, 51):\n for j in range(i*2,51, i):\n ints[j] = 1\n\n if ints[m] == 1:\n print(\"NO\")\n return\n\n for k in range(n+1, m):\n if ints[k] == 0:\n print(\"NO\")\n return\n\n print(\"YES\")\n\ndef get_tests():\n #tests = [(\"512 4\", \"50\")]\n\n for test in tests:\n print(json.dumps({\"input\": test[0], \"output\": test[1]}))\n\nif __name__ == \"__main__\":\n parser = argparse.ArgumentParser()\n parser.add_argument(\"--get-tests\", action=\"store_true\")\n args = parser.parse_args()\n\n if args.get_tests:\n get_tests()\n else:\n main()\n", "import math\r\ndef IsPrime(i):\r\n flag =0\r\n if i > 1:\r\n for j in range(2,int(math.sqrt(i))+1):\r\n if(i % j == 0):\r\n flag +=1\r\n if(flag > 0):\r\n return False\r\n else:\r\n return True\r\n else:\r\n return False\r\n\r\nNumbers = input().split(\" \")\r\nNumber1 = int(Numbers[0]) + 1\r\nNumber2 = int(Numbers[1])\r\n\r\nCount = 0\r\nPrNum=0\r\nwhile Number1 < Number2:\r\n if(IsPrime(Number1)):\r\n Count+=1\r\n Number1+=1\r\n\r\nif(IsPrime(Number2)== False or Count > 0 ):\r\n print(\"NO\")\r\nelif(Count == 0 and IsPrime(Number2)==True):\r\n print(\"YES\")", "def sakurajima(n):\r\n if n < 9:\r\n return [0, 1, 1, 0, 1, 0, 1, 0]\r\n l = [1] * n\r\n for i in range(2, int(n ** 0.5) + 1):\r\n if l[i - 1] == 1:\r\n for j in range(i ** 2, n + 1, i):\r\n if j % i == 0:\r\n l[j - 1] = 0\r\n l[0] = 0\r\n return l\r\n\r\ndef azusagawa(a, b):\r\n l = sakurajima(b)\r\n if l [a - 1] == 0 or l[b - 1] == 0:\r\n return \"NO\"\r\n if b == a + 1:\r\n if l[b - 1] == 1 and l[a - 1] == 1:\r\n return \"YES\"\r\n return \"NO\"\r\n for i in range(a, b - 1):\r\n if l[i] == 1:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nn, m = map(int, input().split())\r\na, b = min(n, m), max(n, m)\r\nprint(azusagawa(a, b))\r\n", "from math import sqrt\r\n\r\ndef isPrime(n):\r\n if (n <= 1):\r\n return False\r\n \r\n for i in range(2, int(sqrt(n))+1):\r\n if (n % i == 0):\r\n return False\r\n \r\n return True\r\n\r\nx , y = map(int, input().split())\r\nprime = []\r\n\r\n\r\nfor i in range(x, y+1):\r\n if isPrime(i):\r\n prime.append(i)\r\n #print(prime)\r\n if len(prime) > 2:\r\n break\r\n\r\n\r\nif len(prime)>1:\r\n if isPrime(y) and prime[1] == y:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\nelse: print(\"NO\")\r\n", "n,m = map(int,input().split())\r\nif m > n:\r\n f = 1\r\n for i in range(1,m//2+1):\r\n if m % i == 0:\r\n f = f + 1\r\n if f == 2:\r\n li = []\r\n for j in range(n+1,m+1):\r\n c = 1\r\n for k in range(1,n+1//2+1):\r\n if j % k == 0:\r\n c = c + 1\r\n if c == 2:\r\n li.append(j)\r\n if len(li) == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n T=input().split(' ')\r\n K=Prime(int(T[0]))\r\n if K==int(T[1]):\r\n print('YES')\r\n else:\r\n print('NO')\r\ndef Prime(n):\r\n n+=1\r\n while(not(Premier(n))):\r\n n+=1\r\n return n\r\ndef Premier(n):\r\n for i in range(2,n//2+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\nmain()\r\n", "ls = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\r\nn, m = map(int, input().split())\r\n\r\nif m == n:\r\n print('NO')\r\nelif m < n:\r\n print('NO')\r\nelse:\r\n if n in ls and m in ls:\r\n x = ls.index(n)\r\n y = ls.index(m)\r\n if y - x == 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')", "\r\nn,m=map(int,input().split())\r\n\r\ndef prime(n):\r\n\tfor i in range(2,n):\r\n\t\tif n%i==0:\r\n\t\t\treturn 'not'\r\n\treturn 'yes'\r\n\r\nl=0\r\nfor i in range(n+1,m): \r\n for j in range(2,i): \r\n if(i % j==0): \r\n break\r\n else: \r\n \tl+=1\r\n \r\n# print(l)\r\nif l>0 :\r\n\tprint('NO')\r\nelif l<1 and prime(m)=='yes':\r\n\tprint('YES') \r\nelse:\r\n\tprint('NO')\r\n ", "l=[int(i) for i in input().split()];ll=[]\r\na=l[0];b=l[len(l)-1];c=0\r\nfor i in range(a,b+1):\r\n c=0\r\n for j in range(2,i):\r\n if i%j==0:\r\n c=1\r\n if c==0:\r\n ll.append(i)\r\nif l==ll:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "lst=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nn,m=map(int,input().split())\r\nind=lst.index(n)\r\nif ind==len(lst)-1:\r\n print('NO')\r\nelse: \r\n if m==lst[ind+1]:\r\n print('YES')\r\n else:\r\n print('NO')", "x=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\na,b=map(int,input().split())\r\nif b in x and x.index(b)-x.index(a)==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "def f(a):\r\n if a<2: return False\r\n k = 0\r\n for i in range(2, a // 2+1):\r\n if (a % i == 0):\r\n k = k+1\r\n if (k <= 0): return True\r\n return False\r\n\r\nx, y=map(int, input().split())\r\nc=0\r\nif f(x) and f(y):\r\n for i in range(x+1, y):\r\n if f(i): c+=1\r\n if c==0: print(\"YES\")\r\n else: print(\"NO\")\r\nelse: print(\"NO\")", "a,b=map(int,input().split());c=[];t=2\r\nfor i in list(range(b,a,-1)):\r\n t=2\r\n while((t**2)<=i):\r\n if i%t==0:c.append(i);break\r\n else:t+=1\r\nprint(\"NO\" if b-a-len(c)>1 or b in c else \"YES\")", "x, y = map(int, input().split())\r\n\r\nsieve = [True]*(y+1)\r\n\r\nfor i in range(2, y+1, 1):\r\n\tif not sieve[i]: continue\r\n\tt = 2*i\r\n\twhile(t < y+1):\r\n\t\tsieve[t] = False\r\n\t\tt += i\r\n\r\na = True\r\n\r\np = 0\r\nfor i in range(x+1, y+1, 1):\r\n\tif sieve[i]:\r\n\t\tp = i\r\n\t\tbreak\r\nif p == y:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n,m = map(int,input().split())\r\nprime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nif m in prime:\r\n if m == prime[prime.index(n)+1]:\r\n print('YES')\r\n else :\r\n print('NO')\r\nelse :\r\n print('NO')", "n, m = list(map(int,input().split()))\r\n\r\ndef Prime(x):\r\n val = 2\r\n while val * val <= x:\r\n if x % val == 0:\r\n return False\r\n val += 1\r\n return True\r\n\r\nif n >= m or not Prime(m):\r\n print('NO')\r\n exit(0)\r\n\r\nx = n + 1\r\nwhile not Prime(x):\r\n x += 1\r\nif x != m:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "import math\r\nn,m=map(int,input().split())\r\narr=[i for i in range(2,m+1)]\r\n\r\np=2\r\n\r\nwhile p<=int(math.sqrt(m)):\r\n if p in arr:\r\n for j in range(p*2,m+1,p):\r\n if j in arr:\r\n arr.remove(j)\r\n p=p+1\r\n\r\nif n in arr:\r\n index=arr.index(n)\r\n if index==len(arr)-1:\r\n print('NO')\r\n elif arr[index+1]==m:\r\n print('YES')\r\n else:\r\n print('NO')", "n=list(map(int,input().split()))\r\ns=0\r\nw=0\r\nfor i in range(n[0]+1,n[1]+1):\r\n s=0\r\n for j in range(2,i+1):\r\n if(i%j==0):\r\n s=s+1\r\n if(s==1):\r\n if(i==n[1]):\r\n print('YES')\r\n w=w+1\r\n break\r\n else:\r\n print('NO')\r\n w=w+1\r\n break\r\nif(w==0):\r\n print('NO')\r\n \r\n", "k=[int(i) for i in input().split()]\r\n\r\nn=k[0]\r\nm=k[-1]\r\n\r\nwhile True:\r\n f=[]\r\n if n==2:\r\n n+=1\r\n else:\r\n n+=2\r\n for i in range(1,n//2+2):\r\n if n%i==0:\r\n f.append(i)\r\n f.append(int(n/i))\r\n if len(f)==2 and n==m:\r\n print('YES')\r\n break\r\n if len(f)==2 and n!=m:\r\n print('NO')\r\n break\r\n \r\n \r\n \r\n", "f=lambda x:all(x%i for i in range(2,x))\r\nn,m=map(int,input().split())\r\nprint(['NO','YES'][f(m)and all(not f(i)for i in range(n+1,m))])", "lis = list(map(int,input().split()))\r\n\r\nn = lis[0]\r\nm = lis[1]\r\n\r\narr = []\r\nfor num in range(0, 60):\r\n # all prime numbers are greater than 1\r\n if num > 1:\r\n for i in range(2, num):\r\n if (num % i) == 0:\r\n break\r\n else:\r\n arr.append(num)\r\n\r\n\r\nc = False\r\n\r\nfor i in range(len(arr)):\r\n if arr[i]==n and arr[i+1]==m:\r\n c = True\r\n\r\n else:\r\n pass\r\n\r\nif c:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "def check(k):\r\n for i in range(2, k//2+1):\r\n if k % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef solve():\r\n x, y = map(int, input().split())\r\n for i in range(x+1, y+1):\r\n if check(i):\r\n print('YES' if i == y else 'NO')\r\n return\r\n print('NO')\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "l=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\nn,m=map(int, input().split())\r\nif m in l:\r\n a=l.index(m)\r\n if n==l[a-1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "def is_prime(num):\r\n if num <= 1:\r\n return False\r\n for i in range(2, int(num ** 0.5) + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n \r\n v = []\r\n for N in range(2, 51):\r\n if is_prime(N):\r\n v.append(N)\r\n\r\n flag = False\r\n for i in range(len(v) - 1):\r\n if v[i] == n and v[i + 1] == m:\r\n flag = True\r\n break\r\n\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin, stdout\r\nreadline, writeline = stdin.readline, stdout.write\r\n\r\n\r\ndef lint():\r\n return list(mint())\r\n\r\n\r\ndef mint():\r\n return map(int, readline().strip().split())\r\n\r\n\r\ndef iint():\r\n return int(readline().strip())\r\n\r\n\r\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nn, m = mint()\r\nif primes[primes.index(n)+1] == m:\r\n writeline(\"YES\\n\")\r\nelse:\r\n writeline(\"NO\\n\")\r\n", "m,n=map(int,input().split())\r\ndef isprime(n):\r\n if n==1:\r\n return False\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\nf=True\r\nfor i in range(m+1,n):\r\n if isprime(i):\r\n f=False\r\n break\r\nif f and isprime(n):\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_prime(n):\r\n if n <= 1:\r\n return False\r\n for i in range(2, int(n**0.5) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\nn, m = map(int, input().split())\r\nnext_prime = n + 1\r\nwhile not is_prime(next_prime):\r\n next_prime += 1\r\nif next_prime == m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = list(map(int, input().split()))\r\na = list(range(1, 51, 2))\r\ni = 0\r\na.insert(1, 2)\r\nwhile i < len(a) - 1:\r\n d = 3\r\n while d < a[i]:\r\n if a[i] % d == 0:\r\n a.remove(a[i])\r\n d += 1\r\n i += 1\r\na.remove(49)\r\n\r\nif m in a:\r\n if a.index(m) - a.index(n) == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "a,b=map(int,input().split())\r\nn=100\r\ndlist=[x for x in range(n+1)]\r\ni=2\r\nwhile(i*i<=n):\r\n for j in range(i*i,n+1,i):\r\n if j in dlist:\r\n dlist.remove(j)\r\n i+=1\r\nt=dlist.index(a)\r\nif dlist[t+1]==b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, m = [int(x) for x in input().split()]\r\n \r\nl = []\r\n \r\n \r\nfor i in range(2, m+1):\r\n if not any(i % x == 0 for x in l): \r\n l.append(i)\r\n\r\nif m == l[-1] and n == l[-2]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def checkprime(n):\r\n for i in range(2,int(n/2)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=a+1\r\nwhile checkprime(c)== False:\r\n c+=1\r\nif c==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nli = []\r\ndef prime(a):\r\n\r\n for i in range(2,a):\r\n if a%i ==0:\r\n return False\r\n return True\r\n\r\nfor i in range(1,51):\r\n if prime(i):\r\n li.append(i)\r\n\r\nn,m = map(int,input().split())\r\nif prime(m) and (li.index(n)+1) == li.index(m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "def isprime(x):\r\n count = 0\r\n for i in range(1,x+1):\r\n if x%i == 0:\r\n count +=1\r\n if count > 2:\r\n return False\r\n else:\r\n return True\r\nn, m = list(map(int,input().split()))\r\nresult = \"YES\"\r\nif not isprime(m):\r\n result = \"NO\"\r\nelse:\r\n for i in range(n+1,m):\r\n if isprime(i):\r\n result = \"NO\"\r\n break\r\nprint(result)", "def h(n):\r\n k=0\r\n for i in range(2,(n//2)+1):\r\n if n%i==0:\r\n return 2\r\n k=1\r\n break\r\n if k==0:\r\n return 3\r\n(k,l)=map(int,input().split())\r\nu=0\r\nif h(l)==3:\r\n for i in range(k+1,l):\r\n \r\n if h(i)==3:\r\n print(\"NO\")\r\n u=1\r\n break\r\nelse:\r\n u=1\r\n print(\"NO\")\r\nif u==0:\r\n print(\"YES\")\r\n ", "n, m = list(map(int, input().split()))\r\nif n < 10:\r\n if n == 2 and m == 3:\r\n print(\"YES\")\r\n elif n == 3 and m == 5:\r\n print(\"YES\")\r\n elif n == 5 and m == 7:\r\n print(\"YES\")\r\n elif n == 7 and m == 11:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nelif n < 20:\r\n if n == 11 and m == 13:\r\n print(\"YES\")\r\n elif n == 13 and m == 17:\r\n print(\"YES\")\r\n elif n == 17 and m == 19:\r\n print(\"YES\")\r\n elif n == 19 and m == 23:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nelif n < 30:\r\n if n == 23 and m == 29:\r\n print(\"YES\")\r\n elif n == 29 and m == 31:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nelif n < 40:\r\n if n == 31 and m == 37:\r\n print(\"YES\")\r\n elif n == 37 and m == 41:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nelif n < 50:\r\n if n == 41 and m == 43:\r\n print(\"YES\")\r\n elif n == 43 and m == 47:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n#print(m, n)\r\n", "n,m = map(int,input().split())\r\n\r\nc = 0\r\nmm = []\r\nfor i in range(1,55):\r\n c = 0\r\n for k in range(1,i+1):\r\n\r\n if i%k == 0 :\r\n c+=1\r\n if c < 3 :\r\n mm.append(i)\r\n#print(mm)\r\n\r\n\r\nif n in mm and m in mm :\r\n\r\n if mm.index(m) - 1 == mm.index(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n'''\r\n\r\n if m%i == 0 :\r\n c+=1\r\n if c \r\n mm.append()\r\n '''\r\n\r\n\r\n\r\n\r\n\r\n'''\r\nc=0\r\nfor i in range(1,m+1):\r\n \r\n if m%i == 0 :\r\n c+=1\r\n\r\nif c < 3 :\r\n\r\n for k in range(1,50+1):\r\n\r\n\r\n'''", "x,y=list(map(int,input().split()))\r\np=[1,2]\r\nfor i in range(3,50):\r\n c=0\r\n for j in range(2,i):\r\n if i%j==0:\r\n c +=1\r\n if c==0:\r\n p.append(i)\r\nbo=True\r\nfor k in range(len(p)-1):\r\n if p[k]==x and p[k+1]==y:\r\n print(\"YES\")\r\n bo=False\r\n break\r\nif bo:\r\n print(\"NO\")", "p=[2, 3, 5, 7 ,11, 13 ,17,19, 23, 29,31, 37, 41, 43, 47]\r\na,b=map(int,input().split())\r\nif b in p and p.index(b)-1==p.index(a):\r\n print('YES')\r\nelse:\r\n print('NO')", "def problemA():\r\n N, M = map(int,input().split())\r\n prime_numbers = []\r\n for prime in range(N, M+1):\r\n if prime > 1:\r\n for i in range(2, prime):\r\n if prime % i == 0:\r\n break\r\n else:\r\n prime_numbers.append(prime)\r\n #print(prime_numbers)\r\n if len(prime_numbers) > 1:\r\n if prime_numbers[1] == M:\r\n return \"YES\"\r\n \r\n else:\r\n return \"NO\"\r\n else:\r\n return \"NO\"\r\n \r\n \r\n\r\nnumber_of_testcases = 1 #int(input())\r\nfor _ in range(number_of_testcases):\r\n print(problemA())", "\r\n\r\ndef is_prime(num):\r\n if num < 2:\r\n return False\r\n for integer in range(2, int(num ** 0.5)+1):\r\n if num % integer == 0:\r\n return False\r\n return True\r\n\r\n\r\na, b = list(map(int, input().split()))\r\n\r\n\r\n\r\nprimes = []\r\n\r\nfor i in range(a, b + 1):\r\n if is_prime(i):\r\n primes.append(i)\r\n \r\n# print(primes)\r\ntry:\r\n if primes[1] == b:\r\n print('YES')\r\n else:\r\n print('NO')\r\nexcept:\r\n print('NO')", "import math\r\nn,m = map(int,input().split())\r\ndef check_prime(n,m):\r\n for i in range(n+1, m+1):\r\n prime = True\r\n for j in range(2, int(math.sqrt(i))+1):\r\n if i % j == 0:\r\n prime = False\r\n break\r\n if prime == True:\r\n if i == m:\r\n return 'YES'\r\n return 'NO'\r\n else:\r\n continue\r\n return ('NO')\r\nprint(check_prime(n,m))", "n,m=list(map(int,input().split()))\r\nx=n+1\r\ndef is_Prime(n):\r\n c=0\r\n for i in range(1,(n+1)):\r\n if (n%i==0):\r\n c=c+1\r\n if(c==2):\r\n return(\"YES\")\r\n else:\r\n return(\"NO\")\r\n \r\nwhile(True):\r\n if (is_Prime(x)==\"YES\"):\r\n break\r\n else:\r\n x=x+1\r\nif (is_Prime(m)==\"YES\" and m==x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Panoramix's Prediction\ndef primes(a, b):\n primes = [True for i in range(b+1)]\n i = 2\n while i ** 2 <= b:\n if primes[i]:\n for j in range(i*i, b+1, i):\n primes[j] = False\n i += 1\n primes[0] = False\n primes[1] = False\n if primes[b] == False:\n return \"NO\"\n i = (a + 1)\n while True:\n if primes[i] == True:\n if i == b:\n return \"YES\"\n else:\n return \"NO\"\n i += 1\n \nn, m = list(map(int, input().rstrip().split()))\nprint(primes(n, m))", "import math\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\r\n \r\n max_div = math.floor(math.sqrt(n))\r\n for i in range(2, 1 + max_div):\r\n if n % i == 0:\r\n return False\r\n return True\r\nif __name__==\"__main__\":\r\n m,n = map(int, input().split())\r\n f=0\r\n for i in range(m+1, n):\r\n if is_prime(i):\r\n f=1 \r\n break \r\n if f==0 and is_prime(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\ndef gcd (a, b):\r\n if a % b == 0:\r\n return b\r\n else:\r\n return gcd(b, a%b) \r\n\r\ndef prime_bool(k):\r\n if k==2 or k==3: return True\r\n if k%2==0 or k<2: return False\r\n for i in range(3, int(k**0.5)+1, 2):\r\n if k%i==0:\r\n return False\r\n return True\r\n\r\ndef prime(k):\r\n for i in range(2, int(k**0.5)+1, 1):\r\n if k%i==0:\r\n return i\r\n return k\r\n\r\na, b = [int(i) for i in input().split()]\r\nif prime_bool(b) == True :\r\n x = 0\r\n for i in range (a + 1, b + 1) :\r\n if prime_bool(i) == True :\r\n x =i\r\n break\r\n if x == b :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\nelse :\r\n print(\"NO\")", "\r\ndef is_prime(x):\r\n found_div=False;\r\n for i in range(2,x):\r\n if(x%i==0):\r\n found_div=True\r\n break\r\n return (not found_div)\r\n \r\n\r\nn,m=[int(x) for x in input().split()]\r\nfound=False\r\nfor i in range(n+1,m):\r\n if(is_prime(i)):\r\n found=True\r\n\r\nif(found==False and is_prime(m)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def ch(a):\r\n i=2\r\n while i<a//2+1:\r\n if a%i==0:\r\n return 1\r\n i+=1\r\n return 0\r\na,b=map(int,input().split())\r\ni=a+1\r\nwhile 1:\r\n if ch(i)==0:\r\n break\r\n i+=1\r\nif i==b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "def isPrime(n) :\n if n <= 1 :\n return False\n if n <= 3 :\n return True\n\n if n % 2 == 0 or n % 3 == 0 :\n return False\n\n i = 5\n while i * i <= n :\n if n % i == 0 or n % (i + 2) == 0 :\n return False\n i = i + 6\n\n return True\n\n\na, b = map(int, input().split())\nx = 0\nfor i in range(a + 1, b + 1):\n if isPrime(i) :\n x = i\n break\nif x == b:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t\t\t \t \t\t \t\t\t \t\t \t\t\t", "n, m = [int(x) for x in input().split()]\n\n\nprime = True\nfor l in range(2, m):\n\tif m % l == 0:\n\t\tprime = False\n\t\tprint(\"NO\")\n\t\texit()\n\nother = False\nfor i in range(n+1, m):\n\tprim = True\n\tfor j in range(2, i):\n\t\tif i % j == 0:\n\t\t\tprim = False\n\t\t\tbreak\n\tif prim == True:\n\t\tprint(\"NO\")\n\t\texit()\nprint(\"YES\")", "a,b = list(map(int,input().split()))\r\nif b != 3 and b != 5 and b != 7 and b != 11:\r\n if b%2 !=0 and b%3 !=0 and b%5 !=0 and b%7 !=0 :\r\n if a != 2 and a != 3 and a != 5 and a !=7:\r\n a = a+2\r\n while a%2 == 0 or a%3 == 0 or a%5 == 0 or a%7==0:\r\n a = a+2\r\n if a == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n elif (a == 2 and b == 3) or (a == 3 and b == 5) or (a == 5 and b ==7) or (a == 7 and b ==11):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelif (a == 2 and b == 3) or (a == 3 and b == 5) or (a == 5 and b ==7) or (a == 7 and b ==11):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "# Function to check if a number is prime\r\ndef is_prime(x):\r\n if x <= 1:\r\n return False\r\n for i in range(2, int(x**0.5) + 1):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\n# Read input values\r\nn, m = map(int, input().split())\r\n\r\n# Find the next prime number after n\r\nnext_prime = n + 1\r\nwhile True:\r\n if is_prime(next_prime):\r\n break\r\n next_prime += 1\r\n\r\n# Check if m is the next prime after n\r\nif m == next_prime:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_prime(x):\r\n return all(x % i for i in range(2, x))\r\n\r\ndef next_prime(x):\r\n return min([a for a in range(x+1, 2*x) if is_prime(a)])\r\nn, m = map(int, input().split())\r\nif next_prime(n) == m:\r\n\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "prime = []\r\nfor j in range(1, 51):\r\n c = 0\r\n for i in range(1, j+1):\r\n if j % i == 0:\r\n c += 1\r\n if c == 2:\r\n prime.append(j)\r\nx, y = map(int, input().split())\r\nprime.append(0)\r\nif y == prime[prime.index(x)+1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m = [int(x) for x in input().split()]\r\nres = \"NO\"\r\ndef isprime(i):\r\n for j in range(2,int(i**0.5+1)):\r\n if i%j==0:\r\n return False\r\n return True\r\nfor i in range(n+1,m+1):\r\n if isprime(i):\r\n if i==m:\r\n res = \"YES\"\r\n break\r\n else:\r\n res=\"NO\"\r\n break\r\n \r\nprint(res)", "l,m=map(int,input().split())\r\na=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,0];print('YNEOS'[a[a.index(l)+1]!=m::2])\r\n", "import re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef is_isprime(n):\r\n if n == 0 or n == 1:\r\n return False\r\n if n == 2:\r\n return True\r\n limit = int(sqrt(n)+1)\r\n for i in range(2, limit+1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\na, b = invr()\r\nnxt_p = -1\r\nfor i in range(a+1, b+1):\r\n if is_isprime(i):\r\n nxt_p = i\r\n break\r\nif nxt_p == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def prime(n):\r\n for i in range(2, n):\r\n if n % i == 0:\r\n p = False\r\n break\r\n else:\r\n p = True\r\n return p\r\n\r\nn, m = map(int, input().split())\r\n\r\nif prime(m) == True:\r\n while m - 1 > n:\r\n m -= 1\r\n if prime(m) == True:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "prime = [True] * 51\r\nnprime = []\r\np = 2\r\nprime[0], prime[1] = False, False\r\n\r\nwhile(p * p <= 51):\r\n if prime[p]:\r\n\r\n for i in range(p*2, 51, p):\r\n prime[i] = False\r\n p += 1\r\n\r\nfor j, i in enumerate(prime):\r\n if i:\r\n nprime.append(j)\r\n\r\nn, m = [int(x) for x in input().split()]\r\nif prime[n] and prime[m]:\r\n if nprime.index(n) + 1 == nprime.index(m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "line = input()\r\n(n,m) = map(int, line.split())\r\nx = n + 1\r\nwhile True:\r\n for i in range(2,x):\r\n if (x%i) == 0:\r\n break\r\n else:\r\n if x == m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\r\n x += 1", "def is_prime(n):\r\n i = 2\r\n while i < n:\r\n if n%i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\nn,k = map(int,input().split())\r\nfor i in range(n + 1,k):\r\n if is_prime(i):\r\n print(\"NO\")\r\n break\r\nelse:\r\n if is_prime(k):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n", "p=input()\r\nn,m=map(int,p.split())\r\nd=0\r\nfor i in range(n,m+1):\r\n c=0\r\n for j in range(2,i):\r\n if i%j==0:\r\n break\r\n else:\r\n c+=1\r\n if c==i-2:\r\n d+=1\r\n if d==2 and i<m:\r\n d+=1\r\nif d!=2:\r\n print('NO')\r\nelse:\r\n print('YES')", "from math import sqrt\r\nfrom time import sleep\r\n\r\n\r\nn,m = map(int, input().split())\r\n\r\ndef Prime(n): \r\n\tF = 1\r\n\ti = 2\r\n\twhile (F == 1) and (i <= int(sqrt(n)) + 1):\r\n\t\tF += 1 if n % i == 0 else 0\r\n\t\ti += 1\r\n\treturn F == 1\r\nsleep(1.5)\t\r\nn += 1\r\nwhile Prime(n) == False: \r\n\tn += 1\r\nprint(\"YES\" if n == m else \"NO\")", "n,m = tuple(map(int,input().split()))\r\ndef prime(x):\r\n for i in range(2,x):\r\n if x%i==0:\r\n return False\r\n return True\r\n\r\nif prime(m)== False:\r\n print(\"NO\")\r\nelse:\r\n ans =0\r\n for i in range(n+1,m):\r\n if prime(i)== True:\r\n ans = 1\r\n print(\"NO\")\r\n break\r\n if ans==0:\r\n print(\"YES\")\r\n \r\n", "def check():\r\n given_prime, to_check_prime = map(int, input().split())\r\n x = 1\r\n while True:\r\n c = given_prime + x\r\n count = 0\r\n for i in range(2, c + 1):\r\n if c % i == 0:\r\n count += 1\r\n if count > 2:\r\n break\r\n if count < 2:\r\n if c == to_check_prime:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n x += 1\r\n\r\ncheck()\r\n \r\n\r\n", "n,m=map(int,input().split())\r\na=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nfor i in range(len(a)-1):\r\n\tif n==a[i]:\r\n\t\tif m==a[i+1]:\r\n\t\t\tprint('YES')\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\t\t\tbreak\r\n", "\r\ndef isprime(n):\r\n co=0\r\n for i in range(2,n):\r\n if n%i==0:\r\n co+=1\r\n if co>0:\r\n return False\r\n else:\r\n k=n\r\n if l[1]==n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n return True\r\n \r\nl=list(map(int,input().split()))\r\ni=l[0]\r\ni+=1\r\nwhile(not isprime(i)):\r\n i+=1\r\n", "from math import sqrt\r\n\r\ndef is_prime(x):\r\n if x == 1:\r\n return False\r\n if x == 2:\r\n return True\r\n if x % 2 == 0:\r\n return False \r\n for d in range(3, int(sqrt(x)) + 1):\r\n if x % d == 0:\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\nflag = True\r\n\r\nfor d in range(n + 1, m):\r\n if is_prime(d):\r\n flag = False\r\n\r\nif flag:\r\n flag = is_prime(m)\r\n\r\nprint(\"YES\" if flag else \"NO\")", "if __name__ == '__main__':\r\n refer = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\n n, m = str(input()).split()\r\n n, m = int(n), int(m)\r\n if refer[refer.index(n) + 1] == m:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "n, m = [int(p) for p in input().split()]\r\nlmao = True\r\nanjime = True\r\ny = 0\r\nA = []\r\nfor i in range(n+1, 51):\r\n if anjime:\r\n for j in range(2, i):\r\n if i % j == 0:\r\n lmao = False\r\n break\r\n else:\r\n y = i\r\n anjime = False\r\n break\r\n else:\r\n break\r\nif m == y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n return prime\r\n\r\nn,m = map(int,input().split())\r\nprimes = SieveOfEratosthenes(max(n,m))\r\nif primes[m] and True not in primes[n+1:m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def prime(x):\r\n for i in range(x+1,51):\r\n flag=0\r\n for j in range(2,i):\r\n if i%j==0:\r\n flag=1\r\n break\r\n if flag==0:\r\n return i\r\na,b=input().split()\r\na,b=[int(a),int(b)]\r\nif b==prime(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "import collections\r\nimport math\r\n\r\ndef isprime(n):\r\n return n in (2,3,5,7) or (n > 7 and n%2!=0 and n%3!=0 and n%5 != 0 and n % 7 != 0)\r\n\r\ndef function():\r\n n, m = map(int, input().split())\r\n if n == m:\r\n return \"NO\"\r\n for i in range(n+1, m+1):\r\n if isprime(i) and i != m:\r\n return \"NO\"\r\n if isprime(i) and i == m:\r\n return \"YES\"\r\n if not isprime(i) and i == m:\r\n return \"NO\"\r\n\r\nif __name__ == \"__main__\":\r\n res = function()\r\n print(res)\r\n\r\n\r\n#0,1,2 3,4,5 6,7 -- 3\r\n", "n, m = map(int, input().split())\r\n\r\n\r\ndef isPrime(number):\r\n prime = 1\r\n for x in range(2, number):\r\n if number % x == 0:\r\n prime = 0\r\n\r\n if prime == 1:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nflag = 0\r\nif isPrime(m):\r\n flag = 2\r\n for i in range(n + 1, m):\r\n if isPrime(i):\r\n flag = 1\r\n break\r\n\r\nif flag == 1:\r\n print(\"NO\")\r\nelif flag == 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\r\n n, m = map(int, input().split())\r\n for i in range(n+1, m):\r\n if not check(i):\r\n print(\"NO\")\r\n return\r\n\r\n print(\"YES\" if not check(m) else \"NO\")\r\n\r\n\r\ndef check(i): # Check prime\r\n for j in range(2, i):\r\n if i % j == 0:\r\n return True\r\n return False\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def isPrime(x):\n\tfor i in range(2, x):\n\t\tif x % i == 0:\n\t\t\treturn False\n\treturn True\n\nn, m = [int(x) for x in input().split()]\nfor i in range(n + 1, m + 1):\n\tif isPrime(i):\n\t\tif i == m:\n\t\t\tprint('YES')\n\t\telse:\n\t\t\tprint('NO')\n\t\texit(0)\nprint('NO')\n", "nm = list(map(int, input().split()))\r\naccept = 0\r\nfor i in range(nm[0] + 1, nm[1]):\r\n\tsimple_number = 1\r\n\tfor j in range(2, i):\r\n\t\tif i % j == 0:\r\n\t\t\tsimple_number = 0\r\n\t\t\tbreak\r\n\tif simple_number == 1:\r\n\t\taccept = 1\r\n\t\tbreak\r\nsimple = 1\r\nif accept == 1:\r\n\tprint('NO')\r\nelse:\r\n\tfor m in range(2, nm[1]):\r\n\t\tif nm[1] % m == 0:\r\n\t\t\tsimple = 0\r\n\t\t\tbreak\r\n\tif simple == 1:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "n, m = map(int, input().split())\r\n\r\nnext_prime = n + 1\r\n\r\ndef is_prime(num):\r\n i = 2\r\n while i <= num ** (1/2):\r\n if num % i == 0:\r\n return False \r\n i += 1\r\n return True \r\n\r\nwhile next_prime <= m:\r\n if is_prime(next_prime):\r\n if next_prime == m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\r\n elif next_prime == m:\r\n print(\"NO\")\r\n next_prime += 1\r\n\r\n", "from math import sqrt\r\n\r\nprimes = [1 for i in range(51)]\r\nprimes[0], primes[1] = 0, 0\r\n\r\nfor i in range(2, 8):\r\n for j in range(i * i, 51, i):\r\n primes[j] = 0\r\n\r\nn,m = map(int, input().split())\r\n\r\nvalid = False\r\nif primes[m]:\r\n x = n+1\r\n while not primes[x]:\r\n x += 1\r\n if x == m:\r\n valid = True\r\nif valid:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input().strip().split()\r\nb = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\nc = b.index(int(a[0]))\r\nif c<len(b)-1 and b[c+1]==int(a[1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_prime(n):\r\n\r\n if n <= 1:\r\n return False\r\n\r\n for i in range(2, int(n**0.5)+1):\r\n if n % i == 0:\r\n return False\r\n\r\n return True\r\n\r\na, b = input().split()\r\na, b = int(a), int(b)\r\n\r\np = a+1\r\nf = False\r\nwhile not f:\r\n if is_prime(p):\r\n f = True\r\n else:\r\n p+=1\r\n \r\nif p==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isPrime(num):\n if num > 1: \n for i in range(2,num): \n if (num % i) == 0: \n return False\n else: \n return True\n \n else: \n return False \n \n\nn,m = map(int,input().split())\nc=0\nfor i in range(n+1,m+1):\n if isPrime(i):\n break\nif isPrime(m) and i==m:\n print('YES')\nelse:\n print('NO')\n# print(isPrime(n),isPrime(m))" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nn, k = map(int, input().split())\r\nl = sorted(list(range(1, n+1)))\r\nc = 0\r\nt = []\r\nfor i in [int(j) for j in input().split()]:\r\n c = (c+i)%len(l)\r\n t.append(l[c])\r\n l = l[:c]+l[c+1:]\r\nprint(*t)\r\n", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nc = 1\r\nans = []\r\nb = [i for i in range(1, n+1)]\r\nfor i in range(k):\r\n c = (c + a[i]-1)%n\r\n ans.append(b[c])\r\n b.pop(c)\r\n n = n - 1\r\n if n == 0:\r\n break\r\n c = (c + 1)%n\r\n \r\nfor i in ans:\r\n print(i, end = \" \")\r\n \r\n", "import math\r\nn,k= map(int,input().split())\r\na= list(map(int,input().split()))\r\nl1=[x for x in range(1,n+1)]\r\nj=0\r\nfor i in a:\r\n k-=1\r\n j=(j+i)%n\r\n if k!=0:\r\n print(l1[j],end=' ')\r\n else:\r\n print (l1[j],end='')\r\n n-=1\r\n l1.pop(j)\r\n \r\n", "n,k=(int(n) for n in input().split())\r\nA=[int(n) for n in input().split()]\r\n\r\nV=[i+1 for i in range(n)]\r\n\r\npos=0\r\nelim=[]\r\nfor i in range(k):\r\n\tpos=(pos+A[i])%len(V)\r\n\telim.append(V.pop(pos))\r\n\tif(pos == len(V)):\r\n\t\tpos=0\r\nfor x in elim:\r\n\tprint(x,end=' ')\r\n", "nn,k=map(int,input().split())\r\nn=nn\r\na=list(map(int,input().split()))\r\nc=list(range(1,n+1))\r\ns=0\r\nans=[]\r\nfor j in a:\r\n x=j%n\r\n m=0\r\n while m<x:\r\n s+=1;s%=nn\r\n while c[s]==-1:s+=1;s%=nn\r\n m+=1\r\n ans.append(str(c[s]))\r\n c[s]=-1\r\n n-=1\r\n if n>0:\r\n while c[s]==-1:s+=1;s%=nn\r\n\r\nprint(' '.join(ans))", "(n, k) = (int(i) for i in input().split())\r\na = [int(i) for i in input().split()]\r\n\r\nms = [int(i) for i in range(1, n+1)]\r\ncur = 0\r\nfor i in a:\r\n\tind = (i - n + cur) % n\r\n\tn -= 1\r\n\tcur = ind\r\n\tprint(ms.pop(ind), end=' ')", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nchildren = list(range(1, n + 1))\r\n\r\npos = 0\r\nfor i in range(k):\r\n\tpos = (pos + a[i]) % len(children)\r\n\tprint(children[pos], end = ' ')\r\n\tdel children[pos]\r\nprint()", "n,k = map(int,input().split())\na = list(map(int,input().split()))\n\nchildren = list(range(1,n+1))\nlea, idx = 0, 0\nfor ai in a:\n idx = (lea+ai)%len(children)\n print(children.pop(idx))\n lea = idx\n", "n,k=(input().split(\" \"))\r\nn,k=int(n),int(k)\r\na=list(range(1,n+1))\r\nl=0\r\nfor i in input().split(\" \"):\r\n e=((l+int(i))%len(a))\r\n print(a[e],end=\" \")\r\n a.pop(e)\r\n l=e\r\n ", "from sys import stdout\n\ndef solve():\n n, k = map(int, input().rstrip().split())\n ls = list(map(int, input().rstrip().split()))\n children = [i for i in range(1, n + 1)]\n index = 0\n for elt in ls:\n index = (index + elt) % len(children)\n stdout.write(str(children[index]) + ' ')\n children.pop(index)\n print()\n\nif __name__ == '__main__':\n solve()\n", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nq = deque()\r\nfor i in range(n):\r\n q.append(i + 1)\r\nans = []\r\nfor i in a:\r\n c = i % n\r\n for _ in range(c):\r\n q.append(q.popleft())\r\n ans.append(q.popleft())\r\n n -= 1\r\nprint(*ans)", "n, a, b, l = input().split(), input().split(), [0], 1\r\nn[0], n[1] = int(n[0]), int(n[1])\r\nfor i in range(1, n[0]+1): b.append(i);\r\nfor i in range(n[1]):\r\n l = (l+int(a[i]))%n[0]\r\n if l==0: l = n[0];\r\n n[0]-=1\r\n print(b[l], end = ' ')\r\n b.pop(l)", "import sys\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = [0]*k\r\np = list(range(1, n+1))\r\ni = 0\r\n\r\nfor j in range(k):\r\n i = (i + a[j]) % len(p)\r\n ans[j] = p[i]\r\n p.pop(i)\r\n i %= len(p)\r\n\r\nprint(*ans)\r\n", "import math;\r\n\r\nn,k = map(int,input().split());\r\na = [int(i) for i in input().split()];\r\nmass = [];\r\nprintmass = '';\r\n\r\ncount = n;\r\n\r\nnow = 0;\r\n\r\nfor i in range(n):\r\n mass.insert(i,i+1);\r\n\r\nfor i in range(k):\r\n a[i] = (a[i]+now) % count;\r\n printmass += str(mass[a[i]]) + ' ';\r\n del mass[a[i]];\r\n now = a[i];\r\n count -= 1;\r\n\r\nprint(printmass);", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n\r\ndef mindist(n, k, list):\r\n player = [i for i in range(1,n+1)]\r\n capo = 0\r\n rem = n\r\n result = \"\"\r\n for step in range(k):\r\n puntato = (capo + list[step]) % rem\r\n capo = puntato\r\n result += str(player[puntato]) + \" \"\r\n player.remove(player[puntato])\r\n rem -= 1\r\n return(result[:-1])\r\n\r\nif __name__ == '__main__':\r\n [n,k] = list(map(int, input().rstrip().split()))\r\n list = list(map(int, input().rstrip().split()))\r\n print(mindist(n, k, list))", "import sys\r\nimport bisect as bi\r\nimport math as mt\r\nimport collections as cc\r\nimport heapq as hp\r\nI=lambda:list(map(int,input().split()))\r\nn,k=I()\r\nl=I()\r\nar=list(range(1,n+1))\r\nnow=0\r\nfor i in range(k):\r\n cur=(now+l[i])%n\r\n print(ar[cur],end=\" \")\r\n ar.pop(cur)\r\n n=len(ar)\r\n now=(cur)%n\r\n #print(ar,now,n)", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nX = list(range(n))\r\ncur = 0\r\nans = []\r\nfor i in range(k):\r\n m = len(X)\r\n j = (cur+A[i])%m\r\n ans.append(X.pop(j))\r\n cur = j\r\nans = [i+1 for i in ans]\r\nprint(*ans)\r\n", "def circle(arr, start):\r\n if start == arr.__len__():\r\n start = 0\r\n\r\n while True:\r\n yield start\r\n start += 1\r\n if start == arr.__len__():\r\n start = 0\r\n\r\n\r\ndef get_ith_victim(a, i, count):\r\n z = count % a.__len__()\r\n it = circle(a, i)\r\n toPop = i\r\n while z >= 0:\r\n toPop = it.__next__()\r\n z -= 1\r\n res = a.pop(toPop)\r\n return res, toPop\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = tuple(map(int, input().split()))\r\n nums = list(map(int, input().split()))\r\n members = list(range(1, n + 1))\r\n next_leader = 0\r\n for c in nums:\r\n victim, next_leader = get_ith_victim(members, next_leader, c)\r\n print(victim, end=\" \")", "import sys\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n ch = [i + 1 for i in range(n)]\r\n a = [int(i) for i in input().split()]\r\n\r\n live = n\r\n leader = 0\r\n ans = []\r\n\r\n for v in a:\r\n v = v % live\r\n j = 0\r\n cnt = 0\r\n\r\n while cnt < v:\r\n if ch[(leader + j + 1) % n]:\r\n cnt += 1\r\n\r\n j += 1\r\n\r\n ans.append((leader + j) % n + 1)\r\n ch[(leader + j) % n] = 0\r\n live -= 1\r\n leader = (leader + j + 1) % n\r\n\r\n while ch[leader] == 0:\r\n leader = (leader + 1) % n\r\n\r\n # print(ch)\r\n # print(leader + 1)\r\n\r\n print(*ans)\r\n\r\ndef debug(x, table):\r\n for name, val in table.items():\r\n if x is val:\r\n print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)\r\n return None\r\n\r\nif __name__ == '__main__':\r\n solve()", "n, k = [int(i) for i in input().split()]\nass = [int(i) for i in input().split()]\nchi = [i+1 for i in range(n)]\ns = 0\nfor a in ass:\n print(chi[(a+s)%n], end=\" \")\n chi.pop((a + s) % n)\n s = (a+s)%n\n n -= 1\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nc = [(i + 1) for i in range(n)]\r\n\r\ncur = 0\r\nfor i in range(k):\r\n cur = (cur + a[i]) % len(c)\r\n print(c[cur], end=' ')\r\n c = c[:cur] + c[cur+1:]\r\n# print(c, cur)\r\n# cur = (cur + 1) % len(c)\r\n \r\n", "import sys\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nnum = [i for i in range(1,n+1)]\r\nleader = 0\r\nfor i in range(k):\r\n if a[i] == n:\r\n pos = leader\r\n elif a[i] > n:\r\n a[i] = a[i] % n\r\n pos = leader + a[i]\r\n if leader + a[i] >= n:\r\n a[i] -= n-1-leader\r\n pos = a[i] - 1\r\n else:\r\n pos = leader + a[i]\r\n print(num[pos],'',end='')\r\n num.pop(pos)\r\n leader = pos\r\n n -= 1", "def main():\r\n n, k = map(int, input().split())\r\n a = map(int, input().split())\r\n\r\n kids = list(range(1, n + 1))\r\n i = 0\r\n\r\n for ai in a:\r\n i += ai\r\n i %= len(kids)\r\n print(kids[i], end=' ')\r\n del kids[i]\r\n\r\n\r\nif __name__ == '__main__':\r\n # import sys\r\n # sys.stdin = open(\"B.txt\")\r\n main()\r\n", "n, k = [int(x) for x in input().split(\" \")]\r\nsteps = [int(x) for x in input().split(\" \")]\r\n\r\nleader = 0\r\nchildren = [x for x in range(1, n + 1)]\r\nresult = []\r\nfor s in steps:\r\n next_index = (leader + s) % len(children)\r\n result.append(children[next_index])\r\n del children[next_index]\r\n leader = next_index\r\n\r\nprint(\" \".join(map(lambda x: str(x), result)))\r\n", "n,k=map(int,input().split())\r\na=[i for i in range(1,n+1)]\r\nmove=[int(i) for i in input().split()]\r\nfor m in move: \r\n #print(m)\r\n m%=len(a)\r\n print(a[m],end=' ')\r\n a=a[m+1:]+a[:m]", "#!/usr/bin/env python3\n\n[n, k] = map(int, input().strip().split())\nais = list(map(int, input().strip().split()))\n\ncur = 0\nch = list(range(1, n + 1))\nl = []\nfor a in ais:\n\tcur += a\n\tcur %= len(ch)\n\tl.append(ch[cur])\n\tdel ch[cur]\n\nprint (' '.join(map(str, l)))\n", "#import sys\r\n#sys.stdin = open('in', 'r')\r\n#n = int(input())\r\n#a = [int(x) for x in input().split()]\r\nn,k = map(int, input().split())\r\ncs = [i + 1 for i in range(n)]\r\nrem = 0\r\nfor v in map(int, input().split()):\r\n rem = (rem + v) % len(cs)\r\n print(cs[rem], end=' ')\r\n cs.remove(cs[rem])\r\n \r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, k] = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\np = [i+1 for i in range(n)]\r\nleader = 0\r\nres = []\r\nfor i in range(k):\r\n leader = (leader+a[i])%n\r\n res.append(p.pop(leader))\r\n n = len(p)\r\n if leader == n:\r\n leader = 0\r\nprint(' '.join(map(str, res)))", "import sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\n\nn,k=I()\nx=I()\nl=[i+1 for i in range(n)]\nan=[];cur=0\nfor i in range(k):\n\tcr=(cur+x[i])%n\n\tan.append(l[cr])\n\tdel l[cr]\n\tn-=1\n\tcur=cr\n\t#print(l,cur)\nprint(*an)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nj=0\r\nL=list(range(1,n+1))\r\nfor i in l:\r\n k-=1\r\n j=(j+i)%n\r\n if k!=0:\r\n print(L[j],end=' ')\r\n else :print (L[j],end='')\r\n n-=1\r\n \r\n L.pop(j)\r\n", "import sys\nfoo = [int(x) for x in sys.stdin.readline().strip().split(\" \")]\n#print(foo)\nn, k = foo\n\ninp = [int(x) for x in sys.stdin.readline().strip().split(\" \")]\n\npeople = [x for x in range(0, n)]\nleader = 0\n\nfor a in inp:\n removed_idx = (leader + a) % len(people)\n print(people[removed_idx] + 1)\n del people[removed_idx]\n leader = removed_idx\n\n \t \t \t \t \t \t\t \t \t \t \t\t\t\t", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [i+1 for i in range(n)]\r\nl = n\r\nans = []\r\nind = 0\r\nx = 0\r\nfor i in range(k):\r\n\tind = ind + a[i]%l\r\n\tif ind >= l:\r\n\t\tind -= l\r\n\tans.append(b.pop(ind))\r\n\tl -= 1\r\nprint (*ans)", "n, k =map(int, input().split())\r\nk = list(map(int , input().split()))\r\nl, ans = [], []\r\nfor i in range(n):\r\n l.append(i)\r\nleader=0\r\nfor i in k:\r\n ans.append( l[((leader+i)%(len(l)))] +1)\r\n leader = ((leader+i)%(len(l)));\r\n l.remove(ans[-1]-1)\r\n leader = leader%len(l)\r\n\r\nprint(*ans, sep=\" \")\r\n\r\n", "n, k = [int(x) for x in input().split(' ')]\nsteps = [int(x) for x in input().split(' ')]\nsteps.reverse() # to use list.pop()\ncircle = list(range(n))\n\n\ndef next_index(i, step, circle):\n length = len(circle)\n return (i + step) % length\n\n\nindex = 0\nfor i in range(len(steps)):\n # print(index, steps, circle)\n index = next_index(index, steps.pop(), circle)\n print(circle[index] + 1, end=' ')\n del circle[index]\n", "n, k=map(int, input().split())\r\na=[x+1 for x in range(n)]\r\nfor m in map(int, input().split()):\r\n\tm%=len(a)\r\n\tprint(a[m], end=\" \")\r\n\ta=a[m+1:]+a[:m]\r\nprint()", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n\n\ndef main():\n n,k = LI()\n ka = list(range(n))\n a = LI()\n r = []\n l = 0\n for _ in range(k):\n t = a[_]\n al = len(ka)\n b = (l+t)%al\n r.append(ka[b]+1)\n ka = ka[:b] + ka[b+1:]\n l = b\n\n return ' '.join(map(str, r))\n\n\nprint(main())\n", "##n children are standing in a circle and playing the counting-out game.\r\n##Children are numbered clockwise from 1 to n. In the beginning,\r\n##the first child is considered the leader. The game is played in k steps.\r\n##In the i-th step the leader counts out ai people in clockwise order,\r\n##starting from the next person. The last one to be pointed at by the\r\n##leader is eliminated, and the next player after him becomes the new leader.\r\n##\r\n##For example, if there are children with numbers [8, 10, 13, 14, 16]\r\n##currently in the circle, the leader is child 13 and ai = 12, then counting-out\r\n##rhyme ends on child 16, who is eliminated. Child 8 becomes the leader.\r\n##\r\n##You have to write a program which prints the number of the child to be\r\n##eliminated on every step.\r\n##\r\n##Input\r\n##The first line contains two integer numbers n and k (2 ≤ n ≤ 100, 1 ≤ k ≤ n - 1).\r\n##\r\n##The next line contains k integer numbers a1, a2, ..., ak (1 ≤ ai ≤ 109).\r\n##\r\n##Output\r\n##Print k numbers, the i-th one corresponds to the number of child to be\r\n##eliminated at the i-th step.\r\n##input\r\n##7 5\r\n##10 4 11 4 1\r\n##output\r\n##4 2 5 6 1 \r\nn, k = map( int, input().split() )\r\na = list( map(int, input().split() ) )\r\n\r\nx = [0] * n\r\ny = \"\"\r\nfor i in range(n):\r\n x[i] = i+1\r\n\r\nc = 0\r\nfor j in range(len(a)):\r\n a[j] = (a[j]+c) % (n-j)\r\n y += str(x[a[j]]) + \" \"\r\n del x[a[j]]\r\n c = a[j]\r\nprint( y)\r\n\r\n", "import math\r\nimport queue\r\n\r\nn, k=map(int,input().split())\r\n\r\ns=[]\r\na=[int(cost) for cost in input().split()]\r\n\r\n \r\nfor i in range(1,n+1):\r\n s.append(i)\r\n \r\nfor i in range(0,k):\r\n b=a[i]%n\r\n \r\n print(s[b],\"\",end='')\r\n \r\n temp_arr=[]\r\n for i in range(b+1,n):\r\n temp_arr.append(s[i])\r\n \r\n for i in range(0,b):\r\n temp_arr.append(s[i])\r\n \r\n s=temp_arr\r\n \r\n \r\n n-=1\r\n \r\n \r\n \r\n \r\n ", "def solve():\r\n n, k = [int(x) for x in input().split(' ')]\r\n a = [int(x) for x in input().split(' ')]\r\n curr = [i for i in range(n)]\r\n i = 0\r\n j = 0\r\n ans = []\r\n for c in range(k):\r\n i = (i + a[j]) % n\r\n ans.append(curr[i] + 1)\r\n del curr[i]\r\n n -= 1\r\n i = i % n\r\n j += 1\r\n return ans\r\n\r\nprint(*solve())", "a,b=map(int,input().split())\r\nz=[*range(1,a+1)];p=0\r\nc=list(map(int,input().split()))\r\nfor i in range(b,0,-1):p=(p+c.pop(0))%a;print(z.pop(p));a-=1", "n, k = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nai2 = list(range(1,n+1))\r\nnum = 0\r\nfor i in range(k):\r\n num = num + ai[i]\r\n num %= n\r\n print(ai2[num],end=\" \")\r\n n -= 1\r\n ai2.remove(ai2[num])\r\n", "from collections import deque\n\n\ndef rhymes(n,a):\n children = deque(range(1,n+1))\n result = []\n for step in a:\n children.rotate(-step)\n result.append(children.popleft())\n return result\n\ndef main():\n n, k = map(int, input().strip().split())\n a = tuple(map(int, input().strip().split()))\n result = rhymes(n,a)\n print(*result)\n\nif __name__ == '__main__':\n main()", "import sys\r\nrln=sys.stdin.buffer.readline\r\nrl=lambda:rln().rstrip(b'\\r\\n').rstrip(b'\\n')\r\nri=lambda:int(rln())\r\nrif=lambda:[*map(int,rln().split())]\r\nrt=lambda:rl().decode()\r\nrtf=lambda:rln().decode().split()\r\ninf=float('inf')\r\ndir4=[(-1,0),(0,1),(1,0),(0,-1)]\r\ndir8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\nYES,NO,Yes,No,yes,no='YES','NO','Yes','No','yes','no'\r\n\r\nn,k=rif()\r\na=rif()\r\nans=[]\r\nc=[*range(1,n+1)]\r\ni=0\r\nfor x in a:\r\n i=(i+x)%len(c)\r\n ans.append(c.pop(i))\r\n i%=len(c)\r\n\r\nprint(*ans)\r\n", "def solution(n, nums):\n lis = [x for x in range(n)]\n pivot = 0\n for a in nums:\n steps = a%len(lis)\n borr = (pivot + steps) % len(lis)\n print(lis[borr] +1 , end = \" \")\n del lis[borr]\n pivot = borr\n\n\ndef main():\n n, k = [int(x) for x in input().split()]\n a = [int(x) for x in input().split()]\n solution(n, a)\n\nmain()\n", "def findout(A,x):\r\n ans=A[x%len(A)]\r\n new_A=A[x%len(A)+1:]+A[:x%len(A)]\r\n return new_A,ans\r\nAns=[]\r\nn,k=list(map(int,input().strip().split(' ')))\r\nchange=list(map(int,input().strip().split(' ')))\r\nA=[i+1 for i in range(n)]\r\nfor x in change:\r\n A,ans=findout(A,x)\r\n Ans+=[ans]\r\nAns=[str(x) for x in Ans]\r\nprint(\" \".join(Ans))", "import sys\r\ninput = sys.stdin.readline\r\ndef solve():\r\n n , k = map(int, input().split())\r\n ls = list(map(int, input().split()))\r\n ll = list(range( 1 , n + 1))\r\n lead = 0\r\n j = 0 \r\n while k : \r\n x = (lead + 1 + ls[j])%len(ll)\r\n lead = x - 1 \r\n if lead == -1 : \r\n lead = 0 \r\n print(ll[x-1] , end = \" \")\r\n ll.remove(ll[x-1]) \r\n j += 1 \r\n k -= 1\r\n#for _ in range(int(input())):\r\nsolve()", "#!/usr/bin/python3\nimport sys\n\nn, k = map(int, sys.stdin.readline().split())\na = [int(x) for x in sys.stdin.readline().split()]\n\nl = [i for i in range(1, n + 1)]\np = 0\n\nret = []\n\nfor d in a:\n p += d\n p %= len(l)\n ret.append(l[p])\n del l[p]\n \nprint(' '.join(str(x) for x in ret))\n", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nkids = list(range(1, n+1))\r\nnext = 0\r\nres = []\r\n\r\nfor a in A:\r\n n = len(kids)\r\n lose = (next + a) % n\r\n next = lose % n\r\n res.append(kids.pop(lose))\r\n\r\nprint(*res)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nchildren = [i for i in range(n)]\r\nleader = 0\r\noutput = []\r\nfor i in range(k):\r\n del_pointer = (leader + a[i]) % len(children)\r\n output.append(children.pop(del_pointer) + 1)\r\n leader = del_pointer\r\nprint(*output)\r\n\r\n\r\n", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\nsys.setrecursionlimit(1000000)\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = [i for i in range(n)]\r\nindx = 0\r\n\r\nfor i in range(k):\r\n indx = (indx + a[i])%(n-i)\r\n print(c.pop(indx)+1, end=\" \")", "n, k = map(int, input().split())\r\n*a, = map(int, input().split())\r\nans = []\r\npeo = list(range(1, n+1))\r\n\r\ncur = 0\r\nfor i in range(k):\r\n dind = (cur+a[i])%len(peo)\r\n cur = dind\r\n ans.append(peo.pop(dind))\r\n cur %= len(peo)\r\n dind %= len(peo)\r\nprint(*ans)\r\n", "n, k = map(int, input().split())\n\nks = list(map(int, input().split()))\n\nc = [(i + 1) for i in range(n)]\n\nind = 0\n\nfor i in range(k):\n\t#print('c now', c)\n\td = (ind + ks[i]) % len(c)\n\tind = d\n\t#print('del', c[d])#, end = ' ')\n\tprint(c[d], end = ' ')\n\tdel c[d]\nprint()\n", "from copy import deepcopy as dcopy\r\ndef main():\r\n n, k = map(int, input().split())\r\n ks = list(map(int, input().split()))\r\n\r\n children = list(range(n))\r\n leader_i = 0\r\n res = []\r\n for k in ks:\r\n elim_i = (leader_i + k) % len(children)\r\n elim_num = dcopy(children[elim_i])\r\n nextl_i = (leader_i + k + 1) % len(children)\r\n nextl_num = dcopy(children[nextl_i])\r\n res.append(children.pop(elim_i)+1)\r\n leader_i = children.index(nextl_num)\r\n\r\n print(' '.join(map(str,res)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def find_eliminatee(l, offset):\r\n c = l\r\n for _ in range(offset):\r\n c = next(c)\r\n return c\r\n\r\ndef next(c):\r\n t = (c+1) % len(es)\r\n while es[t]:\r\n t = (t+1) % len(es)\r\n return t\r\n\r\nn,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nl = 0\r\nes = [False]*n\r\nfor i in range(k):\r\n e = find_eliminatee(l ,(a[i] % n))\r\n es[e] = True\r\n n -= 1\r\n l = next(e)\r\n #print (\"state\", e+1, n, l+1)\r\n print(e+1, end=' ')\r\n\r\n\r\n", "\r\ndef solve():\r\n children = list(range(1, list(map(int, input().split()))[0] + 1))\r\n del_i = 0\r\n for a_i in map(int, input().split()):\r\n del_i = (del_i + a_i) % len(children)\r\n print(children.pop(del_i), end=' ')\r\n\r\n\r\nsolve()\r\n", "n,k=[int(f)for f in input().split()]\na=list(range(1,n+1))\nl=0\nfor x in input().split():\n e=(l+int(x))%len(a)\n print(a[e],end=' ')\n a.pop(e)\n l=e\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\na = list(range(1, n+1))\r\nd = []\r\nx = n\r\nq = 0\r\nfor i in w:\r\n c = i\r\n q = (q+c)%x\r\n d.append(a[q])\r\n a.pop(q)\r\n x -= 1\r\n k -= 1\r\n if k == 0:\r\n break\r\nprint(' '.join(map(str, d)))\r\n", "from math import *\nn, k = map(int, input().split())\nq = [int(i) for i in input().split()]\nv = [i for i in range(n)]\n\nx = 0\nfor i in range(k):\n # print(v)\n x = (x + q[i]) % len(v)\n print(v[x] + 1, end=\" \")\n v.pop(x)\nprint()\n", "n,k=[int(i) for i in input().split()]\r\npassos=[int(i) for i in input().split()]\r\ncri=[]\r\nfor i in range(n):\r\n cri.append(i+1)\r\n\r\nini=0\r\nfor p in passos:\r\n ini+=p\r\n ini%=len(cri)\r\n print(cri[ini],end =\" \")\r\n cri.pop(ini)\r\nprint()", "from collections import deque\nfrom sys import stdin\nlines = deque(line.strip() for line in stdin.readlines())\n\ndef nextline():\n return lines.popleft()\n\ndef types(cast):\n return list(int(x) for x in nextline().split())\n\ndef ints():\n return types(int)\n\ndef strs():\n return nextline().split()\n\ndef main():\n # lines will now contain all of the input's lines in a list\n n, k = ints()\n nums = ints()\n cur = 0\n kids = list(range(1, n+1))\n elims = [0]*k\n for i in range(k):\n elim = (cur + nums[i]) % len(kids)\n elims[i] = kids[elim]\n del kids[elim]\n if kids:\n cur = elim % len(kids)\n print(' '.join(map(str, elims)))\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int, input().split())\r\ns = 0\r\n\r\na = list(range(n))\r\nfor i in map(int, input().split()):\r\n s = (s + i) % len(a)\r\n print(1 + a.pop(s), end=\" \")# 1692136650.3996363", "n, k = map(int, input().split())\r\ns, a, v, c = list(range(1, n + 1)), list(map(int, input().split())), [], 0\r\nfor i in range(k):\r\n c = (c + a[i]) % len(s)\r\n v.append(str(s.pop(c)))\r\nprint(' '.join(v))", "n,k = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\nl=[]\r\nfor i in range(1,n+1):\r\n l.append(i)\r\ni2=1\r\nfor i in range(1,k+1):\r\n k1=(lst[i-1]+i2)%(n-i+1)\r\n print(l[k1-1],end=\" \")\r\n ind=l.index(l[k1-1])\r\n if l[ind]==l[-1]:\r\n i2=1\r\n else:\r\n i2=k1\r\n \r\n del l[ind]\r\n \r\n ", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nlst = list(range(1,n+1))\r\nleader = 0\r\nfor step in range(k):\r\n\tindex = (leader+(a[step]%n))%n\r\n\tans=lst[index]\r\n\tprint(ans,end =\" \")\r\n\tlst.remove(ans)\r\n\tn-=1\r\n\tleader=index\r\n", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nc = list(range(1, n + 1))\r\nved = 0\r\nfor i in a:\r\n n = i % len(c)\r\n ved = ved + n\r\n if (ved >= len(c)):\r\n ved -= len(c)\r\n print(c[ved], end=\" \")\r\n c.pop(ved)\r\n \r\n \r\n \r\n \r\n", "n,k1 = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\ncircle = [i+1 for i in range(n)]\r\ni = 0\r\nk = 0\r\nwhile(len(circle) > n-k1):\r\n l = len(circle)\r\n x = (k+ arr[i]%l)%l\r\n print(circle.pop(x) , end = ' ')\r\n k = x\r\n i += 1\r\n", "n, k = map(int, input().split())\r\na = map(int, input().split())\r\nb = list(range(1, n + 1))\r\n\r\np = 0\r\nfor i in range(k):\r\n d = next(a) % len(b)\r\n for j in range(d):\r\n p = (p + 1) % len(b)\r\n print(b[p], end=' ')\r\n b.pop(p)\r\n p %= len(b)\r\n", "n, k = map(int, input().split()) # n детей, k шагов\r\nlst = []\r\nfor i in range(n):\r\n lst.append(i + 1)\r\nklst = list(map(int, input().split()))\r\nindex = 0\r\nfor i in range(k):\r\n index = (index + klst[i]) % len(lst)\r\n print(lst.pop(index), end=' ')", "n,k = map(int,input().split())\r\ns = [int(i) for i in input().split()]\r\na = [i for i in range(1,n+1)]\r\nr = 0\r\nj = 0\r\nd = []\r\n\r\n\r\nfor i in range(k):\r\n\tif j==len(a):\r\n\t\tj=0\r\n\tfor _ in range(s[i]%len(a)):\r\n\t\tif j>=len(a)-1:\r\n\t\t\tj=0\r\n\t\telse:\r\n\t\t\tj+=1\r\n\r\n\td.append(a.pop(j))\r\nprint(*d)\r\n\t\r\n\r\n", "n,k=map(int,input().split())\r\nls=list(map(int,input().split()))\r\nlz=list(range(1,n+1))\r\ny=0\r\nfor i in range(k):\r\n x=ls[i]\r\n y=(y+x)%len(lz)\r\n print(lz.pop(y),end=\" \")", "n, k = map(int, input().split())\nkids = [i + 1 for i in range(n)]\na = [int(x) for x in input().split()]\nlead = 0\nfor i in range(k):\n x = (a[i] + lead) % len(kids)\n lead = x\n if lead == len(kids) - 1:\n lead = 0\n print(kids.pop(x), end=' ')", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nlead = 0\r\nlst = []\r\nfor i in range(1, n + 1):\r\n lst.append(i)\r\nfor i in range(k):\r\n ind = (lead + a[i])%len(lst)\r\n print(lst[ind], end=\" \")\r\n lead = ind\r\n lst[ind] = -1\r\n llst = []\r\n for j in range(len(lst)):\r\n if lst[j] != -1:llst.append(lst[j])\r\n lst = list(llst)", "n, k = map(int, input().split())\nlst = list(map(int, input().split()))\n# n, k = 7, 5\n# lst = [10, 4, 11, 4, 1]\nchildren = [i for i in range(1,n+1)]\noutput = []\nfront = 0\nfor i,a in enumerate(lst):\n elim = (a+front) % (n-i)\n child = children[elim]\n front = children.index(child)\n children.remove(child)\n print(child,end=' ')\nprint()", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nrem=[1]*n\r\ntmp=0\r\nans=[]\r\nfor i in range(k):\r\n for _ in range(a[i]%(n-i)):\r\n tmp+=1\r\n tmp%=n\r\n while rem[tmp]==0:\r\n tmp+=1\r\n tmp%=n\r\n ans.append(tmp+1)\r\n rem[tmp]=0\r\n while rem[tmp]==0:\r\n tmp+=1\r\n tmp%=n\r\nprint(*ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\npos = 0\r\nd = []\r\nm = n\r\nR = list(range(0, n))\r\nfor i in range(k):\r\n s = a[i] % (n - i)\r\n pos = pos + s\r\n if pos >= (n - i):\r\n pos -= n - i\r\n d.append(R[pos] + 1)\r\n R.remove(R[pos])\r\n if pos >= (n - i):\r\n pos -= n - i\r\n\r\nprint(*d)", "n, k = map(int, input().split())\r\nt = list(range(n))\r\ni = 0\r\nfor ai in map(int, input().split()):\r\n i = (i + ai) % len(t)\r\n print(t[i] + 1, end = ' ')\r\n t = t[: i] + t[i + 1:]\r\n i = i % len(t)", "n,k=map(int,input().split())\r\nl=[i for i in range(n)]\r\nleader=0\r\nK=list(map(int,input().split()))\r\nfor i in K:\r\n leader+=i\r\n leader%=n\r\n print(l[leader]+1,end=\" \")\r\n del l[leader]\r\n n-=1\r\n leader%=n", "i = 0\r\n\r\n\r\ndef someFunc():\r\n global i\r\n i += 1\r\n return i\r\n\r\n\r\nclass Human:\r\n def __init__(self, value, kum):\r\n self.value = value\r\n self.kum = kum\r\n\r\n\r\nn, k = map(int, input().split())\r\naa = list(map(int, input().split()))\r\na = list(range(1, n + 1))\r\nfor i in aa:\r\n y = i % len(a)\r\n print(a[y],end=' ')\r\n a = a[y + 1::] + a[0:y:]\r\n\r\n", "num_children, num_steps = list(map(int, input().split(' ')))\ncounts_at_each_step = list(map(int, input().split(' ')))\n\ndef next_index_in_list(list_, index):\n if index == len(list_) - 1:\n return 0\n return index + 1\n\ndef prev_index_in_list(list_, index):\n if index == 0:\n return len(list_) - 1\n return index - 1\n\ndef update_current_leader_index(current_leader_index, eliminate_index, list_):\n if current_leader_index > eliminate_index:\n return prev_index_in_list(list_, current_leader_index)\n else:\n return current_leader_index\n\nchildren = list(range(1, num_children+1))\ncurrent_leader_index = 0\nelimination_sequence = []\nfor count_at_step in counts_at_each_step:\n eliminate_index = (count_at_step + current_leader_index) % len(children)\n elimination_sequence.append(children[eliminate_index])\n current_leader_index = next_index_in_list(children, eliminate_index)\n del(children[eliminate_index])\n current_leader_index = update_current_leader_index(current_leader_index, eliminate_index, children)\n\nprint (' '.join(map(str, elimination_sequence)))\n", "n, k = map(int, input().strip().split(\" \"))\narr = list(map(int, input().strip().split()))\nchildren = list([i + 1 for i in range(n)])\nanswer = []\ni = 0\nfor ai in arr:\n i = (i + ai) % n\n answer.append(str(children[i]))\n del children[i]\n n -= 1\n\nprint(\" \".join(answer))", "n, k = map(int, input().split())\r\na = list(range(n))\r\nans = []\r\ni = 0\r\nfor c in map(int, input().split()):\r\n i = (i + c) % len(a)\r\n ans.append(a[i] + 1)\r\n a.pop(i)\r\nprint(*ans)", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(n):\r\n\tb.append(i+1)\r\nptr = 1\r\n\r\nfor i in range(k):\r\n\ttemp = (ptr + a[i])%n\r\n\tprint(b[temp-1],end=\" \")\r\n\tb.pop(temp-1)\r\n\tptr = temp\r\n\tif(temp == 0):\r\n\t\tptr = 1\r\n\tn-=1\r\n\t", "n, _=map(int, input().split())\r\na=[i+1 for i in range(n)]\r\nfor m in map(int, input().split()):\r\n m%=len(a)\r\n print(a[m], end=' ')\r\n a=a[m+1:]+a[:m]", "#Let's go\nimport sys\nimport math\nimport random\n\nsys.setrecursionlimit(100000)\n\nn, k = map(int, input().split())\nar=[i+1 for i in range(n)]\n\nfor m in map(int, input().split()):\n m%=len(ar)\n print(ar[m], end=\" \")\n ar=ar[m+1:] + ar[:m]\n \t\t \t\t\t\t\t\t \t\t\t \t\t \t\t\t \t\t\t\t \t", "n, k = map(int, input().split())\n\na = [int(i) for i in input().split()]\nv = [int(i) for i in range(n)]\n# print(v)\ni = 0\ncont = 0\ntam = n\neli = []\nwhile cont < k:\n i = ((i+a[cont])%tam)\n eli.append(v[i]+1)\n v.pop(i)\n # print(i)\n # print(v)\n cont += 1\n tam -= 1\n # i += 1\n # print(i)\n # print()\n\nfor i in range(k):\n if i != k-1 :\n print(eli[i], end=' ')\n else:\n print(eli[i], end='')\nprint()\n", "x,y=map(int,input().split())\narr1=[]\narr3=[]\narr=list(map(int,input().split()))\nl=1\narr1=[0]*x\nfor i in range(0,x):\n arr1[i]=i+1\nfor i in range(0,len(arr)):\n x1=(arr[i]+l)%x\n if x1==0:\n x1=x\n arr3.append(arr1[x1-1])\n del arr1[x1-1]\n x-=1\n l=x1\nfor i in range(0,len(arr3)):\n print(arr3[i],end=\" \")\n\n# print(arr3)\n\n", "n, k = map(int, input().strip().split())\r\na = list(map(int, input().strip().split()))\r\n\r\nch = list(range(1, n + 1))\r\n\r\ncurr = 0\r\nout = []\r\n\r\nfor i in range(k):\r\n curr = (curr + a[i]) % len(ch)\r\n\r\n out.append(ch.pop(curr))\r\n\r\n if curr == len(ch):\r\n curr = 0\r\n\r\nprint(' '.join(map(str, out)))\r\n", "n, k = map(int, input().split())\r\nB = list(map(int, input().split()))\r\nA = [i for i in range(1, n + 1)]\r\nx = 0\r\nfor i in range(k):\r\n x = (x + B[i]) % len(A)\r\n print(A.pop(x), end = \" \")\r\n\r\n \r\n", "n, k = map(int, input().split())\na = [int(x) for x in input().split()]\n\nld = 0\nppl = list(range(1, n+1))\n\nfor rd in range(k):\n ld = (ld + a[rd]) % len(ppl)\n print(ppl[ld], end=' ')\n ppl = ppl[:ld] + ppl[ld+1:]\nprint()\n", "n,k=map(int,input().split())\r\nlist_k=list(map(int,input().split()))\r\n\r\nlist_child=[None]*n\r\nfor i in range(n):\r\n\tlist_child[i]=i\r\n\r\ncount_from=1\r\nfor i in range(k):\r\n\teliminate=(list_k[i]+count_from-1)%len(list_child)\r\n\tprint(list_child.pop(eliminate)+1,end=\" \")\r\n\r\n\tcount_from=(eliminate+2)%len(list_child)\r\n\tcount_from-=1", "n,k = map(int, input().split()) \r\na = list(map(int, input().split()))\r\nL = [ i for i in range(1,n+1) ]\r\n\r\nldr = 0\r\nfor x in a:\r\n ldr = (ldr + x)% len(L)\r\n print(L[ldr], end = ' ')\r\n L.pop(ldr)\r\n ", "n,k=map(int,input().split())\r\na=[i+1 for i in range(n)]\r\nfor m in map(int,input().split()):\r\n m%=len(a)\r\n print(a[m],end=\" \")\r\n a=a[m+1:]+a[:m]", "l=input().split()\r\nn=int(l[0])\r\nk=int(l[1])\r\ndone=[0 for i in range(n)]\r\ncount=0\r\nposn=0\r\nl=input().split()\r\nli=[int(i) for i in l]\r\nl=[]\r\nfor i in range(n):\r\n l.append(i)\r\nfor i in range(k):\r\n posn+=1\r\n posn%=len(l)\r\n li[i]-=1\r\n posn=posn+(li[i]%(len(l)))\r\n posn%=len(l)\r\n done[l[posn]]=1\r\n print(l[posn]+1,end=\" \")\r\n if(posn==len(l)-1):\r\n posn=0\r\n l.pop(-1)\r\n else:\r\n l.pop(posn)\r\n", "n, k = map(int, input().split())\nchildren = list(range(1, n + 1))\n\nleader = 0\nanswer = list()\n\nfor a in map(int, input().split()):\n leader = (leader + a) % len(children)\n answer.append(children[leader])\n del children[leader]\n\nprint(*answer)\n", "import sys\r\n\r\nI=sys.stdin.readline\r\n\r\nn,k=map(int,input().split())\r\n\r\narr=list(map(int,input().split()))\r\n\r\nc=list(range(n))\r\nans=[]\r\ns=0\r\nfor i in arr:\r\n\ts=(s+i)%len(c)\r\n\tans.append(1+c.pop(s))\r\n\t\r\n\r\nprint(*ans)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[i+1 for i in range(n)]\r\nl=1\r\nfor i in range(k):\r\n for j in range(len(b)):\r\n if b[j]==l:\r\n break \r\n r=len(b)-j-1\r\n l=j+1\r\n t=a[i]%(l+r)\r\n if t<=r and t!=0:\r\n t=j+t\r\n elif t>r:\r\n t=(t-r)-1\r\n else:\r\n t=j\r\n if t==len(b)-1:\r\n print(b[t],end=' ')\r\n del b[t]\r\n l=b[0]\r\n else:\r\n print(b[t],end=' ')\r\n del b[t]\r\n l=b[t]\r\n \r\n \r\n ", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nleaderidx=0\r\nchildren=[i for i in range(1,n+1)]\r\nans=[]\r\nfor i in range(k):\r\n mov=a[i]%len(children)\r\n leaderidx=(leaderidx+mov)%len(children)\r\n ans.append(str(children[leaderidx]))\r\n del(children[leaderidx])\r\nprint(\" \".join(ans))\r\n\r\n", "import sys\nLI=lambda:list(map(int, sys.stdin.readline().split()))\nMI=lambda:map(int, sys.stdin.readline().split())\nSI=lambda:sys.stdin.readline().strip('\\n')\nII=lambda:int(sys.stdin.readline())\n\nn, k=MI()\ninp=[i for i in range(1, n+1)]\nl=0\nout=[]\nfor a in LI():\n\te=(l+a)%len(inp)\n\tout.append(inp[e])\n\tl=e\n\tinp.pop(e)\nprint(*out)", "a=list(map(int, input().split()))\r\nn=a[0]\r\nk=a[1]\r\nb=list(map(int, input().split()))\r\nl=[0]*n\r\nfor i in range(n):\r\n l[i]=i+1\r\nans=[]\r\nfor i in range(k):\r\n c=b[i]\r\n g=len(l)\r\n j=c%g\r\n ans.append(l[j])\r\n l.pop(j)\r\n l=l[j:]+l[:j]\r\nprint(*ans)", "n,k = map(int,input().split())\r\na = list(range(1,n+1))\r\nleader = 0\r\nfor i in input().split():\r\n e = (leader+int(i))%len(a)\r\n print(a[e],end=' ')\r\n a.pop(e)\r\n leader = e", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nstart=0\r\nl=list(range(1,n+1))\r\nres=[]\r\nfor i in range(k):\r\n el=arr[i]\r\n el%=len(l)\r\n ind=(start+el)%len(l)\r\n start=(ind)%(len(l)-1)\r\n res.append(l.pop(ind))\r\nprint(*res)\r\n ", "n, k = map(int, input().split())\na = map(int, input().split())\n\ncs = list(range(1, n+1))\nl = 0\nres = \"\"\nlen = n\n\nfor x in a:\n pos = (l + x) % len\n #print(cs, pos)\n res += str(cs[pos]) + \" \"\n del cs[pos]\n len -= 1\n l = pos\n\nprint(res)", "def geti():\r\n return map(int, input().split())\r\n\r\nn, k = geti()\r\na = list(geti())\r\nxk = [i+1 for i in range(n)]\r\n\r\nt = 1\r\nb = []\r\nx = 0\r\n\r\nfor i in range(k):\r\n\r\n x = ((x + a[i]) % len(xk))\r\n b.append(xk[x])\r\n xk.remove(xk[x])\r\n\r\n\r\nfor i in b:\r\n print(i,end=' ')\r\n", "n_children, steps = map(int, input().strip().split())\r\nnumbers = list(map(int, input().strip().split()))\r\n\r\nchildren = list(range(0, n_children))\r\n\r\nleader = 0\r\n#print('leader = 0')\r\n#print(children)\r\n#print(numbers)\r\nfor step in range(0, steps):\r\n eliminated = (leader + numbers[step]) % len(children)\r\n print(children[eliminated] + 1, end = ' ')\r\n del children[eliminated]\r\n leader = (eliminated) % len(children)\r\n #print('\\nkilled: {}, new leader: {}\\nchildren: {}'.format(eliminated ,leader, children))", "f = lambda: map(int, input().split())\r\nn, k = f()\r\ns = 0\r\nb = list(range(n))\r\nfor a in f():\r\n s = (s + a) % len(b)\r\n print(1 + b.pop(s))", "n , k = map(int, input().split())\narr = [i for i in range(1,n+1)]\narg_k = list(map(int, input().split()))\nv = 0\nfor i in arg_k:\n l = len(arr)\n d = (i + v) % l\n print(arr.pop(d))\n v = d % len(arr)\n #print(arr, v)\n", "n, k = map(int,input().split())\r\n\r\nchilds = [i for i in range(1, n +1)]\r\n\r\ndata = list(map(int,input().split()))\r\n\r\nlast_start = 0\r\ncount = n\r\n\r\nfor el in data:\r\n a = el % count\r\n print(childs.pop((last_start + a) % count), end = \" \")\r\n last_start = (last_start + a) % count\r\n count -= 1\r\n\r\n", "n, k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\ntemp=[]\r\nfor i in range(n):\r\n temp.append(i+1)\r\n\r\nx=0\r\ni=0\r\nmlist=[]\r\nwhile k!=0:\r\n y=l[i]%n\r\n z=x+y\r\n if z>n-1:\r\n w=z%n\r\n else:\r\n w=z\r\n \r\n mlist.append(temp[w])\r\n temp.pop(w)\r\n x=w \r\n i+=1\r\n n-=1\r\n k-=1\r\n\r\nprint(*mlist) \r\n\r\n\r\n ", "import sys\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nnum =[]\r\nfor i in range(n):\r\n num.append(i+1)\r\ncnt = pos = elliminate = 0\r\nres = []\r\nfor j in range(k):\r\n cnt = arr[j] % n\r\n\r\n if(elliminate + cnt < n):\r\n elliminate = elliminate+cnt\r\n else:\r\n\r\n elliminate = cnt - (n-1-elliminate)-1\r\n\r\n res.append(num[elliminate])\r\n num.pop(elliminate)\r\n n -= 1\r\n if(elliminate < n-1):\r\n leader = num[elliminate]\r\n else:\r\n leader = num[0]\r\nprint(*res,sep=' ')\r\n", "n, k = map(int,input().split())\na = list(map(int,input().split()))\nlead = 0\npeople = [i + 1 for i in range(n)]\nfor d in a:\n nex = (lead + d) % len(people)\n print(people[nex],end = ' ')\n del people[nex]\n nex %= n\n lead = nex\n", "n,k=[int(s) for s in input().split()]\r\na=[int(s) for s in input().split()]\r\nb=[i for i in range(1,n+1)]\r\nv=0\r\nrez=[]\r\nfor i in range(k):\r\n t=a[i]%len(b)\r\n v+=t\r\n v%=len(b)\r\n rez.append(b[v])\r\n del b[v]\r\nprint(' '.join([str(elem) for elem in rez]))", "n, k = map(int, (input().split()))\r\narr = list(map(int, input().split()))\r\n\r\nnums = list(range(1, n+1))\r\nleader = 0\r\nelims = []\r\nfor i in range(k):\r\n elim = (leader + arr[i]) % n\r\n elims.append(nums.pop(elim))\r\n n -= 1\r\n leader = elim\r\nprint(*elims)\r\n\r\n\r\n\r\n", "n, k = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nans = list(range(1, n + 1))\r\nbase = 0\r\nfor i in range(k):\r\n base = (l[i] + base) % len(ans)\r\n print(ans.pop(base))", "siz,qu = map(int,input().split())\r\nar,ind = [x for x in range(1,siz+1)],0\r\nfor k in map(int,input().split()):\r\n nx = (ind + k) % siz\r\n print(ar[nx])\r\n siz -= 1; ar.pop(nx); ind = nx", "def solution(n, nums):\r\n child = [x for x in range(1,n+1)]\r\n #result = []\r\n lead = 0\r\n for a in nums:\r\n steps = a%len(child)\r\n borr = (lead + steps) % len(child)\r\n #result.append(children[next_index])\r\n print(child[borr] , end = \" \")\r\n del child[borr]\r\n lead = borr\r\n\r\n\r\ndef main():\r\n n, k = [int(x) for x in input().split()]\r\n a = [int(x) for x in input().split()]\r\n solution(n, a)\r\n\r\nmain()", "n, _ = [int(i) for i in input().strip().split(' ')]\nak = [int(i) for i in input().strip().split(' ')]\n\n\npeople = list(range(1, n + 1))\ncurrent = 0\n\nleaved = []\n\nfor k in ak:\n pos = ((current + k) % len(people))\n leave = people.pop(pos)\n\n leaved.append(leave)\n\n if pos >= len(people):\n current = 0\n else:\n current = pos\n\nprint(\" \".join(map(str, leaved)))\n", "inp1 = input().split()\r\nn=int(inp1[0])\r\nk=int(inp1[1])\r\nkoh_lanta = list(range(1,n+1))\r\nliste_elimination = input().split()\r\nlead=0\r\neliminated = []\r\nfor i in range(k):\r\n lead = (lead + int(liste_elimination[i]))%(n-i)\r\n eliminated.append(koh_lanta.pop(int(lead)))\r\nprint(*eliminated)\r\n", "N, K = map(int, input().split())\nAs = map(int, input().split())\n\ncs = [c for c in range(1, N + 1)]\nans = []\nfor a in As:\n i = a % len(cs)\n ans.append(cs[i])\n cs = cs[i + 1:] + cs[:i]\n\nprint(' '.join(map(str, ans)))\n", "n, k = map(int, input().split())\r\n\r\nlst = [i for i in range(1,n+1)]\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nlead = 0;\r\n\r\nfor i in range(k):\r\n print(lst.pop((lead+arr[i])%n),end=\" \")\r\n lead = (lead+arr[i])%n\r\n n -= 1\r\n \r\n \r\n \r\n", "n, k = [int(x) for x in input().split(' ')]\r\nsteps = [int(x) for x in input().split(' ')]\r\ncircle = list(range(n))\r\n\r\n\r\ndef next_index(i, steps, circle):\r\n length = len(circle)\r\n return (i + steps[0]) % length\r\n\r\n\r\nindex = 0\r\nwhile len(steps) > 0:\r\n # print(index, steps, circle)\r\n index = next_index(index, steps, circle)\r\n print(circle[index] + 1, end=' ')\r\n del circle[index]\r\n del steps[0]\r\n", "ip = input().split(' ')\nn = ip[0]\nk = ip[1]\nip2 = input().split(' ')\na = list(map(int, ip2))\nchildren = []\nfor x in range(int(n)):\n children.append(x+1)\ntemp = 0\nfor y in a:\n print(children[((temp+y)%len(children))])\n temp = children.index(children[((temp+y)%len(children))])\n del(children[temp])\n \t \t \t\t\t\t \t\t \t \t\t \t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nchildren = [x for x in range(1,n+1)]\nl_index = 0\ni = 0\nout = []\nwhile i < k:\n pos = (a[i] % len(children)) + l_index\n elim = children[pos % len(children)]\n out.append(str(elim))\n i += 1\n l_index = pos % len(children)\n del children[pos%len(children)]\n\n \nprint(\" \".join(out))\n ", "# coding=utf-8\r\n__author__ = 'Alexander'\r\n\r\ns = input()\r\nn, k = tuple(map(int, s.split()))\r\n\r\ns = input()\r\na = list(map(int, s.split()))\r\n\r\nr = list(range(1, n+1))\r\n\r\nj = 0\r\n\r\nfor i in range(k):\r\n j = (j + a[i]) % n\r\n n -= 1\r\n print(r[j], end=' ')\r\n del r[j]\r\n", "n, k=map(int, input().split())\r\nl=input()\r\na=[int(i) for i in l.split()]\r\nm=list(range(1,n+1))\r\nl=\"\"\r\nb=0\r\nd=len(m)\r\nfor i in a:\r\n if m[(i+b)%d]==m[len(m)-1]:\r\n l+=\"{} \".format(m[(i+b)%d])\r\n m.remove(m[(i+b)%d])\r\n b=0\r\n else:\r\n l+=\"{} \".format(m[(i+b)%d])\r\n m.remove(m[(i+b)%d])\r\n b=m.index(m[(i+b)%d])\r\n d=len(m)\r\nprint(l)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nele=[(j+1) for j in range(n)]\r\nj=0\r\ne=[]\r\nfor i in range(k):\r\n j=(j+a[i])%len(ele)\r\n m=ele.pop(j)\r\n e.append(m)\r\nfor j in range(len(e)):\r\n print(e[j],end=\" \")\r\nprint(\"\") ", "\n\nn, k = map(int, input().split())\n\nA = [int(x) for x in input().split()]\n\ntab = list(range(1, n + 1))\n\nleader = 0\n\nresult = []\n\nfor x in A:\n leader = (leader + x) % len(tab)\n result += [tab[leader]]\n tab = tab[:leader] + tab[leader + 1:]\n leader = leader % len(tab)\n\nprint(' '.join(map(str, result)))\n", "\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nl = list(range(1, n + 1))\r\nans = []\r\nleader = 0\r\nfor i in range(k):\r\n\t\r\n\tnu = a[i] % len(l)\r\n\r\n\tpos = (leader + nu) % len(l)\r\n\r\n\tif pos == len(l) - 1:\r\n\t\tleader = 0\r\n\telse:\r\n\t\tleader = pos\r\n\r\n\tans.append(l.pop(pos))\r\n\r\n\r\nprint(*ans)\r\n", "def solve(n, a, k):\r\n leader = 0\r\n size = n\r\n p = list(range(1, n+1))\r\n res = []\r\n \r\n for i in range(0, k):\r\n j = (leader+a[i]) % size\r\n\r\n res.append(p[j])\r\n p.pop(j)\r\n\r\n size -= 1\r\n leader = j % size\r\n\r\n print(*res)\r\ndef main():\r\n n,k = map(int,input().split())\r\n a = [int(x) for x in input().split()]\r\n\r\n solve(n, a, k)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndeleted = []\r\nfor i in range(n):\r\n deleted.append(i)\r\nhost = 0\r\nfor i in range(k):\r\n j = (host + a[i]) % n\r\n print(deleted.pop(j) + 1, end=' ')\r\n if j == n - 1:\r\n host = 0\r\n else:\r\n host = j\r\n n -= 1\r\n" ]

[ "n = int(input())\r\nr = [False]*n\r\nl = [False]*n\r\n\r\n\r\nc = ''\r\nfor i in range(n*n):\r\n k, m= [int(i) for i in input().split()]\r\n if not r[k - 1] and not l[m - 1]:\r\n r[k - 1] = True\r\n l[m - 1] = True\r\n c += str(i + 1) + ' '\r\nprint(c)", "n = int(input())\r\n\r\nh = [False]*n\r\nv = [False]*n\r\n\r\nday_numbers = []\r\n\r\nfor day in range(1, n**2 + 1):\r\n hi, vi = [int(x)-1 for x in input().split()]\r\n if not h[hi] and not v[vi]:\r\n h[hi] = v[vi] = True\r\n day_numbers.append(day)\r\nprint(*day_numbers)", "n = int(input())\r\nG = []; V = []; res = []\r\nfor i in range(n*n):\r\n h,v = map(int, input().split())\r\n if G.count(h)==0 and V.count(v)==0:\r\n G.append(h)\r\n V.append(v)\r\n res.append(i+1)\r\nprint(*res)\r\n \r\n", "n=int(input())\r\nx,y=[],[]\r\nfor i in range(n*n):\r\n x1,y1=input().split()\r\n x2,y2=len(x),len(y)\r\n flag=0\r\n for j in range(x2):\r\n if(x1==x[j]):\r\n flag=1\r\n for j in range(y2):\r\n if(y1==y[j]):\r\n flag=1\r\n if(flag==0):\r\n x.append(x1)\r\n y.append(y1)\r\n print(i+1)\r\n", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(1, n*n+1):\r\n x, y = map(int, input().split())\r\n if x not in a and y not in b:\r\n print(i, end=' ')\r\n a.append(x)\r\n b.append(y)\r\n", "n=int(input())\nm1=[0 for i in range(n)]\nm2=[0 for i in range(n)]\nfor i in range(n*n):\n\ta,b=list(map(int,input().split()))\n\tif m1[a-1]==m2[b-1]==0:\n\t\tm1[a-1]=m2[b-1]=1\n\t\tprint(i+1,end=' ')", "# Bismillahir Rahmanir Rahim\r\n# @UTH0R :- A |-| |\\| A F\r\nfrom collections import Counter as CC\r\n\r\nn = int(input())\r\nans , h, v= [], [], []\r\nfor i in range(0, n**2):\r\n x, y = list(map(int, input().split()))\r\n if x not in h and y not in v:\r\n ans.append(i+1)\r\n h.append(x)\r\n v.append(y)\r\nprint(*ans)", "n=int(input())**2\r\nh=[1]*n;v=[1]*n;x=[]\r\nfor i in range(n):\r\n\tm,n=map(int,input().split())\r\n\tif h[m-1] and v[n-1]:\r\n\t\tx.append(i+1)\r\n\t\th[m-1]=0;v[n-1]=0\r\nprint(*x)", "n = int(input())\r\nh = [0] * n\r\nv = [0] * n\r\ng = []\r\nfor i in range(n * n):\r\n a, b = map(int, input().split())\r\n if h[a - 1] == 0 and v[b - 1] == 0:\r\n h[a - 1] = 1\r\n v[b - 1] = 1\r\n g.append(i+1)\r\nprint(*g)", "#!/usr/bin/python3\n\nclass StdReader:\n\tdef read_int(self):\n\t\treturn int(self.read_string())\n\n\tdef read_ints(self, sep=None):\n\t\treturn [int(i) for i in self.read_strings(sep)]\n\n\tdef read_float(self):\n\t\treturn float(self.read_string())\n\n\tdef read_floats(self, sep=None):\n\t\treturn [float(i) for i in self.read_strings(sep)]\n\n\tdef read_string(self):\n\t\treturn input()\n\n\tdef read_strings(self, sep=None):\n\t\treturn self.read_string().split(sep)\n\nreader = StdReader()\n\n\ndef main():\n\tn = reader.read_int()\n\n\th_done = [False]*n\n\tv_done = [False]*n\n\n\tfor i in range(n*n):\n\t\th, v = reader.read_ints()\n\t\th -= 1\n\t\tv -= 1\n\n\t\tif not h_done[h] and not v_done[v]:\n\t\t\tprint(i+1, end=' ')\n\n\t\t\th_done[h] = True\n\t\t\tv_done[v] = True\n\n\nif __name__ == '__main__':\n\tmain()\n", "n = int(input())\r\nres = []\r\nx = set()\r\ny = set()\r\nfor i in range(n*n):\r\n a,b = map(int,input().split())\r\n if not (a in x or b in y):\r\n x.add(a)\r\n y.add(b)\r\n res.append(i+1)\r\nprint(*res)", "n = int(input())\nxs = set(range(1, n + 1))\nys = set(range(1, n + 1))\nfor _ in range(1, n ** 2 + 1):\n x, y = map(int, input().split())\n if x in xs and y in ys:\n print(_)\n print(\"\")\n xs.discard(x)\n ys.discard(y)\n \t\t\t \t \t\t\t \t \t \t \t", "A = []\r\nB = []\r\nC = []\r\ns=0\r\nfor t in range(int(input())**2):\r\n a,b=list(map(int,input().split()))\r\n if a not in A and b not in B:\r\n A.append(a)\r\n B.append(b)\r\n C.append(str(t+1))\r\nprint(\" \".join(C))\r\n\r\n\r\n\r\n ", "def mp(): return map(int,input().split())\r\ndef lt(): return list(map(int,input().split()))\r\ndef pt(x): print(x)\r\ndef ip(): return input()\r\ndef it(): return int(input())\r\ndef sl(x): return [t for t in x]\r\ndef spl(x): return x.split()\r\ndef aj(liste, item): liste.append(item)\r\ndef bin(x): return \"{0:b}\".format(x)\r\ndef printlist(l): print(' '.join([str(x) for x in l]))\r\ndef listring(l): return ''.join([str(x) for x in l])\r\n\r\nn = it()\r\nalready1 = []\r\nalready2 = []\r\nalready = []\r\nfor i in range(n*n):\r\n m,p = mp()\r\n if not m in already1 and not p in already2:\r\n already1.append(m)\r\n already2.append(p)\r\n print(i+1)", "a,b={0},{0}\r\nfor i in range(int(input())**2):\r\n x,y=map(int,input().split())\r\n if x not in a and y not in b:a|={x};b|={y};print(i+1,end=' ')\r\n", "n = int(input())\r\nh = []\r\nv = []\r\nfor i in range(n*n):\r\n horizontal, vertical = map(int, input().split())\r\n if(horizontal not in h) and (vertical not in v):\r\n h.append(horizontal)\r\n v.append(vertical)\r\n print(i+1, end = ' ')", "def solve():\r\n\tn = int(input())\r\n\r\n\ths = [False]*51\r\n\tvs = [False]*51\r\n\r\n\tfor i in range(n*n):\r\n\t\tx,y = map(int,input().split())\r\n\t\tif not hs[x] and not vs[y]:\r\n\t\t\tprint(i+1)\r\n\t\t\ths[x] = True\r\n\t\t\tvs[y] = True\r\n\r\nsolve()", "n=int(input())\r\nsc=[]\r\nfor i in range(n**2):\r\n sc.append(list(map(int,input().split(' '))))\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n x.append(i+1)\r\n y.append(i+1)\r\nfor j in range(len(sc)):\r\n if sc[j][0] in x:\r\n if sc[j][1] in y:\r\n x.remove(sc[j][0])\r\n y.remove(sc[j][1])\r\n print(j+1)", "n=int(input())\r\na=set()\r\nb=set()\r\nx=n*n\r\nc=0\r\n\r\nfor i in range(x):\r\n h1,v1=map(int,input().split())\r\n \r\n if h1 in a or v1 in b:\r\n continue\r\n else:\r\n a.add(h1)\r\n \r\n b.add(v1)\r\n \r\n print(i+1,end=' ')", "words = \"\"\r\nn = int(input()); r = [0 for x in range(n)]; c = [0 for x in range(n)]\r\nfor i in range(n ** 2):\r\n a, b = map(int, input().split())\r\n if not r[a - 1] and not c[b - 1]:\r\n r[a - 1] = 1; c[b - 1] = 1\r\n words += str(i+1)+\" \"\r\nprint(words)\r\n", "n = int(input())\r\nxs = [0] * n\r\nys = [0] * n\r\ndays = []\r\nfor i in range(n**2):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n if xs[x] == 0 and ys[y] == 0:\r\n days.append(i + 1)\r\n xs[x] = 1\r\n ys[y] = 1\r\nprint(*days)", "n = int(input())\r\n\r\nmass = []\r\nmass.append([])\r\nmass.append([])\r\n\r\n\r\n\r\nans = '1 '\r\na1, a2 = map(int, input().split())\r\nmass[0].append(a1)\r\nmass[1].append(a2)\r\n\r\n\r\nfor i in range(2, n*n+1):\r\n a1, a2 = map(int, input().split())\r\n k = 0\r\n for j in range(len(mass[0])):\r\n if mass[0][j] == a1 or mass[1][j] == a2:\r\n k = 1\r\n if k == 0:\r\n mass[0].append(a1)\r\n mass[1].append(a2)\r\n ans = ans + str(i) + ' '\r\n \r\n\r\nprint(ans)\r\n", "import math\r\n\r\nn=int(input())\r\na=[0]*n\r\nb=[0]*n\r\narr=[]\r\n\r\nfor i in range(n**2):\r\n h,v=map(int,input().split())\r\n h-=1;v-=1\r\n if a[h]==0 and b[v]==0:\r\n a[h]=1;b[v]=1\r\n arr.append(i+1)\r\n \r\nfor i in range(len(arr)):\r\n print(arr[i],end=\" \")", "\"\"\"\nhttps://codeforces.com/problemset/problem/583/A\n\"\"\"\nn = int(input())\nlignes, colonnes = [False] * (n + 1), [False] * (n + 1)\nres = []\nfor day in range(1, n * n + 1):\n l, c = [int(x) for x in input().split()]\n if not lignes[l] and not colonnes[c]:\n res.append(day)\n lignes[l] = True\n colonnes[c] = True\nprint(*res)\n", "n = int(input())\r\n\r\npairs = [[int(i)-1 for i in input().split(' ')] for pair in range(n**2)]\r\n\r\nvert = [0 for i in range(n)]\r\nhori = [0 for i in range(n)]\r\n\r\ndays = []\r\n\r\nday=1\r\nfor pair in pairs:\r\n if vert[pair[0]]==1 or hori[pair[1]]==1:\r\n day+=1\r\n continue\r\n vert[pair[0]]=1\r\n hori[pair[1]]=1\r\n days.append(day)\r\n day+=1\r\n\r\nprint(' '.join([str(i) for i in days]))", "N = int(input())\r\n\r\nplan = list()\r\nfor i in range(N ** 2):\r\n plan.append([ int(i) for i in input().split()])\r\n\r\nver, her, progress = list(), list(), list()\r\nday = 1\r\nfor item in plan:\r\n if item[0] not in ver and item[1] not in her:\r\n progress.append(str(day))\r\n ver.append(item[0])\r\n her.append(item[1])\r\n day += 1\r\nprint(\" \".join(progress))", "n = int(input())\nh = [False for i in range(n)]\nv = [False for i in range(n)]\nz = []\nfor i in range(n*n):\n a,b = map(int, input().split())\n a -= 1\n b -= 1\n if (not h[a]) and (not v[b]):\n z.append(i+1)\n h[a] = True\n v[b] = True\nprint(*z)\n", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n * n):\r\n f, s = map(int, input().split())\r\n if not(f in a) and not(s in b):\r\n a.append(f)\r\n b.append(s)\r\n print(i + 1, end = ' ')", "n = int(input())\r\na = [False for _ in range(n)]\r\nb = [False for _ in range(n)]\r\nans = []\r\nfor day in range(n * n):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n if not a[x] and not b[y]:\r\n a[x] = True\r\n b[y] = True\r\n ans.append(day + 1)\r\nprint(' '.join(map(str, ans)))\r\n", "n=int(input())\r\nS1=[]\r\nS2=[]\r\nS=[]\r\nfor i in range(n*n) :\r\n l=list(map(int,input().split()))\r\n z=0\r\n for c in S1 :\r\n if c==l[0] :\r\n z=1\r\n for c in S2 :\r\n if c==l[1] :\r\n z=1\r\n if z!=1 :\r\n S.append(str(i+1))\r\n S1.append(l[0])\r\n S2.append(l[1])\r\nprint(' '.join(S))\r\n \r\n \r\n \r\n", "n = int(input())\r\n\r\narr1 = set()\r\narr2 = set()\r\n\r\nfor i in range(n**2):\r\n a , b = map(int , input().split())\r\n if a not in arr1 and b not in arr2:\r\n print(i+1 , end = \" \")\r\n arr1.add(a)\r\n arr2.add(b)\r\n\r\n\r\n\r\n\r\n", "def roads(lst):\r\n a = list()\r\n h = [0] * 55\r\n v = [0] * 55\r\n for elem in lst:\r\n if not h[elem[0]] and not v[elem[1]]:\r\n a.append(lst.index(elem) + 1)\r\n h[elem[0]], v[elem[1]] = 1, 1\r\n return a\r\n\r\n\r\nn = int(input())\r\nb = list()\r\nfor i in range(n * n):\r\n hh, vv = [int(j) for j in input().split()]\r\n b.append([hh, vv])\r\nprint(*roads(b))\r\n", "n=int(input())\r\nh={i:0 for i in range(1,n+1)}\r\nv={i:0 for i in range(1,n+1)}\r\nl=[]\r\nfor i in range(1,n*n+1):\r\n\ta,b=map(int,input().split())\r\n\tif h[a]==0 and v[b]==0:\r\n\t\tl.append(i)\r\n\t\th[a],v[b]=1,1\r\nprint(*l)\t\t\r\n\r\n", "n = int(input())\r\nhorizontal = []\r\nvertical = []\r\ndays = []\r\nfor x in range(n ** 2):\r\n string = input()\r\n numbers = string.split(\" \")\r\n a = int(numbers[0])\r\n b = int(numbers[1])\r\n if not a in horizontal and not b in vertical:\r\n horizontal.append(a)\r\n vertical.append(b)\r\n days.append(str(x + 1))\r\nprint(\" \".join(days))", "n = int(input())\r\nhr=[]\r\nvr=[]\r\ns=\"\"\r\nfor i in range(n**2):\r\n h,v = map(int,input().split())\r\n if(h not in hr and v not in vr):\r\n hr.append(h)\r\n vr.append(v)\r\n s+=str(i+1)+\" \"\r\nprint(s[:len(s)-1])", "n = int(input())\r\np1 = [0] * n\r\np2 = [0] * n\r\n\r\nfor i in range(n ** 2):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n if p1[a] == 0 and p2[b] == 0:\r\n p1[a] = 1\r\n p2[b] = 1\r\n print(i + 1, end = ' ')\r\n", "n = int(input())\r\nans = []\r\nvertical = [0] * (n + 1)\r\nhorizontal = [0] * (n + 1)\r\nfor i in range(n * n):\r\n x, y = map(int, input().split())\r\n if not horizontal[x] and not vertical[y]:\r\n horizontal[x] = 1\r\n vertical[y] = 1\r\n ans.append(i + 1)\r\nprint(' '.join(map(str, ans)))", "from sys import stdin\r\nn = int(stdin.readline())\r\nv = [0] * (n+1)\r\nh = [0] * (n+1)\r\n\r\nfor i in range(n*n):\r\n \r\n a, b = map(int, stdin.readline().split())\r\n \r\n if v[a] == 0 and h[b] == 0:\r\n print(i+1)\r\n \r\n v[a] = h[b] = 1", "n = int(input())\r\na = [0] * (n+1)\r\nb = [0] * (n+1)\r\nfor i in range(n*n):\r\n x, y = map(int, input().split())\r\n if a[x] + b[y] == 0:\r\n a[x] = 1\r\n b[y] = 1\r\n print(i+1, end = ' ')", "n=int(input())\r\nch=set()\r\ncv=set()\r\nfor i in range(n*n):\r\n h,v=map(int,input().split())\r\n if h in ch or v in cv:\r\n continue\r\n else:\r\n ch.add(h)\r\n cv.add(v)\r\n print(i+1,end=' ')", "import sys\r\nlines = iter(sys.stdin.read().split(\"\\n\"))\r\nn = int(next(lines))\r\nrows = [0] * (n + 1)\r\ncols = [0] * (n + 1)\r\nres = []\r\nfor i in range(n ** 2):\r\n r, c = map(int, next(lines).strip(\" \").split(\" \"))\r\n if rows[r] == 0 and cols[c] == 0:\r\n rows[r] = 1\r\n cols[c] = 1\r\n res.append(str(i + 1))\r\nprint(\" \".join(res))\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n*n):\r\n a.append([])\r\n a[i]=[int(x) for x in input().split()]\r\nansarr=[]\r\nr=[False for i in range(n)]\r\nc=[False for i in range(n)]\r\nfor i in range(n*n):\r\n if(r[a[i][0]-1]==False and c[a[i][1]-1]==False):\r\n r[a[i][0]-1]=True\r\n c[a[i][1]-1]=True\r\n ansarr.append(i+1)\r\nfor i in range(len(ansarr)):\r\n print(ansarr[i],end=' ')\r\nprint('')", "n = int(input())\r\nmas1=[1]*(n+1)\r\nmas2=[1]*(n+1)\r\nres=[]\r\nfor i in range(n*n):\r\n a,b= map(int,input().split(\" \"))\r\n if mas1[a] and mas2[b]:\r\n mas1[a],mas2[b]=0,0\r\n res.append(str(i+1))\r\nprint(\" \".join(res))", "n = int(input())\nx_lst = []\ny_lst = []\nfx_lst= []\nfy_lst = []\ndays = []\nfor i in range(n**2):\n crds = input().split()\n x_lst.append(crds[0])\n y_lst.append(crds[1])\nfor j in range(n**2):\n if y_lst[j] not in fy_lst:\n if x_lst[j] not in fx_lst:\n fx_lst.append(x_lst[j])\n fy_lst.append(y_lst[j])\n days.append(str(j+1))\ns = ' '.join(days)\nprint(s)\n", "blbost = int(input())\r\nradky = []\r\nsloupce = []\r\nfor k in range(blbost**2):\r\n line = list(map(int, input().split()))\r\n m = line[0] in radky\r\n l = line[1] in sloupce\r\n if m or l:\r\n continue\r\n else:\r\n print(k+1,end = \" \")\r\n radky.append(line[0])\r\n sloupce.append(line[1])", "n = int(input())\r\nf = set()\r\ns = set()\r\nans = []\r\nfor i in range(n*n):\r\n h, v = map(int, input().split())\r\n if h not in f and v not in s:\r\n f.add(h)\r\n s.add(v)\r\n ans.append(i+1)\r\nprint(*ans)\r\n", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n n = N()\r\n H, V = dict(), dict()\r\n r = list()\r\n\r\n n *= n\r\n\r\n for i in range(n):\r\n h, v = P()\r\n if not (h in H.keys() or v in V.keys()):\r\n r.append(i + 1)\r\n H[h] = H.get(h, True)\r\n V[v] = V.get(v, True)\r\n for i in r:\r\n print(i, end=' ')", "n = int(input())\r\nh_road = set()\r\nv_road = set()\r\nres = ''\r\nfor i in range(n ** 2):\r\n h, v = map(int, input().split())\r\n if h not in h_road and v not in v_road:\r\n h_road.add(h)\r\n v_road.add(v)\r\n res += str(i + 1) + ' '\r\nprint(res)", "def progress(n, sched):\n hs = set()\n vs = set()\n for d, (hi, vi) in enumerate(sched, 1):\n if hi in hs or vi in vs:\n continue\n yield d\n hs.add(hi)\n vs.add(vi)\n\n\ndef isect():\n h, v = map(int, input().split())\n return h, v\n\n\ndef main():\n n = int(input())\n sched = (isect() for _ in range(n*n))\n print(' '.join(map(str, progress(n, sched))))\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)*1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}\"\n f\"Got ({int((t1-t0)*1000000)/1000:0.3f} ms):\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n2\n1 1\n1 2\n2 1\n2 2\n\"\"\", \"\"\"\\\n1 4\n\"\"\"), (\"\"\"\\\n1\n1 1\n\"\"\", \"\"\"\\\n1\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n", "__author__ = 'yarsanich'\nn = int(input(''))\nh =[]\nv =[]\nfor i in range(n*n):\n x, y = map(int, input('').split())\n if (x not in h) and (y not in v):\n h.append(x)\n v.append(y)\n print(i+1, end = ' ')\n\n", "h_asphalted, v_asphalted = set(), set()\r\n\r\nfor i in range(1, int(input()) ** 2 + 1):\r\n h, v = input().split()\r\n \r\n if h not in h_asphalted and v not in v_asphalted:\r\n h_asphalted.add(h)\r\n v_asphalted.add(v)\r\n print(i, end=' ')", "\nn = int(input())\nres = []\nh= [0] * (n+1)\nv= [0] * (n+1)\n\nfor i in range(0,n**2):\n a, b = map(int, input().split())\n if h[a] == 0 and v[b] == 0:\n res.append(i+1)\n h[a] = 1\n v[b] = 1\nfor x in res:\n print(x, end=' ')\n\n\n\t \t \t \t \t\t \t \t\t\t\t \t\t \t\t", "n = int(input())\r\nh = []\r\nv = []\r\nl = []\r\nfor i in range(n*n):\r\n x,y = map(int,input().split())\r\n if(x not in h and y not in v):\r\n l.append(i+1)\r\n h.append(x)\r\n v.append(y)\r\nprint(*l)\r\n", "n = int(input())\nA = []\nfor i in range(0,n**2):\n a,b = input().split()\n A.append([int(a),int(b)])\nB = []\nC = []\nfor l in range(0,n):\n B.append(0)\n C.append(0)\nD = []\nfor k in range(0,n**2):\n if B[A[k][0]-1] == 0 and C[A[k][1]-1] == 0:\n D.append(k)\n B[A[k][0]-1] = 1\n C[A[k][1]-1] = 1\n \n \ns = ''\nfor j in range(0,n):\n s =s+str(D[j]+1)+' '\nprint(s)", "n=int(input())\r\nx=[];y=[];z=[]\r\nfor i in range(1,n*n+1):\r\n a,b=map(int,input().split())\r\n if a not in x and b not in y:\r\n z.append(i)\r\n x.append(a)\r\n y.append(b)\r\nprint(*z)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/24 13:26\r\n\r\n\"\"\"\r\n\r\n\r\nN = int(input())\r\n\r\ncol = set()\r\nrow = set()\r\n\r\nans = []\r\nfor i in range(1, N**2+1):\r\n r, c = map(int, input().split())\r\n if r not in row and c not in col:\r\n ans.append(i)\r\n row.add(r)\r\n col.add(c)\r\n\r\nprint(\" \".join(map(str, ans)))", "n = int(input()) \r\nroads = [[int(j) for j in input().split()] for i in range(n ** 2)]\r\nHorizontal = []\r\nVertical = []\r\nDays = []\r\nfor i in range(0,(n**2)):\r\n\tif (roads[i][0] not in Vertical) and (roads[i][1] not in Horizontal):\r\n\t\tVertical.append(roads[i][0])\r\n\t\tHorizontal.append(roads[i][1])\r\n\t\tDays.append(i+1)\r\nfor i in range(0,len(Days)):\r\n\tprint(Days[i],end=' ')", "n = int(input())\r\nx = []\r\ny = []\r\nr = []\r\nfor i in range(n**2):\r\n a,b = input().split()\r\n if int(a) not in x and int(b) not in y:\r\n r.append(i+1)\r\n x.append(int(a))\r\n y.append(int(b))\r\n\r\nfor i in r:\r\n print (i,end=\" \")\r\n \r\n", "n = int(input())\r\nh = [False] * n\r\nv = [False] * n\r\nd = []\r\n\r\nfor i in range(n*n):\r\n hr, vr = [int(k) for k in input().split()]\r\n if not h[hr-1] and not v[vr-1]:\r\n h[hr-1] = True\r\n v[vr-1] = True\r\n d.append(i)\r\n\r\nopt = ''\r\nfor i in d:\r\n opt += str(i+1) + ' '\r\n\r\nprint(opt)", "seen_h = set()\nseen_v = set()\nn = int(input())\nfor i in range(n*n):\n h, v = [int(x) for x in input().split()]\n if h not in seen_h and v not in seen_v:\n print(str(i+1))\n seen_h.add(h)\n seen_v.add(v)\n", "days = []\ntakenRows = []\ntakenCols = []\nfor i in range(int(input().strip())**2):\n\tx, y = map(int, input().strip().split())\n\tif x not in takenRows and y not in takenCols:\n\t\ttakenCols.append(y)\n\t\ttakenRows.append(x)\n\t\tdays.append(i+1)\nprint(*days)", "n = int(input())\r\n\r\nH = [False for i in range(n)]\r\nV = [False for i in range(n)]\r\n\r\nfor i in range(n**2):\r\n h, v = [int(i) - 1 for i in input().split()]\r\n if not H[h] and not V[v]:\r\n H[h] = True\r\n V[v] = True\r\n print(i + 1, end = ' ')\r\n", "n=int(input( ))\r\ns=[[0 for a in range(n)]for b in range(n)]\r\nfor i in range(n**2):\r\n a,b=[int(i) for i in input( ).split( )]\r\n ac=0\r\n for j in range(n):\r\n if s[a-1][j]!=0 or s[j][b-1]!=0:\r\n ac+=1\r\n if ac==0:\r\n s[a-1][b-1]+=1\r\n print(i+1,end=' ')\r\n\r\n\r\n \r\n", "n=int(input())\r\na=[]\r\nfor i in range(n*n):\r\n a.append([])\r\nfor i in range(n*n):\r\n a[i]=list(map(int,input().split()))\r\nhmark=[0]*(n+1)\r\nvmark=[0]*(n+1)\r\nans=[]\r\nfor i in range(n*n):\r\n if(not hmark[a[i][0]] and not vmark[a[i][1]]):\r\n hmark[a[i][0]]=1\r\n vmark[a[i][1]]=1\r\n ans.append(i+1)\r\nfor i in range(len(ans)):\r\n print(ans[i],end=\" \")\r\n", "n = int(input())\r\nf = [0] * (n*n)\r\ns = [0] * (n*n)\r\nfor i in range(n*n):\r\n f[i], s[i] = map(int,input().split())\r\n \r\nvert = [0] * n\r\nhor = [0] * n\r\nres = []\r\nfor i in range(n * n):\r\n if hor[f[i]-1] == 0 and vert[s[i]-1] == 0:\r\n hor[f[i]-1] = 1\r\n vert[s[i]-1] = 1\r\n res.append(i+1)\r\n \r\nfor elem in res: print(elem, end = ' ')\r\n ", "n = int(input())\r\nhp, vp = [False] * (n + 1), [False] * (n + 1)\r\nfor i in range(1, n ** 2 + 1):\r\n hi, vi = map(int, input().split())\r\n if not hp[hi] and not vp[vi]:\r\n hp[hi] = vp[vi] = True\r\n print(i, end=' ')", "# Description of the problem can be found on http://codeforces.com/problemset/problem/583/A\r\n\r\nh_d = {}\r\nv_d = {}\r\n\r\nn = int(input())\r\n\r\nfor i in range(n * n):\r\n h, v = map(int, input().split())\r\n if h not in h_d and v not in v_d:\r\n print(i + 1, end = \" \")\r\n h_d[h] = 1\r\n v_d[v] = 1", "num = int(input())\r\nx = []\r\ny = []\r\nresultList = []\r\nfor i in range(1, num + 1):\r\n x.append(i)\r\n y.append(i)\r\nfor i in range(num ** 2):\r\n a, b = map(int, input().split())\r\n if a in x and b in y:\r\n resultList.append(i + 1)\r\n x.remove(a)\r\n y.remove(b)\r\n\r\nprint(\" \".join(str(s) for s in resultList))", "n = int(input())\r\nh, v = [False] * (n + 1), [False] * (n + 1)\r\nfor i in range(n * n):\r\n x, y = map(int, input().split())\r\n if not h[x] and not v[y]:\r\n print(i + 1, end = ' ')\r\n h[x], v[y] = True, True\r\n", "#codeforces_538A\r\ngi = lambda:list(map(int,input().split(\" \")))\r\nn, = gi()\r\noccLines = [0 for e in range(n+1)]\r\noccCols = occLines[:]\r\nfor k in range(n*n):\r\n line = gi()\r\n if not (occLines[line[0]] or occCols[line[1]]):\r\n print(k+1,end=\" \")\r\n occLines[line[0]] = occCols[line[1]] = 1", "n = int(input())\nx = [False] * (n + 1)\ny = [False] * (n + 1)\na = []\nfor i in range(1, n**2+1):\n h, v = map(int, input().split())\n if not x[h] and not y[v]:\n a.append(i)\n x[h] = True\n y[v] = True\nprint(*a)\n", "from sys import stdin\r\nlive = True\r\nif not live: stdin = open(\"data.in\", \"r\")\r\n\r\nn = int(stdin.readline().strip())\r\nvert = [False] * (n + 1)\r\nhori = [False] * (n + 1)\r\nans = []\r\n\r\nfor it in range(n * n):\r\n\tx, y = list(map(int, stdin.readline().strip().split()))\r\n\tif not hori[x] and not vert[y]:\r\n\t\thori[x] = vert[y] = True\r\n\t\tans += [it + 1]\r\n\t\t\r\nprint(' '.join(map(str, ans)))\r\n\r\nif not live: stdin.close()", "t = int(input())\r\na = []\r\nres = []\r\nh = []\r\nv = []\r\n\r\nfor i in range(1 , t**2+1):\r\n h.append(False)\r\n v.append(False)\r\n\r\nfor el in range(t**2):\r\n n1 , n2 = list(map(int , input().split()))\r\n if(h[n1-1] == False and v[n2-1] == False):\r\n res.append(el+1)\r\n h[n1-1] = True\r\n v[n2-1] = True\r\n # if(n1 in a and n2 in a):\r\n # continue \r\n # else:\r\n # res.append(el+1)\r\n # a.append(n1)\r\n # a.append(n2)\r\n\r\nprint(*res)", "n = int(input())\r\nans = []\r\nvert = set()\r\nhor = set()\r\nfor i in range(n*n):\r\n a,b = map(int,input().split())\r\n if a not in vert and b not in hor:\r\n ans.append(i+1)\r\n vert.add(a)\r\n hor.add(b)\r\nprint(*ans)", "a=int(input())\r\nanswer = ''\r\nhpaved= []\r\nvpaved= []\r\npavingDays=[]\r\nfor i in range(0,a**2):\r\n h,v = map(int,input().split())\r\n if h not in hpaved and v not in vpaved:\r\n hpaved.append(h)\r\n vpaved.append(v)\r\n answer += str(i+1)+' '\r\nprint(answer)", "n=int(input())\r\nr=[0]*(n+1)\r\nc=[0]*(n+1)\r\nfor i in range(n*n):\r\n\ta,b=map(int,input().split())\r\n\tif r[a]==0 and c[b]==0:\r\n\t\tprint(i+1)\r\n\t\tr[a]=c[b]=1\r\n", "n=int(input())\r\nlih=[]\r\nliv=[]\r\nans=[]\r\nfor i in range(n**2):\r\n\th,v=map(int,input().split())\r\n\tif h not in lih and v not in liv:\r\n\t\tans.append(i+1)\r\n\t\tliv.append(v)\r\n\t\tlih.append(h)\r\nprint(*ans)", "n = int(input())\r\nrow = [False for i in range(n)]\r\ncol = [False for i in range(n)]\r\nans = []\r\nfor i in range(n ** 2):\r\n u, v = list(map(int, input().split()))\r\n u -= 1\r\n v -= 1\r\n if row[u] == False and col[v] == False:\r\n row[u] = True\r\n col[v] = True\r\n ans.append(i + 1)\r\nprint(*ans)\r\n", "n = int(input())\nhor_roads, ver_roads = [], []\nwork_days = []\nfor i in range(n**2):\n\tx, y = (int(j) for j in input().split())\n\tif x not in hor_roads and y not in ver_roads:\n\t\twork_days.append(i+1)\n\t\thor_roads.append(x)\n\t\tver_roads.append(y)\nresult = ''\nfor day in work_days:\n\tresult += str(day) + ' '\nprint(result[:-1])", "\r\n\r\nk = int(input())\r\nH, V, answer = [], [], []\r\nfor i in range(k * k):\r\n h, v = map(int, input().split())\r\n if h not in H and v not in V:\r\n H.append(h);V.append(v);answer.append(i+1)\r\nprint(*answer)\r\n# CodeForcesian\r\n# ♥\r\n# Lifan", "n = int(input())\r\nusedx = [False] * (n + 1)\r\nusedy = [False] * (n + 1)\r\nfor i in range(1, n * n + 1):\r\n x, y = map(int, input().split())\r\n if (not usedx[x]) and (not usedy[y]):\r\n print(i, end = ' ')\r\n usedx[x] = True\r\n usedy[y] = True\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n n = I()\r\n row = [False]*(n+1)\r\n col = [False]*(n+1)\r\n res = []\r\n for i in range(pow(n, 2)):\r\n r, c = IA()\r\n if not row[r] and not col[c]:\r\n row[r]=True\r\n col[c]=True\r\n res.append(i+1)\r\n print(*res)\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nl=[]\r\nm=[]\r\nfor i in range(n*n):\r\n\th,v=map(int,input().split())\r\n\tif h not in l and v not in m:\r\n\t\tprint(i+1,end=\" \")\r\n\t\tl.append(h)\r\n\t\tm.append(v)\r\n ", "n = int(input())\r\nh_list = [0] * (n+1)\r\nv_list = [0] * (n+1)\r\nans = []\r\nfor x in range(1,n**2+1):\r\n h,v = map(int,input().split())\r\n if h_list[h]+v_list[v]==0:\r\n h_list[h]=1\r\n v_list[v]=1\r\n ans.append(str(x))\r\n\r\n\r\nprint (' '.join(ans))", "n=int(input())\r\nah=[False]*n*n\r\nav=[False]*n*n\r\ns=''\r\nfor i in range(n*n):\r\n h,v=map(int,input().split(' '))\r\n h-=1\r\n v-=1\r\n if(not ah[h] and not av[v]):\r\n ah[h]=True\r\n av[v]=True\r\n s+=str(i+1)+' '\r\nprint(s)\r\n", "n = int(input())\r\nh_road = [0] * (n + 1)\r\nv_road = [0] * (n + 1)\r\nres = ''\r\nfor i in range(n ** 2):\r\n h, v = map(int, input().split())\r\n if h_road[h] == 0 and v_road[v] == 0:\r\n h_road[h] = 1\r\n v_road[v] = 1\r\n res += str(i + 1) + ' '\r\nprint(res)", "n = int(input())\r\ns_x = set()\r\ns_y = set()\r\nfor i in range(n**2):\r\n\tx,y = map(int, input().strip().split())\r\n\tif (not x in s_x) and (not y in s_y):\r\n\t\tprint(i+1)\r\n\t\ts_x.add(x)\r\n\t\ts_y.add(y)", "n = int(input())\nH = []\nV = []\nfor i in range(n * n):\n a, b = map(int, input().split())\n if (a not in H) and (b not in V):\n H.append(a)\n V.append(b)\n print(i + 1, end = ' ')", "n = int(input());\r\nhoriz = [0] * n;\r\nvert = [0] * n;\r\n\r\nrealDays = [False] * n**2;\r\n\r\nfor i in range( 0, n**2):\r\n line = [int(n) for n in input().split()];\r\n if( horiz[line[0]-1]==0 and vert[line[1]-1]==0 ):\r\n\r\n horiz[line[0]-1] = 1;\r\n vert[line[1]-1] = 1;\r\n realDays[i] = True;\r\n\r\nout = \"\"; \r\n\r\nfor i in range( 0, len(realDays) ):\r\n if( realDays[i] ):\r\n out += str(i+1) + \" \";\r\n \r\nprint(out);", "from collections import defaultdict\r\nn = int(input())\r\nd = defaultdict(set)\r\nans = []\r\nfor i in range(n*n):\r\n a,b = map(int,input().split())\r\n if a not in d[\"V\"]and b not in d[\"H\"]:\r\n ans.append(i+1)\r\n d[\"V\"].add(a)\r\n d[\"H\"].add(b)\r\nprint(*ans)\r\n", "def get_result():\n n = int(input())\n asphalted_h = []\n asphalted_v = []\n working_days = []\n\n for i in range(n**2):\n h, v = [int(val) for val in input().split()]\n\n if not (h in asphalted_h or v in asphalted_v):\n asphalted_h.append(h)\n asphalted_v.append(v)\n working_days.append(str(i+1))\n\n return ' '.join(working_days)\n\n\nif __name__ == \"__main__\":\n print(get_result())\n", "\r\nn=int(input())\r\nhused=[]\r\nyused=[]\r\nfor x in range(n*n):\r\n if x==0:\r\n a=list(map(int,input().split()))\r\n print(1,end=' ')\r\n hused.append(a[0])\r\n yused.append(a[1])\r\n else:\r\n a = list(map(int, input().split()))\r\n if hused.count(a[0])==0 and yused.count(a[1])==0:\r\n hused.append(a[0])\r\n yused.append(a[1])\r\n ##print(hused,yused)\r\n print(x+1,end=' ')", "n = int(input())\r\na = [False] * n\r\nb = [False] * n\r\nd = 0\r\nfor i in range(n * n):\r\n d += 1\r\n h, v = map(int, input().split())\r\n if not a[h - 1] and not b[v - 1]:\r\n a[h - 1] = True\r\n b[v - 1] = True\r\n print(d, end=\" \")", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn = int(input())\r\n\r\nroad1 = [0] * n\r\nroad2 = [0] * n\r\n\r\ndays = []\r\n\r\nfor i in range(n*n):\r\n h, v = map(int,input().split())\r\n h -= 1\r\n v -= 1\r\n\r\n if road1[h] == 0 and road2[v] == 0:\r\n days.append(i+1)\r\n road1[h] = 1\r\n road2[v] = 1\r\n\r\nfor i in range(len(days)):\r\n print(days[i],end = \" \")\r\nprint()\r\n", "n=int(input())\r\nmapp=[[0 for x in range(n)]for y in range(n)]\r\nrecord=[]\r\nfor i in range(n*n):\r\n a,b=map(int,input().split())\r\n a-=1\r\n b-=1\r\n if mapp[a][b]==0:\r\n for j in range(n):\r\n mapp[a][j]=1\r\n for j in range(n):\r\n mapp[j][b]=1\r\n record.append(i+1)\r\n else:\r\n pass\r\nprint(\" \".join([str(x) for x in record]))\r\n", "n=int(input())\r\ndoneH=[]\r\ndoneV=[]\r\nsch=[]\r\ndays=[]\r\nfor i in range(n*n):\r\n line=input().split(\" \")\r\n sch.append([line[0],line[1]])\r\nfor i in range(n*n):\r\n if sch[i][0] not in doneH and sch[i][1] not in doneV:\r\n doneH.append(sch[i][0])\r\n doneV.append(sch[i][1])\r\n days.append(str(i+1))\r\n if len(doneH)==n:\r\n break\r\nprint(\" \".join(days))\r\n", "n = int(input())\r\nli = [[0] * n for i in range(n)]\r\nfor i in range(n * n):\r\n a, b = [int(i) for i in input().split()]\r\n if (li[a - 1][b - 1] == 0):\r\n for j in range(n):\r\n li[j][b - 1] = 1\r\n li[a - 1][j] = 1\r\n print(i + 1, end = ' ')", "n=int(input())\r\nv=[0]*((n**2)+1)\r\nh=[0]*((n**2)+1)\r\nfor i in range(n*n):\r\n a,b=list(map(int,input().split()))\r\n if v[a]==0 and h[b]==0:\r\n print(i+1)\r\n v[a]='a'\r\n h[b]='b'", "n = int(input())\r\n\r\nroads = [[0]*n for _ in range(n)]\r\n\r\ndays = []\r\nfor j in range(n * n):\r\n sum_x = 0\r\n sum_y = 0\r\n work = input().split()\r\n for i in range(n):\r\n sum_x += roads[int(work[0]) - 1][i]\r\n sum_y += roads[i][int(work[1]) - 1]\r\n if sum_x == 0 and sum_y == 0:\r\n roads[int(work[0]) - 1][int(work[1]) - 1] += 1\r\n days.append(j + 1)\r\n\r\nprint(*days, sep = \" \")", "seta = set()\r\nsetb = set()\r\nn = int(input())\r\nfor i in range (n**2):\r\n a, b = [int(i) for i in input().split()]\r\n if a not in seta and b not in setb:\r\n print (i+1, end = ' ')\r\n seta.add(a)\r\n setb.add(b)", "n = int(input().strip())\r\nx,y=set(),set()\r\nfor i in range(n**2):\r\n a,b=map(int,input().split())\r\n if a not in x and b not in y:\r\n x.add(a)\r\n y.add(b)\r\n print(i+1)\r\n\r\n", "while 1:\n try:\n n=int(input())\n a,b=[0]*(n*n),[0]*(n*n)\n for i in range(n*n):\n a[i],b[i]=map(int,input().split())\n except: break\n \n s,t=set(),set()\n res=[]\n for i in range(n*n):\n if (not a[i] in s) and (not b[i] in t):\n res.append(i+1)\n s.add(a[i])\n t.add(b[i])\n print(' '.join(map(str,res)))\n", "n = int(input())\r\ni = 0\r\nhv = []\r\nvv = []\r\nans = []\r\nwhile(i<(n*n)):\r\n h,v = map(int,input().split())\r\n if h not in hv and v not in vv:\r\n ans.append(i+1)\r\n hv.append(h)\r\n vv.append(v)\r\n i+=1\r\nfor i in ans:\r\n print(i,end=\" \")", "n = int(input())\r\nA = [list(map(int, input().split())) for i in range(n*n)]\r\nday = []\r\ndorgor = [i for i in range(1, n+1)]\r\ndorvert = [i for i in range(1, n+1)]\r\nfor i in range(0, n*n):\r\n if (len(dorgor) > 0) and (len(dorvert) > 0):\r\n for j in range(1):\r\n if (A[i][j] in dorgor) and (A[i][j+1] in dorvert):\r\n day.append(i)\r\n dorgor.remove(A[i][j])\r\n dorvert.remove(A[i][j+1])\r\n \r\nfor dni in day: print(dni+1, end = ' ')\r\n", "n=int(input())\r\na=set()\r\nb=set()\r\nans=[]\r\nfor i in range(n**2):\r\n h,v=map(int,input().split())\r\n if h not in a and v not in b:\r\n a.add(h)\r\n b.add(v)\r\n ans.append(i+1)\r\nprint(*ans)", "n=int(input())\r\nh=[0]*(n+1)\r\nv=[0]*(n+1)\r\nfor i in range(n*n):\r\n\thi,vi=map(int,input().split())\r\n\tif h[hi]==0 and v[vi]==0:\r\n\t\tprint(i+1)\r\n\t\th[hi]=1\r\n\t\tv[vi]=1\r\n", "n = int(input())\r\nans = []\r\naa, bb = [False] * 90, [False] * 90\r\nfor i in range(1, n ** 2 + 1):\r\n a, b = map(int, input().split())\r\n if not aa[a] and not bb[b]:\r\n ans.append(i)\r\n aa[a] = True\r\n bb[b] = True\r\nprint(' '.join(map(str, ans)))", "h,v,l,n={0},{0},[],int(input())\r\nfor i in range(n*n):\r\n q,w=map(int,input().split())\r\n if q not in h and w not in v:h.add(q);v.add(w);l+=[i+1]\r\nprint(*l)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nn=int(input())\r\nr=[0]*(n+1)\r\nc=[0]*(n+1)\r\nfor i in range(n*n):\r\n\ta,b=map(int,input().split())\r\n\tif r[a]==0 and c[b]==0:\r\n\t\tprint(i+1)\r\n\t\tr[a]=c[b]=1", "__author__ = 'suvasish'\r\n\r\nn = int(input())\r\nintersection_order = []\r\nrow_count = 0\r\nasphalted_hori = []\r\nasphalted_vert = []\r\nfor i in range(0,n*n):\r\n line = input()\r\n if line:\r\n intersection_order.append(line)\r\n\r\nfor row in range(0, len(intersection_order)):\r\n row_count += 1\r\n row_items = intersection_order[row].split(' ')\r\n hori = int(row_items[0])\r\n vert = int(row_items[1])\r\n if hori in asphalted_hori or vert in asphalted_vert:\r\n continue\r\n else:\r\n asphalted_hori.append(hori)\r\n asphalted_vert.append(vert)\r\n print(row_count, end=' ')\r\n", "import math as mt\nimport sys, string\nfrom collections import Counter, defaultdict\ninput = sys.stdin.readline\n\n# input functions\nI = lambda : int(input())\nM = lambda : map(int, input().split())\nARR = lambda: list(map(int, input().split()))\n\ndef printARR(arr):\n for e in arr:\n print(e, end=\" \")\n print()\n\ndef main():\n visited_h, visited_v = set(), set()\n n = I()\n for i in range(n*n):\n h,v=M()\n if h not in visited_h and v not in visited_v:\n print(i+1, end=\" \")\n visited_v.add(v)\n visited_h.add(h)\n\ntc = 1\n# tc = I()\nfor _ in range(tc):\n main()", "#In the name of Allah\n\nfrom sys import stdin, stdout\ninput = stdin.readline\n\nn = int(input())\nv = [False] * (n + 1)\nh = [False] * (n + 1)\nans = \" \"\nfor i in range(n * n):\n x, y = map(int, input().split())\n if not (v[x] or h[y]):\n ans += str(i + 1) + \" \"\n v[x] = True\n h[y] = True\nstdout.write(ans[1:-1])\n \n", "\r\nn = int(input().split()[0])\r\nhb = [False for _ in range(n + 1)]\r\nvb = hb[:]\r\ndays = \"\"\r\nfor i in range(n ** 2):\r\n s = input().split()\r\n hi, vi = int(s[0]), int(s[1])\r\n if not (hb[hi] or vb[vi]):\r\n hb[hi], vb[vi] = True, True\r\n days += \" \" + str(i + 1)\r\n\r\nprint(days[1:])\r\n", "n = int(input())\nisetv = set()\nisetg = set()\nfor i in range(n ** 2):\n a, b = map(int, input().split())\n if a not in isetv and b not in isetg:\n isetv.add(a)\n isetg.add(b)\n print(i + 1, end = ' ')", "n = int(input())\r\n\r\nH = [False] * (n + 1)\r\nV = [False] * (n + 1)\r\nans = []\r\nfor i in range(n ** 2):\r\n h, v = map(int, input().split())\r\n if not H[h] and not V[v]:\r\n H[h] = True\r\n V[v] = True\r\n ans.append(i + 1)\r\nprint(' '.join(map(str, ans)))\r\n", "n = int(input())\nans = []\nh = [False] * n\nv = [False] * n\nfor d in range(n * n):\n i, j = (int(x) - 1 for x in input().split())\n if not h[i] and not v[j]:\n ans += [d]\n v[j] = True\n h[i] = True\nprint(' '.join([str(x + 1) for x in ans]))\n", "n = int(input())\nh = []\nv = []\nans = ''\nfor i in range(0, n*n):\n\tgiven = list(map(int,input().split()))\n\th1 = given[0]\n\tv1 = given[1]\n\tif (h1 in h or v1 in v):\n\t\tx = 1\n\telse:\n\t\th.append(h1)\n\t\tv.append(v1)\n\t\tans += (str(i+1) + ' ')\nprint(ans[:-1])", "n = int(input())\r\n\r\nvert = []\r\nhoriz = []\r\n\r\ndays = []\r\nfor i in range(n**2):\r\n\tv, h = map(int, input().split())\r\n\tif (not v in vert) and (not h in horiz):\r\n\t\tvert.append(v)\r\n\t\thoriz.append(h)\r\n\t\t\r\n\t\tdays.append(i + 1)\r\n\r\nprint(\" \".join(map(str, days)))", "n = int(input())\r\nx,y = dict(),dict()\r\no = list()\r\nfor i in range(n**2):\r\n a,b = map(int,input().split())\r\n if (not a in x) and (not b in y) :\r\n o.append(i+1)\r\n x[a] = True\r\n y[b] = True\r\nprint(\" \".join(list(map(str,o))))", "n=int(input())\r\nasphalted=[]\r\nans=[]\r\nfor i in range(n**2):\r\n a,b=map(int,input().split())\r\n if \"R\"+str(a) not in asphalted and \"V\"+str(b) not in asphalted:\r\n asphalted.append(\"R\"+str(a))\r\n asphalted.append(\"V\"+str(b))\r\n ans.append(i+1)\r\nfor i in ans:\r\n print(i,end=\" \")\r\n \r\n", "x = int(input())\r\nus1 = [0] * (x + 1)\r\nus2 = [0] * (x + 1)\r\nl = []\r\nfor i in range (x ** 2):\r\n a, b = map(int, input().split(\" \"))\r\n if not us1[a] and not us2[b]:\r\n us1[a] = 1\r\n us2[b] = 1\r\n l.append(i + 1)\r\nprint(' '.join(map(str, l)))", "def main():\r\n n = int(input())\r\n x = [0] * n\r\n y = [0] * n\r\n for day in range(n * n):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n #print(x[a], y[b], x[a] == 0, x[b] == 0, type(x[a]))\r\n if x[a] == 0 and y[b] == 0:\r\n x[a] = 1\r\n y[b] = 1\r\n print(day + 1, end=\" \")\r\n \r\nmain()", "n = int(input())\r\nAsphaltedV = []\r\nAsphaltedH = []\r\nDays = []\r\nfor i in range(n**2):\r\n H , V = map(int,input().split())\r\n if H not in AsphaltedH and V not in AsphaltedV :\r\n AsphaltedH.append(H)\r\n AsphaltedV.append(V)\r\n Days.append(i+1)\r\n\r\nprint(*Days)", "n = int(input())\r\nD = [list(map(int, input().split())) for x in range(n*n)]\r\nH = []\r\nV = []\r\nL = []\r\nfor m in range(n*n):\r\n if D[m][0] not in H and D[m][1] not in V:\r\n H.append(D[m][0])\r\n V.append(D[m][1])\r\n L.append(m+1)\r\n\r\nfor m in range(n):\r\n print(L[m], end=\" \")", "n = int(input())\n\nhe = set()\nve = set()\nres = []\n\nfor i in range(1,n**2+1):\n h,v = map(int, input().split())\n if h not in he and v not in ve:\n he.add(h)\n ve.add(v)\n res.append(i)\n \nprint(\" \".join(map(str, res)))", "n = int(input())\r\nres = []\r\nused = [False] * n\r\nused1 = [False] * n\r\nfor i in range(n * n):\r\n x, y =[int(x) for x in input().split()]\r\n if used[x - 1] == False and used1[y - 1] == False:\r\n res.append(i + 1)\r\n used[x - 1] = True\r\n used1[y - 1] = True\r\nprint(*res)", "def main():\n n = int(input())\n hh, vv, res = [True] * (n + 1), [True] * (n + 1), []\n for i in range(1, n * n + 1):\n h, v = map(int, input().split())\n if hh[h] and vv[v]:\n hh[h] = vv[v] = False\n res.append(i)\n print(' '.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()\n", "\r\nn = int(input())\r\nl = []\r\nfor _ in range(n * n):\r\n\tl.append(list(map(int, input().split())))\r\n\r\ndone = []\r\ndone1 = []\r\nday = []\r\n\r\nfor i in range(n * n):\r\n\tif l[i][0] not in done and l[i][1] not in done1:\r\n\t\tdone.append(l[i][0])\r\n\t\tdone1.append(l[i][1])\r\n\t\tday.append(i + 1)\r\n\r\n\r\nprint(*day, sep = ' ')", "n = int(input())\r\nhor, ver = [True] * (n + 1), [True] * (n + 1)\r\nfor x in range(n * n):\r\n h, v = map(int, input().split())\r\n if hor[h] and ver[v]: \r\n hor[h], ver[v] = False, False\r\n print(x + 1, end = \" \")", "n = int(input())\r\ndata = [list(map(int, input().split())) for i in range(n ** 2)]\r\nvertical = [0 for i in range(n)]\r\nhorizontal = [0 for i in range(n)]\r\nanswer = []\r\nfor i in range(n ** 2):\r\n if vertical[data[i][0] - 1] == 0 and horizontal[data[i][1] - 1] == 0:\r\n vertical[data[i][0] - 1], horizontal[data[i][1] - 1] = 1, 1\r\n answer.append(i + 1)\r\nprint(' '.join(map(str, answer)))", "n=int(input())\r\na=[0 for i in range(n)]\r\nb=[0 for i in range(n)]\r\nc=[]\r\nfor i in range(n**2):\r\n h,v=list(map(int,input().split()))\r\n if a[h-1]==0 and b[v-1]==0:\r\n c.append(i+1)\r\n a[h-1]=1\r\n b[v-1]=1\r\nprint(*c)", "n = int(input())**2 + 1\r\na = [0] * n\r\nb = [0] * n\r\nfor i in range(1, n):\r\n c, d = map(int, input().split())\r\n if a[c] + b[d] == 0:\r\n print(i, end=\" \")\r\n a[c] = 1\r\n b[d] = 1", "n = int(input())\nx = [1]\ny = [1]\n\nfor i in range(1,n+1):\n x.append(0)\n y.append(0)\n\nfor i in range(1,n**2+1):\n str = input()\n a,b = str.split()\n a = int(a)\n b = int(b)\n if x[a]==0 and y[b]==0:\n x[a] = 1\n y[b] = 1\n print(i)\n ", "n = int(input())\r\nhor_roads_repaired = []\r\nver_roads_repaired = []\r\nfor i in range(n ** 2):\r\n hor_road, ver_road = map(int, input().split())\r\n if hor_road not in hor_roads_repaired and ver_road not in ver_roads_repaired:\r\n hor_roads_repaired += [hor_road]\r\n ver_roads_repaired += [ver_road]\r\n print(i + 1, end=' ')\r\nprint()\r\n", "a=int(input())\r\n#print(a)\r\nanswer = ''\r\nhpaved = []\r\nvpaved = []\r\npavingday = []\r\nfor i in range(0,a*a):\r\n h,v = map(int,input().split())\r\n #print(h,v)\r\n if not(h in hpaved) and not(v in vpaved):\r\n #print(i+1)\r\n pavingday.append(i+1)\r\n hpaved.append(h)\r\n vpaved.append(v)\r\nfor i in range(len(pavingday)):\r\n answer = answer + str(pavingday[i]) + ' '\r\nprint(answer)\r\n # print(pavingday[i]) \r\n# print(pavingday)\r\n # do something\r\n", "n = int(input())\r\nvertical = n*[0]\r\nhorizontal = n*[0]\r\nwork = []\r\n\r\nfor i in range(n**2):\r\n v,h = [int(j) for j in input().split()]\r\n if vertical[v-1] == 1 or horizontal[h-1] == 1:\r\n continue\r\n else:\r\n vertical[v-1] = 1\r\n horizontal[h-1] = 1\r\n work.append(str(i+1))\r\n\r\nprint(' ' .join(work))\r\n", "n = int(input())\r\nx_roads = list()\r\ny_roads = list()\r\ndays = list()\r\nfor index in range(n * n):\r\n x,y = map(int, input().split())\r\n if not x in x_roads and not y in y_roads:\r\n x_roads.append(x)\r\n y_roads.append(y)\r\n days.append(index + 1)\r\nprint(' '.join(str(e) for e in days))", "def main():\n n = int(input())\n asphalted_rows = [False for _ in range(n + 1)]\n asphalted_cols = [False for _ in range(n + 1)]\n result = []\n\n for i in range(1, n * n + 1):\n [row, col] = [int(_) for _ in input().split()]\n\n if asphalted_rows[row] or asphalted_cols[col]:\n pass\n else:\n asphalted_rows[row] = True\n asphalted_cols[col] = True\n result += [str(i)]\n\n print(' '.join(result))\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict\r\nxd, yd = defaultdict(bool), defaultdict(bool)\r\nfor i in range(int(input())**2):\r\n\tx, y = map(int, input().split())\r\n\tif not (xd[x] or yd[y]):\r\n\t\txd[x] = yd[y] = True\r\n\t\tprint(i + 1)", "n = int(input())\na, b = [0] * n, [0] * n\nfor x in range(n ** 2):\n i, j = map(int, input().split())\n if (not a[i - 1]) and (not b[j - 1]):\n print(x + 1, end = ' ')\n a[i - 1] = b[j - 1] = 1\nprint()\n", "'''input\n1\n1 1\n'''\nn = int(input())\ns = []\nh, v = set(), set()\nfor _ in range(n**2):\n\ti = list(map(int, input().split()))\n\ts.append(i)\n\th.add(i[0])\n\tv.add(i[1])\nfor x in range(n**2):\n\tif s[x][0] in h and s[x][1] in v:\n\t\th.remove(s[x][0])\n\t\tv.remove(s[x][1])\n\t\tprint(x+1, end=' ')\n\n\n\n\n\n\n\n\n\n", "n, ans = int(input()), 0\r\nroad_x = [0] * (n+1)\r\nroad_y = [0] * (n+1)\r\nfor i in range(n*n):\r\n a,b=map(int,input().split())\r\n if road_x[a]==road_y[b]==0:\r\n print(i+1, end=' ')\r\n road_x[a]=road_y[b]=1", "n=int(input())\r\na,b=[0,0]*n,[0,0]*n\r\nfor i in range(n*n):\r\n x,y=map(int,input().split())\r\n if a[x]<1>b[y]:a[x]=b[y]=1;print(i+1,end=' ')\r\n", "n=int(input());h=[];v=[]\nfor i in range(n**2):\n\ta,b=map(int,input().split())\n\tif a not in h and b not in v:\n\t\tprint(i+1,end=' ')\n\t\th.append(a)\n\t\tv.append(b)\n", "a = int(input())\r\nb = [[0 for i in range(a)] for i in range(2)]\r\n#try:\r\n# for i in range(a-1):\r\n# x = [0 for i in range(a)]\r\n# a.append(x)\r\nfor i in range(a**2):\r\n x = [int(i) for i in input().split()]\r\n if b[0][x[0]-1] == 0 and b[1][x[1]-1] == 0:\r\n print(i+1, end=' ')\r\n b[0][x[0]-1] = 1\r\n b[1][x[1]-1] = 1\r\n", "import math\r\n\r\ndef rainbow(lst):\r\n #print(len(lst))\r\n ln=int(math.sqrt(len(lst)))\r\n #print(ln)\r\n v1=[0]*(ln+5)\r\n v2=[0]*(ln+5)\r\n ans=[]\r\n #print(v1)\r\n for i in range(len(lst)):\r\n a,b=lst[i][0],lst[i][1]\r\n if min(a,b)<1 or max(a,b)>ln:\r\n return -1\r\n if v1[a]==0 and v2[b]==0:\r\n v1[a]=1\r\n v2[b]=1\r\n ans.append(str(i+1))\r\n return \" \".join(ans)\r\n\r\nn=int(input())\r\nv=[]\r\nfor i in range(n*n):\r\n x,y=map(int,input().split())\r\n v.append([x,y])\r\nprint(rainbow(v))\r\n", "'''\r\nCreated on Oct 11, 2015\r\n\r\n@author: Ismael\r\n'''\r\nn = int(input())\r\nA=n*[False]\r\nB=n*[False]\r\nr=[]\r\ni=1\r\nfor _ in range(n**2):\r\n a,b = map(int,input().split())\r\n if not A[a-1] and not B[b-1]:\r\n A[a-1]=True\r\n B[b-1]=True\r\n r.append(str(i))\r\n i+=1\r\nprint(' '.join(r))", "n = int(input())\r\n\r\nx = []\r\ny = []\r\n\r\nfor i in range(n ** 2):\r\n u = [int(i) for i in input().split()]\r\n if u[0] not in x and u[1] not in y:\r\n x.append(u[0])\r\n y.append(u[1])\r\n print(i + 1, end = \" \")\r\n\r\n \r\n\r\n", "n = int(input())\r\nh = [False] * n\r\nv = [False] * n\r\nresult = [ ]\r\nfor i in range(n * n):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n if not h[a] and not v[b]:\r\n h[a] = v[b] = True\r\n result.append(i + 1)\r\nprint(' '.join(map(str, result)))\r\n", "# ------------------------\r\n# * SirNickolas's Solution\r\n# ------------------------\r\nn = int(input())\r\nh = [False] * n\r\nv = [False] * n\r\nresult = []\r\nfor i in range(n * n):\r\n v_road, h_road = map(int, input().split())\r\n if not h[h_road - 1] and not v[v_road - 1]:\r\n h[h_road - 1] = v[v_road - 1] = True\r\n result += [i + 1]\r\nprint(' '.join(map(str, result)))\r\n\r\n# ----------------------------\r\n# * cgl-fai's Correct Solution\r\n# ----------------------------\r\n# n = int(input())\r\n# hor_roads_repaired = []\r\n# ver_roads_repaired = []\r\n# for i in range(n ** 2):\r\n# hor_road, ver_road = map(int, input().split())\r\n# if hor_road not in hor_roads_repaired and ver_road not in ver_roads_repaired:\r\n# hor_roads_repaired += [hor_road]\r\n# ver_roads_repaired += [ver_road]\r\n# print(i + 1, end=' ')\r\n# print()\r\n", "f2 = lambda : map(int , input().split())\r\nn = int(input())\r\nans = []\r\nstx = set()\r\nsty = set()\r\nx = n * n\r\nfor i in range(x):\r\n x , y = f2()\r\n if x not in stx and y not in sty :\r\n stx.add(x)\r\n sty.add(y)\r\n ans.append(i + 1)\r\n else:\r\n continue\r\n\r\nans.sort()\r\nprint(*ans)", "n = int(input())\r\n\r\nrows = []\r\n\r\ncols = []\r\n\r\nfor i in range(n**2):\r\n h, v = [int(i) for i in input().split()]\r\n #print('\\nlog: ',rows, cols, h, v)\r\n if h not in rows and v not in cols:\r\n print(i+1, end=\" \")\r\n rows.append(h)\r\n cols.append(v)\r\n", "n=int(input())\r\na=[0]*n*n\r\nb=[0]*n*n\r\nfor i in range(n*n):\r\n a[i],b[i]=map(int,input().split())\r\nh=list()\r\nc=[int(i) for i in range(1,n+1)]\r\nd=[int(i) for i in range(1,n+1)]\r\nfor i in range(n*n):\r\n if(c[a[i]-1]!=0 and d[b[i]-1]!=0):\r\n h.append(i+1)\r\n c[a[i]-1]=d[b[i]-1]=0\r\nfor i in h:\r\n print(i,end=' ')", "n = int(input())\r\nhorz = []\r\nvert = []\r\nfor i in range(1,n**2+1):\r\n h,v = map(int,input().split())\r\n if h not in horz and v not in vert:\r\n horz.append(h)\r\n vert.append(v)\r\n print(i,end = ' ')\r\n \r\n", "import sys\nn = int(input())\nvlist = [0] * (n+1)\nhlist = [0] * (n+1)\nans = []\nfor i in range(1,n*n+1):\n v, h = map(int, sys.stdin.readline().split())\n if vlist[v] == 0 and hlist[h] == 0:\n ans.append(i)\n vlist[v] = 1\n hlist[h] = 1\nprint(' '.join([str(a) for a in ans]))\n", "import os,sys,io,math\r\nfrom array import array\r\nfrom math import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nn=IN()\r\na,b,c=[0]*n,[0]*n,[]\r\nfor i in range(n**2):\r\n h,v=map(int,input().split())\r\n if a[h-1]==0 and b[v-1]==0:\r\n c.append(i+1)\r\n a[h-1]=1\r\n b[v-1]=1\r\nprint(*c)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\nn = int(input())\nH = [ 0 for i in range(n) ]\nV = [ 0 for i in range(n) ]\n\ndays = []\nj = 1\n\nfor i in range(n*n):\n (h, v) = (int(i) for i in input().split())\n h -= 1\n v -= 1\n if H[h] == 0 and V[v] == 0:\n H[h] = 1\n V[v] = 1\n days.append(j)\n\n j += 1\n\nstart = time.time()\n\nfor i in days:\n print(i, end=' ')\nprint()\n\nfinish = time.time()\n#print(finish - start)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\nn = int(input()) \r\nhzt = list(0 for x in range(n))\r\nlzt = list(0 for x in range(n))\r\nhgj = list(0 for x in range(n*n)) \r\nlgj = list(0 for x in range(n*n)) \r\nout = \"\"\r\nfor i in range(n*n):\r\n inp = input().split()\r\n hgj[i] = int(inp[0])-1\r\n lgj[i] = int(inp[1])-1\r\n\r\nfor i in range(n*n):\r\n if hzt[hgj[i]] == 0 and lzt[lgj[i]] == 0:\r\n hzt[hgj[i]] = lzt[lgj[i]] = 1\r\n out += f\"{i+1} \"\r\nprint(out) ", "n = int(input())\r\nvert = [False for i in range(n)]\r\ngor = [False for i in range(n)]\r\nfor i in range(n ** 2):\r\n h, v = map(int, input().split())\r\n h -= 1\r\n v -= 1\r\n if not gor[h] and not vert[v]:\r\n gor[h] = True\r\n vert[v] = True\r\n print(i + 1, end=' ')\r\n", "n = int(input())\nroads = [ [ False for _ in range(n) ], [ False for _ in range(n) ] ]\nfor i in range(n**2):\n x, y = map(int, input().split())\n if roads[0][x-1] == False and roads[1][y-1] == False:\n roads[0][x-1] = True\n roads[1][y-1] = True\n print(i+1, end=\" \")", "n = int(input())\r\n\r\nHlist = [0 for i in range(1,100)]\r\nVlist = [0 for i in range(1,100)]\r\n\r\nfor i in range(n*n):\r\n h, v = map(int, input().split())\r\n \r\n if ((Hlist[h] == 0)) and ((Vlist[v] == 0)):\r\n print(i+1)\r\n if h < 100 and h > 0:\r\n Hlist[h] = 1 \r\n if v < 100 and v > 0:\r\n Vlist[v] = 1\r\n\r\n", "n = int(input())\r\n\r\nhor = []\r\nver = []\r\nr = []\r\n\r\nfor i in range(n*n):\r\n a, b = map(int, input().split(\" \"))\r\n if a not in hor and b not in ver:\r\n r.append(i + 1)\r\n hor.append(a)\r\n ver.append(b)\r\n\r\nprint(' '.join(map(str, r)))", "n = int(input())\nx = [0 for _ in range(n)]\ny = [0 for _ in range(n)]\n\nw = []\n\nfor k in range(n ** 2):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n if not (x[a] or y[b]):\n x[a] = 1\n y[b] = 1\n w.append(k + 1)\nif len(w) == 1:\n print(w[0])\nelse:\n for u in w[:-1]:\n print(u, end=' ')\n print(w[-1])\n", "n = int(input())\r\ngor = [False] * (n + 2)\r\nvert = [False] * (n + 2)\r\nans = 0\r\nfor i in range(n ** 2):\r\n a, b = map(int, input().split())\r\n if gor[a] == False and vert[b] == False:\r\n gor[a] = True\r\n vert[b] = True\r\n print(i + 1, end=' ')\r\n \r\n \r\n", "n=int(input())\r\nsa=set()\r\nsb=set()\r\nl=[]\r\nfor i in range(n*n):\r\n a,b=map(int,input().split())\r\n if not(a in sa) and not(b in sb):\r\n l+=[str(i+1)]\r\n sa.add(a)\r\n sb.add(b)\r\nprint(' '.join(l))\r\n", "#!/usr/bin/env python3\nimport itertools, functools, math\n\ndef solve():\n n = int(input())\n rows = [False]*n\n cols = [False]*n\n days = []\n for i in range(1, n*n + 1):\n r, c = map(int, input().split())\n r -= 1\n c -= 1\n if not rows[r] and not cols[c]:\n rows[r] = True\n cols[c] = True\n days.append(i)\n return days\n\nif __name__ == '__main__':\n print(*solve())\n\n", "n = int(input())\nv_done, h_done = [False] * n, [False] * n\nres = []\nfor i in range(n ** 2):\n v, h = (int(i) for i in input().split())\n if v_done[v - 1] == h_done[h - 1] == False:\n res.append(i + 1)\n v_done[v - 1] = h_done[h - 1] = True\nprint(*res)\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n = int(input())\r\n row = [0] * n\r\n col = [0] * n\r\n B = []\r\n for i in range(n * n):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n if row[x] == 0 and col[y] == 0:\r\n B.append(i)\r\n row[x] = 1\r\n col[y] = 1\r\n print(' '.join(list(str(a + 1) for a in B)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nh, v = [True for i in range(n)], [True for i in range(n)]\n\nodpovede = []\nfor den in range(n ** 2):\n h_i, v_i = [int(i) - 1 for i in input().split()]\n if h[h_i] and v[v_i]:\n h[h_i] = False\n v[v_i] = False\n odpovede.append(den + 1)\n\nprint(' '.join(map(str, odpovede)))\n", "n=int(input())\r\n\r\nc = set()\r\nr = set()\r\n\r\nfor i in range(n**2):\r\n x,y = map(int,input().split())\r\n if x not in r and y not in c:\r\n print(i+1)\r\n r.add(x)\r\n c.add(y)\r\n \r\n \r\n", "n = int(input()) \na = list(range(1, n + 1))\nb = list(range(1, n + 1))\nfor i in range(n * n):\n n, m = map(int, input().split())\n if n in a and m in b:\n print(i + 1, end = ' ')\n a.pop(a.index(n))\n b.pop(b.index(m))\n#s = input()\n#c = list(map(int, input().split()))\n", "n=int(input())\r\na,b=[],[]\r\nfor x in range(n**2):\r\n\tc,d=map(int,input().split())\r\n\tif (c not in a) and (d not in b):\r\n\t\ta.append(c);b.append(d)\r\n\t\tprint(x+1,end=\" \")", "n = int(input()); roadg = []; roadv = []; days = []\r\nli = [ [0,0] for i in range(n*n)]\r\nfor i in range(n*n):\r\n li[i][0],li[i][1] = input().split()\r\nfor i in range(n*n):\r\n if ((li[i][0] not in roadg) and (li[i][1] not in roadv)):\r\n roadg.append(li[i][0])\r\n roadv.append(li[i][1])\r\n days.append(i+1)\r\nprint(' '.join(map(str, days)))\r\n \r\n \r\n", "n = int(input())\r\nx = []\r\ny = []\r\ndates = []\r\n\r\nfor i in range(n*n):\r\n a,b = map(int,input().split())\r\n if a not in x and b not in y:\r\n x.append(a)\r\n y.append(b)\r\n dates.append(str(i+1))\r\n\r\nprint(' '.join(dates))\r\n", "n = int(input())\r\ndays = []\r\nH,V = [0 for j in range(n)] ,[0 for x in range(n)]\r\nfor i in range(1,(n**2)+1):\r\n\th,v = map(int, input().split())\r\n\tif H[h-1] == 0 and V[v-1] == 0:\r\n\t H[h-1] = V[v-1] = 1\r\n\t days.append(i)\r\nprint(*sorted(days), sep=' ')", "n=int(input())\r\nh=[0 for i in range(n+1)]\r\nv=[0 for i in range(n+1)]\r\nans=[]\r\nfor i in range(n*n):\r\n x,y=map(int,input().split())\r\n if h[x]==0 and v[y]==0:\r\n ans.append(i+1)\r\n h[x]=1\r\n v[y]=1\r\nprint(*ans)", "#!/usr/bin/env python3.4\n\nimport time\n\nCOL, ROW, LEN = 1000, 1000, 26\nmatrix = [[0] * COL for i in range(ROW)]\narr = [0] * LEN\n\ndirection = ((0, -1), (-1, 0), (0, 1), (1, 0))\n\n\nclass Pair:\n def __init__(self, x, y):\n self.x = x\n self.y = y\n\n\ndef timer(func, *pargs, **kargs):\n start = time.time()\n func(*pargs, **kargs)\n return time.time() - start\n\n\ndef test(a):\n answer = 0\n for value in a:\n if value >= 0:\n answer += value\n return answer\n\n\nif __name__ == \"__main__\":\n n = int(input())\n ls = list()\n matrix = [[0] * n for i in range(n)]\n for i in range(n * n):\n x, y = map(int, input().split())\n if matrix[x - 1][y - 1] == 0:\n for j in range(n):\n matrix[x - 1][j] = 1\n matrix[j][y - 1] = 1\n ls.append(i + 1)\n print(\" \".join(map(str, ls)))\n", "n = int(input())\r\nhh = [0]*n\r\nvv = [0]*n\r\n\r\nret = []\r\nfor i, (h, v) in enumerate(map(int, input().split()) for _ in range(n*n)):\r\n if not hh[h-1] and not vv[v-1]:\r\n ret.append(str(i+1))\r\n hh[h-1] = 1\r\n vv[v-1] = 1\r\n\r\nprint(' '.join(ret))\r\n", "n = int(input())\nX = [0 for i in range(n)]\nY = [0 for i in range(n)]\nfor i in range(n ** 2):\n x, y = map(int, input().split())\n if X[x - 1] + Y[y - 1] == 0:\n X[x - 1] = 1\n Y[y - 1] = 1\n print(i + 1)\n", "#!/usr/bin/env python\n\nfrom sys import stdin\n\nn = int(stdin.readline())\nhorizontal_roads = [False] * n\nvertical_roads = [False] * n\n\nwork_days = []\n\nfor i in range(n*n):\n h, v = (int(x)-1 for x in stdin.readline().split())\n if not horizontal_roads[h] and not vertical_roads[v]:\n work_days.append(i+1)\n horizontal_roads[h] = True\n vertical_roads[v] = True\n\nprint(\" \".join(str(x) for x in work_days))\n", "n = int(input())\r\nv = [0]*(n+1)\r\nh = [0]*(n+1)\r\ni = 1\r\nwhile (i<=n*n):\r\n a,b=map(int,input().split())\r\n if v[a]==0 and h[b]==0:\r\n v[a]=h[b]=1\r\n print(i,sep=' ',end=' ')\r\n i+=1\r\n", "n = int(input())\r\na = []\r\nb = []\r\nc = []\r\nfor i in range(n**2):\r\n d, e = map(int,input().split())\r\n if d in a or e in b:\r\n continue\r\n else:\r\n a.append(d)\r\n b.append(e)\r\n c.append(str(i+1))\r\nprint(' '.join(c))", "t = int(input())**2\r\ntable1=[]\r\ntable2=[]\r\nans=[]\r\n\r\nfor i in range(t):\r\n l1 = [int(x) for x in input().split()]\r\n if l1[0] in table1 or l1[1] in table2:\r\n pass\r\n else:\r\n table1.append(l1[0])\r\n table2.append(l1[1])\r\n ans.append(i+1)\r\n\r\nprint(*ans)", "n = int(input())\r\nA = [0 for i in range(n)]\r\nB = [0 for i in range(n)]\r\nday = 1\r\nresult = []\r\nfor i in range(n ** 2):\r\n nowA, nowB = [int(i) for i in input().split()]\r\n if A[nowA - 1] == 0 and B[nowB - 1] == 0:\r\n result.append(day)\r\n A[nowA - 1] = 1\r\n B[nowB - 1] = 1\r\n day += 1\r\nfor i in result:\r\n print(i, end = ' ')\r\n ", "n=int(input())\r\nh=[False for i in range(n+1)]\r\nv=[False for j in range(n+1)]\r\nfor j in range(n*n):\r\n\thh, vv=map(int, input().split())\r\n\tif {h[hh], v[vv]}=={False}:\r\n\t\tprint(j+1, end=' ')\r\n\t\th[hh]=True; v[vv]=True\r\n\r\n", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n line_h = [1] * n\r\n line_v = [1] * n\r\n value = list()\r\n for i in range(n * n):\r\n h, v = str(input()).split()\r\n h = int(h) - 1\r\n v = int(v) - 1\r\n if line_h[h] and line_v[v]:\r\n line_h[h] = 0\r\n line_v[v] = 0\r\n value.append(str(i + 1))\r\n print(' '.join(value))\r\n", "n=int(input())**2+1\r\na=[0]*n\r\nb=[0]*n\r\nfor i in range(1,n):\r\n c,d=map(int,input().split())\r\n if a[c]+b[d]==0:\r\n print(i,end=\" \")\r\n a[c]=1\r\n b[d]=1", "n = int(input())\r\nroads = []\r\nfor i in range(n):\r\n roads.append([0]*n)\r\nans = []\r\nfor i in range(n ** 2):\r\n r, c = map(int, input().split())\r\n t = 0\r\n for j in range(n):\r\n t += roads[r - 1][j]\r\n t += roads[j][c - 1]\r\n if t == 0:\r\n ans.append(i + 1)\r\n roads[r - 1][c - 1] = 1\r\nprint(' '.join(map(str, ans)))\r\n", "n = int(input())\r\nvRoad = []\r\nhRoad = []\r\ndays = []\r\nfor i in range (0, n + 1):\r\n vRoad.append(0)\r\n hRoad.append(0)\r\n\r\nintersections = n * n\r\nfor i in range (0, intersections):\r\n a, b = [int(x) for x in input().split()]\r\n if hRoad[a] == 0 and vRoad[b] == 0:\r\n hRoad[a] = 1\r\n vRoad[b] = 1\r\n days.append(i + 1)\r\n\r\nfor day in days:\r\n print(day, end=\" \")", "import sys\n\n\n#sys.stdin = open(\"input.txt\")\n#sys.stdout = open(\"output.txt\", \"w\")\n\nn = int(input())\n\nvert = [False for i in range(n)]\ngor = [False for i in range(n)]\n\nfor i in range(n ** 2):\n\tx, y = [int(i) - 1 for i in input().split()]\n\tif not vert[x] and not gor[y]:\n\t\tvert[x] = True\n\t\tgor[y] = True\n\t\tprint(i + 1, end = ' ')\n\nprint()", "import sys\n\nn = int(input())\nhn = [0] * (n+1)\nvn = [0] * (n+1)\n\nresult = []\nfor i in range(1, n*n+1):\n h, v = map(int, sys.stdin.readline().split())\n if hn[h] == 0 and vn[v] == 0:\n result.append(i)\n hn[h] = 1\n vn[v] = 1\n\nprint(\" \".join(str(i) for i in result))\n", "X = int(input())\r\nV = list()\r\nH = list()\r\nfor i in range(X ** 2):\r\n Roads = list(map(int, input().split()))\r\n if (Roads[0] not in H) and (Roads[1] not in V):\r\n print(i + 1, end=\" \")\r\n H.append(Roads[0])\r\n V.append(Roads[1])\r\n", "n = int(input())\r\n\r\nh = [0] * n\r\nv = [0] * n\r\n\r\ndays = []\r\nfor i in range(n**2):\r\n\troads = [int(i) for i in input().split()]\r\n\tj, k = roads[0]-1, roads[1]-1\r\n\t\r\n\tif h[j]==0 and v[k]==0:\r\n\t\th[j] = 1\r\n\t\tv[k] = 1\r\n\t\tdays.append(str(i+1))\r\n\r\nprint(\" \".join(days))", "n=int(input())\r\nl,b,c,ans=n*[0],n*[0],0,[]\r\n# print(l,b)\r\nfor i in range(1,n*n+1):\r\n x,y=map(int,input().split())\r\n if l[x-1]==0 and b[y-1]==0:\r\n ans.append(i)\r\n l[x-1]=1 \r\n b[y-1]=1\r\nprint(*ans)", "n = int(input())\r\ndh = dict()\r\ndv = dict()\r\nans = []\r\nfor i in range(n):\r\n dh[str(i + 1)] = 0\r\n dv[str(i + 1)] = 0\r\nfor i in range(n * n):\r\n a, b = [int(x) for x in input().split()]\r\n if dh[str(a)] == 0 and dv[str(b)] == 0:\r\n ans.append(i + 1)\r\n dh[str(a)] = 1\r\n dv[str(b)] = 1\r\nprint(*ans)", "n = int(input())\r\nhor=[0]*(n+1)\r\nver=[0]*(n+1)\r\nans=[]\r\nfor i in range(1,n*n+1):\r\n a,b=map(int,input().split())\r\n if hor[a]==0 and ver[b]==0:\r\n ans.append(i)\r\n hor[a]=1\r\n ver[b]=1\r\nprint(*ans) ", "N = int(input())\npaintH = set()\npaintV = set()\nd = 0\nres = []\nfor i in range(N):\n for j in range(N):\n d += 1\n h, v = map(int, input().split())\n if h not in paintH and v not in paintV:\n paintH.add(h)\n paintV.add(v)\n res.append(str(d))\n\nprint(\" \".join(res))\n", "\r\n\r\ndata = int(input())\r\n\r\nvert = set([])\r\nhor = set([])\r\n\r\nresult = []\r\n\r\nfor i in range(1, (data * data) + 1):\r\n a, b = map(int, input().split(\" \"))\r\n\r\n\r\n if a not in vert and b not in hor:\r\n result.append(i)\r\n vert.add(a)\r\n hor.add(b)\r\n\r\n\r\n\r\nprint(*result, sep = ' ')", "\r\nn=int(input())\r\nx=[]\r\ny=[]\r\nk=0\r\nans=\"\"\r\nfor i in range(n*n):\r\n s=[int(j) for j in input().split(\" \")]\r\n h=s[0]\r\n v=s[1]\r\n if h not in y and v not in x:\r\n y.append(h)\n x.append(v)\r\n ans=ans+str(i+1)+\" \" \r\nprint(ans)", "n = int(input())\nv, h = [0]*(n+1), [0]*(n+1)\nr = []\nfor i in range(n*n):\n [hi, vi] = list(map(int, input().split(\" \")))\n if h[hi]+v[vi] == 0:\n h[hi], v[vi] = 1, 1\n r.append(i+1)\nprint(*r)\n", "n = int(input())\r\nhor, ver = set(), set()\r\nr = []\r\nfor i in range(n**2):\r\n a, b = map(int, input().split())\r\n if a not in hor and b not in ver:\r\n r.append(i + 1)\r\n hor.add(a)\r\n ver.add(b)\r\nprint(' '.join(map(str, r)))", "import sys\nInput=lambda:map(int,sys.stdin.readline().split())\n\nn = int(sys.stdin.readline())\nres = list()\nTmph = dict()\nTmpv = dict() \nfor i in range(n*n):\n h,v = Input()\n if Tmph.get(h,-1) == -1 and Tmpv.get(v,-1)==-1:\n res.append(i+1)\n Tmph[h] = 1\n Tmpv[v] = 1\nprint(*res)\n", "n = int(input())\r\nh = set()\r\nv = set()\r\nr = []\r\nfor i in range(n ** 2):\r\n a, b = (int(j) for j in input().split())\r\n if a not in h and b not in v:\r\n r.append(i + 1)\r\n h.add(a)\r\n v.add(b)\r\nprint(\" \".join(str(i) for i in r))", "n = int(input())\r\nhor = []\r\nver = []\r\nans = []\r\nfor i in range(1, n*n + 1):\r\n s = input().split()\r\n if s[0] not in hor and s[1] not in ver:\r\n ans.append(i)\r\n hor.append(s[0])\r\n ver.append(s[1])\r\n \r\nfor i in ans:\r\n print(i, end = ' ')\r\n \r\n \r\n", "n=int(input())\r\nh=[]\r\nv=[]\r\nd=[]\r\nfor i in range(n*n):\r\n a,b=map(int,input().split())\r\n if a not in h and b not in v:\r\n h.append(a)\r\n v.append(b)\r\n d.append(i+1)\r\nfor i in d:\r\n print(i,end=\" \")", "n=int(input())\r\nrow=[False]*(n+1)\r\ncol=[False]*(n+1)\r\nans=[]\r\nfor i in range(n*n):\r\n h,v=map(int,input().split())\r\n if not(row[h] or col[v]):\r\n row[h]=True\r\n col[v]=True\r\n ans.append(i+1)\r\nprint(' '.join(map(str,ans)))", "n=int(input())\r\ns=[]\r\nfor _ in range(n*n):\r\n v=input().split()\r\n s.append((v[0],v[1]))\r\nph=set()\r\npv=set()\r\nfor i in range(1,n*n+1):\r\n sh,sv=s[i-1]\r\n if (sh not in ph) and (sv not in pv):\r\n print(i,end=' ')\r\n ph.add(sh);pv.add(sv)\r\n", "z=set();z1=set()\r\nfor i in range(int(input())**2):\r\n a,b=map(int,input().split())\r\n if a not in z and b not in z1:print(i+1);z.add(a);z1.add(b)\r\n", "count = int(input())\r\nhorizontal = []\r\nvertical = []\r\nfor i in range(count*count):\r\n\th,v = map(int, input().split())\r\n\tif not(h in horizontal or v in vertical):\r\n\t\thorizontal.append(h)\r\n\t\tvertical.append(v)\r\n\t\tprint(i+1)\r\n", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range (n):\r\n\ta.append(False)\r\nfor i in range (n):\r\n\tb.append(False)\r\nfor i in range (n*n):\r\n\tx,y = [int(x) for x in input().split()]\r\n\tif(a[x-1] == False and b[y-1] == False):\r\n\t\tprint (i+1, end = ' ')\r\n\t\ta[x-1] = True\r\n\t\tb[y-1] = True\r\n", "n = int(input())\r\nh1 = []\r\nv1 = []\r\nh = 0\r\nv = 0\r\ns = []\r\nd = ''\r\nfor i in range(n*n):\r\n s = input().split()\r\n h = int(s[0])\r\n v = int(s[1])\r\n if h not in h1 and v not in v1:\r\n h1.append(h)\r\n v1.append(v)\r\n d+=str(i+1) + ' '\r\nprint(d)\r\n", "n = int(input())\r\ndata = [list(map(int, input().split())) for _ in range(n * n)]\r\n\r\nrchk = [False] * (n + 1)\r\ncchk = [False] * (n + 1)\r\nfor i in range(n * n):\r\n if not rchk[data[i][0]] and not cchk[data[i][1]]:\r\n rchk[data[i][0]] = True\r\n cchk[data[i][1]] = True\r\n print(i + 1, end=' ')", "n = int(input())\nres = ''\nh = []\nv = []\nfor i in range(1, n**2+1):\n crossroad = tuple(map(int, input().split(' ')))\n if not ((crossroad[0] in h) or (crossroad[1] in v)):\n h.append(crossroad[0])\n v.append(crossroad[1])\n res += str(i) + ' '\n else:\n continue\nprint(res.strip())", "n = int(input())\r\nh = [0 for i in range(n+1)]\r\nv = [0 for i in range(n+1)]\r\nans = []\r\nfor i in range(n*n):\r\n x,y = map(int,input().split())\r\n if not h[x] and not v[y]:\r\n ans.append(i+1)\r\n h[x] = 1; v[y] = 1\r\nprint(*ans)", "n = int(input())\r\narr = list()\r\nfor i in range(n):\r\n arr.append([False] * n)\r\n\r\nl = list()\r\nk = 1\r\nfor i in range(n ** 2):\r\n h, v = map(int, input().split())\r\n h -= 1\r\n v -= 1\r\n if not arr[h][v]:\r\n for j in range(n):\r\n arr[h][j] = True\r\n arr[j][v] = True\r\n l.append(k)\r\n k += 1\r\n\r\nfor i in l:\r\n print(i, end=\" \")", "n = int(input())\r\nn2 = n ** 2\r\n\r\nvd = [0] * n\r\nhd = [0] * n\r\n\r\nfor i in range(n2):\r\n h, v = map(int, input().split())\r\n h -= 1\r\n v -= 1\r\n if (vd[v] == 0 and hd[h] == 0):\r\n vd[v], hd[h] = 1, 1\r\n print(i + 1, end = ' ')\r\nprint()\r\n\r\n", "X,Y=[],[]\r\nfor i in range(int(input())**2):\r\n x,y=map(int,input().split())\r\n if x not in X and y not in Y:\r\n print(i+1,end=\" \")\r\n X.append(x)\r\n Y.append(y)", "n = int(input().strip())\r\ngarizontal = []\r\nvertical = []\r\ngarizontal1 = []\r\nvertical1 = []\r\notvet = []\r\nfor i in range(n**2):\r\n ll = list(map(int,input().split()))\r\n garizontal.append(ll[0])\r\n vertical.append(ll[1])\r\nfor i in range(n**2):\r\n if garizontal[i] not in garizontal1 and vertical[i] not in vertical1:\r\n garizontal1.append(garizontal[i])\r\n vertical1.append(vertical[i])\r\n otvet.append(str(i+1))\r\nprint(' '.join(otvet))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na, b, d = [], [], []\r\nfor i in range(n**2):\r\n h, v = input()[:-1].split()\r\n if h not in a and v not in b:\r\n d.append(i+1)\r\n a.append(h)\r\n b.append(v)\r\nprint(' '.join(map(str, d)))", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\nsys.setrecursionlimit(99999)\r\n\r\n\r\nn, = map(int,sys.stdin.readline().split())\r\nsr = set()\r\nsc = set()\r\nfor i in range(1,n*n+1):\r\n r,c = map(int, sys.stdin.readline().split())\r\n if r in sr or c in sc:\r\n continue\r\n else:\r\n print(i,end=\" \")\r\n sr.add(r)\r\n sc.add(c)\r\n\r\n\r\n", "x= int(input())**2\ninter=[input().split() for i in range(x)]\n\ntoken_0=[]\ntoken_1=[]\ndays=[]\nfor i in range(x):\n if(inter[i][0] not in token_0 and inter[i][1] not in token_1):\n token_0.append(inter[i][0])\n token_1.append(inter[i][1])\n days.append(i + 1)\n\nprint(\" \".join(map(str,sorted(days))))", "R = lambda:list(map(int,input().split()))\r\nn = int(input())\r\nl,k = [],[]\r\nfor i in range(n*n):\r\n\tn,m = R()\r\n\tif n not in l and m not in k:print(i+1,end=\" \");l.append(n);k.append(m)", "a=[]\r\nb=[]\r\nc=[]\r\nd=[]\r\nfor i in range(int(input())**2):\r\n\ta+=[list(map(int,input().split()))]\r\nfor i,j in a:\r\n\tif i not in b and j not in c:\r\n\t\tb+=[i]\r\n\t\tc+=[j]\r\n\t\tprint(a.index([i,j])+1,end=' ')", "class CodeforcesTask583ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.schedule = []\n\n def read_input(self):\n self.n = int(input())\n for x in range(self.n ** 2):\n self.schedule.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n vertical = [False for x in range(self.n)]\n horizontal = [False for x in range(self.n)]\n workdays = []\n for x in range(self.n ** 2):\n if not vertical[self.schedule[x][0] - 1] and not horizontal[self.schedule[x][1] - 1]:\n workdays.append(x + 1)\n vertical[self.schedule[x][0] - 1] = True\n horizontal[self.schedule[x][1] - 1] = True\n self.result = \" \".join([str(x) for x in workdays])\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask583ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\n\r\ndone_h = set()\r\ndone_v = set()\r\n\r\ndays = []\r\nfor i in range(n * n):\r\n h, v = map(int, input().split(\" \"))\r\n if (h not in done_h) and (v not in done_v):\r\n done_h.add(h)\r\n done_v.add(v)\r\n days.append(i + 1)\r\n\r\nprint(*days)\r\n", "n = int(input())\r\nk = []\r\na,b = [],[]\r\nfor i in range(n**2):\r\n x, y = map(int,input().split())\r\n if x not in a and y not in b:\r\n k.append(i+1)\r\n a.append(x)\r\n b.append(y)\r\nprint(*k)", "n = int(input())\r\n\r\nS1 = set()\r\nS2 = set()\r\nans = list()\r\n\r\nfor i in range(1, n*n+1) :\r\n h,v = map(int, input().split())\r\n if h in S1 or v in S2 :\r\n continue\r\n else :\r\n S1.add(h)\r\n S2.add(v)\r\n ans.append(i)\r\n\r\nfor i in ans :\r\n print(i, end = ' ')\r\n", "if __name__ == '__main__':\n n = int(input())\n nums = [[0] * n for i in range(n)]\n\n ans = list()\n for x in range(n ** 2):\n i, j = map(int, input().split())\n if nums[i-1][j-1] == 0:\n for a in range(1, n + 1):\n nums[i-1][a-1] += 1\n for a in range(1, n + 1):\n nums[a-1][j-1] += 1\n ans.append(str(x + 1))\n print(' '.join(ans))\n\n \t\t\t\t \t\t \t\t\t\t \t \t \t \t \t\t\t\t \t", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn = int(input())\r\nv = [0] * (n+1)\r\nh = [0] * (n+1)\r\nans = []\r\nfor i in range(n*n):\r\n\tth, tv = [int(x) for x in input().split()]\r\n\tif not(v[tv] or h[th]):\r\n\t\tv[tv] = 1\r\n\t\th[th] = 1\r\n\t\tans.append(i+1)\r\nprint(\" \".join(map(str, ans)))\r\n", "n = int(input())\r\nh_0 = {}\r\nv_0 = {}\r\nfor i in range(n ** 2):\r\n h, v = map(int,input().split())\r\n if h not in h_0 and v not in v_0:\r\n print(i +1, end = ' ')\r\n h_0[h] = 1\r\n v_0[v] = 1\r\n ", "n = int(input())\nrs = [0 for i in range(n+1)]\ncs = [0 for i in range(n+1)]\ns = \"\"\nfor i in range(n**2):\n r, c = map(int, input().split())\n if rs[r] == 0 and cs[c] == 0:\n rs[r] = 1\n cs[c] = 1\n s += str(i+1)+\" \"\nprint(s)\n \n", "n = int(input())\na, b, c = [False] * n, [False] * n, []\nfor k in range(n ** 2):\n i, j = map(int, input().split())\n if a[i - 1] == False and b[j - 1] == False:\n c.append(k + 1)\n a[i - 1], b[j - 1] = True, True\nprint(*c)", "N=int(input())\r\nRoadx=[0]*120\r\nRoady=[0]*100\r\nfor i in range(1,N*N+1):\r\n x,y=input().split()\r\n x=int(x)\r\n y=int(y)\r\n if(Roadx[x]==0 and Roady[y]==0):\r\n print(i,end=' ')\r\n Roadx[x]=Roady[y]=1\r\n", "n = int(input())\r\nkruispunten = []\r\nhorizontaal = set()\r\nverticaal = set()\r\ndagen = []\r\n\r\nfor i in range(0, n**2 ):\r\n kruispunten.append(list(map(int, input().split(\" \"))))\r\n\r\nfor j in range(0, n**2 ):\r\n if kruispunten[j][0] in horizontaal or kruispunten[j][1] in verticaal:\r\n pass\r\n else:\r\n horizontaal.add(kruispunten[j][0])\r\n verticaal.add(kruispunten[j][1])\r\n dagen.append(j+1)\r\n\r\n\r\nfor x in dagen:\r\n print(x, end=\" \")\r\n", "n = int(input())\n\na = [[0 for i in range(n)] for j in range(n)]\n\ndef fillcol(a, x):\n for i in range(len(a)):\n a[i][x] = 1\n\ndef fillrow(a, y):\n for i in range(len(a)):\n a[y][i] = 1\n\nmylist = list()\nfor i in range(n * n):\n x, y = list(map(int, input().split()))\n if a[y-1][x-1] == 0:\n mylist.append(i+1)\n fillcol(a, x - 1)\n fillrow(a, y - 1)\n\nprint(' '.join([str(item) for item in mylist]))\n", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n\r\nn = int(input())\r\nH = [False for i in range(n+1)]\r\nV = [False for i in range(n+1)]\r\nans = []\r\n\r\nfor i in range(n**2):\r\n h,v = map(int,input().split())\r\n if not H[h] and not V[v]:\r\n H[h] = True\r\n V[v] = True\r\n ans.append(i+1)\r\nprint(' '.join(map(str,ans)))\r\n", "n = int(input())\npaved_rows = set()\npaved_columns = set()\nresult = []\nfor i in range(n * n):\n r, c = map(int, input().split())\n if r in paved_rows or c in paved_columns:\n continue\n result.append(i + 1)\n paved_rows.add(r)\n paved_columns.add(c)\nprint(' '.join(map(str, result)))\n", "def solve(arr,n):\n h=[arr[0][0]]\n v=[arr[0][1]]\n res=[1]\n for i in range(1,n**2):\n if arr[i][0] not in h and arr[i][1] not in v:\n res.append(i+1)\n h.append(arr[i][0])\n v.append(arr[i][1])\n return res\n\n\n\n\n\ndef main():\n n = int(input())\n arr = []\n for _ in range(n**2):\n arr.append(list(map(int, list(input().split(\" \")))))\n print(*solve(arr,n))\n\nmain()", "if __name__ == '__main__':\n n = int(input())\n ans = list()\n row = [0] * n\n col = [0] * n\n for x in range(n ** 2):\n i, j = map(int, input().split())\n i, j = i - 1, j - 1\n if row[i] == 0 and col[j] == 0:\n row[i] += 1\n col[j] += 1\n ans.append(x + 1)\n print(' '.join([str(x) for i, x in enumerate(ans)]))\n\n\t\t\t\t \t \t \t\t \t \t \t \t \t\t", "from collections import Counter,defaultdict\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nd=defaultdict(int);e=defaultdict(int)\r\nfor i in range(I()**2):\r\n n,k=M()\r\n if d[n]==0 and e[k]==0:\r\n print(i+1,end=\" \")\r\n d[n]=1;e[k]=1\r\n", "r, rr, res = [],[],[]\r\nfor i in range((int(input()))**2):\r\n k, kk = map(int,input().split())\r\n if k not in r and kk not in rr:\r\n r.append(k); rr.append(kk)\r\n res.append(i+1)\r\nprint(*res)", "n=int(input())\nhor=set()\nver=set()\nres=[]\nfor i in range(n*n):\n\th,v=map(int, input().split())\n\tif (h not in hor) and (v not in ver):\n\t\tres.append(str(i+1))\n\t\thor.add(h)\n\t\tver.add(v)\nprint(\" \".join(res))", "nb_roads = int(input())\r\nH = [0] * nb_roads\r\nV = [0] * nb_roads\r\nans = []\r\nfor i in range(nb_roads * nb_roads):\r\n h, v = [int(x) for x in input().split()]\r\n if h in H or v in V:\r\n continue\r\n else: \r\n H.append(h)\r\n V.append(v)\r\n ans.append(i+1)\r\nprint(*ans) \r\n", "a=int(input())\r\nb=[]\r\nc=[]\r\nd=[]\r\nfor i in range(a**2):\r\n *e,=map(int,input().split())\r\n if e[0]in b or e[1]in c:\r\n continue\r\n else:\r\n d+=[i+1]\r\n b+=[e[0]]\r\n c+=[e[1]]\r\nprint(' '.join(map(str,d)))\r\n", "n = int(input())\nhs = [0] * n\nvs = [0] * n\ndays = []\n\nfor i in range(n*n):\n h, v = [int(i) for i in input().split()]\n if not hs[h-1] and not vs[v-1]:\n hs[h-1] = 1\n vs[v-1] = 1\n days.append(i+1)\n\nfor i in days:\n print(i, end=\" \")\nprint()", "from math import ceil\r\nday=int(input())\r\nhorizontal=[]\r\nvertical=[]\r\nwork_days=[]\r\nfor i in range(day**2):\r\n hr,vr=map(int,input().split())\r\n if hr not in horizontal and vr not in vertical :\r\n horizontal.append(hr) \r\n vertical.append(vr)\r\n work_days.append(i+1)\r\nfor i in range(len(work_days)):\r\n print(work_days[i],end=\" \")", "from collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\n \r\n \r\ninp =lambda: int(input())\r\nstrng =lambda: input().strip()\r\njn =lambda x,l: x.join(map(str,l))\r\nstrl =lambda: list(input().strip())\r\nmul =lambda: map(int,input().strip().split())\r\nmulf =lambda: map(float,input().strip().split())\r\narr =lambda: list(map(int,input().strip().split()))\r\n \r\ndef main():\r\n t=inp()\r\n rowset={0}\r\n colset={0}\r\n ans=[]\r\n for i in range((t*t)):\r\n n,m=mul()\r\n if(n not in rowset):\r\n if(m not in colset):\r\n rowset.add(n)\r\n colset.add(m)\r\n ans.append(i+1)\r\n print(*ans)\r\n \r\n \r\nif __name__==\"__main__\":\r\n main()", "N = int(input())\nhs = set([])\nvs = set([])\nans = []\nfor i in range(N ** 2):\n h, v = map(int, input().split())\n if h in hs or v in vs:\n continue\n hs.add(h)\n vs.add(v)\n ans.append(i + 1)\nprint(\" \".join(map(str, ans)))\n", "hm = int(input())\r\nhm2 = hm*hm\r\n\r\nrows = []\r\ncols = []\r\nlis = []\r\n\r\nfor i in range(1, hm+1):\r\n rows.append(i)\r\n cols.append(i)\r\n\r\nfor i in range(1, hm2+1):\r\n row, col = input().split(\" \")\r\n row = int(row)\r\n col = int(col)\r\n\r\n if row in rows and col in cols:\r\n lis.append(i)\r\n rows.remove(row)\r\n cols.remove(col)\r\n\r\nprint(*lis, sep=' ')\r\n", "a = int(input())\r\nx = []\r\ny = []\r\nres = []\r\n\r\nfor i in range(a**2):\r\n a = [i for i in input().split()]\r\n if a[0] not in x and a[1] not in y:\r\n res.append(int(i)+1)\r\n x.append(a[0])\r\n y.append(a[1])\r\n\r\nprint(*res)", "n=int(input())\r\na=[0]*(n+1)\r\nb=[0]*(n+1)\r\nans=[]\r\nfor i in range(1,n*n+1):\r\n x,y=map(int,input().split())\r\n if a[x]+b[y]==0: ans+=[str(i)]; a[x]=1; b[y]=1\r\nprint(' '.join(ans))", "n = int(input())\r\n\r\nhl = []\r\nvl = []\r\nz = []\r\n\r\nfor i in range(n**2):\r\n a,b = map(int, input().split())\r\n if a in hl or b in vl:\r\n pass\r\n else:\r\n z.append(str(i+1))\r\n hl.append(a)\r\n vl.append(b)\r\nprint(' '.join(z))\r\n", "n = int(input())\r\nx = [0 for x in range(n)]\r\ny = x.copy()\r\nz = []\r\nfor i in range(n*n):\r\n a = input()\r\n a = a.split()\r\n a = [int(x)-1 for x in a]\r\n # a.sort()#; print(a)\r\n h, v = a\r\n if x[h] + y[v] == 0:\r\n z.append(i+1)\r\n x[h], y[v] = 1, 1\r\n\r\nfor i in z:\r\n print(i, end=' ')", "n = int(input())\r\nhorizontal = set()\r\nvertical = set()\r\n\r\nfor i in range(n*n):\r\n h, v = map(int, input().split())\r\n if h not in horizontal and v not in vertical:\r\n horizontal.add(h)\r\n vertical.add(v)\r\n print(i+1, end=' ')\r\n", "n = int(input())\r\nn = n*n\r\nh = []\r\nv = []\r\nans = []\r\nfor i in range(n):\r\n\ta,b = map(int,input().split())\r\n\tif a not in h and b not in v:\r\n\t\th.append(a)\r\n\t\tv.append(b)\r\n\t\tans.append(i+1)\r\n\r\na = ' '.join(str(e) for e in ans)\r\nprint(a)", "n=int(input())\r\nv={}\r\nh={}\r\nans=[]\r\nfor i in range(n**2):\r\n a,b=map(int,input().split())\r\n if a not in v.keys():\r\n v[a]=-1\r\n if b not in h.keys():\r\n h[b]=-1\r\n if v[a]==-1 and h[b]==-1:\r\n ans.append(i+1)\r\n v[a]+=1\r\n h[b]+=1\r\nprint(*ans)\r\n", "n = int(input())\r\nys = [False for i in range(n)]\r\nxs = [False for i in range(n)]\r\nres = []\r\n\r\nfor i in range(1, n*n+1):\r\n x, y = map(int, input().split(' ')[:2])\r\n x -= 1\r\n y -= 1\r\n if not ys[y] and not xs[x]:\r\n res.append(i)\r\n ys[y] = True\r\n xs[x] = True\r\n\r\nprint(*res)\r\n", "n =int(input())\na=list(list(False for i in range(n)) for j in range(n))\nt=0\ns=''\nfor k in range(n*n):\n\tt+=1\n\th,v=map(int,input().split())\n\tif a[h-1][v-1]==False:\n\t\ts+=str(t)+' '\n\t\tfor l in range(n):\n\t\t\ta[h-1][l]=True\n\t\t\ta[l][v-1]=True\nprint(s[:-1])\n", "n,l1,l2=int(input()),[],[]\r\nfor i in range(n*n):\r\n\tx,y=input().split()\r\n\tif x not in l1 and y not in l2:\r\n\t\tprint(i+1,end=' ')\r\n\t\tl1.append(x)\r\n\t\tl2.append(y)", "#!/usr/bin/python3\n\nimport itertools as ittls\nfrom collections import Counter\n\nfrom pprint import pprint as pprint\n\nimport re\nimport math\n\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\n\nN = int(input())\n\nmaskrow = [0]*N\nmaskcol = [0]*N\nres = []\n\nfor i in range(N*N):\n x, y = inputarray(lambda x: int(x) - 1)\n\n if maskrow[x] == 0 and maskcol[y] == 0:\n res.append(i)\n\n maskrow[x] = 1\n maskcol[y] = 1\n\nprint( ' '.join(map(lambda x: str(x + 1), res)) )\n", "n = int(input())\n\ntmp_h = [False]*(n+1)\ntmp_v = [False]*(n+1)\n\nanswer = []\nfor i in range(1, n**2+1):\n\th, v = map(lambda x: int(x)-1, input().split())\n\tif not tmp_h[h] and not tmp_v[v]:\n\t\ttmp_h[h] = True\n\t\ttmp_v[v] = True\n\t\tanswer.append(i)\n\nprint(' '.join(map(str, answer)))", "n = int(input())\r\nHseen, Vseen = [0] * n, [0] * n\r\nfor i in range(n ** 2):\r\n v, h = map(int, input().split())\r\n if Vseen[v - 1] == 0 and Hseen[h - 1] == 0:\r\n print(i + 1, end=' ')\r\n Vseen[v - 1] = Hseen[h - 1] = 1\r\n" ]

[ "n, ro, re, oe = int(input()), int(input()), int(input()), int(input())\r\nd, a, c, b = {0: ro, 1: re, 2: oe}, [ro, re, oe], 0, [0, 1]\r\nfor i in range(n - 1):\r\n if d[b[0]] >= d[b[1]]:\r\n c += d[b[1]]\r\n b.append(3 - sum(b))\r\n b.remove(b[0])\r\n else:\r\n c += d[b[0]]\r\n b.append(3 - sum(b))\r\n b.remove(b[1])\r\nprint(c)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif min(a,b,c)==a or min(a,b,c)==b or n==1:\r\n print(min(a,b)*(n-1))\r\nelse:\r\n print(min(a,b)+(c*(n-2)))\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nh1=a\r\nh2=b\r\nh3=c\r\nd=1\r\ne=0\r\nwhile(d!=n):\r\n house = min(h1, h2)\r\n e=e+house\r\n if house==h1:\r\n h1=house\r\n h2=h3\r\n h3=max(h1,h2)\r\n else:\r\n h2=house\r\n h1=h3\r\n h3=max(h1,h2)\r\n d=d+1\r\nprint(e)", "n=int(input())\na=int(input())\nb=int(input())\nc=int(input())\nx=0\nif n>1:\n x=min(a,b)\n if n>2:\n x+=min(x,c)*(n-2)\nprint(x)\n", "import math\r\nimport re\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef ri():\r\n return int(input())\r\n\r\n\r\ndef rfa():\r\n return [float(i) for i in input().split()]\r\n\r\n\r\nn = ria()[0]\r\na = ria()[0]\r\nb = ria()[0]\r\nc = ria()[0]\r\nn -= 1\r\nif n == 0:\r\n print(0)\r\n exit()\r\nprint(min(a + c * (n - 1),b + c * (n - 1),a*n,b*n))\r\n", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\ndist = 0\ncur_pos = \"R\"\ncur_n = 1\nd = {\"RO\": a, \"RE\": b, \"OE\": c}\nwhile cur_n < n:\n j = [i for i in d.keys() if cur_pos in i]\n if d[j[0]] > d[j[1]]:\n k = j[1]\n else:\n k = j[0]\n cur_pos = k.replace(cur_pos, \"\")\n cur_n += 1\n dist += d[k]\nprint(dist)\n\t \t \t\t \t \t \t\t \t \t \t \t \t \t", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=min(a,b)\r\nif n==1 or min(d,c)==a or min(d,c)==b:\r\n print(d*(n-1))\r\nelse:\r\n print(d+(c*(n-2)))\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nans=0\r\nsu=n-1\r\nwhile(su):\r\n if(a<b):\r\n ans+=a \r\n su-=1\r\n if(c<a and su):\r\n ans+=c*su\r\n su=0\r\n else:\r\n ans+=a*su\r\n su=0\r\n else:\r\n ans+=b \r\n su-=1\r\n if(c<b and su):\r\n ans+=c*su\r\n su=0\r\n else:\r\n ans+=b*su\r\n su=0\r\nprint(ans) \r\n ", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nsum=0\r\nwhile n>1:\r\n n-=1\r\n sum+=min(a,b)\r\n if min(a,b)==a:\r\n b=c\r\n else:\r\n a=c\r\nprint(sum)\r\n ", "if __name__ == \"__main__\":\r\n N = int(input())\r\n A = int(input())\r\n B = int(input())\r\n C = int(input())\r\n cnt = 0\r\n result = 1145141919\r\n res1 = A * (N - 1)\r\n res2 = B * (N - 1)\r\n if (N >= 2):\r\n res3 = min(A, B) + C * (N - 2)\r\n result = min(result, res3)\r\n result = min(result, res1, res2)\r\n print (result)\r\n", "\nn = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\nn = n - 1\nd = 0\n\nif n != 0:\n minab = min(a, b)\n m = min(minab, c)\n \n if m == a or m == b:\n d = m*n\n else:\n d = minab + (n-1)*m\n\nprint(d)", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\n\r\nn = int(stdin.readline())\r\nn -= 1\r\n\r\na = int(stdin.readline())\r\nb = int(stdin.readline())\r\nc = int(stdin.readline())\r\n\r\nif n == 0:\r\n ans = 0\r\nelse:\r\n ans = min(a*n,b*n , a+c*(n-1) , b+c*(n-1))\r\n\r\nprint (ans)\r\n", "n=int(input())\r\np=int(input())\r\nl=int(input())\r\ng=int(input())\r\nif n==1:\r\n print(\"0\")\r\nelse:\r\n if min(p,l,g)==p:\r\n print((n-1)*p)\r\n elif min(p,l,g)==l:\r\n print((n-1)*l)\r\n else:\r\n tad=min(p,l)\r\n lap=(n-2)*g\r\n print(tad+lap)", "n, a, b, c = int(input()), int(input()), int(input()), int(input())\r\nprint(min(a, b) * (n - 1)) if n == 1 or min(a, b, c) in[a, b] else print(min(a, b) + c * (n - 2))", "\nn = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\ndef main():\n if n == 1:\n return 0\n else:\n\n l = [a,b,c]\n if min(l) == l[2]:\n return min(l[0],l[1]) + (n-2)*l[2]\n else:\n return (n-1) * min(l)\n\nprint(main())\n", "need = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\ntotal = 1\r\ns = 0\r\ni = 1\r\n\r\nwhile total != need:\r\n if i == 1:\r\n if a <= b:\r\n i = 2\r\n total += 1\r\n s += a\r\n else:\r\n i = 3\r\n total += 1\r\n s += b\r\n elif i == 2:\r\n if a <= c:\r\n i = 1\r\n total += 1\r\n s += a\r\n else:\r\n i = 3\r\n total += 1\r\n s += c\r\n else:\r\n if c <= b:\r\n i = 2\r\n total += 1\r\n s += c\r\n else:\r\n i = 1\r\n total += 1\r\n s += b\r\n \r\nprint(s)", "n=int(input())\na=int(input())\nb=int(input())\nc=int(input())\nans1=9999999\nans2=9999999\nans1=min(a*(n-1),b*(n-1))\nif n>=2:\n\tans2=min(a,b)+c*(n-2)\nprint(min(ans1,ans2))\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nshort = min((a,b,c))\r\nans = 0\r\nif n == 1:\r\n print(0)\r\nelse:\r\n if a == short or b == short:\r\n ans = min(a,b)*(n-1)\r\n else:\r\n ans = min(a,b) + c*(n-2)\r\n print(ans)\r\n", "n=int(input())-1\r\na,b,c=int(input()),int(input()),int(input())\r\nprint((min(b,a))+min(a,b,c)*(n-1) if n!=0 else 0)\r\n", "# from sys import stdin,stdout\r\n# input = stdin.readline\r\n# print = stdout.write\r\nfrom math import *\r\nn=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nt=0\r\nans=0\r\nfor i in range(1,n):\r\n\tif(t==0):\r\n\t\tif(a<b):\r\n\t\t\tt=1\r\n\t\t\tans+=a\r\n\t\telse:\r\n\t\t\tt=2\r\n\t\t\tans+=b\r\n\telif(t==1):\r\n\t\tif(a<c):\r\n\t\t\tt=0\r\n\t\t\tans+=a\r\n\t\telse:\r\n\t\t\tt=2\r\n\t\t\tans+=c\r\n\telif(t==2):\r\n\t\tif(b<c):\r\n\t\t\tt=0\r\n\t\t\tans+=b\r\n\t\telse:\r\n\t\t\tt=1\r\n\t\t\tans+=c\r\nprint(ans)", "n = int(input())-1\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nans = 0\r\n\r\nif n:\r\n ans += min(a,b)\r\n n -= 1\r\nmn = min(a, b, c)\r\nwhile n:\r\n n -= 1\r\n ans += mn\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\ndist = [int(input()) for _ in range(3)]\n\nprint((min(dist[:2]) + min(dist) * (n - 2)) if (n > 1) else 0)\n", "def main():\n n = int(input()) - 1\n [d01, d02, d12] = [int(input()) for _ in range(3)]\n min_distance = min(d01, d02, d12)\n distances = [[d01, d02], [d12, d01], [d01, d12]]\n sum_distances = 0\n pos = 0\n\n while n > 0:\n if min(distances[pos]) == min_distance:\n sum_distances += n * min_distance\n n = 0\n else:\n d1 = distances[pos][0]\n d2 = distances[pos][1]\n\n if d1 < d2:\n sum_distances += d1\n pos += 1\n else:\n sum_distances += d2\n pos += 2\n\n pos %= 3\n n -= 1\n\n print(sum_distances)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif n == 1:\r\n print('0')\r\n exit()\r\nelif n == 2:\r\n print(min(a, b))\r\n exit()\r\nelse:\r\n ans = min(a, b)\r\n mini = min(a, b, c)\r\n ans += mini * (n - 2)\r\n print(ans)\r\n exit()\r\n", "n,a,b,c=int(input()),int(input()),int(input()),int(input())\r\nif n==1:\r\n print(0)\r\nelif min(a,b,c) == a or min(a,b,c) == b:\r\n print((min(a,b)*(n-1)))\r\nelse:\r\n print(min(a,b)+c*(n-2))", "d={}\r\nn=int(input())\r\nab=int(input())\r\nac=int(input())\r\nbc=int(input())\r\nd[1]=[[2,ab],[3,ac]]\r\nd[2]=[[1,ab],[3,bc]]\r\nd[3]=[[2,bc],[1,ac]]\r\nans=0\r\nk=1\r\nx=1\r\nwhile k<n:\r\n ans+=min(d[x][0][1],d[x][1][1])\r\n if d[x][0][1]<d[x][1][1]:\r\n x=d[x][0][0]\r\n else:\r\n x=d[x][1][0]\r\n k+=1\r\nprint(ans)", "on = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\non -= 1\r\nif on == 0:\r\n print(0)\r\nelse:\r\n finalRes = 10**18\r\n # first A\r\n cost = 0\r\n n = on\r\n n -= 1\r\n cost = a\r\n cost += min(a,c) * n\r\n finalRes = min(finalRes, cost)\r\n\r\n cost = 0\r\n n = on\r\n n -= 1\r\n cost = b\r\n cost += min(c,b) * n\r\n finalRes = min(finalRes, cost)\r\n\r\n print(finalRes)", "def solve(x,n):\r\n ans = 0\r\n for i in range(n-1):\r\n if i==0:\r\n ans += min(a,b)\r\n else: ans += min(a,b,c)\r\n \r\n return ans\r\n\r\nif __name__==\"__main__\":\r\n n = int(input())\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n \r\n ans = solve(\"a\",n)\r\n print(ans)", "\n\n\ngraph = [[0,0,0], [0,0,0], [0,0,0]]\nn = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\ngraph[0][1] = a\ngraph[1][0] = a\ngraph[0][2] = b\ngraph[2][0] = b\ngraph[1][2] = c\ngraph[2][1] = c\n\nd = 0\nc = 0\nfor _ in range(n-1):\n fs = 2 if c == 0 else c - 1\n bs = 0 if c == 2 else c + 1\n\n fd = graph[c][fs]\n bd = graph[c][bs]\n \n if fd < bd:\n d += fd\n c = fs\n else:\n d += bd\n c = bs\n\n\nprint(d)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nn -= 1\r\nif n == 0:\r\n print(0)\r\nelif n == 1:\r\n print(min(a, b))\r\nelif a == min(a, b, c):\r\n print(n * a)\r\nelif b == min(a, b, c):\r\n print(n * b)\r\nelse:\r\n print(min(a, b) + (n - 1) * c)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nprint((n>1)*min(a,b)+max(0,n-2)*min(a,b,c))", "n = int( input() )\na = int( input() )\nb = int( input() )\nc = int( input() )\n\nif n == 1:\n print (\"0\")\nelif c < a and c < b :\n print ( min(a,b) + c * (n-2) )\nelse :\n print ( min(a,b) * (n-1) )\n", "def cod():\n n =int(input())\n a =int(input())\n b =int(input())\n c =int(input())\n \n z=min(a,b)\n if n==1:\n return 0\n if z>c:\n return(z + (n-2)*c)\n else:\n return((n-1)*z)\nprint(cod())\n\t \t \t\t\t \t \t \t\t \t\t \t \t\t\t\t\t\t", "\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nif c < a and c < b:\r\n\tdis = min(a, b) * min(1, n - 1) + max(0, n - 2) * c\r\nelse:\r\n\tdis = min(a, b) * (n - 1)\r\n\t\r\n\r\nprint(dis)\r\n\r\n", "n=int(input())\na=int(input())\nb=int(input())\nc=int(input())\nn-=1\ns=1\nan=0\nwhile n:\n\tif s==1:\n\t\tif a<b:\n\t\t\ts=2\n\t\t\tan+=a\n\t\telse:\n\t\t\ts=3\n\t\t\tan+=b\n\t\tn-=1\n\telif s==2:\n\t\tif a<c:\n\t\t\ts=1\n\t\t\tan+=a\n\t\telse:\n\t\t\ts=3\n\t\t\tan+=c\n\t\tn-=1\n\telse:\n\t\tif b<c:\n\t\t\ts=1\n\t\t\tan+=b\n\t\telse:\n\t\t\ts=2\n\t\t\tan+=c\n\t\tn-=1\nprint(an)\n \t \t\t\t\t \t\t\t \t\t \t \t \t\t \t", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nx = min(a, b, c)\r\nif x == a or x == b or n == 1:\r\n print((n - 1) * min(a, b))\r\nelse:\r\n print(min(a, b) + c * (n - 2))\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif n == 1:\r\n print(0)\r\nelse:\r\n ans = min(a, b)\r\n n -= 2\r\n if a <= b:\r\n ans = ans + n * min(a, c)\r\n else:\r\n ans = ans + n * min(b, c)\r\n print(ans)\r\n \r\n\r\n", "n, a, b, c = map(int, [input() for i in range(4)])\r\ns, ans = 1, 0\r\nfor _ in range(n - 1):\r\n if s == 1:\r\n s, ans = (2, ans + a) if a < b else (3, ans + b)\r\n elif s == 2:\r\n s, ans = (1, ans + a) if a < c else (3, ans + c)\r\n else:\r\n s, ans = (1, ans + b) if b < c else (2, ans + c)\r\nprint(ans)\r\n", "\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nMin = min(a,b,c)\r\nif Min == a or Min == b or n == 1:\r\n print(min(a,b)*(n-1))\r\nelse:\r\n print(min(a,b)+c*(n-2))\r\n", "n = int(input())\r\nro = int(input())\r\nre = int(input())\r\noe = int(input())\r\ne = [re, oe]\r\no = [ro, oe]\r\nr = [re, ro]\r\npasport = \"r\"\r\nmealctr = 1\r\ndistctr = 0\r\nwhile mealctr < n:\r\n mealctr+=1\r\n if pasport == \"r\":\r\n if min(r) == re:\r\n pasport = \"e\"\r\n distctr+=re\r\n else:\r\n pasport = \"o\"\r\n distctr+=ro\r\n elif pasport == \"e\":\r\n if min(e) == re:\r\n pasport = \"r\"\r\n distctr+=re\r\n else:\r\n pasport = \"o\"\r\n distctr+=oe \r\n elif pasport == \"o\":\r\n if min(o) == ro:\r\n pasport = \"r\"\r\n distctr+=ro\r\n else:\r\n pasport = \"e\"\r\n distctr+=oe\r\nprint(distctr) ", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\nx = 0\nn = n-1\nm=min(a,b)\nms=min(m,c)\nif n > 0 :\n\tx += m\n\tn = n-1\nwhile n>0 :\n\tx += ms\n\tn = n-1\nprint(x)\n", "n = int(input())\r\nl = []\r\nfor i in range(3):\r\n v = int(input())\r\n l.append(v)\r\nn = n-1\r\nd = 0\r\nfor i in range(n):\r\n ans = min(l[0],l[1])\r\n d += ans\r\n k = l.index(max(l[0],l[1]))\r\n l[-1], l[k] = l[k], l[-1]\r\n \r\nprint(d)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nno_move = False\r\n_min = min(a, b)\r\n\r\nif n == 1:\r\n no_move = True\r\n\r\nif no_move:\r\n print(0)\r\nelse:\r\n if c >= _min:\r\n dist = (n-1)*_min\r\n else:\r\n dist = _min+(n-2)*c\r\n\r\n print(dist)\r\n", "n=int(input())\r\nr_o=int(input())\r\nr_e=int(input())\r\ne_o=int(input())\r\nrahe_rafte=0\r\nif n>=2:\r\n rahe_rafte=min(r_e,r_o)\r\ns=min(min(r_e,r_o),e_o)\r\nfor i in range(n-2):\r\n rahe_rafte+=s\r\nprint(rahe_rafte)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif n == 1:\r\n print(0)\r\nelif n == 2:\r\n print(min(a, b))\r\nelse:\r\n if a < b:\r\n print(a + min(a, c) * (n - 2))\r\n else:\r\n print(b + min(c, b) * (n - 2))", "import sys\n\ndef main():\n n = int(sys.stdin.readline().rstrip())\n a = int(sys.stdin.readline().rstrip())\n b = int(sys.stdin.readline().rstrip())\n c = int(sys.stdin.readline().rstrip())\n state = 0\n dist = 0\n for i in range(1,n):\n if (state == 0):\n if (a < b):\n dist += a\n state = 1\n else:\n dist += b\n state = 2\n elif state == 1:\n if (a < c):\n dist += a\n state = 0\n else:\n dist += c\n state = 2\n elif state == 2:\n if (b < c):\n dist += b\n state = 0\n else:\n dist += c\n state = 1\n return(dist)\n\nprint(main())\n \n", "def distance(n, a, b, c):\r\n if n == 1:\r\n return 0\r\n else:\r\n if a < b:\r\n return a + distance(n-1, a, c, b) \r\n else:\r\n return b + distance(n-1, b, c, a) \r\n \r\nI = lambda:int(input())\r\nn = I()\r\na = I()\r\nb = I()\r\nc = I()\r\n\r\nprint(distance(n, a, b, c)) \r\n", "def main():\r\n n, a, b, c = int(input()), int(input()), int(input()), int(input())\r\n\r\n current_home = \"rabbit\"\r\n counter = 0\r\n total_distance = 0\r\n while True:\r\n counter += 1\r\n if counter >= n:\r\n break\r\n if current_home == \"rabbit\":\r\n if a > b:\r\n current_home = \"eeyore\"\r\n total_distance += b\r\n else:\r\n current_home = \"owl\"\r\n total_distance += a\r\n elif current_home == \"owl\":\r\n if c > a:\r\n current_home = \"rabbit\"\r\n total_distance += a\r\n else:\r\n current_home = \"eeyore\"\r\n total_distance += c\r\n else:\r\n if b > c:\r\n current_home = \"owl\"\r\n total_distance += c\r\n else:\r\n current_home = \"rabbit\"\r\n total_distance += b\r\n\r\n print(total_distance)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\nn = int(input())\nnums = []\nfor i in range(3):\n\n\ta = int(input())\n\n\tnums.append(a)\n\nif n == 1:\n\tprint(0)\n\texit()\n\nif n == 2:\n\tprint(min(nums[0],nums[1]))\n\texit()\n\nans = min(nums[0],nums[1])\nn = n - 2\n\nans = ans + min(nums)*n\n\nprint(ans)\n\n", "n=int(input())\r\na,b,c=int(input()),int(input()),int(input())\r\nif n==1:print(0)\r\nelse:\r\n\tif a+c==b:\r\n\t\tif a>c:print(a+(n-2)*c)\r\n\t\telse:print((n-1)*a)\r\n\telif a+b==c:print((n-1)*min(a,b))\r\n\telse:\r\n\t\tif c<=min(a,b):print(min(a,b)+(n-2)*c)\r\n\t\telse:print((n-1)*min(a,b))\r\n\t\t", "n=int(input())\na=int(input())\nb=int(input())\nc=int(input())\nif n==1:\n\tprint (0)\nelif n==2:\n\tprint (min(a,b))\nelse:\n\tif a<b:\n\t\tprint (a+min(a,c)*(n-2))\n\telse:\n\t\tprint (b+min(c,b)*(n-2))\n", "I=input\r\nn=int(I())-1\r\na=int(I())\r\nb=int(I())\r\nc=int(I())\r\nprint(max(min(a*n,b*n,c*(n-1)+(min(a,b))),0))\r\n", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\nif n == 1:\n print(0)\nelse:\n small2 = min(a,b)\n small3 = min(small2, c)\n print(small2 + (n-2)*small3)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nif n==1: \r\n print (0)\r\nelse :\r\n print(min(a,b)+(n-2)* min(a,b,c))", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif n==1:\r\n print(0)\r\n exit()\r\nn-=1\r\nprint(min(a,b,c)*(n-1)+min(a,b))\r\n \r\n ", "#!/usr/bin/python3\n\nn = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\nmn = min(a, b, c)\n\nif n == 1:\n\tprint('0')\nelif n == 2:\n\tprint(min(a, b))\nelse :\n\tprint(min(a, b) + (n-2) * mn)\n\t\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\npath = min(a, b)\r\nshort = min(a, b, c)\r\nres = path\r\nif n > 2:\r\n res += (n-2)*short\r\nif n == 1: res = 0\r\nprint(res)\r\n", "n = int(input())\nro = int(input())\nre = int(input())\noe = int(input())\n\nm = min([ro,re,oe])\n\nif n == 1:\n print(0)\nelif m == ro or m == re:\n print((n-1)*m)\nelse:\n print(min([ro,re]) + ((n-2)*oe))\n \t \t\t \t \t\t \t \t\t \t \t \t", "n = int(input())\r\nro = int(input())\r\nre = int(input())\r\noe = int(input())\r\n#rabbit = 0, owl = 1, eye = 2\r\nans = 0\r\ncurr = 0\r\nwhile(n - 1 > 0):\r\n if curr == 0:\r\n ans += min(ro, re)\r\n if ro<re:\r\n curr = 1\r\n else: curr = 2\r\n elif curr == 1:\r\n ans += min(ro, oe)\r\n if ro<oe:\r\n curr = 0\r\n else: curr = 2\r\n elif curr == 2:\r\n ans += min(oe, re)\r\n if re<oe:\r\n curr = 0\r\n else: curr = 1\r\n n -= 1\r\nprint(ans)\r\n\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nn -=1\r\nindeed=0\r\nif min(a,b,c)==a:\r\n shortestpath=a\r\nelif min(a,b,c)==b:\r\n shortestpath=b\r\nelse:\r\n indeed=1\r\n shortestpath = c\r\n intermediary = min(a,b)\r\nans=0\r\nwhile n>0:\r\n if indeed:\r\n indeed=0\r\n ans+=intermediary\r\n else:\r\n ans+=shortestpath\r\n n-=1\r\nprint(ans)", "n=int(input())\r\nl=[]\r\nfor i in range(3):\r\n l.append(int(input()))\r\nif (n==1):\r\n print (0)\r\nelse:\r\n if (l[0]==min(l)):\r\n print ((n-1)*l[0])\r\n elif (l[1]==min(l)):\r\n print ((n-1)*l[1])\r\n else:\r\n print (min(l[0],l[1]) + (n-2)*l[2])\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# кролик = 0, идёт только по a и b\r\n# сова = 1, идёт только по a и c\r\n# иа = 2, идёт только по b и c\r\n\r\nstate = 0\r\nans = 0\r\nn -= 1\r\nwhile n > 0:\r\n if state == 0:\r\n if a < b:\r\n ans += a\r\n state = 1\r\n else:\r\n ans += b\r\n state = 2\r\n elif state == 1:\r\n if a < c:\r\n ans += a\r\n state = 0\r\n else:\r\n ans += c\r\n state = 2\r\n else:\r\n if b < c:\r\n ans += b\r\n state = 0\r\n else:\r\n ans += c\r\n state = 1\r\n n -= 1\r\nprint(ans)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\na=min(a,b)\r\nprint((n>1)*a+(n>2)*(n-2)*min(a,c))", "n = int(input())\nro = int(input())\ner = int(input())\noe = int(input())\n\ndists = dict()\n\n\ndef precalc(o, d1, dis1, d2, dis2):\n if dis1 < dis2:\n dists[o] = (dis1, d1)\n else:\n dists[o] = (dis2, d2)\n\n\nprecalc(\"r\", \"o\", ro, \"e\", er)\nprecalc(\"e\", \"o\", oe, \"r\", er)\nprecalc(\"o\", \"e\", oe, \"r\", ro)\n\n\nposition = \"r\"\ndistance = 0\n\nfor x in range(n-1):\n distance += dists[position][0]\n position = dists[position][1]\n \nprint(distance)\n\n", "n,a,b,c=int(input()),int(input()),int(input()),int(input())\r\nif n==1: print(0)\r\nelse:\r\n first = a if a<b else b\r\n second = first if first<c else c\r\n print(first+(n-2)*second)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=min(a,b,c)\r\nif d==a or d==b or n==1:\r\n ans=(min(a, b))*(n-1)\r\nelse:\r\n ans=min(a, b)+(c*(n-2)) \r\n \r\nprint(ans) ", "n=int(input());a=int(input());b=int(input());c=int(input())\r\nlist1=[a,b,c]\r\nif n==1:\r\n print(0)\r\nelse:\r\n if min(list1)==a:\r\n print(a*(n-1))\r\n elif min(list1)==b:\r\n print(b*(n-1))\r\n else:\r\n print(min(a,b)+c*(n-2))\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nx = min(a, b)\r\ny = min(a, b, c)\r\nprint(0 if n==1 else x + y*(n-2))", "n,a,b,c=map(int,''.join([*open(0)]).split())\r\na=min(a,b)\r\nprint((n>1)*a+(n>2)*(n-2)*min(a,c))", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nm = min(a,b,c)\r\n\r\nif m == a:\r\n n -= 1\r\n dist = 0\r\n if n > 0:\r\n dist += n*a\r\n print(dist)\r\nelif m == b:\r\n n -= 1\r\n dist = 0\r\n if n > 0:\r\n dist += n*b\r\n print(dist)\r\nelse:\r\n n -= 1\r\n dist = 0\r\n if n>0:\r\n n -= 1\r\n dist += min(a,b)\r\n if n>0:\r\n dist += n*c\r\n print(dist)\r\n", "\nn, ac, ab, bc = [int(input()) for _ in range(4)]\n\ndist = 0\nplace = 0\n\n# 0 = a, 1 = b, 2 = c\n\nfor _ in range(n - 1):\n if place == 0: # at q\n if ac > ab:\n dist += ab\n place = 1\n else:\n dist += ac\n place = 2\n elif place == 1: # at b\n if ab > bc:\n dist += bc\n place = 2\n else:\n dist += ab\n place = 0\n else: # at c\n if ac > bc:\n dist += bc\n place = 1\n else:\n dist += ac\n place = 0\n\nprint(dist)\n ", "import sys\nn, a, b, c = [int(z) for z in sys.stdin.read().split()]\nif n < 2:\n print(0)\nelse:\n print(min(a, b) + (n-2)*min(a, b, c))\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = int(input())\r\nif a == 1 or min(b,c,d) == b or min(b,c,d) == c:\r\n\tprint(min(b,c)*(a-1))\r\nelse:\r\n\tprint(min(b,c)+d*(a-2))\r\n", "n=int(input())\na=int(input())\nb=int(input())\nc=int(input())\nif a==min(a,b,c):\n print(a*(n-1))\nelif b==min(a,b,c):\n print(b*(n-1))\nelse:\n if n==1:\n print(0)\n elif n==2:\n print(min(a,b))\n else:\n print(min(a,b)+(n-2)*c)\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\npath=0\r\nh=1\r\n\r\nwhile(n-1):\r\n\tif h==1:\r\n\t\tif a>b:\r\n\t\t\tpath = path+b\r\n\t\t\th=3\r\n\t\telse:\r\n\t\t\tpath = path+a\r\n\t\t\th=2\r\n\telif h==2:\r\n\t\tif a>c:\r\n\t\t\tpath =path+c \r\n\t\t\th=3\r\n\t\telse:\r\n\t\t\tpath=path+a \r\n\t\t\th=1\r\n\telif h==3:\r\n\t\tif c>b:\r\n\t\t\tpath=path+b\r\n\t\t\th=1\r\n\t\telse:\r\n\t\t\tpath=path+c \r\n\t\t\th=2\r\n\tn=n-1\r\nprint(path)\r\n\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif n == 1:\r\n print(0)\r\nelse:\r\n m = min(a, b, c)\r\n print(min(a,b) + (n-2)*m)", "if __name__ == \"__main__\":\n\tn = int(input())\n\ta = int(input())\n\tb = int(input())\n\tc = int(input())\n\tans = 0 \n\tat = 1\n\tfor i in range(n-1):\n\t\tif at ==1 and min(a,b)==a:\n\t\t\tans+=a\n\t\t\tat = 2\n\t\telif at == 1 and min(a,b)==b:\n\t\t\tans+=b\n\t\t\tat = 3\n\t\telif at == 3 and min(b,c)==b:\n\t\t\tans+=b\n\t\t\tat = 1\n\t\telif at == 3 and min(b,c)==c:\n\t\t\tans+=c\n\t\t\tat = 2\n\t\telif at == 2 and min(a,c)==a:\n\t\t\tans+=a\n\t\t\tat = 1\n\t\telse:\n\t\t\tans+=c\n\t\t\tat = 3\n\tprint(ans)\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif n==1:\r\n print(0)\r\nelif n==2:\r\n print(min(a,b))\r\nelse:\r\n if a<=b:\r\n if c<=a:\r\n print(a+(n-2)*c)\r\n else:\r\n print((n-1)*a)\r\n else:\r\n if c<=b:\r\n print(b+(n-2)*c)\r\n else:\r\n print((n-1)*b)", "n=int(input())-1\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\nfrom collections import defaultdict\r\nd=defaultdict(lambda : 0)\r\n\r\ncurr = 1\r\ns=0\r\nfor i in range(n):\r\n if curr == 1:\r\n if a<b:\r\n curr = 2\r\n s+=a\r\n else:\r\n curr = 3\r\n s+=b\r\n elif curr == 2:\r\n if a<c:\r\n curr = 1\r\n s+=a\r\n else:\r\n curr = 3\r\n s+=c\r\n elif curr == 3:\r\n if b<c:\r\n curr = 1\r\n s+=b\r\n else:\r\n curr = 2\r\n s+=c\r\n # print(s)\r\nprint(s)\r\n", "n=int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\nn-=1\nt = 0\nif n>0:\n\tt+=min([a,b])\n\tn-=1\nt+=min([a,b,c])*n\nprint(t)", "n=int(input())\r\na=[0]*3\r\na[0]=int(input())\r\na[2]=int(input())\r\na[1]=int(input())\r\np=0\r\ntimes=1\r\nans=0\r\nwhile times<n:\r\n t=(p-1+3)%3\r\n if a[p]<a[t]:\r\n ans+=a[p]\r\n p=(p+1)%3\r\n else:\r\n ans+=a[t]\r\n p=(p-1+3)%3\r\n times+=1\r\nprint(ans)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\ndist=0\r\nn-=1\r\nif(n>0):\r\n\tdist+=min(a,b)\r\n\tn-=1\r\nwhile(n>0):\r\n\tdist+=min(a,b,c)\r\n\tn-=1\r\nprint(dist)\t\r\n", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\nn -= 1\nif min(a, b) <= c:\n print(min(a, b) * n)\nelse:\n res = 0\n if n >= 1:\n res = min(a, b) + (n - 1) * c\n print(res)\n\n\t\t \t \t \t \t\t\t \t \t\t \t \t", "def winnie(n, grove, loc):\r\n \r\n dist = 0\r\n while n > 1:\r\n next_loc = min(grove[loc], key=grove[loc].get)\r\n dist += grove[loc][next_loc]\r\n\r\n loc = next_loc\r\n n-=1\r\n return dist\r\n\r\ngrove_matrix = {\"R\":{\"E\":0, \"O\":0}, \"E\":{\"R\":0, \"O\":0}, \"O\":{\"E\":0, \"R\":0}}\r\n\r\nn = int(input()) #visits\r\na = int(input()) # d(R,O)\r\nb = int(input()) # d(R,E)\r\nc = int(input()) # d(E,O)\r\n\r\ngrove_matrix[\"R\"][\"E\"] = b\r\ngrove_matrix[\"E\"][\"R\"] = b\r\n\r\ngrove_matrix[\"R\"][\"O\"] = a\r\ngrove_matrix[\"O\"][\"R\"] = a\r\n\r\ngrove_matrix[\"E\"][\"O\"] = c\r\ngrove_matrix[\"O\"][\"E\"] = c\r\n\r\nloc = \"R\"\r\n\r\nprint(winnie(n, grove_matrix, loc))", "n = int(input()) - 1\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif n == 0:\r\n print(0)\r\nelse:\r\n minimum = min(a, b, c)\r\n print((n-1)*minimum + min(a, b))\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nw = 'k'\r\ns = 0\r\n\r\nfor i in range(n - 1):\r\n if w == 'k':\r\n if a >= b:\r\n s += b\r\n w = 'o'\r\n else:\r\n s += a\r\n w = 'c'\r\n elif w == 'c':\r\n if a >= c:\r\n s += c\r\n w = 'o'\r\n else:\r\n s += a\r\n w = 'k'\r\n elif w == 'o':\r\n if c >= b:\r\n s += b\r\n w = 'k'\r\n else:\r\n s += c\r\n w = 'c'\r\nprint(s)\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif(n==1):\r\n print(0);\r\n exit(0)\r\nn-=1;\r\nm=[a,b,c]\r\nm=sorted(m);\r\nphys=0;\r\nif(m[0]==c):\r\n phys=min(a,b);\r\n n-=1;\r\n phys+=n*c;\r\nelse:\r\n phys=n*m[0];\r\nprint(phys)\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\ndef min2(a,b):\r\n if(a<=b):\r\n return a\r\n if(b<a):\r\n return b\r\n \r\ndef min3(a,b,c):\r\n if(a<=min(b,c)):\r\n return a\r\n if(b<=min(a,c)):\r\n return b\r\n if(c<=min(b,c)):\r\n return c\r\ns=0\r\nif(n>1):\r\n s=s+min2(a,b)\r\n s=s+(n-2)*min3(a,b,c)\r\n print(s)\r\nif(n==0 or n==1):\r\n print(0)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif min(a, b, c) == a or min(a, b, c) == b or n == 1:\r\n ans = min(a, b) * (n - 1)\r\nelse:\r\n ans = min(a, b) + c * (n - 2)\r\nprint(ans)\r\n\r\n", "\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nmx = max(max(a, b), c)\r\nmn = min(min(a, b), c)\r\n\r\nprint(0 if n == 1 else min(a, b) + (n - 2) * mn)\r\n", "n, a, b, c = (int(input()) for _ in range(4))\nres = max(0, min(min(a, b) + (n - 2) * c, (n - 1) * min(a, b)))\nprint(res)\n", "n,a,b,c = int(input()),int(input()),int(input()),int(input())\r\nprint((n>1)*min(a,b)+max(0,n-2)*min(a,b,c))", "import sys\r\nn=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif n==1:\r\n print(0)\r\n sys.exit()\r\nif c<a and c<b:\r\n print(min(a,b)+c*(n-2))\r\nelse:\r\n print(min(a,b)*(n-1))", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\nm = min(a, b)\nif n == 1:\n print(0)\n exit()\nif c < m:\n print(((n - 2) * c) + m)\nelse:\n print((n - 1) * m)\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nif min(a,b,c)==a or min(a,b,c)==b or n==1:\r\n print(min(a,b) * (n-1))\r\nelse:\r\n print(min(a,b) + c*(n-2))", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif n==1:\r\n print(0)\r\nelif a<=b and a<=c:\r\n print((n-1)*a)\r\nelif b<=a and b<=c:\r\n print((n-1)*b)\r\nelse:\r\n print(min(a,b)+(n-2)*c)\r\n", "n=int(input())\r\na,b,c=int(input()),int(input()),int(input())\r\nif(n==1):\r\n print(0)\r\nelse:\r\n if(a<b):\r\n print(a+(n-2)*min(a,c))\r\n else:\r\n print(b+(n-2)*min(b,c))", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nmy_list = [[101, b, a], [b, 101, c], [a, c, 101]]\r\npos = 0\r\ndist = 0\r\n\r\nwhile n != 1:\r\n curr_min = min(my_list[pos][0], my_list[pos][1], my_list[pos][2])\r\n dist += curr_min\r\n pos = my_list[pos].index(curr_min)\r\n n -= 1\r\nprint(dist)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nmin_ab = min([a, b])\r\n\r\nif n == 1:\r\n ans = 0\r\nelif n == 2:\r\n ans = min_ab\r\nelif c < a and c < b:\r\n ans = min_ab + (n - 2) * c\r\nelse:\r\n ans = min_ab * (n - 1) \r\n\r\nprint(ans)\r\n", "'''input\r\n1\r\n2\r\n3\r\n5\r\n'''\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\ncur = 0\r\npos = 0\r\nfor i in range(n-1):\r\n if pos == 0:\r\n if a < b:\r\n pos = 1\r\n cur += a\r\n else:\r\n pos = 2\r\n cur += b \r\n elif pos == 1:\r\n if a < c: \r\n pos = 1\r\n cur += a\r\n else:\r\n pos = 3\r\n cur += c\r\n else:\r\n if b < c: \r\n pos = 2\r\n cur += b\r\n else:\r\n pos = 3\r\n cur += c \r\nprint(cur) ", "import sys\n\nN = int(sys.stdin.readline())\nA = int(sys.stdin.readline())\nB = int(sys.stdin.readline())\nC = int(sys.stdin.readline())\n\nR = 'R'\nO = 'O'\nE = 'E'\n\np = 'R'\nans = 0\n\nfor _ in range(N - 1):\n if p == R:\n if A < B:\n ans += A\n p = O\n else:\n ans += B\n p = E\n elif p == E:\n if B < C:\n ans += B\n p = R\n else:\n ans += C\n p = O\n else:\n if C < A:\n ans += C\n p = E\n else:\n ans += A\n p = R\n\nprint(ans)\n", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\nef = min(a,b,c)\ndist = 0\n\nif(ef != c):\n dist += (n-1)*ef\nelse:\n if(n != 1):\n dist += min(a,b)\n dist += (n-2)*ef\n\nprint(dist)\n\n \t \t\t \t \t \t\t\t\t \t \t\t\t", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nmin1=min(a,min(b,c))\r\n\r\nif min1==a or min1==b or n==1:\r\n print(min(a,b)*(n-1))\r\nelse:\r\n print(min(a,b)+c*(n-2))\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nprint(min( [ a * (n-1), b * (n-1), min(a,b) + c * max(0,n-2) ] ) )", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\ns = 0\r\nix = 0\r\nfor i in range(n - 1):\r\n if ix == 0:\r\n if a < b:\r\n s += a\r\n ix = 1\r\n else:\r\n s += b\r\n ix = 2\r\n elif ix == 1:\r\n if a < c:\r\n s += a\r\n ix = 0\r\n else:\r\n s += c\r\n ix = 2\r\n else:\r\n if b < c:\r\n s += b\r\n ix = 0\r\n else:\r\n s += c\r\n ix = 1\r\nprint(s)\r\n\r\n", "def main():\n n, a, b, c = (int(input()) for _ in \"nabc\")\n print(min(a, b) * (n > 1) + min(a, b, c) * (n - 2) * (n > 2))\n\n\nif __name__ == '__main__':\n main()\n", "n, a, b, c = int(input()), int(input()), int(input()), int(input())\r\nans = 0\r\nif n == 1:\r\n ans = 0\r\nelse:\r\n ans += min(a, b)\r\n ans += (n-2)*min(a, b, c)\r\nprint(ans)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nmin1 = min(a,b,c)\r\n\r\nif(n==1 or (min1 == a) or min1 == b):\r\n print(min(a,b)*(n-1))\r\nelse:\r\n print(min(a,b)+c*(n-2))\r\n \r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif n==1:\r\n print (0)\r\nelse:\r\n print (min(a,b)+min(a,b,c)*(n-2))", "n, a, b, c = map(int, (input() for i in range(4)))\r\nprint((min(a,b) + min(min(a,b), c) * (n - 2), 0)[n < 2])\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nsum=0\r\npos=0\r\nfor i in range(n-1):\r\n if pos==0:\r\n if a<=b:\r\n pos=1\r\n sum+=a\r\n else:\r\n pos=2\r\n sum+=b\r\n elif pos==1:\r\n if(a<=c):\r\n pos=0\r\n sum+=a\r\n else:\r\n pos=2\r\n sum+=c\r\n else:\r\n if b<=c:\r\n pos=0\r\n sum+=b\r\n else:\r\n pos=1\r\n sum+=c\r\nprint(sum)", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\ndef ii():\r\n return int(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return list(map(str, input().split()))\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n#╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\nn = ii()\r\na = ii()\r\nb = ii()\r\nc = ii()\r\nif min(a,b,c) == a or b == min(a,b,c) or n == 1:\r\n print(min(a,b)*(n-1))\r\nelse:\r\n print(min(a,b)+c*(n-2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input()) - 1\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nprint(max(min(n * a, n * b, (n - 1) * c + min(a, b)), 0))\r\n", "n = int(input())\r\na = []\r\nfor i in range(3):\r\n a.append(int(input()))\r\nans = 0\r\nif min(a) in (a[0],a[1]) or n==1:\r\n print(min(a[0],a[1])*(n-1))\r\nelse:\r\n print(min(a[0],a[1])+(a[2]*(n-2)))", "p=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif (p==1):\r\n print(0)\r\nelse:\r\n print(min(a,b)+(p-2)*min(a,b,c))", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\ncur = 1\r\nans = 0\r\nn -= 1\r\nwhile n > 0:\r\n\tif cur == 1:\r\n\t\tif a > b:\r\n\t\t\tcur = 3\r\n\t\t\tans += b\r\n\t\telse:\r\n\t\t\tcur = 2\r\n\t\t\tans += a\r\n\telif cur == 2:\r\n\t\tif a > c:\r\n\t\t\tcur = 3\r\n\t\t\tans += c\r\n\t\telse:\r\n\t\t\tcur = 1\r\n\t\t\tans += a \r\n\telse:\r\n\t\tif b > c:\r\n\t\t\tcur = 2\r\n\t\t\tans += c\r\n\t\telse:\r\n\t\t\tcur = 1\r\n\t\t\tans += b\r\n\tn -= 1\r\nprint(ans)", "import copy\r\n\r\ndef solve():\r\n \r\n n, a, b, c = [int(input()) for i in range(4)]\r\n\r\n nowloc = 'ab'\r\n mealed = 1\r\n totaldistance = 0\r\n history = ['ab']\r\n\r\n while mealed < n:\r\n \r\n if nowloc == 'ab':\r\n if a < b:\r\n nowloc = 'ac'\r\n totaldistance += a\r\n else:\r\n nowloc = 'bc'\r\n totaldistance += b\r\n\r\n elif nowloc == 'bc':\r\n if b < c:\r\n nowloc = 'ab'\r\n totaldistance += b\r\n else:\r\n nowloc = 'ac'\r\n totaldistance += c\r\n\r\n elif nowloc == 'ac':\r\n if a < c:\r\n nowloc = 'ab'\r\n totaldistance += a\r\n else:\r\n nowloc = 'bc'\r\n totaldistance += c\r\n\r\n history.append(copy.deepcopy(nowloc))\r\n mealed += 1\r\n\r\n return totaldistance, history\r\n\r\nprint(solve()[0])\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nvar1 = min(a, b)\r\nvar2 = min(var1, c)\r\nif n == 1:\r\n print(0)\r\nelif n == 2:\r\n print(var1)\r\nelse:\r\n print(var1 + (n - 2) * var2)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=[a,b,c]\r\ne=min(d)\r\nf=min(a,b)\r\nif n==1:\r\n print(0)\r\nelif n==2:\r\n print(f)\r\nelse:\r\n g=f+(n-2)*e\r\n print(g)\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nn-=1\r\nif n==0:print(0)\r\nelse:print(min(a,b,c)*(n-1)+min(a,b))\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif n==1:\r\n\tprint (0)\r\nelif n==2:\r\n\tprint (min(a,b))\r\nelse:\r\n\tif a<b:\r\n\t\tprint (a+min(a,c)*(n-2))\r\n\telse:\r\n\t\tprint (b+min(c,b)*(n-2))", "def main():\n N = int(input())\n A, B, C = (int(input()) for _ in [0] * 3)\n\n if N == 1:\n print(0)\n exit()\n\n min_ = min(A, B, C)\n if A == min_ or B == min_:\n dist = min_\n else:\n dist = min(A, B)\n dist += min_ * (N - 2)\n\n print(dist)\n\nmain()\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\ntotal=0\r\nif(n>1):\r\n total=min(a,b)+((n-2)*(min(a,b,c)))\r\nprint(total)", "def main():\r\n n = int(input())\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n\r\n if n == 1:\r\n print(\"0\")\r\n\r\n elif n == 2:\r\n print(min(a, b))\r\n\r\n else:\r\n print(min(a, b) + (n - 2) * min(a, min(b, c)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "num_visits = int(input().strip())\nlengths = {}\nlengths[('a', 'b')] = int(input().strip())\nlengths[('a', 'c')] = int(input().strip())\nlengths[('b', 'c')] = int(input().strip())\n\ntarget = {}\n\n\ntarget['a'] = (('a', 'b'), 'b') if lengths[('a', 'b')] < lengths[('a', 'c')] else (('a', 'c'), 'c')\ntarget['b'] = (('b', 'c'), 'c') if lengths[('b', 'c')] < lengths[('a', 'b')] else (('a', 'b'), 'a')\ntarget['c'] = (('a', 'c'), 'a') if lengths[('a', 'c')] < lengths[('b', 'c')] else (('b', 'c'), 'b')\n\npos = 'a'\ntimes = 0\ndist = 0\nwhile times+1 < num_visits:\n dist += lengths[ target[pos][0] ]\n pos = target[pos][1]\n times += 1\n\nprint(dist)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif n == 1:\r\n print(0)\r\nelse: \r\n print(min(a, b) + (n - 2) * (min(a, b, c)))\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif n == 1:\r\n print(0)\r\n exit()\r\nelse:\r\n if a < b:\r\n print(a + (n - 2) * min(a, c))\r\n else:\r\n print(b + (n - 2) * min(b, c))", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\nif n >= 3:\n print(min(a, b) + (n - 2) * min(a, min(b, c)))\nelif n == 2:\n print(min(a, b))\nelse:\n print(0)\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\ncurd = 'K'\r\nans = 0\r\nwhile n > 1:\r\n n -= 1\r\n if curd == 'K':\r\n if a > b:\r\n ans += b\r\n curd = 'I'\r\n else:\r\n ans += a\r\n curd = 'S'\r\n elif curd == 'S':\r\n if a > c:\r\n ans += c\r\n curd = 'I'\r\n else:\r\n ans += a\r\n curd = 'K'\r\n else:\r\n if b > c:\r\n ans += c\r\n curd = 'S'\r\n else:\r\n ans += b\r\n curd = 'K'\r\nprint(ans)", "n=int(input())\r\natob=int(input())\r\natoc=int(input())\r\nbtoc=int(input())\r\nbtoa=atob\r\nctoa=atoc\r\nctob=btoc\r\nif(atob>atoc):\r\n\tpos1='c'\r\n\tdis1=atoc\r\nelse:\r\n\tpos1='b'\r\n\tdis1=atob\r\nif(btoc>btoa):\r\n\tpos2='a'\r\n\tdis2=btoa\r\nelse:\r\n\tpos2='c'\r\n\tdis2=btoc\r\nif(ctoa>ctob):\r\n\tpos3='b'\r\n\tdis3=ctob\r\nelse:\r\n\tpos3='a'\r\n\tdis3=ctoa\r\nposition='a'\r\ndistance=0\r\ndef dist(pos,dtravelled):\r\n\tif (pos=='a'):\r\n\t\tpos=pos1\r\n\t\tdtravelled+=dis1\r\n\telif(pos=='b'):\r\n\t\tpos=pos2\r\n\t\tdtravelled+=dis2\r\n\telif (pos=='c'):\r\n\t\tpos=pos3\r\n\t\tdtravelled+=dis3\r\n\treturn(pos,dtravelled)\r\nfor i in range(n-1):\r\n\tposition,distance=dist(position,distance)\r\n\t\r\nprint(distance)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=0\r\nif n==1:\r\n print(0)\r\nelif n==2:\r\n print(min(a,b))\r\nelse:\r\n p=min(a,b)\r\n d=min(a,b)+(min(p,c))*(n-2)\r\n print(d)", "n=int(input())\r\ne=int(input())\r\no=int(input())\r\nr=int(input())\r\nmeal=1\r\nway=0\r\npos='R'\r\ndic={'R':[o,e],'E':[o,r],'O':[e,r]}\r\nwhile meal<n :\r\n way+=min(dic[pos])\r\n if min(dic[pos])==e :\r\n if pos=='R' :\r\n pos='O'\r\n else :\r\n pos='R'\r\n elif min(dic[pos])==o :\r\n if pos=='R' :\r\n pos='E'\r\n else :\r\n pos='R'\r\n else :\r\n if pos=='O' :\r\n pos='E'\r\n else :\r\n pos='O'\r\n meal+=1\r\nprint(way)", "\r\nno_of_meals = int(input()) \r\nro = int(input()) \r\nre = int(input()) \r\noe = int(input()) \r\ndistance = 0\r\nhome = \"r\"\r\n\r\nfor each in range(0,no_of_meals-1):\r\n if(home==\"r\"):\r\n if(ro > re):\r\n home = \"e\"\r\n distance += re \r\n else:\r\n home = \"o\" \r\n distance += ro\r\n \r\n elif(home==\"o\"):\r\n if(ro > oe):\r\n home = \"e\"\r\n distance += oe \r\n else:\r\n home = \"r\" \r\n distance += ro\r\n \r\n else:\r\n if(re > oe):\r\n home = \"o\"\r\n distance += oe \r\n else:\r\n home = \"r\" \r\n distance += re \r\n \r\n \r\nprint(distance)\r\n\r\n\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nSUM = 0\r\nif n > 1:\r\n if c < a and c < b:\r\n SUM = min(a, b)\r\n SUM += c*(n-2)\r\n else:\r\n SUM = (n-1)*min(a, b)\r\n print(SUM)\r\nelse:\r\n print(0)", "def f(l,n):\r\n a,b,c = l\r\n return (n-2)*c+min(a,b) if (n>2 and min(l)==c) else (n-1)*min(a,b)\r\n\r\nn = int(input())\r\nl = [int(input()) for _ in range(3)]\r\nprint(f(l,n))\r\n\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\ndist = min(a, b)\r\n\r\nif n == 1:\r\n print(0)\r\nelif n == 2:\r\n print(dist)\r\nelse:\r\n dist1 = min(dist, c)\r\n print(dist + (n-2)*dist1)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nif(n==1):\r\n print(0)\r\n exit()\r\n\r\nsmallest = min(a,b,c)\r\n\r\nif smallest == a:\r\n print(a*(n-1))\r\n exit()\r\n\r\nif smallest == b:\r\n print(b*(n-1))\r\n exit()\r\n\r\nprint(min(a,b) + c*(n-2))\r\n\r\n# house = [0,1,2]\r\n# total_trip = 0\r\n# one = 1\r\n# other = 2\r\n\r\n# eat -= 1\r\n\r\n# curr = 0\r\n\r\n# def walk_to(house):\r\n# if()\r\n# while(eat):\r\n\r\n\r\n\r\n\r\n\r\n\r\n# class node:\r\n# def __init__(self,home,left,right):\r\n# self.home = \r\n# self.left = left\r\n# self.right = right\r\n \r\n# def get_left():\r\n# return self.left\r\n\r\n# def get_right():\r\n# return self.right\r\n \r\n# def set_left_child(child):\r\n# self.set_left_child = child\r\n \r\n# def set_right_child(child):\r\n# self.set_right_child = child\r\n \r\n# def get_left_child(child):\r\n# self.set_left_child = child\r\n\r\n# def set_right_child(child):\r\n# self.set_right_child = child\r\n\r\n# rabbit = node('rabbit',a,c)\r\n# owl = node('owl',a,c)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nans = 0\r\nif n == 1:\r\n print('0')\r\n exit()\r\nif (a > b):\r\n ans += b\r\n if (b > c):\r\n ans += c * (n - 2)\r\n else:\r\n ans += b * (n - 2)\r\nelse:\r\n ans += a\r\n if (a > c):\r\n ans += c * (n - 2)\r\n else:\r\n ans += a * (n - 2) \r\nprint(ans)", "n, a, b, c = int(input()), int(input()), int(input()), int(input())\r\nprint(min(a, b) + (n - 2) * min(a, b, c) if n > 1 else 0)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nif (n==1):\r\n print(0)\r\nelse:\r\n if (a <= b and a <= c):\r\n print(a*(n-1))\r\n elif (b <= a and b <= c):\r\n print(b*(n-1))\r\n else:\r\n if (a <= b):\r\n print(a+c*(n-2))\r\n else:\r\n print(b+c*(n-2))", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nn -= 1\r\nsm = 0\r\nif n > 0:\r\n if a < b:\r\n sm = a + min(c, a) * (n-1)\r\n else:\r\n sm = b + min(c, b) * (n-1)\r\nprint(sm)\r\n", "from sys import stdin, stdout\r\nfrom functools import reduce\r\n\r\ndef main():\r\n n=int(stdin.readline().strip())-1\r\n a=int(stdin.readline().strip())\r\n b=int(stdin.readline().strip())\r\n c=int(stdin.readline().strip())\r\n if n<=0: return 0\r\n x=min(a, min(b, c))\r\n if x==a or x==b:\r\n return x*n\r\n else:\r\n return min(a,b)+c*(n-1)\r\n\r\nstdout.write(str(main()))\r\n", "n=int(input())\na=int(input())\nb=int(input())\nc=int(input())\n\nif n==1:\n\tprint(0)\n\texit(0)\n\nx=min(a,b,c)\nif x in [a,b]:\n\tprint((n-1)*x)\nelse:\n\tprint(min(a,b)+(n-2)*c)\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif (n==1):\r\n print(0)\r\nelse:\r\n print(min(a,b)+(n-2)*min(a,b,c))", "n = int(input()) - 1\na = int(input())\nb = int(input())\nc = int(input())\nresult = 0\ncur = 'k'\nwhile n > 0:\n if cur == 'k':\n if a < b:\n cur = 's'\n result += a\n else:\n cur = 'i'\n result += b\n elif cur == 's':\n if a < c:\n cur = 'k'\n result += a\n else:\n cur = 'i'\n result += c\n else:\n if b < c:\n cur = 'k'\n result += b\n else:\n cur = 's'\n result += c\n n -= 1\nprint(result)\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nn -= 1\r\ns = 0\r\np = 0\r\nfor i in range(n):\r\n\tif p == 0:\r\n\t\tif a <= b:\r\n\t\t\ts += a\r\n\t\t\tp = 1\r\n\t\telse:\r\n\t\t\ts += b\r\n\t\t\tp = 2\r\n\telif p == 1:\r\n\t\tif a <= c:\r\n\t\t\ts += a\r\n\t\t\tp = 0\r\n\t\telse:\r\n\t\t\ts += c\r\n\t\t\tp = 2\r\n\telse:\r\n\t\tif b <= c:\r\n\t\t\ts += b\r\n\t\t\tp = 0\r\n\t\telse:\r\n\t\t\ts += c\r\n\t\t\tp = 1\r\nprint(s)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\nif n<2:print(0)\r\nelse:print(min((n-1)*min(a,b), min(a,b)+(n-2)*c))", "\r\nn=int(input())\r\na,b,c=int(input()),int(input()),int(input())\r\nprint((min(b,a))+min(a,b,c)*(n-2) if n!=1 else 0)", "from sys import stdin\r\n\r\nrd = stdin.readline\r\n\r\nn = int(rd())\r\na = int(rd())\r\nb = int(rd())\r\nc = int(rd())\r\n\r\nif n > 1: print(min(a, b) + (n - 2) * min(a, b, c))\r\nelse: print(0)\r\n\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\ndist = 0\r\nhouse = 1\r\nn-=1\r\nwhile n>0:\r\n if house == 1:\r\n if a<=b:\r\n dist+=a\r\n house = 2\r\n else:\r\n dist+=b\r\n house = 3\r\n\r\n elif house == 2:\r\n if a<=c:\r\n house = 1\r\n dist+=a\r\n else:\r\n house = 3\r\n dist+=c\r\n else:\r\n if c<=b:\r\n house = 2\r\n dist+=c\r\n else:\r\n house = 1\r\n dist+=b\r\n n-=1\r\n\r\nprint(dist)", "\r\nn = int(input()) - 1\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nprint(0 if n is 0 else n * a if a is min(a, b, c) else n * b if b is min(a, b, c) else min(a, b) + (c*(n-1)))\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\ndist = 0\r\nloc = \"R\"\r\n\r\nfor i in range (n-1):\r\n if loc == \"R\":\r\n d= min(a,b)\r\n dist += d \r\n if d == a :\r\n loc = \"O\"\r\n else:\r\n loc = \"E\"\r\n elif loc == \"O\":\r\n d = min (a,c)\r\n dist += d \r\n if d == a :\r\n loc = \"R\"\r\n else:\r\n loc = \"E\"\r\n else:\r\n d = min (b,c)\r\n dist += d \r\n if d == b :\r\n loc = \"R\"\r\n else:\r\n loc = \"O\"\r\n \r\nprint (dist)", "n = int(input())\r\nR_to_O = int(input())\r\nR_to_E = int(input())\r\nO_to_E = int(input())\r\nposition = \"R\"\r\ndistance = 0\r\nwhile n>1:\r\n\tif position == \"R\":\r\n\t\tif R_to_O > R_to_E:\r\n\t\t\tdistance += R_to_E\r\n\t\t\tposition = \"E\"\r\n\t\telse:\r\n\t\t\tdistance += R_to_O\r\n\t\t\tposition = \"O\"\r\n\telif position == \"O\":\r\n\t\tif O_to_E > R_to_O:\r\n\t\t\tdistance += R_to_O\r\n\t\t\tposition = \"R\"\r\n\t\telse:\r\n\t\t\tdistance += O_to_E\r\n\t\t\tposition = \"E\"\r\n\telif position == \"E\":\r\n\t\tif O_to_E > R_to_E:\r\n\t\t\tdistance += R_to_E\r\n\t\t\tposition = \"R\"\r\n\t\telse:\r\n\t\t\tdistance += O_to_E\r\n\t\t\tposition = \"O\"\r\n\tn -= 1\r\nprint(distance)\r\n\r\n\t", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nflag=0\r\nif(a>=b):\r\n first=b\r\n if(c<=b):\r\n flag=c\r\n else:\r\n flag=b\r\nelse:\r\n first=a\r\n if(c<=a):\r\n flag=c\r\n else:\r\n flag=a\r\ne=1\r\nsum=0\r\nwhile(e<n):\r\n if(e==1):\r\n sum=sum+first\r\n e=e+1\r\n else:\r\n sum=sum+flag\r\n e=e+1\r\nprint(sum)", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\nans = min(a, b)\nm = min(ans, c)\n\nif n == 1:\n print(0)\nelse:\n while(n > 2):\n n -= 1\n ans += m\n print(ans)\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nr=[a,b]\r\no=[a,c]\r\ne=[b,c]\r\np=1\r\nl=0\r\ny=r\r\nwhile(p<n):\r\n m=min(y)\r\n l+=m\r\n p+=1\r\n if(y==r):\r\n if(m in o):\r\n y=o\r\n else:\r\n y=e\r\n elif(y==o):\r\n if(m in r):\r\n y=r\r\n else:\r\n y=e\r\n else:\r\n if(m in r):\r\n y=r\r\n else:\r\n y=o\r\n \r\nprint(l) \r\n ", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nx=min(a,b,c)\r\nif x==a or x==b or n==1:\r\n print((n-1)*min(a,b))\r\nelse:\r\n print(min(a,b)+c*(n-2))", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\ndist=0\r\nn=n-1\r\ncur=1\r\nwhile(n>0):\r\n if(cur==1):\r\n if(a>b):\r\n cur=3\r\n dist+=b\r\n else:\r\n cur=2\r\n dist+=a\r\n elif(cur==2):\r\n if(a>c):\r\n cur=3\r\n dist+=c\r\n else:\r\n cur=1\r\n dist+=a\r\n else:\r\n if(b>c):\r\n cur=2\r\n dist+=c\r\n else:\r\n cur=1\r\n dist+=b\r\n n=n-1\r\n # print(cur)\r\nprint(dist)\r\n \r\n", "n = int(input())\r\na= int(input())\r\nb = int(input())\r\nc = int(input())\r\nif a<=b and a<=c:\r\n\tprint(a*(n-1))\r\nelif b<=c and b<=a:\r\n\tprint((n-1)*b)\r\nelif a<=b and a>=c:\r\n\tif n==1:\r\n\t\tprint(\"0\")\r\n\telse:\r\n\t\tprint((n-2)*c+a)\r\nelif b<a and b>=c:\r\n\tif n==1:\r\n\t\tprint(\"0\")\r\n\telse:\r\n\t\tprint((n-2)*c+b)", "#https://codeforces.com/problemset/problem/876/A\nn=int(input())\na=int(input())\nb=int(input())\nc=int(input())\nn=n-1\nans=0\nif n:\n\tn-=1\n\tans+=min(a,b)\n\t#print(c,n)\n\tans+=(min(a,b,c)*n)\nprint(ans)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, a, b, c = [int(input()[:-1]) for _ in range(4)]\r\n\r\n\r\nif c == min(a,b,c):\r\n if n < 3:\r\n print((n-1)*min(a,b))\r\n else:\r\n print(min(a,b) + c*(n-2))\r\nelse:\r\n print((n-1)*min(a,b))", "import sys\n\ndef trip_for_meal(n,a,b,c):\n n -= 1\n start = True\n tot = 0\n if a < b:\n sp = min(a,c)\n else:\n sp = min(b,c)\n \n while n != 0:\n if start:\n sps = min(a,b)\n tot += sps\n start = False\n n-=1\n continue\n tot += sp\n n-=1\n return tot\n\nn = int(sys.stdin.readline())\na = int(sys.stdin.readline())\nb = int(sys.stdin.readline())\nc = int(sys.stdin.readline())\nprint(trip_for_meal(n,a,b,c))", "n,a,b,c=[int(input()) for _ in range(4)]\r\nprint(min(a,b)+(n-2)*min(a,b,c) if n>2 else [min(a,b),0][n==1])\r\n\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nk = 1\r\n\r\nab = min(a, b)\r\nbc = min(b, c)\r\nca = min(c, a)\r\n \r\nacc = 0\r\nwhile n > 1:\r\n if k == 1:\r\n acc += ab\r\n if ab == a:\r\n k = 2\r\n else:\r\n k = 3\r\n elif k == 2:\r\n acc += ca\r\n if ca == c:\r\n k = 3\r\n else:\r\n k = 1\r\n else:\r\n acc += bc\r\n if bc == c:\r\n k = 2\r\n else:\r\n k = 1\r\n n -= 1\r\nprint(acc)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\ns = 0\r\nif n == 1:\r\n print(0)\r\nelse:\r\n if a>b:\r\n s += b\r\n n -= 1\r\n while n>1:\r\n if b>c:\r\n s += c\r\n else:\r\n s += b\r\n n -= 1\r\n else:\r\n s += a\r\n n -= 1\r\n while n>1:\r\n if a>c:\r\n s += c\r\n else:\r\n s += a\r\n n -= 1\r\n print(s)", "n=int(input())\r\nro=int(input())\r\nre=int(input())\r\noe=int(input())\r\nans=0\r\nif n==1:\r\n print(0)\r\nelse:\r\n n-=1\r\n if re<=ro:\r\n ans+=re\r\n n-=1\r\n for i in range(n):\r\n if oe<=re:\r\n ans+=oe\r\n else:\r\n ans+=re\r\n else:\r\n ans+=ro\r\n n-=1\r\n for i in range(n):\r\n if oe<=ro:\r\n ans+=oe\r\n else:\r\n ans+=ro\r\n print(ans)\r\n \r\n \r\n \r\n", "n=int(input())\na=int(input())\nb=int(input())\nc=int(input())\nn=n-1\nw=1\nans=0\nfor i in range(n):\n if w==1 :\n if a>=b :\n ans+=b\n w=2\n else :\n ans+=a\n w=3\n elif w==2 :\n if b<=c :\n ans+=b\n w=1\n else :\n ans+=c\n w=3\n elif w==3 :\n if a<=c :\n ans+=a\n w=1\n else :\n ans+=c\n w=2\nprint(ans)\n", "# rabit to owl a\n# rabit to eyeore b\n# owl to eyore c\n\n# 1 to 2\n# 1 to 3\n# 2 to 4\n\nn = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\n\n\nif n == 1:\n print(0)\n exit()\n\nshort = min(a,b)\n\nif min(short,c) != c:\n dis = (n - 1) * short\n print(dis)\nelse:\n dis = c * (n-2)\n dis += short\n print(dis)\n\n\n\n\n\n\n\n", "n=int(input())\r\ns=int(input())\r\nt=int(input())\r\nf=int(input())\r\nif n==1:\r\n print(0)\r\nelse:\r\n print(min(s,t)+min(s,t,f)*(n-2))", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif n == 1:\r\n print(0)\r\nelif n == 2:\r\n print(min(a, b))\r\nelse:\r\n print(min(a * (n - 1), b * (n - 1), a + c * (n - 2), b + c * (n - 2)))", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif(n==1):\r\n print(0)\r\nelse:\r\n dist=[a,b,c]\r\n dist.sort()\r\n min1=dist[0]\r\n min2=dist[1]\r\n min3=dist[2]\r\n if(min1==a or min1==b):\r\n print((n-1)*min1)\r\n else:\r\n print(min2+((n-2)*min1))", "x = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nt = min(a,b,c)\r\nif x > 1:\r\n\tprint(min(a,b)+(x-2)*min(a,b,c))\r\nelse:\r\n\tprint(0)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nn -= 1\r\nif n == 0:\r\n print(0)\r\nelif min(a, b, c) == c:\r\n print(min(a, b) + (n-1) * c)\r\nelse:\r\n print(min(a, b, c) * n )", "n = int(input())\r\nrabbit_owl = int(input())\r\nrabbit_donkey = int(input())\r\nowl_donkey = int(input())\r\ncur = \"r\"\r\nanswer = 0\r\nfor _ in range(n - 1):\r\n if cur == \"r\":\r\n if rabbit_donkey > rabbit_owl:\r\n cur = \"o\"\r\n answer += rabbit_owl\r\n else:\r\n cur = \"d\"\r\n answer += rabbit_donkey\r\n elif cur == \"o\":\r\n if rabbit_owl < owl_donkey:\r\n cur = \"o\"\r\n answer += rabbit_owl\r\n else:\r\n cur = \"d\"\r\n answer += owl_donkey\r\n else:\r\n if rabbit_donkey < owl_donkey:\r\n cur = \"r\"\r\n answer += rabbit_donkey\r\n else:\r\n cur = \"o\"\r\n answer += owl_donkey\r\nprint(answer)\r\n", "\nimport sys\nimport os\nimport math\nimport re\n\n\nn = int(input())\n\na = int(input())\nb = int(input())\nc = int(input())\n\n\nif n == 1:\n print('0')\nelse:\n if min(min(a,b),c) != c:\n print(min(a,b)*(n-1))\n else:\n print(min(a,b)+(c*(n-2)))\n", "import math\r\n\r\nn=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\nif n==1:\r\n print(0)\r\n quit()\r\n\r\nif c<min(b,a):\r\n print((n-2)*c+min(a,b))\r\nelse:\r\n print((n-1)*min(a,b))", "n=int(input())\r\na=int(input())#1-2\r\nb=int(input())#1-3\r\nc=int(input())#3-2\r\nnowat=1\r\nans=0\r\nfor i in range(n-1):\r\n if nowat==1:\r\n if a<b:\r\n ans+=a\r\n nowat=2\r\n else:\r\n ans+=b\r\n nowat=3\r\n elif nowat==2:\r\n if a<c:\r\n ans+=a\r\n nowat=1\r\n else:\r\n ans+=c\r\n nowat=3\r\n elif nowat==3:\r\n if b<c:\r\n ans+=b\r\n nowat=1\r\n else:\r\n ans+=c\r\n nowat=2\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na, b, c = [int(input()) for _ in range(3)]\r\n\r\nmv = min(a, b, c)\r\nif n == 1:\r\n print(0)\r\nelif mv == a or mv == b:\r\n print(mv * (n - 1))\r\nelse:\r\n print(min(a, b) + mv * (n - 2))", "import sys\r\nimport collections\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef printnl(val):\r\n sys.stdout.write(str(val) + '\\n')\r\n\r\n\r\nn = int(input())\r\na, b, c = [int(input()) for i in range(3)]\r\n\r\ndist = 'a'\r\nn -= 1\r\n\r\nans = 0\r\n\r\nwhile n:\r\n if dist == 'a':\r\n if a < b:\r\n ans += a\r\n dist = 'b'\r\n else:\r\n ans += b\r\n dist = 'c'\r\n else:\r\n if dist == 'b':\r\n if a < c:\r\n ans += a\r\n dist = 'a'\r\n else:\r\n ans += c\r\n dist = 'c'\r\n else:\r\n if dist == 'c':\r\n if c < b:\r\n ans += c\r\n dist = 'b'\r\n else:\r\n ans += b\r\n dist = 'a'\r\n n -= 1\r\n\r\nprint(ans)\r\n", "visits = int(input())\nrabOwl = int(input())\nrabEe = int(input())\nowlEe = int(input())\nminimumEdge = min(rabOwl, rabEe, owlEe)\nif visits == 1:\n\tprint(0)\nelse:\n\tif rabOwl == minimumEdge:\n\t\tprint((visits - 1) * rabOwl)\n\telif rabEe == minimumEdge:\n\t\tprint((visits - 1) * rabEe)\n\telif owlEe == minimumEdge:\n\t\tprint((visits - 2) * owlEe + min(rabOwl, rabEe))", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nk = 0\r\nif (n==1): print(0)\r\nelse:\r\n k = min(a,b) + (n-2)*min(a,b,c)\r\n print(k)\r\n", "I = lambda: int(input())\r\nn = I()\r\nd = [I(), I(), I()]\r\nif n==1:\r\n print(0)\r\nelse:\r\n print(min(d[:2])+(n-2)*min(d))", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\nif min(a, b, c) in [a, b] or n == 1:\n print(min(a, b) * (n - 1))\nelse:\n print(min(a, b) + c * (n - 2))\n\n", "from math import ceil\nInput=lambda:map(int,input().split())\n\nn = int(input())\nR, E, O = int(input()), int(input()),int(input())\nn-=1\nif n == 0:\n print(0)\n exit()\narr = [[R,'R'],[E,'E'],[O,'O']]\narr.sort()\nif arr[0][1] == 'O':\n n-=1\n print((arr[1][0]) + (arr[0][0]*n) )\nelse:\n print(arr[0][0]*n)\n\n\n\n", "n = int(input())-1\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nprint(min(a, b)+(n-1)*min(a, b, c) if n else 0)", "\r\nn=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nn-=1\r\nif n==0:\r\n print(0)\r\nelse:\r\n print(min(a,b,c)*(n-1)+min(a,b))", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nsumm=0\r\nsec=str()\r\nif n==1:\r\n\tprint(0)\r\nelse:\r\n\tsec='kr'\r\n\tfor i in range(n-1):\r\n\t\tif sec=='kr': \r\n\t\t\tsumm+=min(b,a)\r\n\t\t\tif min(b,a)==b:\r\n\t\t\t\tsec='ia'\r\n\t\t\telse:\r\n\t\t\t\tsec='sov'\r\n\t\telse:\r\n\t\t\tif sec=='sov':\r\n\t\t\t\tsumm+=min(a,c)\r\n\t\t\t\tif min(a,c)==c:\r\n\t\t\t\t\tsec='ia'\r\n\t\t\t\telse:\r\n\t\t\t\t\tsec='kr'\r\n\t\t\telse:\r\n\t\t\t\tsumm+= min(b,c)\r\n\t\t\t\tif min(b,c)==b:\r\n\t\t\t\t\tsec='kr'\r\n\t\t\t\telse:\r\n\t\t\t\t\tsec='sov'\r\n\tprint(summ)", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\ng = [1 if a < b else 2, 0 if a < c else 2, 1 if c < b else 0]\nd = [min(a, b), min(a, c), min(c, b)]\n\nt = 0\np = 0\nfor i in range(n - 1):\n t += d[p]\n p = g[p]\n\nprint(t)\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nn -= 1\r\ni = 0 # 0=coelho; 1=coruja; 2=burro\r\ncont = 0\r\nwhile(True):\r\n if(n == 0):\r\n break\r\n n-=1\r\n if(i == 0):\r\n if(a<b):\r\n cont+=a\r\n i = 1\r\n else:\r\n cont+=b\r\n i = 2\r\n elif(i == 1):\r\n if(a<c):\r\n cont+=a\r\n i = 0\r\n else:\r\n cont+=c\r\n i = 2\r\n elif(i == 2):\r\n if(c<b):\r\n cont+=c\r\n i = 1\r\n else:\r\n cont+=b\r\n i = 0\r\nprint(cont)\r\n", "n=int(input())\r\nll=[]\r\nfor i in range(3):\r\n ll.append(int(input()))\r\na,b,c =ll\r\nif n==1:\r\n print(0)\r\nelif min(ll)==a:\r\n print(a*(n-1))\r\nelif min(ll)==b:\r\n print(b*(n-1))\r\nelse:\r\n print(min(a,b)+(c*(n-2)))", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\ncount = 1\r\nlength = 0\r\n\r\nx = 1\r\n\r\nwhile count < n:\r\n count += 1\r\n if x == 1:\r\n if a < b:\r\n x = 2\r\n length += a\r\n else:\r\n x = 3\r\n length += b\r\n elif x == 2:\r\n if a < c:\r\n x = 1\r\n length += a\r\n else:\r\n x = 3\r\n length += c\r\n else:\r\n if b < c:\r\n x = 1\r\n length += b\r\n else:\r\n x = 2\r\n length += c\r\nprint(length)", "read = lambda: tuple(map(int, input().split()))\nn, a, b, c = read()[0], read()[0], read()[0], read()[0]\nn -= 1\nif n == 0:\n print(0)\nelif n == 1:\n print(min(a, b))\nelse:\n print(min(a + c * (n - 1), b + c * (n - 1), b * n, a * n))\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif n == 1:\r\n print(0)\r\nelse:\r\n d = min(a, b, c)\r\n if a == d or b == d:\r\n print((n-1) * d)\r\n else:\r\n print(min(a, b) + (n - 2) * d)", "from collections import Counter\r\nfrom collections import Counter\r\n \r\ndef solve():\r\n n=int(input())\r\n a=int(input())\r\n b=int(input())\r\n c=int(input())\r\n pr=1\r\n i,sum=1,0\r\n\r\n while i<n:\r\n i+=1\r\n if pr==1:\r\n if b>=a:\r\n pr=2\r\n sum+=a\r\n else:\r\n sum+=b\r\n pr=3\r\n continue\r\n if pr==2:\r\n if a>=c:\r\n pr=3\r\n sum+=c \r\n else:\r\n sum+=a\r\n pr=1\r\n continue\r\n if pr==3:\r\n if b>=c:\r\n pr=2\r\n sum+=c \r\n else:\r\n pr=1\r\n sum+=b\r\n continue\r\n return sum\r\n\r\n\r\nprint(solve())\r\n\r\n", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\nhouse = 'rab'\nanswer = 0\n\nfor i in range(n - 1):\n if house == 'rab':\n if a < b:\n house = 'owl'\n answer += a\n else:\n house = 'eey'\n answer += b\n elif house == 'owl':\n if a < c:\n house = 'rab'\n answer += a\n else:\n house = 'eey'\n answer += c\n else:\n if b < c:\n house = 'rab'\n answer += b\n else:\n house = 'owl'\n answer += c\n\nprint(answer)\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif n==1:\r\n print(0)\r\nelse:\r\n mi=min(a,b,c)\r\n if mi==a:\r\n dist=a*(n-1)\r\n elif mi==b:\r\n dist=b*(n-1)\r\n elif mi==c:\r\n ma=min(a,b)\r\n if ma==a:\r\n dist=a\r\n else:\r\n dist=b\r\n dist=dist+c*(n-2)\r\n print(dist)\r\n \r\n", "n = int(input());\r\na = int(input());\r\nb = int(input());\r\nc = int(input());\r\nans = 0;\r\nk = 1;\r\nfor i in range(n-1):\r\n if (k == 1):\r\n if (a < b):\r\n k = 2;\r\n ans += a;\r\n else: \r\n k = 3;\r\n ans += b;\r\n elif k == 2 : \r\n if (a < c):\r\n k = 1;\r\n ans += a;\r\n else:\r\n k = 3;\r\n ans += c;\r\n else:\r\n if (b < c):\r\n k = 1;\r\n ans += b;\r\n else:\r\n k = 2;\r\n ans += c;\r\nprint(ans);\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nm=0\r\nif n>1: m=min(a,b)\r\ns=m\r\nwhile n>2:\r\n s+=min(m,c)\r\n n-=1\r\nprint(s)", "from sys import stdin\nn, a, b, c = map(int, stdin.read().split())\n\nif n == 1:\n result = 0\nelif n == 2:\n result = min(a, b)\nelse:\n if min(a, b, c) == a:\n result = (n - 1) * a\n elif min(a, b, c) == b:\n result = (n - 1) * b\n else:\n result = min(a, b) + (n - 2) * c\n\nfrom sys import stdout\nprint(result, file=stdout)", "def moves():\r\n n = int(input())\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n if n==1:\r\n return 0\r\n k = min(a,b)\r\n if n==2:\r\n return k\r\n return k + min(k,c) * (n-2)\r\n\r\nprint(moves())\r\n ", "from sys import stdin,stdout\r\n\r\nn, a, b, c = map(int,stdin.readlines())\r\n\r\ndist = 0\r\nn = n -1\r\nif n==0:\r\n stdout.write(\"0\")\r\nelif min(a,b) > c:\r\n dist = min(a,b) + c *(n-1)\r\n stdout.write(str(dist))\r\nelse:\r\n dist = min(a,b) * n\r\n stdout.write(str(dist))", "food = int(input()) - 1\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nif food:\r\n print(min(a, b) + (food - 1) * min(a, b, c))\r\nelse:\r\n print(0)", "import os, sys\r\nfrom itertools import count, combinations\r\nfrom collections import namedtuple, Counter\r\nfrom operator import itemgetter\r\nclass CustomException(Exception): pass\r\n\r\nif os.getenv('SJDEAK'):\r\n sys.stdin = open(os.path.expanduser('~/data/in.txt'))\r\n # sys.stdout = open(os.path.expanduser('~/data/out.txt'), 'w')\r\n\r\nmem = {}\r\n\r\ndef dp(n, pos):\r\n if n == 0:\r\n return 0\r\n if (n, pos) in mem:\r\n return mem[(n, pos)]\r\n \r\n if pos == 'A':\r\n mem[(n, pos)] = min(A + dp(n-1, 'B'), B + dp(n-1, 'C'))\r\n elif pos == 'B':\r\n mem[(n, pos)] = min(A + dp(n-1, 'A'), C + dp(n-1, 'C'))\r\n else:\r\n mem[(n, pos)] = min(B + dp(n-1, 'A'), C + dp(n-1, 'B'))\r\n \r\n return mem[(n, pos)]\r\n\r\n\r\nif __name__ == '__main__':\r\n N, A, B, C = [int(input()) for i in range(4)]\r\n \r\n print(dp(N-1, 'A'))\r\n # print(mem)\r\n\r\n\r\n\r\n\r\n # N -= 1\r\n # if not N % 3:\r\n # print(N // 3 * (A + B + C))\r\n # elif N % 3 == 1:\r\n # print(min(A, B) + (N - 1) // 3 * (A + B + C))\r\n # else:\r\n # print(min(A, B) + C + (N - 2) // 3 * (A + B + C))\r\n\r\n\r\n", "n = int(input()) - 1\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nd = min(a,min(b,c))\r\nif d == a:\r\n print(n*d)\r\nelif d == b:\r\n print(n*d)\r\nelse:\r\n if n >= 1:\r\n print((n-1)*d + min(a,b))\r\n else:\r\n print(0)", "n = int(input())\r\na = int(input()) # kr i sov\r\nb = int(input()) # kr i ia\r\nc = int(input()) # cov i ia\r\n\r\nif n == 0:\r\n print(\"0\")\r\nelif n == 1:\r\n print(\"0\")\r\nelse:\r\n print(str(\r\n min(\r\n a * (n - 1),\r\n b * (n - 1),\r\n a + c * (n - 2),\r\n b + c * (n - 2)\r\n )\r\n ))\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\nif n==1:\r\n\tprint(0)\r\n\texit(0)\r\n\r\nx=min(a,b,c)\r\nif x in [a,b]:\r\n\tprint((n-1)*x)\r\nelse:\r\n\tprint(min(a,b)+(n-2)*c)", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nprint(min(n-1, 1) * min(a, b) + max(n-2, 0)* min(a, b, c))", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif(n>1): \r\n print(min(a, b) + (n - 2) * min(a, b, c))\r\nelse:\r\n print(0)", "\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nmx = max(a, b, c)\r\nmn = min(a, b, c)\r\n\r\nprint(0 if n == 1 else min(a, b) + (n - 2) * mn)\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif n<2:\r\n print(0)\r\nelse:\r\n n-=1\r\n if a<b:\r\n s=a\r\n n-=1\r\n if c<a:\r\n print(s+(c*n))\r\n else:\r\n print(s+(a*n))\r\n else:\r\n s=b\r\n n-=1\r\n if c<b:\r\n print(s+(c*n))\r\n else:\r\n print(s+(b*n))\r\n ", "n = int(input())\r\na = int(input()) # kr sov\r\nb = int(input()) # kr os\r\nc = int(input()) # sov os\r\ns = 0\r\npoint = 'k'\r\nn -= 1\r\n\r\nwhile n > 0:\r\n if point == 'k':\r\n if a >= b:\r\n s += b\r\n point = 'o'\r\n n -= 1\r\n continue\r\n else:\r\n s += a\r\n point = 's'\r\n n -= 1\r\n continue\r\n if point == 's':\r\n if a >= c:\r\n s += c\r\n point = 'o'\r\n n -= 1\r\n continue\r\n else:\r\n s += a\r\n point = 'k'\r\n n -= 1\r\n continue\r\n if point == 'o':\r\n if b >= c:\r\n s += c\r\n point = 's'\r\n n -= 1\r\n continue\r\n else:\r\n s += b\r\n point = 'k'\r\n n -= 1\r\n continue\r\nprint(s)", "def food(n, a, b, c):\r\n if n == 1:\r\n return 0\r\n result = 0\r\n n -= 1\r\n if a > b:\r\n result += b\r\n n -= 1\r\n if b > c and n > 0:\r\n result += n * c\r\n else:\r\n result += n * b\r\n else:\r\n result += a\r\n n -= 1\r\n if a > c and n > 0:\r\n result += n * c\r\n else:\r\n result += n * a\r\n return result\r\n\r\n\r\nN = int(input())\r\nA = int(input())\r\nB = int(input())\r\nC = int(input())\r\nprint(food(N, A, B, C))\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\nif n==1:\r\n print(0)\r\nelse:\r\n if a<=c or b<=c:\r\n m=min(a,b)\r\n print((n-1)*m)\r\n else:\r\n m=min(a,b)\r\n print(m+(n-2)*c)\r\n", "from sys import stdin,stdout\r\nfrom collections import Counter\r\ndef ai(): return list(map(int, stdin.readline().split()))\r\ndef ei(): return map(int, stdin.readline().split())\r\ndef ip(): return int(stdin.readline().strip())\r\ndef op(ans): return stdout.write(str(ans) + '\\n')\r\n\r\nn = ip()\r\na = ip()\r\nb = ip()\r\nc = ip()\r\n\r\nans = 0\r\ni = 1\r\ncurrent = 'r'\r\nwhile i != n:\r\n\ti += 1\r\n\tif current == 'r':\r\n\t\tif a<b: current = 'o'\r\n\t\telse: current = 'e' \r\n\t\tans += min(a,b)\r\n\telif current == 'o':\r\n\t\tif c<a : current = 'e'\r\n\t\telse: current = 'r'\r\n\t\tans += min(a,c)\r\n\telif current == 'e':\r\n\t\tif b < c: current = 'r'\r\n\t\telse: current = 'o'\r\n\t\tans += min(b,c)\r\nop(ans)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=0\r\nn-=1\r\nif(n>0):\r\n d+=min(a,b)\r\n n-=1\r\nif(n>0):\r\n d+=min(d,c)*n\r\nprint(d)\r\n\r\n", "if __name__ == \"__main__\":\r\n visits = int(input())\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n distances = [a , b , c]\r\n total_distance = 0\r\n if visits > 1:\r\n if c < a and c < b:\r\n if a < b:\r\n total_distance += a\r\n total_distance += (visits - 2) * c\r\n else:\r\n total_distance += b\r\n total_distance += (visits - 2) * c\r\n elif a < b:\r\n total_distance += (visits - 1) * a\r\n else:\r\n total_distance += (visits - 1) * b\r\n print(total_distance)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\np = 1\r\nr = 0\r\nfor i in range(n-1):\r\n if p == 1:\r\n r += min(a,b)\r\n if a < b:\r\n p = 2\r\n else:\r\n p = 3\r\n elif p == 2:\r\n r += min(a,c)\r\n if a < c:\r\n p = 1\r\n else:\r\n p = 3\r\n elif p == 3:\r\n r += min(b,c)\r\n if b < c:\r\n p = 1\r\n else:\r\n p = 2\r\nprint(r)\r\n", "N = int(input())\r\n\r\nd1 =int(input())\r\nd2 =int(input())\r\nd3 =int(input())\r\n\r\n\r\n\r\nif N == 1:\r\n print(0)\r\nelse:\r\n AN = min(d1, d2)\r\n AN += min([d1,d2,d3]) * (N-2)\r\n print(AN)\r\n \r\n ", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nnow = \"R\"\r\ndic = {\"R\": 0, \"O\": 1, \"E\":2}\r\nd = [[1000] * 3 for i in range(3)]\r\nd[dic[\"R\"]][dic[\"O\"]], d[dic[\"O\"]][dic[\"R\"]] = a, a\r\nd[dic[\"R\"]][dic[\"E\"]], d[dic[\"E\"]][dic[\"R\"]] = b, b\r\nd[dic[\"O\"]][dic[\"E\"]], d[dic[\"E\"]][dic[\"O\"]] = c, c\r\ncost = 0\r\nfor i in range(n - 1):\r\n rec = 1001\r\n index = 0\r\n for p, q in enumerate(d[dic[now]]):\r\n if rec > q:\r\n rec = q\r\n index = p\r\n cost += rec\r\n if index == 0:\r\n now = \"R\"\r\n elif index == 1:\r\n now = \"O\"\r\n else:\r\n now = \"E\"\r\n \r\nprint(cost)", "n=int(input())\r\na=[]\r\nfor i in range(3):\r\n a.append(int(input()))\r\nif min(a)==a[2]:\r\n if n!=1:\r\n print(min(a[1],a[0])+a[2]*(n-2))\r\n else:\r\n print(0)\r\nelse:\r\n print(min(a)*(n-1))\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\ns = 0\r\nt = 1\r\nfor i in range(n-1):\r\n if t == 1:\r\n if a < b:\r\n s += a\r\n t = 2\r\n continue\r\n else:\r\n s += b\r\n t = 3\r\n continue\r\n if t == 2:\r\n if a < c:\r\n s += a\r\n t = 1\r\n continue\r\n else:\r\n s += c\r\n t = 3\r\n continue\r\n if t == 3:\r\n if c < b:\r\n s += c\r\n t = 2\r\n continue\r\n else:\r\n s += b\r\n t = 1\r\n continue\r\nprint(s)", "def solve(n: int, a: int, b: int, c: int) -> int:\r\n if n == 1:\r\n return(0)\r\n elif c == min(a, b, c):\r\n return(min(a, b) + c * (n - 2))\r\n else:\r\n return(min(a, b) * (n - 1))\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nprint(solve(n, a, b, c))\r\n \r\n", "n, a, b, c = int(input()), int(input()), int(input()), int(input())\r\nprint((min(a, b) if n > 1 else 0) + ((n - 2) * min(a, b, c) if n > 2 else 0))", "#problem65\r\nn=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif n==1:\r\n print(0)\r\nelif min(a,b,c)==a or min(a,b,c)==b:\r\n print(min(a,b)*(n-1))\r\nelse:\r\n print(min(a,b)+c*(n-2))\r\n ", "#coding=utf-8\r\n\r\ndef path(a,b,c,n):\r\n if n==1:\r\n return 0\r\n elif n==2:\r\n return min(a,b)\r\n elif n>2 and c>=min(a,b):\r\n return (n-1)*min(a,b)\r\n elif n>2 and c<min(a,b):\r\n return min(a,b)+(n-2)*c\r\n \r\ndef main():\r\n n = int(input())\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n x = path(a,b,c,n)\r\n print(x)\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif((min(a,b,c)==a)or(min(a,b,c)==b)):\r\n print((n-1)*(min(a,b)))\r\nelse:\r\n if(n==1):\r\n print(0)\r\n else:\r\n if(min(a,b)==a):\r\n print(a+((n-2)*c))\r\n else:\r\n print(b+((n-2)*c))", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nk=min(a,b,c)\r\nj=1\r\nm=0\r\nif n>1:\r\n if k==c:\r\n m=min(a,b)\r\n j+=1\r\n while j<n:\r\n j+=1\r\n m+=k\r\n else:\r\n while j<n:\r\n j+=1\r\n m+=k\r\nprint(m)\r\n", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\ns = 0\nn -= 1\nx = 1\nfor i in range(n):\n if x == 1:\n if a < b:\n s += a\n x = 2\n else:\n s += b\n x = 3\n elif x == 2:\n if a < c:\n s += a\n x = 1\n else:\n s += c\n x = 3\n else:\n if b < c:\n s += b\n x = 1\n else:\n s += c\n x = 2\nprint(s)\n ", "import sys\n\nn = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\nif n < 2:\n print(0)\n sys.exit()\n\ng = {}\ng['R'] = {'O':a,'E':b} \ng['E'] = {'R':b,'O':c} \ng['O'] = {'R':a,'E':c} \n\ncurr = 'R'\ndist = 0\n\nn -= 1 #eats at rabbits house\nwhile n > 0:\n choices = g[curr] \n curr = min(choices, key=choices.get)\n dist += choices[curr]\n n -= 1\n\nprint(dist)\n\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\ndist = 0\r\ncurr = 'r'\r\nwhile n > 1:\r\n n -= 1\r\n if curr == 'e':\r\n if b < c:\r\n curr = 'r'\r\n dist += b\r\n else:\r\n curr = 'o'\r\n dist += c\r\n elif curr == 'o':\r\n if a < c:\r\n curr = 'r'\r\n dist += a\r\n else:\r\n curr = 'e'\r\n dist += c\r\n else:\r\n if a < b:\r\n curr = 'o'\r\n dist += a\r\n else:\r\n curr = 'e'\r\n dist += b\r\nprint(dist)", "d = 0\r\nn = int(input())-1\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif(n!=0):\r\n d+=min([a,b])\r\n n-=1\r\n d+=min([a,b,c])*n\r\n print(d)\r\n \r\nelse:\r\n print(0)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nans = max(min(1, n - 1), 0) * min(a, b) + max(n - 2, 0) * min(a, b, c)\r\nprint(ans)", "N = int(input())\r\nN -= 1\r\nA = int(input())\r\nB = int(input())\r\nC = int(input())\r\nprint(min(N * A, N * B, min(A, B) + (C * (N - 1))) if N != 0 else 0)\r\n", "n = int(input())\na = int(input())\nb = int(input())\nc = int(input())\n\nif n == 1:\n print(0)\nif n == 2:\n print(min(a,b))\nif n>2:\n print(min(a,b) + (n-2)*min(a,b,c))\n" ]

[ "n,m,k=map(int,input().split())\r\nL=[]\r\nfor i in range(n):\r\n L.append(list((map(int,input().split()))))\r\n\r\nK={}\r\nfor i in range(m):\r\n K[i+1]=[]\r\n for j in range(n):\r\n if(L[j][i]==1):\r\n K[i+1].append(j+1)\r\nAns=[0]*n\r\nAnss=[0]*m\r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n Anss[y-1]+=1\r\n Ans[x-1]-=1\r\nfor i in range(n):\r\n for j in range(m):\r\n if(L[i][j]==1):\r\n Ans[i]+=Anss[j]\r\nfor item in Ans:\r\n print(item,end=\" \")\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,m,k=(int(i) for i in input().split())\r\nl=[]\r\nl2=[0]*m\r\nfor i in range(n):\r\n l1=[int(i) for i in input().split()]\r\n l.append(l1)\r\nl3=[0]*n\r\nfor i in range(k):\r\n x,y=(int(i) for i in input().split())\r\n l3[x-1]+=1\r\n l2[y-1]+=1\r\nfor i in range(n):\r\n s=0\r\n for j in range(m):\r\n if(l[i][j]==1):\r\n s+=l2[j]\r\n l3[i]=s-l3[i]\r\nprint(*l3)", "n, m, k = map(int, input().split())\na, nc, mc = [list(map(int, input().split())) for i in range(n)], [0] * n, [0] * m\nfor i in range(k):\n x, y = map(int, input().split())\n nc[x - 1] += 1\n mc[y - 1] += 1\nprint(' '.join(map(str, (sum(mc[j] for j in range(m) if a[i][j]) - nc[i] for i in range(n)))))\n", "n, m, k = map(int, input().split())\r\nchatsmembers = []\r\nchatkol = []\r\nfor i in range(n):\r\n chatsmembers.append(list(map(int, input().split())))\r\nchatkol = [0]*m\r\nchatsents = [0]*n\r\nfor i in range(k):\r\n a, b = map(int, input().split())\r\n chatsents[a - 1] += 1\r\n chatkol[b - 1] += 1\r\nfor i in range(n):\r\n t = 0\r\n for j in range(m):\r\n if chatsmembers[i][j] == 1:\r\n t += chatkol[j]\r\n print(t - chatsents[i], end = ' ')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\ng = [input()[:-1].replace(' ', '') for _ in range(n)]\r\nd = [0]*n\r\ne = [0]*m\r\nfor i in range(k):\r\n a, b = map(int, input().split())\r\n d[a-1] += 1\r\n e[b-1] += 1\r\nfor i in range(n):\r\n c = -d[i]\r\n for j in range(m):\r\n if g[i][j] == '1':\r\n c += e[j]\r\n print(c, end=' ')", "n, m, k = map(int,input().split())\r\nchats = list()\r\nfor i in range(m):\r\n chats.append([set(),0])\r\nemps = [0] * n\r\nfor i in range(n):\r\n e = list(map(int,input().split()))\r\n for j in range(m):\r\n if e[j] == 1:\r\n chats[j][0].add(i)\r\n\r\nfor i in range(k):\r\n x,y = map(int,input().split())\r\n x -= 1; y -= 1\r\n chats[y][1] += 1\r\n emps[x] -= 1\r\n\r\nfor i in chats:\r\n for j in i[0]:\r\n emps[j] += i[1];\r\n\r\nfor i in range(n):\r\n print(emps[i], end = ' ')", "R = lambda: map(int, input().split())\r\nn, m, k = R()\r\nchat = []\r\nfor i in range(n):\r\n chat.append(list(R()))\r\nman = [0] * n; room = [0] * m\r\nfor i in range(k):\r\n a, b = R()\r\n man[a-1] += 1\r\n room[b-1] += 1\r\nfor i in range(n):\r\n t = 0\r\n for j in range(m):\r\n if chat[i][j] == 1:\r\n t += room[j]\r\n print(t - man[i], end = ' ')", "import collections\n\ndef parseInt():\n return map(int, input().split())\n\nn, m, k = parseInt() \narr = []\nfor i in range(n):\n arr.append(list(parseInt()))\n\nchat_count = collections.defaultdict(int)\nuser_sent_count = collections.defaultdict(int)\nfor i in range(k):\n user, chat = parseInt()\n user_sent_count[user-1] += 1\n chat_count[chat-1] += 1\n\nans = []\nfor i in range(n):\n total_msgs = 0\n for j in range(m):\n if arr[i][j]:\n total_msgs += chat_count[j] \n total_msgs -= user_sent_count[i]\n ans.append(total_msgs)\n\nprint(' '.join(map(str, ans)))\n", "# link: https://codeforces.com/problemset/problem/413/B\r\n\r\nimport sys\r\n\r\nif __name__ == \"__main__\":\r\n i = sys.stdin.readline\r\n n,m,k = tuple(map(int, i().split()))\r\n info = [[] for i in range(n)]\r\n for j in range(n):\r\n info[j] = tuple(map(int, i().split()))\r\n employees = [0] * (n)\r\n chats = [0] * (m)\r\n for j in range(k):\r\n ei, ci = map(int, input().split()) \r\n employees[ei-1] -= 1\r\n chats[ci-1] += 1\r\n for i in range(n):\r\n for j in range(m):\r\n employees[i] += chats[j] * info[i][j]\r\n print(*employees) \r\n", "def readString():\n return input().split(\" \")\n\ndef readInts():\n return list(map(lambda s: int(s), readString()))\n\ndef readInt():\n return int(input())\n\ndef intsToString(ints):\n return \" \".join(intsToStrings(ints))\n\ndef intsToStrings(ints):\n return list(map(lambda i: str(i), ints))\n\n\n#Spyke чат\n\nn,m,k = tuple(readInts())\n\nchats = []\n\nfor i in range(m):\n chats.append([])\n\nfor i in range(n):\n userChats = readInts()\n for j in range(m):\n if userChats[j] == 1:\n chats[j].append(i)\n\nchatsEvents = [0]*m\nuserSent = [0]*n\n\nfor _ in range(k):\n x,y = tuple(readInts())\n userSent[x-1] += 1\n chatsEvents[y-1] += 1\n\nresult = [0]*n\nfor c in range(m):\n for u in chats[c]:\n result[u] += chatsEvents[c]\n\nfor i in range(n):\n result[i] -= userSent[i]\n\n\nprint(intsToString(result))\n\n\n", "#!/usr/local/bin/python3\r\nn, m, k = map(int, input().split())\r\nroom = [[] for i in range(m)]\r\nperson = []\r\nresult = [0] * n\r\nfor i in range(n):\r\n person.append(list(input().split()))\r\nfor i in range(n):\r\n n_room = 0\r\n for n_be in person[i]:\r\n if n_be == '1':\r\n room[n_room].append(i)\r\n n_room += 1\r\ncnt = [0] * m\r\nfor i in range(k):\r\n n_person, n_room = map(int, input().split())\r\n n_person -= 1\r\n n_room -= 1\r\n result[n_person] -= 1\r\n cnt[n_room] += 1\r\nfor n_room, n_cnt in enumerate(cnt):\r\n for i in room[n_room]:\r\n result[i] += n_cnt\r\nprint(' '.join(map(str, result)))", "n,m,k = map(int,input().split())\r\nmatrix = []\r\nfor i in range(n):\r\n mat = list(map(int,input().split()))\r\n matrix.append(mat)\r\nmat = [0 for i in range(m+1)]\r\nans = [0 for i in range(n+1)]\r\nfor i in range(k):\r\n a,b = map(int,input().split())\r\n mat[b-1] += 1\r\n ans[a-1] -= 1\r\nfor i in range(n):\r\n s = sum([mat[j] for j in range(m) if matrix[i][j]==1])\r\n print(ans[i]+s,end=\" \")\r\n", "import sys\r\ndef read_integers():\r\n\treturn list(map(int,sys.stdin.readline().split()))\r\nn,m,k = read_integers()\r\narr = []\r\nfor _ in range(n):\r\n\tarr.append(read_integers())\r\ngp_cnt = [0]*m\r\nmsg_cnt = [[0 for _ in range(m)] for _ in range(n)]\r\nfor _ in range(k):\r\n\ta,b = read_integers()\r\n\tgp_cnt[b-1]+=1 \r\n\tmsg_cnt[a-1][b-1]+=1 \r\nanswers = []\r\nfor i in range(n):\r\n\tans = 0 \r\n\tfor j in range(m):\r\n\t\tans += gp_cnt[j]*arr[i][j]-msg_cnt[i][j]\r\n\tanswers.append(ans)\r\nprint(\" \".join(map(str,answers)))", "#!/usr/local/bin/python3\r\nn, m, k = map(int, input().split())\r\nroom = [[] for i in range(m)]; result = [0] * n; cnt = [0] * m\r\nfor i in range(n):\r\n for n_room, n_be in enumerate(list(input().split())):\r\n if n_be == '1':\r\n room[n_room].append(i)\r\nfor i in range(k):\r\n n_person, n_room = map(int, input().split())\r\n result[n_person-1] -= 1\r\n cnt[n_room-1] += 1\r\nfor n_room, n_cnt in enumerate(cnt):\r\n for i in room[n_room]:\r\n result[i] += n_cnt\r\nprint(' '.join(map(str, result)))", "n,m,k=map(int,input().split())\r\nmat=[]\r\nfor i in range(n):\r\n mat.append(list(map(int,input().split())))\r\nout=[0]*n\r\ncol=[0]*m\r\nfor _ in range(k):\r\n e,c=map(int,input().split())\r\n out[e-1]-=1\r\n col[c-1]+=1\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j]==1:\r\n out[i]+=col[j]\r\nprint(*out)\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nYL 2 B. K6nelogi\r\n\"\"\"\r\nn,m,k=list(map(int,input().split()))\r\ntoo=dict()\r\nchat=dict()\r\nchat2=dict()\r\nfor i in range(n):\r\n too[i]=0\r\nfor i in range(m):\r\n chat2[i]=0 # Korda postitati\r\nfor i in range(n):\r\n chat[i]=list(map(int,input().split()))# info inimese kohta\r\nfor i in range(k):\r\n x,y=list(map(int,input().split()))\r\n chat2[y-1]+=1\r\n too[x-1]-=1\r\n\r\nout=[]\r\nfor i in range(n):\r\n t2=0\r\n for e in range(m):\r\n if chat[i][e]: t2+=chat2[e]\r\n t=too[i]+t2\r\n out.append(str(t))\r\nprint(' '.join(out))", "from sys import stdin,stdout\r\na,b,c=map(int,stdin.readline().split())\r\nz=[list(map(int,stdin.readline().split())) for _ in \" \"*a]\r\nk=[0]*a\r\nm=[0]*b;ans=[0]*a\r\nfor _ in \" \"*c:\r\n u,v=map(int,stdin.readline().split())\r\n k[u-1]+=1;m[v-1]+=1\r\nfor i in range(a):\r\n ans[i]=-k[i]\r\n for j in range(b):ans[i]+=m[j]*z[i][j]\r\nstdout.write(' '.join(map(str,ans)))", "R = lambda:map(int, input().split())\r\nn, m, k = R()\r\na = [list(R()) for _ in range(n)]\r\nb = [0] * n\r\nc = [0] * m\r\nfor i in range(k):\r\n x, y = R()\r\n b[x - 1] += 1\r\n c[y - 1] += 1\r\nprint(\" \".join(map(str, (sum(a[i][j] * c[j] for j in range(m)) - b[i] for i in range(n)))))", "from sys import stdin,stdout\r\n \r\nn,m,k=map(int,input().split())\r\nl=[[0]*m]*n\r\n \r\nfor i in range(n):\r\n l[i]=list(map(int,stdin.readline().split()))\r\n \r\nt=[[0]*2]*k\r\ne=[0]*n\r\nc=[0]*m\r\n \r\nfor i in range(k):\r\n t0,t1=map(int,stdin.readline().split())\r\n e[t0-1]-=1\r\n c[t1-1]+=1\r\n \r\np=[\"\"]*n\r\nfor i in range(n):\r\n for j in range(m):\r\n e[i]=e[i]+c[j]*l[i][j]\r\n p[i]=str(e[i])\r\n \r\nstdout.write(\" \".join(p))", "n,m,k=map(int,input().split())\r\np=[]\r\n\r\nfor i in range(n):\r\n o=[int(w) for w in input().split()]\r\n p.append(o)\r\n\r\nt=[0]*n\r\nr=[0]*m\r\n\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n t[a-1]+=1\r\n r[b-1]+=1\r\n\r\nfor i in range(n):\r\n ans=0\r\n for j in range(m):\r\n if p[i][j]==1:\r\n ans+=r[j]\r\n print(ans-t[i],end=\" \")" ]

[ "from sys import stdin\r\ninp = stdin.readline\r\n\r\nk, b, n = map(int, inp().split())\r\ns = [int(i) for i in inp().split()]\r\na = b % (k-1)\r\n\r\nsums = {0: 1}\r\n\r\n\r\ndef zero():\r\n i, count2 = 0, 0\r\n s.append(1)\r\n while i < n:\r\n if s[i] == 0:\r\n x = 0\r\n while s[i] == 0:\r\n x += 1\r\n i += 1\r\n count2 += int(x*(x+1)/2)\r\n i += 1\r\n return count2\r\n\r\n\r\nif b != 0:\r\n curr, count = 0, 0\r\n\r\n for i in range(n):\r\n curr = (curr + s[i]) % (k-1)\r\n x = (curr - a) % (k-1)\r\n\r\n count += sums.get(x, 0)\r\n\r\n sums[curr] = sums.get(curr, 0) + 1\r\n\r\n if b == k-1:\r\n count -= zero()\r\n\r\n print(count)\r\nelse:\r\n print(zero())\r\n", "Line1 = list(map(int,input().split())) #Lee de consola la primera linea que contiene tres enteros(separados por espacios) que\r\n #en orden representan la base en la que se representan los numeros, el \"digito de la suerte\" y \r\n #la cantidad de digitos de la lista y los guarda el la variable Line1 como una lista\r\n\r\n\r\nList = list(map(int,input().split())) #Lee de consola la segunda linea donde estan los digitos(separaados por espacio) y los \r\n #guarda en la lista List\r\n\r\n\r\ndef MartianLuck(k,b,n,digit_list): \r\n if b == 0: #Si el digito de la suerte es cero buscamos los subarrays que solo contienen ceros puesto que si se suma cualquier otra cifra \r\n #nunca se obtiene cero como raiz digital\r\n return Zero(n,digit_list)\r\n\r\n Subarray = dict() #Se crea un diccionario donde sus llaves son los valores de las raices digitales hasta ahora obtenidas en los subarrays\r\n #y los values son la cantidad de veces que hemos encontrado esta raiz digital en distintos subarrays\r\n Subarray[0]=1 #Inicialmente podemos asumir que tenemos una raiz digital de valor cero ya que esto nos ayudara con el algoritmo \r\n LuckyNumbersCounter = 0 \r\n ActualNumber = 0 #Inicializo el valor de la raiz digital actual(Como inicia en cero concuerda con que en eldictionary subarray aparezca )\r\n\r\n for Digit in digit_list : #Se recorre la lista de digitos \r\n \r\n ActualNumber = (ActualNumber + Digit) % (k-1) #Se determina el valor de la raiz digital -1 de el subarray que inicia en 0\r\n #hasta la posicion Digit \r\n \r\n Diference = (ActualNumber - b) % (k-1) #Se determina cual es el valor de la raiz digital -1 del complemento(Valor \r\n #que hay que restar a la actual raiz digital para que sea igual al digito de la suerte)\r\n \r\n LuckyNumbersCounter += Subarray.get(Diference,0) #Si el complemento anteriormente hallado esta en alguno(s) de los subarrays \r\n #digit_list[0]....digit_list[i] 0<=i<Digit(Entonces su para la llave Diference \r\n #el value indica cuantos subarrays cumplen esta condicion) entonces en dependencia \r\n #del value asociado a este Key es la cantidad de subarrays de la forma digit_list[i]....digit_list[Digit]\r\n #con raiz digital igual al digito de la suerte (b) \r\n \r\n Subarray[ActualNumber] = Subarray.get(ActualNumber,0) + 1 #Se incrementa el value asociado a la llave ActualNumber(es decir de la raiz digital actual)\r\n #En señal de que encontramos un subarray desde digit_list[0]...digit_list[Digit] cuya raiz digital es \r\n #ActualNumber para asi en futuras iteraciones si el complemento de esa raiz digital es este valor \r\n #Hayar entonces la cantidad de subarrays correctas al sumarle la cantidad de ocurrencias de este valor\r\n \r\n if b == k-1: #En caso de que el numero de la suerte b sea igual a las base en que estan representados los digitos - 1 entonces \r\n #Por la forma en que determinamos el valor de la raiz digital utilizando el resto sucede que (n-1)%(n-1)= 0 = 0%(n-1) por lo que\r\n # Contariamos los subarrays de ceros como valores correctos por lo que debemos a la cuenta actual restarle las soluciones que son cero \r\n return LuckyNumbersCounter - Zero(n,digit_list)\r\n return LuckyNumbersCounter #En caso contrario sencillamente devolvemos la solucion\r\n \r\ndef Zero(n,digit_list):\r\n Digit_index = 0 #Inicializo el indice \r\n LuckyZeroNumbersCounter =0 #Inicializo el contador\r\n while Digit_index < n: #Se recorre el array \r\n count = 0\r\n while Digit_index + count <n and digit_list[Digit_index + count] == 0: #cuando se encuentra un cero se empieza a contar el numero de ceros consecutivos\r\n count += 1 #el numero de subarrays que se obtiene en un array de k ceros consecutivos\r\n LuckyZeroNumbersCounter += count*(count +1) //2 #se puede determinar con la formula de la sumatoria de los numeros naturales hasta k\r\n Digit_index += count + 1 #Como el ciclo anterior se detiene al encontrar el primer digito que sea distinto de cero podemos iniciar la\r\n #proxima iteracion saltando a la posicion siguiente a en la que terminan los k ceros consecutivos\r\n return LuckyZeroNumbersCounter #Se devuelve la cantidad total de subarrays de ceros\r\n\r\n\r\nprint(MartianLuck(Line1[0],Line1[1],Line1[2],List)) #Se imprime la solucion", "k, b, n = map(int, input().split())\n\ndigits = list(map(int, input().split()))\n\ndef ans0():\n j = -1\n answer = 0 \n for i in range(n):\n if digits[i] != 0 or i < j:\n continue\n j = i\n while j < n and digits[j] == 0:\n j += 1\n\n r = j - i\n answer += r * (r + 1) // 2\n\n return answer\n\nif b == 0:\n print(ans0())\nelse:\n count = dict()\n count[0] = 1\n pref_sum = 0\n answer = 0\n\n if b == k - 1:\n b = 0\n answer -= ans0()\n\n for d in digits:\n pref_sum = (pref_sum + d) % (k - 1)\n\n need = (pref_sum - b) % (k - 1)\n\n answer += count.get(need, 0)\n\n count[pref_sum] = count.get(pref_sum, 0) + 1\n\n print(answer)\n", "Line1 = list(map(int,input().split()))\r\nList = list(map(int,input().split()))\r\n\r\ndef MartianLuck(k,b,n,digit_list): \r\n if b == 0: \r\n return Zero(n,digit_list)\r\n\r\n Subarray = dict()\r\n Subarray[0]=1\r\n LuckyNumbersCounter = 0\r\n ActualNumber = 0 \r\n\r\n for Digit in digit_list :\r\n ActualNumber = (ActualNumber + Digit) % (k-1) \r\n Diference = (ActualNumber - b) % (k-1) \r\n LuckyNumbersCounter += Subarray.get(Diference,0)\r\n Subarray[ActualNumber] = Subarray.get(ActualNumber,0) + 1\r\n \r\n if b == k-1: \r\n return LuckyNumbersCounter - Zero(n,digit_list)\r\n return LuckyNumbersCounter \r\n \r\ndef Zero(n,digit_list):\r\n Digit_index = 0\r\n LuckyZeroNumbersCounter =0\r\n while Digit_index < n:\r\n count = 0\r\n while Digit_index + count <n and digit_list[Digit_index + count] == 0:\r\n count += 1\r\n LuckyZeroNumbersCounter += count*(count +1) //2\r\n Digit_index += count + 1\r\n return LuckyZeroNumbersCounter\r\n\r\nprint(MartianLuck(Line1[0],Line1[1],Line1[2],List))\r\n" ]

[ "from bisect import bisect_left\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nsum_a, sum_b = sum(a), sum(b)\r\ndelta = sum_b - sum_a\r\nans = abs(delta)\r\nans_swap = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if abs((sum_a - a[i] + b[j]) - (sum_b + a[i] - b[j])) < ans:\r\n ans = abs((sum_a - a[i] + b[j]) - (sum_b + a[i] - b[j]))\r\n ans_swap = [(i+1, j+1)]\r\n\r\nd = dict()\r\nfor i in range(m):\r\n for j in range(i+1, m):\r\n d[b[i]+b[j]] = (i+1, j+1)\r\n\r\nminf, inf = -10**13, 10**13\r\nval = [minf, minf] + sorted(d.keys()) + [inf, inf]\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n ap = a[i] + a[j]\r\n req = (delta + ap*2) >> 1\r\n k = bisect_left(val, req)\r\n\r\n for k in range(k-1, k+2):\r\n if abs(delta + ap*2 - val[k]*2) < ans:\r\n ans = abs(delta + ap*2 - val[k]*2)\r\n ans_swap = [(i+1, d[val[k]][0]), (j+1, d[val[k]][1])]\r\n\r\nprint(ans)\r\nprint(len(ans_swap))\r\nfor x, y in ans_swap:\r\n print(x, y)\r\n" ]

[ "n, m = map(int, input().split())\r\na = [0]*105\r\n\r\nwhile m:\r\n l, r = map(int, input().split())\r\n a[l] += 1\r\n a[r+1] -= 1\r\n m -= 1\r\n\r\nfor i in range(1, n+1):\r\n a[i] += a[i-1]\r\n\r\nflag = 1\r\nfor i in range(1, n+1):\r\n if a[i] == 0 or a[i] > 1:\r\n flag = 0\r\n print(i, '', end = '')\r\n print(a[i], '', end = '')\r\n break\r\nif flag:\r\n print('OK')", "n,m = map(int,input().split())\r\nLn = [0]*n\r\nwhile m!=0:\r\n a,b = map(int,input().split())\r\n for i in range(a,b+1):\r\n Ln[i-1]+=1\r\n m-=1\r\nfor i in range(0,len(Ln)):\r\n if Ln[i]==0 :\r\n print(i+1,0)\r\n exit(0)\r\n elif Ln[i]>1:\r\n print(i+1,Ln[i])\r\n exit(0)\r\nprint('OK')\r\nexit(0)\r\n \r\n \r\n", "import sys\r\n\r\n#sys.stdin = open('input.txt', 'r')\r\n#sys.stdout = open('output.txt', 'w')\r\n\r\nn, m = map(int, input().split())\r\nc = [0 for i in range(n + 1)]\r\nfor i in range(m):\r\n\tx, y = map(int, input().split())\r\n\tfor j in range(x, y + 1):\r\n\t\tc[j] += 1\r\nfor i in range(1, n + 1):\r\n\tif c[i] != 1:\r\n\t\tprint(str(i) + \" \" + str(c[i]))\r\n\t\texit(0)\r\nprint(\"OK\")", "n,m=map(int,input().split())\r\na=[0]*(n+1)\r\nfor _ in range(m):\r\n L,R=map(int,input().split())\r\n for x in range(L,R+1): a[x]+=1\r\nx=0 \r\nfor i in range(1,n+1):\r\n if a[i]!=1:\r\n x=i\r\n break\r\nprint(\"OK\") if x==0 else print(x, a[x])\r\n \r\n", "n,m=map(int,input().split())\r\nar=[0 for _ in range(n)]\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n for j in range(a-1,b):\r\n ar[j]+=1\r\nfor e in range(n):\r\n if(ar[e]!=1):\r\n print(e+1,ar[e])\r\n break\r\nelse:\r\n print(\"OK\")\r\n", "# by hdev\ndef parsing(dual) :\n a_b = dual.split()\n a = int(a_b[0])\n b = int(a_b[1])\n return (a, b)\n\ndef creatTable(rows) :\n table = []\n index = 1\n while index <= rows :\n ai_bi = parsing(input())\n table.append(ai_bi)\n index += 1\n return table\n\nclass schedule():\n def __init__(self, n_m) :\n\n days_people = parsing(n_m)\n self.days = days_people[0]\n self.people = days_people[1]\n\n self.table = creatTable(self.people)\n self.check2()\n\n # def check(self) :\n # print(\"CHECKING...\")\n #\n # day_n = self.days\n #\n # day_i = 1\n # index = 0\n #\n # while index < self.people :\n # print(self.table[index])\n #\n #\n # if row[index][0] = day_i :\n # print(day_i)\n # day_i += 1\n # elif row[index] :\n #\n #\n # day_i = None\n # index += 1\n\n def check2(self) :\n self.fullTable = []\n for row in self.table :\n ai = row[0]\n bi = row[1]\n i = ai\n while i <= bi :\n self.fullTable.append(i)\n i += 1\n\n self.optimalTable = []\n i = 1\n while i <= self.days :\n self.optimalTable.append(i)\n i += 1\n\n # print(self.fullTable)\n # print(self.optimalTable)\n\n for optimal in self.optimalTable :\n goodSoFar = True\n if self.fullTable.count(optimal) == 1 :\n #print(optimal, \"pass\")\n continue\n else :\n #print(optimal, \"fail\")\n day = optimal\n times = self.fullTable.count(optimal)\n goodSoFar = False\n break\n\n if goodSoFar == True :\n print(\"OK\")\n else :\n print(day, times)\n\n#def parsing(listoflines) :\n\nschedule1 = schedule(input())\n", "a = input().split()\r\ns = {}\r\nfor i in range(int(a[0])):\r\n s[i+1] = 0\r\nfor i in range(int(a[1])):\r\n d = input().split()\r\n for j in range(int(d[0]),int(d[1]) + 1):\r\n s[j] += 1\r\nfor i in s:\r\n if s[i] != 1:\r\n print(i,s[i])\r\n exit()\r\nprint(\"OK\")", "R = lambda:list(map(int, input().split()))\r\n\r\nn, m = R()\r\ninps = []\r\nfor x in range(m):\r\n inps.append(R())\r\n\r\ndArray = [0 for i in range(n)]\r\n\r\nfor x in inps:\r\n start = x[0]\r\n end = x[1]\r\n\r\n for i in range(start, end+1):\r\n dArray[i-1] +=1\r\n \r\nans = 'OK'\r\nfor i in range(n):\r\n if dArray[i] == 1:\r\n continue\r\n else:\r\n ans = str(i+1) + ' ' + str(dArray[i])\r\n break\r\n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd = [0]*(n+1)\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n for j in range(a, b+1):\r\n d[j] += 1\r\n\r\nfor i in range(1, n+1):\r\n if d[i] == 1:\r\n continue\r\n else:\r\n print(i, d[i])\r\n break\r\nelse:\r\n print('OK')", "n, m = map(int, input().split())\r\nc = [0] * n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n for j in range(a - 1, b):\r\n c[j] += 1\r\nfor i in range(n):\r\n if c[i] != 1:\r\n print(i + 1, c[i])\r\n exit()\r\nprint('OK')", "import sys\r\nn,m=map(int,input().split())\r\nlist1=[]\r\nlist1=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n list1.extend([int(i) for i in range(a,b+1)])\r\nfor i in range(1,n+1):\r\n t=list1.count(i)\r\n if t!=1:\r\n print(i,t)\r\n sys.exit()\r\nprint('OK')\r\n", "# LUOGU_RID: 101872602\ns=input().split(' ')\r\ndays=int(s[0])\r\npeople_num=int(s[1])\r\n\r\n\r\ndef is_holidays_OK(days,people_num):\r\n holiday=[0]*days\r\n while(people_num!=0):\r\n input_stream=input().split(' ')\r\n start_day=int(input_stream[0])\r\n end_day=int(input_stream[1])\r\n for j in range(start_day-1,end_day):\r\n holiday[j]+=1\r\n people_num-=1\r\n for i in range(days):\r\n if holiday[i]!=1:\r\n return str(i+1)+' '+str(holiday[i])\r\n return 'OK'\r\n\r\nprint(is_holidays_OK(days,people_num))", "num_days, num_spans = map(int, input().split())\nspans = [ list(map(int, input().split())) for i in range(num_spans) ]\ncounts = [ 0 for i in range(num_days + 1) ]\n\nfor a, b in spans:\n for day in range(a, b + 1):\n counts[day] += 1\n\nfor day in range(1, num_days + 1):\n if counts[day] != 1:\n print(day, counts[day])\n import sys; sys.exit()\n\nprint('OK')\n", "n, m = [int(i) for i in input().split()]\r\ndays = [0] * n\r\nfor i in range(m):\r\n s, f = [int(k) for k in input().split()]\r\n for k in range (f - s + 1):\r\n days[s - 1 + k] +=1\r\nm = -1\r\nfor i in range(n):\r\n if days[i] != 1:\r\n m = i + 1\r\n n = days[i]\r\n break\r\nif m == -1:\r\n print(\"OK\\n\")\r\nelse:\r\n print(\"%d %d\\n\" % (m, n))\r\n", "n,m=map(int,input().split())\r\njel=[0]*(n+1)\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n for t in range(a,b+1): jel[t]+=1\r\ni=1\r\nwhile i<=n and jel[i]==1: i+=1\r\nif i>n:\r\n print('OK')\r\nelse:\r\n print(i,jel[i])\r\n", "holidays, people = map(int, input().split())\r\n\r\nwater = [0] * holidays\r\n\r\n\r\nfor p in range(people):\r\n start, end = map(int, input().split())\r\n for i in range(start, end+1):\r\n water[i-1] += 1\r\n\r\n\r\n\r\n\r\nf = 1\r\n\r\nfor i, w in enumerate(water):\r\n if w != 1:\r\n print(i + 1, end=' ')\r\n print(w)\r\n f = 0 \r\n break\r\nif f:\r\n print(\"OK\")\r\n\r\n", "n, m = [int(j) for j in input().split()]\r\nstatus = n * [0]\r\nfor j in range(m):\r\n a, b = [int(j) for j in input().split()]\r\n for k in range(a - 1, b):\r\n status[k] += 1\r\noutput = \"OK\"\r\nfor j in range(n):\r\n if status[j] != 1:\r\n output = str(j + 1) + \" \" + str(status[j])\r\n break\r\nprint(output)\r\n", "import sys\r\nL=[]\r\ninp=list(map(int,input().split()))\r\nday=inp[0]\r\npeo=inp[1]\r\na=[0]*(day+1)\r\nfor i in range(0,peo):\r\n inp=list(map(int,input().split()))\r\n for j in range(inp[0],inp[1]+1):a[j]+=1\r\nfor i in range(1,day+1):\r\n if a[i]!=1: \r\n print(str(i)+' '+str(a[i]))\r\n sys.exit()\r\nprint('OK')", "n, m = [int(i) for i in input().split()]\r\na = [0] * n\r\nfor i in range(m):\r\n x, y = [int(i) for i in input().split()]\r\n for j in range(x - 1, y):\r\n a[j] += 1\r\nfor i in range(n):\r\n if a[i] != 1:\r\n print(i+1, a[i])\r\n exit(0)\r\nprint(\"OK\")\r\n", "n , m = map(int,input().split())\r\nlis=[]\r\nlis.append([0,0])\r\nlis.append([n+1,n+1])\r\nc=0\r\nans=0\r\nfor i in range(m):\r\n a , b = map(int,input().split())\r\n lis.append([a,b])\r\nlis.sort()\r\nfor i in range(m+1):\r\n if lis[i][1]+1<lis[i+1][0]:\r\n print(lis[i][1]+1,'0')\r\n exit()\r\n elif lis[i][1]>=lis[i+1][0]:\r\n ans=lis[i+1][0]\r\n break\r\nif ans==0:\r\n print(\"OK\")\r\n exit()\r\nfor j in range(m+1):\r\n if lis[j][0]<=ans and lis[j][1]>=ans:\r\n c+=1\r\nprint(ans,c) \r\n\r\n\r\n", "n, m = input().split()\r\nn, m=int(n), int(m)\r\nout=False\r\nd=[0 for i in range(0,n+2)]\r\nfor i in range(0,m):\r\n a, b=input().split()\r\n a, b=int(a), int(b)\r\n d[a]+=1\r\n d[b+1]-=1\r\nfor i in range(1,n+1):\r\n count=sum(d[0:i+1])\r\n if count!=1:\r\n print(i,count)\r\n out=True\r\n break\r\nif not out:\r\n print(\"OK\")", "nm = input().split(\" \")\r\nn = int(nm[0])\r\nm = int(nm[1])\r\nls = [0] * n\r\nday = []\r\nfor i in range(m):\r\n d = input().split(\" \")\r\n d = [int(x) for x in d]\r\n day.append(d)\r\nun_ans = [0, 0]\r\ndef cc():\r\n for i in day:\r\n for i in range(i[0] - 1, i[1]):\r\n ls[i] += 1\r\n for i in range(n):\r\n if ls[i] != 1:\r\n print(\"{} {}\".format(i+1, ls[i]), end=\"\")\r\n return 0\r\n print(\"OK\", end=\"\")\r\n return 0\r\ncc()", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn,k=f()\r\nl=[0]*(n+2)\r\nfor _ in range(k):\r\n a,b=f()\r\n l[a]+=1\r\n l[b+1]-=1\r\nfor i in range(1,n+2):\r\n l[i]=l[i]+l[i-1]\r\nfor i in range(1,n+1):\r\n if l[i]==0 or l[i]>1:\r\n exit(print(i,l[i]))\r\nprint('OK')", "\r\ntable = {}\r\nn,m = [int(k) for k in input().split()]\r\nfor i in range(1,n+1):\r\n table[i] = 0\r\na = []\r\nb = []\r\ncheck = 0\r\nfor i in range(m):\r\n x = [int(k) for k in input().split()]\r\n a.append(x[0] )\r\n b.append(x[1] )\r\nfor i in range(m):\r\n for j in range(a[i], b[i]+1 ):\r\n table[j] += 1\r\nfor i in range(1,n+1):\r\n if table[i] != 1:\r\n amount = table[i]\r\n date = i\r\n check = 1\r\n break\r\nif check == 1:\r\n print(date,amount)\r\nelse:\r\n print(\"OK\")\r\n\r\n", "n,m=map(int,input().split())\r\ncnt=[0]*(n+1)\r\nfor i in range(1,m+1):\r\n a,b=map(int,input().split())\r\n for i in range(a,b+1):\r\n cnt[i]+=1 \r\nf=0\r\nfor i in range(1,n+1):\r\n if cnt[i]==0 or cnt[i]>1:\r\n print(i,cnt[i])\r\n f=1 \r\n break \r\nif f==0:\r\n print('OK')", "n, m = tuple(map(int, input().split()))\narr = []\nfor _ in range(m):\n\tarr.append(tuple(map(int, input().split())))\n\ncurrent_day = 0\nfor i in range(len(arr)):\n\tt = arr[i]\n\tif(t[0] == current_day):\n\t\tcount = 2\n\t\tfor j in range(i+1, len(arr)):\n\t\t\tif(arr[j][0] == current_day):\n\t\t\t\tcount += 1\n\t\t\telse:\n\t\t\t\tbreak\n\t\tprint(current_day, count)\n\t\texit()\n\telif(t[0] > current_day + 1):\n\t\tprint(current_day + 1, \"0\")\n\t\texit()\n\telse:\n\t\tcurrent_day = t[1]\nif(current_day != n):\n\tprint(current_day + 1, \"0\")\nelse:\n\tprint(\"OK\")", "n, m=map(int, input().split())\r\na=[0]*n\r\nfor i in range(m):\r\n x, y=map(int, input().split())\r\n for j in range(x-1, y):\r\n a[j] += 1\r\nfor i in range(n):\r\n if a[i] != 1:\r\n print(i+1, a[i])\r\n break\r\nelse:\r\n print(\"OK\")", "n,m = map(int, input().split())\r\na = [0]*n\r\nfor i in range(m):\r\n l,r = map(int, input().split())\r\n for j in range(l,r+1):\r\n a[j-1] += 1\r\nif sum(a) == n and not 0 in a: print(\"OK\") \r\nelse:\r\n for i in range(n):\r\n if a[i] != 1: print(i+1,a[i]); exit()", "I = input().split()\r\nn = int(I[0])\r\nm = int(I[1])\r\n\r\ndata = []\r\nfor i in range(m):\r\n I = input().split()\r\n for j in range(int(I[0]), int(I[1]) + 1):\r\n data.append(j)\r\n\r\noccurrence = []\r\nfor i in range(1, n+1):\r\n occurrence.append(data.count(i))\r\n\r\nMistake = False\r\nfor i in occurrence:\r\n if i != 1:\r\n print(str(occurrence.index(i) + 1) + \" \" + str(i))\r\n Mistake = True\r\n break\r\n\r\nif not Mistake:\r\n print(\"OK\")", "n,t = map(int,input().split())\ntmp = [0 for i in range(n)]\nfor i in range(t):\n l,r = map(int,input().split())\n for j in range(l-1,r):\n tmp[j] +=1\n\nfor i in range(n):\n if tmp[i] != 1:\n print(i+1,tmp[i])\n break\nelse:\n print(\"OK\")\n\t \t \t \t \t\t\t\t \t\t\t\t \t \t \t\t \t", "# LUOGU_RID: 111777003\na = [0] * 101\n\nn, m = [int(i) for i in input().split()]\nfor i in range(1, m + 1):\n l, r = [int(i) for i in input().split()]\n for j in range(l, r + 1):\n a[j] += 1\nfor i in range(1, n + 1):\n if a[i] != 1:\n print(i, a[i], sep=' ')\n exit()\nprint('OK')", "[n, m] = map(int, input().split())\r\nst = [0] * (n + 1)\r\nfor i in range(m):\r\n [a, b] = map(int, input().split())\r\n for j in range(a, b + 1):\r\n st[j] += 1\r\nk = 0\r\nfor i in range(1, n + 1):\r\n if st[i] != 1:\r\n k = i\r\n break\r\n\r\nif k != 0:\r\n print(\"%d %d\"%(k, st[k]))\r\nelse:\r\n print(\"OK\")\r\n" ]

[ "r, h = map(int, input().split())\r\na = 1 + 2 * h // r\r\nif h % r >=3 ** 0.5 * r / 2:\r\n a += 1\r\nprint(a)\r\n", "r, h = map(int, input().split())\r\nres = h // r * 2\r\nif 2 * (h % r) >= (3 ** .5) * r:\r\n res += 3\r\nelif 2 * (h % r) >= r:\r\n res += 2\r\nelse:\r\n res += 1\r\nprint(res)", "from math import *\n\nr, h = map(int, input().split())\nd = h % r\n\nif d * 2 < r:\n print(h // r * 2 + 1)\nelif sqrt(3) * (r / 2) + r - 1e-6 <= d + r:\n print(h // r * 2 + 3)\nelse:\n print(h // r * 2 + 2)\n", "r, h = map(int, input().split())\r\nd, p = (3 ** 0.5) / 2 - 1, h / r\r\nprint(max(1 + 2 * int(p - d), 2 * int(p + 0.5)))", "r,h=map(int,input().split())\r\nz=h//r\r\nans=z*2+1;h-=r*z\r\nif h*h*4>=r*r:ans+=1\r\nif h*h*4>=r*r*3:ans+=1\r\nprint(ans)", "#!/usr/bin/python3\n\nfrom math import sqrt\n\nr, h = tuple(map(int, input().split()))\nans = (2 * h + r) // (2 * r)\nprint(2 * ans + (ans * r + sqrt(3.0) * r / 2 <= h + r))\n", "#!/usr/bin/python3\n\nr, h = tuple(map(int, input().split()))\nans = (2 * h + r) // (2 * r)\nprint(2 * ans + (3 * r**2 <= 4 * (h + r - ans * r)**2))\n", "#!/bin/python\r\nfrom math import sqrt\r\n\r\nr, h = (int(x) for x in input().split(' '))\r\n\r\n# You can always put two in each \"row\" of the rectangle and one in the dome\r\nin_box = 2 * h // r + 1\r\n\r\n# You can add an additional one, like so:\r\n# O\r\n# O\r\n#\r\n# since they all have radius r/2, you can get the height needed to add an additional one through Pythagorean theorem\r\nremainder = h % r + r\r\nheight = r * sqrt(3) / 2 + r\r\n\r\nif remainder < height:\r\n\tprint(in_box)\r\nelse:\r\n\tprint(in_box + 1)", "r, h = map(int, input().split())\n\na = 2 * (h // r)\n\nh = h % r\n\nprint (a + 1 + (2*h>=r) + (4*h*h >= 3*r*r))\n\n\n\n# Made By Mostafa_Khaled", "r,h = map(int,input().split())\r\ns = h%r\r\na = (h//r)*2\r\nif s*s >= 3*r*r/4:\r\n\ta += 3\r\nelif 2*s >= r:\r\n\ta += 2\r\nelse:\r\n\ta += 1\r\nprint(a)", "def square_dist(x1,y1,x2,y2):\r\n return (x1 - x2)**2 + (y1 - y2)**2\r\n\r\nr,h = map(int,input().split())\r\nd = int((h + r/2)/r)\r\nans = square_dist(-r, r + 2*r*(d-1),0, 2*h + r) >= 4*r*r\r\nprint(2*d + ans)", "r, h = map(int, input().split())\r\nk = (h // r) * 2\r\nd = h % r\r\nif d >= 2 * r / 3 + 1:\r\n k += 3\r\nelif d >= r / 2:\r\n k += 2\r\nelse:\r\n k += 1\r\nprint(k)", "from math import sqrt\nr, h = [int(x) for x in input().split()]\nr <<= 1\nh <<= 1\n\nans = h // r * 2\nh %= r\nif h >= (r // 2):\n ans += 2\n if 3 * r * r <= 4 * h * h:\n ans += 1\nelse:\n ans += 1\nprint(ans)\n", "r,h = map(int,input().split())\r\nans = int(h//(r/2))\r\nballoons = ans + (ans%2)\r\nif balloons == 0:\r\n dist = r+1\r\nelse:\r\n dist = (((r/2)**2) + ((h - ((balloons//2)-1)*r)**2))**.5 \r\nif dist >= r:\r\n balloons += 1\r\nprint(balloons)" ]

[ "enter = input().split()\r\nn = int(enter[0]) - 1\r\ns = int(enter[1]) - 1 \r\nt = int(enter[2]) - 1\r\nfix = s\r\narr_b = [int(i) - 1 for i in input().split()]\r\narr_a = [i for i in range(1,n+2)]\r\ntarget = arr_a[s]\r\nflag = 0\r\n#print(arr_a)\r\n#print(arr_b)\r\n\r\n\r\ni = 0\r\nwhile (arr_a[t] != target):\r\n \r\n correct_pos = arr_b[s] \r\n arr_a[correct_pos],arr_a[s] = arr_a[s],arr_a[correct_pos]\r\n s = correct_pos\r\n i = i + 1\r\n if (target == arr_a[fix]):\r\n flag = 1\r\n break\r\n#print(arr_a)\r\nif (flag==0):\r\n print(i)\r\nelse:\r\n print(-1)", "n,s,f=map(int,input().split())\ns,f=s-1,f-1\narr = [int(i)-1 for i in input().split()]\nif s==f:\n print(0)\nelse:\n cnt = 0\n temp = arr[s]\n while cnt<n+3:\n cnt+=1\n if temp==f:\n break\n else:\n temp = arr[temp]\n if cnt>n:\n print(-1)\n else:\n print(cnt)\n", "n,i,f=map(int,input().split())\r\nmoves=0\r\nL=[int(i) for i in input().split()]\r\nfor j in range(n):\r\n if i==f:\r\n print(moves)\r\n exit(0)\r\n i=L[i-1]\r\n moves+=1\r\nprint(\"-1\")\r\n", "from sys import stdin\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\n\r\nn,s,t=mp()\r\nl=mp()\r\nans=0\r\nif s==t:\r\n\tprint(0)\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif s==t:\r\n\t\t\tprint(i)\r\n\t\t\tbreak\r\n\t\ts=l[s-1]\r\n\telse:\r\n\t\tprint(-1)\r\n", "n, s, t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nx=s-1\r\ncount=0\r\ndone=0\r\nwhile x!=(t-1):\r\n if count!=n:\r\n x=l[x]-1\r\n count+=1\r\n \r\n else:\r\n done=1\r\n break\r\n\r\nif done==1:\r\n print(-1) \r\nelse:\r\n print(count) ", "n,s,t = map(int,input().split())\np = list(map(int,input().split()))\nshuf = {}\nfor i,pos in enumerate(p):\n\tshuf[i+1] = pos\nsteps = 0\nvisited = {}\nvisited[s] = 1\nif s==t:\n\tprint(steps)\n\texit()\nwhile(shuf[s] not in visited):\n\tvisited[shuf[s]] = 1\n\ts = shuf[s]\n\tsteps +=1\n\tif s==t:\n\t\tprint(steps)\n\t\texit()\nprint(-1)\n", "arr=[int(x) for x in input().split()]\r\nn,s,t=arr[0],arr[1],arr[2]\r\narr=[int(x) for x in input().split()]\r\nans=0\r\nwhile(True):\r\n if(s==t):\r\n print(ans)\r\n break\r\n elif(arr[s-1]==-1):\r\n print(-1)\r\n break\r\n else:\r\n a=arr[s-1]\r\n arr[s-1]=-1\r\n s=a\r\n ans+=1", "n,s,t=input().split()\r\nn,s,t=int(n),int(s),int(t)\r\narr=list(map(int,input().strip().split()))[:n]\r\n\t\r\nif s==t: \r\n print(0)\r\n exit()\r\nx=s\r\nidx=s-1\r\nc=1\r\nx=arr[idx]\r\nwhile x!=t and x!=s:\r\n\tx=arr[x-1]\r\n\tc+=1\r\nif x==s: print(-1)\r\nelse: print(c)", "n,s,t = map(int,input().split())\r\np = list(map(int, input().split()))\r\ncount = 1\r\nx = s-1\r\nf =0\r\nif(s == t):\r\n print(\"0\")\r\nelse:\r\n for i in range(n):\r\n if(t == p[x]):\r\n print(count)\r\n f=1\r\n break\r\n else:\r\n x = p[x]-1\r\n count+=1\r\n if(f==0):\r\n print(\"-1\")", "n,s,t=list(map(int,input().split()))\r\na=list(map(int,input().rstrip().split()))\r\na.insert(0,0)\r\np=dict()\r\ncurr=s\r\nflag=0\r\nif s==t:\r\n print(0)\r\n exit()\r\ncount=1\r\nwhile(1):\r\n if curr in p:\r\n flag=1\r\n break\r\n else:\r\n p[curr]=1\r\n curr=a[curr]\r\n \r\n if curr==t:\r\n break\r\n count+=1\r\nif flag==1:\r\n print(-1)\r\nelse:\r\n print(count)\r\n \r\n \r\n ", "n, s, t = map(int, input().split())\n\np = list(map(int, input().split()))\n\n\n\nfor step in range(10**5):\n if s == t:\n print(step)\n break\n s = p[s-1]\n\nelse:\n print(-1)", "# import sys\n# sys.stdin = open('input.txt')\n# sys.stdout = open('output.txt', 'w')\n\n\n\n\nn, s, t = list(map(int, input().split()))\nlis1 = list(map(int, input().split()))\nmaps = {}\nfor i in range(n):\n maps[i + 1] = lis1[i]\ncurr_pos = s\ncount = 0\nans = False\nif s == t :\n print(0)\n exit()\nwhile True :\n curr_pos = maps[curr_pos]\n count += 1\n if curr_pos == t :\n ans = True\n break\n if curr_pos == s :\n break\n\nif ans :\n print(count)\nelse :\n print(-1)\n\n\n \n", "def main():\r\n n, s, t = list(map(int, input().split()))\r\n p = list(map(int, input().split()))\r\n p = [i-1 for i in p]\r\n cnt = 0\r\n s -= 1\r\n t -= 1\r\n if s == t:\r\n return 0\r\n else:\r\n while cnt <= n:\r\n s = p[s]\r\n cnt += 1\r\n if s == t:\r\n return cnt\r\n return -1\r\nif __name__ == \"__main__\":\r\n print(main())", "\r\nn,s,t = map(int,input().split())\r\nl = []\r\nmp = map(int,input().split())\r\nfor i in mp:\r\n l.append(i)\r\na = [-1 for i in range(n)]\r\ncur=0\r\nnext=s\r\nfor i in range(n):\r\n cur = next\r\n if a[cur-1]==-1:\r\n a[cur-1] = i\r\n else:\r\n break\r\n next = l[cur-1]\r\n #print(a)\r\n\r\nprint(a[t-1])", "n, s, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = 0\r\ninit_s = s\r\nflag = 0\r\n\r\nwhile True:\r\n\tif s==t:\r\n\t\tflag = 1\r\n\t\tbreak\r\n\ts = a[s-1]\r\n\tif s==init_s:\r\n\t\tbreak\r\n\tk += 1\r\nif flag:\r\n\tprint (k)\r\nelse:\r\n\tprint (-1)", "n,s,t = map(int, input().split())\r\np = list(map(int, input().split()))\r\ncount = 0\r\nwhile(s!=t and p[s-1]!=0):\r\n temp = p[s-1]\r\n p[s-1] = 0\r\n s = temp\r\n count+=1\r\nif s==t:\r\n print(count)\r\nelse:\r\n print(-1)\r\n", "\r\nn,s,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ncount = 0\r\ntemp = 0\r\nfor i in range(n):\r\n if s==t:\r\n temp = 1\r\n break\r\n else:\r\n s = l[s-1]\r\n\r\n count+=1\r\nif temp == 0:\r\n print(-1)\r\nelse:\r\n print(count)", "import sys\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ninl = lambda: list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n if s == t:\r\n return 0\r\n\r\n visited = {s}\r\n curr = s\r\n ans = 0\r\n while curr != t:\r\n curr = p[curr]\r\n if curr in visited:\r\n return -1\r\n else:\r\n visited.add(curr)\r\n ans += 1\r\n return ans\r\n\r\n\r\nn, s, t = inl()\r\ns, t = s - 1, t - 1\r\np = inl()\r\np = [e - 1 for e in p]\r\nprint(solve())\r\n", "# cook your dish here\r\nn=input().split(' ')\r\ns=int(n[1])\r\nt=int(n[2])\r\nn=int(n[0])\r\np=input().split(' ')\r\np=list(map(int,p))\r\npos=s\r\ntime=0\r\nwhile(1):\r\n if(s==t):\r\n print('0')\r\n break\r\n pos=p[pos-1]\r\n time+=1\r\n if(pos==t):\r\n print(time)\r\n break\r\n elif(pos==s):\r\n print('-1')\r\n break\r\n\r\n ", "n,s,t = map(int,input().split(' '))\np = list(map(int,input().split(' ')))\n\nd = {}\nfor i,x in enumerate(p):\n d[x] = i + 1\n\nvis = [0]*(n+1)\n\nans = 0\nwhile not vis[t] and s != t:\n vis[t] = 1\n t = d[t]\n ans += 1\n\nif s != t:\n print(-1)\nelse:\n print(ans)\n\n", "n,a,b = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nl.insert(0, 0)\r\nlast = a\r\nd = 0\r\nwhile l[last] != 0 and last != b:\r\n nex = l[last]\r\n l[last] = 0\r\n last = nex\r\n d += 1\r\nif last == b:\r\n print(d)\r\nelse:\r\n print(-1)", "n, s, t = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nfor i in range(n):\r\n if s == t : print(i); exit()\r\n s = p[s-1]\r\nprint(-1)", "n,s,t = [int(x) for x in input().split(\" \")]\r\nl = [int(x) for x in input().split(\" \")]\r\nd = {}\r\nans = 0\r\nfor i in range(n):\r\n d[i+1] = l[i]\r\n\r\nwhile(s!=t):\r\n if ans>=n:\r\n ans = -1\r\n break\r\n ans += 1\r\n s = d[s]\r\n\r\nprint(ans)", "\r\n# Online Python - IDE, Editor, Compiler, Interpreter\r\nfrom collections import deque,defaultdict\r\nimport sys\r\ndef inp(): return int(sys.stdin.readline())\r\ndef mpp(): return map(int,sys.stdin.readline().rstrip().split())\r\ndef lis(): return list(map(int,sys.stdin.readline().rstrip().split()))\r\ndef sol(p,s,t):\r\n visited=dict()\r\n visited[s]=1\r\n q=deque()\r\n q.append((s,0))\r\n count=0\r\n while q:\r\n temp,cnt=q.popleft()\r\n if temp==t:\r\n return cnt\r\n if visited.get(p[temp-1]):\r\n return -1\r\n q.append((p[temp-1],cnt+1))\r\n return -1\r\ndef main():\r\n n,s,t=mpp()\r\n arr=lis()\r\n graph=defaultdict(list)\r\n #print(graph)\r\n sys.stdout.write(str(sol(arr,s,t)))\r\nif __name__==\"__main__\":\r\n main()", "n,s,t=map(int,input().split())\r\nnext=list(map(int,input().split()))\r\nnext=[0]+next\r\nst=set()\r\ncount=0\r\ncnt=0\r\ni=s\r\nif(t==s):\r\n print(0)\r\nelse: \r\n\r\n while(next[i]!=t):\r\n if(next[i] not in st):\r\n st.add(next[i])\r\n count+=1\r\n i=next[i]\r\n else:\r\n print(-1)\r\n cnt=1\r\n break\r\n if(cnt!=1): \r\n print(count+1)\r\n ", "def solve(n, s, t, arr, curr):\r\n curr = s\r\n op = 0\r\n while op <= n and curr != t:\r\n curr = arr[curr - 1] \r\n op += 1 \r\n if op > n:\r\n return -1\r\n return op\r\n \r\n\r\nn, s, t = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncurr = s\r\nprint(solve(n, s, t, arr, curr))", "n,s,t=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\ninitial=s\r\nfinal=t\r\nc=0\r\nf=0\r\nif s==t:\r\n print(0)\r\nelse:\r\n for _ in range(n):\r\n if s==final:\r\n f=1\r\n break\r\n else:\r\n temp=l[s-1]\r\n s=temp\r\n c+=1\r\n if f==0:\r\n print(-1)\r\n else:\r\n print(c)\r\n ", "\"\"\"\r\n Author : Ashish Sasmal\r\n Python3 / PyPy3\r\n\"\"\"\r\n\r\nfrom sys import stdin as sin\r\ndef aint():return int(input())\r\ndef amap():return map(int,sin.readline().split())\r\ndef alist():return list(map(int,sin.readline().split()))\r\ndef astr():return input()\r\n\r\nn,s,t = amap()\r\np = alist()\r\n\r\nflag = False\r\ng = s\r\nc = 0\r\nwhile True:\r\n if g==t:\r\n flag = True\r\n break\r\n c+=1\r\n g = p[g-1]\r\n if g==s:\r\n break\r\n \r\n\r\nif flag:print(c)\r\nelse:print(-1)", "n, s, t = map(int, input().split())\r\narr = [0] + list(map(int, input().split()))\r\n\r\nif s == t:\r\n print(0)\r\nelse:\r\n ans = 0\r\n vis = {s}\r\n while s != t:\r\n ans += 1\r\n s = arr[s]\r\n if s in vis:\r\n print(-1)\r\n exit(0)\r\n vis.add(s)\r\n print(ans)\r\n", "n, s, t = [int(i) for i in input().split()]\np = [int(i) for i in input().split()]\n\nstart = s\namount = 0\nwhile s != t and amount <= n:\n s = p[s - 1]\n if s == start:\n amount = -1\n break\n\n amount += 1\n\n\nprint(amount)", "#Anuneet Anand\r\n\r\nn,s,t = map(int,input().split())\r\nP = list(map(int,input().split()))\r\n\r\nc = 0\r\nx = s-1\r\nwhile x!=t-1:\r\n\tx = P[x]-1\r\n\tc = c + 1\r\n\tif c>n:\r\n\t\tc = -1\r\n\t\tbreak\r\n\r\nprint(c)\r\n\r\n\r\n", "n,s,t = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nvst = [0]*(n)\r\nmoves = 0\r\nlast = arr[s-1]\r\nif s==t:\r\n print(0)\r\nelse:\r\n while 1:\r\n if vst[last-1]:\r\n print(-1)\r\n break\r\n if last==t:\r\n moves+=1\r\n print(moves)\r\n break\r\n vst[last-1]=1\r\n last = arr[last-1]\r\n moves+=1", "# Uses python3\r\nimport sys\r\nimport math\r\ndef fn(n,s,t,p):\r\n c=0\r\n for i in range(n):\r\n if s==t:\r\n return c\r\n s = p[s-1]\r\n c=c+1\r\n \r\n return -1\r\n \r\n return t\r\nif __name__ == '__main__': \r\n input = sys.stdin.read()\r\n data = list(map(int, input.split()))\r\n n = data[0]\r\n s = data[1]\r\n t = data[2]\r\n p = data[3:]\r\n print(fn(n,s,t,p))", "n,s,t=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nfor i in range(n):\r\n if t == s:\r\n exit(print(i))\r\n s=z[s-1] \r\nprint(-1) ", "n,s,t=[int(i) for i in input().split()]\r\np=[int(i) for i in input().split()]\r\nc=0\r\nflag=False\r\nif s==t:\r\n print(0)\r\nelse:\r\n state=p[s-1]\r\n while(state!=t):\r\n c+=1\r\n if state==s:\r\n flag=True\r\n break\r\n state=p[state-1]\r\n if flag==False:\r\n print(c+1)\r\n else:\r\n print(-1)", "n,s,t=map(int,input().split())\r\nA=[0]+[int(x) for x in input().split()]\r\nif s==t:\r\n print(0)\r\nelse:\r\n start=s\r\n cnt=0\r\n while start!=t:\r\n start=A[start]\r\n cnt+=1\r\n if start==s:\r\n print(-1)\r\n exit()\r\n print(cnt)", "from sys import stdin,stdout\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn, s, t = iia()\r\narr = iia()\r\nfor i in range(n):\r\n if s == t:\r\n print(i)\r\n break\r\n s = arr[s - 1]\r\nelse:\r\n print(-1)", "\r\nn,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nstep=0\r\nwhile(s!=t and l[s-1]!=0):\r\n tmp=l[s-1]\r\n l[s-1]=0\r\n s=tmp\r\n step+=1\r\n\r\nif(s==t):\r\n print(step)\r\nelse:\r\n print(-1)\r\n", "n,s,t= map(int, input().split())\r\nl= list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if s==t: print(i); exit()\r\n s= l[s-1]\r\n\r\nprint(-1)", "n, start, end = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.insert(0,0)\r\ni = start\r\nc = 0\r\nwhile i != end:\r\n i = arr[i]\r\n c += 1\r\n if i == start:\r\n print(-1)\r\n exit(0)\r\nprint(c)\r\n", "n, s, t = [int(x) for x in input().split()]\r\n\r\nmov = [int(x) for x in input().split()]\r\nmov.insert(0,0)\r\n\r\nvisited = [0] * (n+1)\r\n\r\nif s == t:\r\n print(0)\r\nelse:\r\n c = 0\r\n pos = s\r\n visited[pos] = 1\r\n \r\n while True:\r\n if visited[pos] == 2:\r\n print(-1)\r\n break\r\n elif mov[pos] == t:\r\n c += 1\r\n print(c)\r\n break\r\n else:\r\n c += 1\r\n pos = mov[pos]\r\n visited[pos] += 1\r\n \r\n \r\n ", "n, s, t = map(int, input().split())\r\nif n==1:\r\n print(0)\r\n exit()\r\npos = list(map(int, input().split()))\r\nmoves = 0\r\nwhile moves<=n and s!=t:\r\n moves += 1\r\n s = pos[s-1]\r\nif s==t:\r\n print(moves)\r\nelse:\r\n print(-1)\r\n", "def binary_search(lis,start,end,ele):\r\n mid=(start+end)//2\r\n if lis[mid]==ele:\r\n return mid\r\n elif start>=end:\r\n return -1\r\n else:\r\n if lis[mid]>ele:\r\n return binary_search(lis,start,mid-1,ele)\r\n else:\r\n return binary_search(lis,mid+1,end,ele)\r\n\r\nn,s,f=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\ncheck=[s]\r\ncount=0\r\nwhile True:\r\n if s==f:\r\n print(count)\r\n break\r\n else:\r\n s=lis[s-1]\r\n if binary_search(check,0,count-1,s)==-1:\r\n check.append(s)\r\n count+=1\r\n else:\r\n print(-1)\r\n break", "# link: https://codeforces.com/problemset/problem/285/B\r\nfrom sys import stdin, stdout\r\nif __name__ == \"__main__\":\r\n n,s,t = map(int, stdin.readline().split())\r\n temp = list(map(int, stdin.readline().split()))\r\n glass = [0]*(n+1)\r\n for i in range(1,n+1):\r\n glass[i] = temp[i-1]\r\n moves = 0\r\n while s!=t and glass[s]!=0:\r\n temp = glass[s]\r\n glass[s] = 0\r\n s = temp\r\n moves += 1\r\n if s==t:\r\n print(moves)\r\n else:\r\n print(-1) ", "n,s,t=map(int,input().split())\n\narr=list(map(int,input().split()))\n\nfor i in range (n):\n\n if(s==t):\n\n print(i)\n\n exit()\n\n s=arr[s-1]\n\nprint(-1)\n\n\n\n# Made By Mostafa_Khaled", "n,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ng=[i for i in range(1,n+1)]\r\nk=s\r\nc=0\r\nf=0\r\nwhile s!=t:\r\n c+=1\r\n s=l[s-1]\r\n if k==s:\r\n f=1\r\n print(-1)\r\n break\r\nif f==0:\r\n print(c)", "n,st,f = [int(i) for i in input().split()]\n\np = [int(i) for i in input().split()]\n\ni = st\nshuffles = 0\nwhile(i != f):\n if(i == st) and shuffles>0:\n shuffles = -1\n break\n else:\n i = p[i-1]\n shuffles += 1\n\nprint(shuffles)\n", "a,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nz=0\r\nwhile b!=c:\r\n if l[b-1]!=0:\r\n a=b-1\r\n b=l[b-1]\r\n l[a]=0\r\n z+=1\r\n else:\r\n print(\"-1\")\r\n exit(0)\r\nprint(z)", "n,s,t=map(int,input().split())\np=[int(x) for x in input().split()]\nfor i in range(n):\n if s==t:\n print(i)\n exit()\n s=p[s-1]\nprint(-1)", "import sys\r\nn,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=0\r\nwhile(i<n):\r\n if(s==t):\r\n print(i)\r\n sys.exit()\r\n s=l[s-1]\r\n i=i+1\r\nif(s==t):\r\n print(i)\r\nelse:\r\n print(\"-1\")", "a = input()\nb = input()\na_1 = \"\"\nlst =[]\nfor i in range(len(a)):\n if a[i] != \" \":\n a_1 = a_1 + a[i]\n else:\n lst.append(int(a_1))\n a_1 = \"\"\nlst.append(int(a_1))\nn = lst[0]\ns = lst[1]\nt = lst[2]\na_1 = \"\"\nlst2 = []\nfor i in range(len(b)):\n if b[i] != \" \":\n a_1 = a_1 + b[i]\n else:\n lst2.append(int(a_1))\n a_1 = \"\"\nlst2.append(int(a_1))\nkey = -1\nif s == t:\n key = 0\nelse:\n conter = 0\n for i in range(n):\n conter = conter + 1\n if lst2[s - 1] == t:\n key = conter\n break\n s = lst2[s - 1]\nprint(key)\n\n", "str1 = list(map(int,input().split()))\r\nn = str1[0]\r\ns = str1[1]\r\nt = str1[2]\r\np = list(map(int,input().split()))\r\ncheck = [0]*n\r\nfor x in range(n):\r\n check[x] = False\r\nprev = s\r\nif s == t:\r\n print('0')\r\nelse:\r\n ct = 0\r\n flag = False\r\n check[prev-1] = True\r\n for i in range(n):\r\n cur = p[prev-1]\r\n check[cur-1] = True\r\n prev = cur\r\n ct += 1\r\n if cur == t:\r\n print(ct)\r\n flag = True\r\n break\r\n if flag is False:\r\n for x in check:\r\n if x is False:\r\n print('-1')\r\n break", "nst=input()\r\nnst1=nst.split()\r\nn=int(nst1[0])\r\ns=int(nst1[1])\r\nt=int(nst1[2])\r\nshuff=input()\r\nshuff1=shuff.split()\r\nshuff2=[int(x) for x in shuff1]\r\nshuffles=shuff2\r\nball=s\r\nfinal=t\r\ni=0\r\nif ball==final:\r\n print(0)\r\n i=n\r\nwhile i<n:\r\n ballold=ball\r\n ball=shuffles[ball-1]\r\n if ball==final:\r\n print(i+1)\r\n i=n\r\n i=i+1\r\nif ball!=final:\r\n print(-1)", "n,s,t = map(int, input().split())\r\nswaps = list(map(int, input().split()))\r\npathLen = 0\r\n\r\nwhile swaps[s-1]!=0 and s!=t:\r\n temp = swaps[s-1]\r\n swaps[s-1] = 0\r\n s = temp\r\n pathLen += 1\r\n\r\nif s==t:\r\n print(pathLen)\r\nelse:\r\n print(-1) ", "n,s,t=[int(n) for n in input().split()]\r\nnums=[int(nums) for nums in input().split()]\r\narr=[0]*(n+1)\r\ncountsteps=0\r\nchecksteps=0\r\nindex=nums[s-1]\r\ntemp=0\r\nif s==t:\r\n print(0)\r\n checksteps=-1\r\nwhile(index!=t):\r\n if arr[index]==-1:\r\n checksteps=1\r\n break\r\n else:\r\n temp=nums[index-1]\r\n arr[index]=-1\r\n index=temp\r\n countsteps+=1\r\nif checksteps==1:\r\n print(-1)\r\nelif checksteps==0:\r\n print(countsteps+1)\r\n", "import math\r\nimport string\r\n\r\ndef shuffle(p, counter, i):\r\n counter_1 = 0\r\n while counter_1 < counter:\r\n i = p[i]\r\n counter_1 += 1\r\n return i\r\n\r\n\r\ndef main_function():\r\n n, s, t = [int(i) for i in input().split(\" \")]\r\n p = [int(i) for i in input().split(\" \")]\r\n s -= 1\r\n s_c = s\r\n t -= 1\r\n counter = 0\r\n while True:\r\n if s == t:\r\n print(counter)\r\n break\r\n elif s == s_c and counter > 0:\r\n print(-1)\r\n break\r\n s = p[s] - 1\r\n counter += 1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m,t = map(int,input().split())\r\narr = list(map(int, input().split()))\r\nbrr = [0]*n\r\nf = m\r\ncount = 1\r\nif(m==t):\r\n print(0)\r\nelse:\r\n while(brr[f-1]!=1 and arr[f-1]!=t):\r\n brr[f-1] = 1\r\n f = arr[f-1]\r\n count+=1\r\n if(arr[f-1] == t):\r\n print(count)\r\n else:\r\n print(-1)", "n,s,t=map(int,input().split())\r\np=list(map(int,input().split()))\r\ncost=0\r\nini=s\r\nvisited=set()\r\nwhile True:\r\n if ini not in visited:\r\n visited.add(ini)\r\n if ini==t:\r\n print(cost)\r\n break\r\n cost+=1\r\n ini=p[ini-1]\r\n else:\r\n print(-1)\r\n break", "import re\n\nin1 = [int(x) for x in re.split(\"\\\\s\", input())]\nin2 = [int(x) for x in re.split(\"\\\\s\", input())]\n\ndone = False\n\nx = 0\nwhile not done and x < in1[0]:\n if in1[1] == in1[2]:\n print(x)\n done = True\n in1[1] = in2[in1[1]-1]\n x += 1\nif not done:\n print(-1)\n\t \t \t\t \t \t\t \t \t \t\t \t\t\t\t \t", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,s,t=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nc=0\r\nc1=0\r\nif(s==t):\r\n print(0)\r\nelse:\r\n ind=s\r\n for i in range(n):\r\n c+=1\r\n ind=l[ind-1]\r\n if(t==ind):\r\n c1=1\r\n break\r\n if(c1==1):\r\n print(c)\r\n else:\r\n print(-1)", "N , ini , fi = list(map(int,input().split()))\nops = list(map(int,input().split()))\nthis_that = {i+1:index for i,index in enumerate(ops)}\nvisited = set()\ncurr = ini\nsh = 0 \nbad = False\nwhile(curr!=fi):\n if this_that[curr] in visited : \n bad = True\n break\n else:\n curr = this_that[curr]\n visited.add(curr) \n sh+=1\n\nif bad : \n print(-1)\nelse:\n print(sh)", "n, s, t = map(int, input().split())\r\np = list(map(int, input().split()))\r\nc = 0\r\nstemp = s\r\nwhile s!=t:\r\n c+=1\r\n s = p[s-1]\r\n if s == stemp:\r\n print(-1)\r\n exit()\r\nprint(c)\r\n", "n, s, t = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\ncnt = 0\r\ncnt1 = s\r\nwhile s != t:\r\n s = lst[s - 1]\r\n cnt += 1\r\n \r\n if s == cnt1:\r\n cnt = -1\r\n break\r\n \r\nprint(cnt)", "n,s,t=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nif(s==t):\r\n print('0')\r\nelse:\r\n pos=s\r\n k=0\r\n f=0\r\n for i in range(0,n):\r\n if(pos==t):\r\n f=1\r\n break\r\n pos=x[pos-1]\r\n k=k+1\r\n if(pos>n):\r\n pos=pos%n\r\n if(f==1):\r\n print(k)\r\n else:\r\n print('-1')", "a=(list(map(int, input().split())))\r\nb=(list(map(int, input().split())))\r\nc=len(b)\r\nd=a[1]\r\nif a[1]==a[2]:\r\n print('0')\r\nelse:\r\n l=0\r\n while 1:\r\n if l==c:\r\n print('-1')\r\n break\r\n if d==a[2]:\r\n print(l)\r\n break\r\n l+=1\r\n d=b[d-1]", "n, s, e = [int(i) for i in input().split()]\r\nar = [int(i)-1 for i in input().split()]\r\n\r\nif s == e:\r\n\tprint(0)\r\n\texit(0)\r\ns -= 1\r\ne -= 1\r\nidx = s\r\nres = 1\r\nidx = ar[idx]\r\nwhile idx != e:\r\n\tif idx == s:\r\n\t\tprint(-1)\r\n\t\texit(0)\r\n\tidx = ar[idx]\r\n\tres += 1\r\n\r\nprint(res)", "n, s, t = map(int, input().split())\r\ninput_ara = list(map(int, input().strip().split()))\r\nara = []\r\nfor i in range(1, n+1):\r\n ara.append((i, input_ara[i-1]))\r\ndictionary = {}\r\ni = flag = 0\r\nwhile 1:\r\n flag = 0\r\n if s not in dictionary:\r\n dictionary[s] = 1\r\n else:\r\n print(-1)\r\n flag = 1\r\n break\r\n if s == t:\r\n break\r\n s = ara[s-1][1]\r\n i += 1\r\nif flag != 1:\r\n print(i)\r\n\r\n", "import sys\nimport bisect\n#sys.stdin = open(\"in.txt\", \"r\")\n\nn, s, t = map(int, input().split())\nl = list(map(int, input().split()))\nmaxn = (10**5)+5\nl.insert(0, -10000)\n\nvis = [0]*maxn\nif s == t:\n print(\"0\")\nelse:\n ans = 0\n while vis[s] != 1 and s != t:\n vis[s] = 1\n s = l[s]\n ans += 1\n if s != t:\n print(\"-1\")\n else:\n print(ans)", "def main():\n\tn, s, t = [int(x)-1 for x in input().split()]\n\tn += 1\n\tf = [int(x)-1 for x in input().split()]\n\n\tif s == t:\n\t\tprint(0)\n\t\treturn\n\tfor i in range(n):\n\t\tif f[s] == t:\n\t\t\tprint(i+1)\n\t\t\treturn\n\t\ts = f[s]\n\tprint(-1)\n\nif __name__ == '__main__':\n\tmain()", "n,s,t=map(int,input().split())\r\np=list(map(int,input().split()))\r\nif(s==t):\r\n print(0)\r\nelse:\r\n ans=0\r\n k=p[s-1]\r\n ans=1\r\n b=1\r\n for i in range(n+1):\r\n if(k==t):\r\n print(ans)\r\n b=0\r\n break\r\n else:\r\n ans+=1\r\n k=p[k-1]\r\n if(b):\r\n print(-1)", "# your code goes here\r\nn, s, t = list(map(int, input().split()))\r\np = [-1] + list(map(int, input().split()))\r\nvis = [False for i in range(n+1)]\r\nans = 0\r\ncur = s\r\nwhile cur != t:\r\n\tif vis[cur] == True:\r\n\t\tans = -1\r\n\t\tbreak\r\n\tvis[cur] = True\r\n\tcur = p[cur]\r\n\tans += 1\r\nprint(ans)", "#B. Find Marble\r\nn,s,t = map(int,input().split())\r\np = list(map(int,input().split()))\r\na = list(range(1,n+1))\r\nm = s\r\nx = 0\r\nif s == t:\r\n print(0)\r\nelse:\r\n while True:\r\n tmp = p[s-1]\r\n x += 1\r\n if tmp == t:\r\n print(x)\r\n break\r\n elif tmp == m:\r\n print(-1)\r\n break\r\n s = tmp", "n,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ntemp=0\r\na=s\r\nc=0\r\nwhile temp!=s:\r\n temp=l[a-1]\r\n a=temp\r\n if temp==t:\r\n if temp==s:\r\n print(0)\r\n else:\r\n print(c+1)\r\n break\r\n c+=1\r\nelse:\r\n print(-1)\r\n \r\n ", "rd=lambda: list(map(int, input().split()))\r\nn,s,t=rd()\r\nA=rd()\r\ncur=s\r\nans=0\r\nfor i in range(n):\r\n if(cur==t):\r\n print(ans);\r\n exit()\r\n cur=A[cur-1]\r\n ans=ans+1\r\nprint(-1)", "n,s,t=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nflag=0\r\ncnt=0\r\nprev=s\r\nfor i in range(n):\r\n if prev==t:\r\n flag=1\r\n break\r\n prev=l[prev-1]\r\n cnt+=1\r\n\r\nif flag:\r\n print(cnt)\r\nelse:\r\n print(-1)", "n,s,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n a[i]-=1\r\ns-=1\r\nt-=1\r\nx=s\r\nans=0\r\nflag=0\r\n#print(s,t)\r\n#print(a)\r\nfor i in range(n):\r\n if(x==t):\r\n break\r\n else:\r\n ans+=1\r\n if(x==a[x]):\r\n flag=1\r\n break\r\n #print(x)\r\n x=a[x]\r\nif(flag==1 or x!=t):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "a, b, c = map(int, input().split())\r\np = list(map(int, input().split()))\r\nfor i in range(a):\r\n if b == c:\r\n print(i)\r\n exit()\r\n b = p[b-1]\r\nelse:\r\n print(-1)", "import sys\r\n# from collections import deque\r\n# from collections import Counter\r\n# from math import sqrt\r\n# from math import log\r\n# from math import ceil\r\n\r\n# alpha=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\n# mod=10**9+7\r\n# mod=998244353\r\n\r\nfast_reader=sys.stdin.readline\r\nfast_writer=sys.stdout.write\r\n\r\ndef input():\r\n\treturn fast_reader().strip()\r\n\r\ndef print(*argv):\r\n\tfast_writer(' '.join((str(i)) for i in argv))\r\n\tfast_writer('\\n')\r\n\r\n#____________________________________________________________________________________________________________________________________\r\n\r\nn,s,t=map(int, input().split())\r\ns=s-1\r\nt=t-1\r\np=list(map(int, input().split()))\r\np=[i-1 for i in p]\r\nans=-1\r\nfor i in range(n):\r\n\tif(s==t):\r\n\t\tans=i\r\n\t\tbreak\r\n\telse:\r\n\t\ts=p[s]\r\nprint(ans)", "n,s,t = [int(x) for x in input().split()]\npos = [int(x) for x in input().split()]\n\ndef find_shuffles(n,s,t,pos):\n\ti = 1\n\tif s==t:\n\t\tprint(0)\n\t\treturn\n\n\twhile i<n:\n\t\ts = pos[s-1]\n\t\tif s==t:\n\t\t\tprint(i)\n\t\t\treturn\n\t\telse:\n\t\t\ti+=1\n\n\tprint(-1)\n\treturn\n\nfind_shuffles(n,s,t,pos)", "n,s,t=map(int,input().split())\na=list(map(int,input().split()))\nif s==t:\n\tprint(0)\n\texit()\nvis=[0]*(n+1)\na=[0]+a\nx=a[s]\nvis[x]=1\nvis[s]=1\nans=1\nwhile(x!=t):\n\tans+=1\n\tx=a[x]\n\tif vis[x]:\n\t\tprint(-1)\n\t\texit()\n\tvis.append(x)\nprint(ans)\n", "rd = lambda: list(map(int, input().split()))\r\nn, s, t = rd()\r\np = rd()\r\nfor i in range(n):\r\n if s == t:\r\n print(i)\r\n exit()\r\n s = p[s - 1]\r\nprint(-1)", "def main():\r\n n,s,t = map(int,input().split())\r\n li=[-1]+list(map(int,input().split()))\r\n cnt=0\r\n found=1\r\n sta=s\r\n while(sta!=t):\r\n sta=li[sta]\r\n cnt=cnt+1\r\n if(sta==s):\r\n found=0\r\n break\r\n if(found==1):\r\n print(cnt)\r\n else:\r\n print(\"-1\")\r\nmain()", "n, s, t = [int(x) for x in input().split()]\np = [int(x) for x in input().split()]\ns -= 1\nt -= 1\nif s == t:\n\tprint(0)\n\texit(0)\ncnt = 0\nfor i in range(n):\n\tnext = p[s]\n\tif next == -1:\n\t\tbreak\n\tp[s] = -1\n\ts = next - 1\n\tcnt += 1\n\tif s == t:\n\t\tprint(cnt)\n\t\texit(0)\nprint(-1)\n", "n, s, t = map(int, input().split())\r\nl_m = list(map(int, input().split()))\r\n\r\no_s = s\r\nm_c = 0\r\nwhile s != t:\r\n s = l_m[s - 1]\r\n m_c += 1\r\n \r\n if s == o_s:\r\n m_c = -1\r\n break\r\n \r\nprint(m_c)", "#Khushal Sindhav\r\n#Indian Institute Of Technology, Jodhpur\r\n# 11 May 2022\r\ndef exe():\r\n curr=initial\r\n count=0\r\n while count<n:\r\n if curr==final:\r\n return count\r\n curr=lst[curr-1]\r\n count+=1\r\n return -1\r\n\r\nn,initial,final=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nprint(exe())", "n,s,t = map(int, input().split())\r\np = [0] + list(map(int, input().split()))\r\nif s==t:\r\n print(0)\r\nelse:\r\n ans=1\r\n nxt=p[s]\r\n while nxt!=t and nxt!=s:\r\n nxt=p[nxt]\r\n ans+=1\r\n if nxt==t:\r\n print(ans)\r\n else:\r\n print(-1)\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\nmod = int(1e9)+7\r\n\r\nn, s, t = rinput()\r\np = get_list()\r\npos = s\r\n\r\nvisited = [0 for _ in range(n)]\r\nflag = ans = 0\r\n\r\nwhile(pos!=t):\r\n\tpos = p[pos-1]\r\n\tans+=1\r\n\tif visited[pos-1]==1:\r\n\t\t# flag = 1\r\n\t\tbreak\r\n\tvisited[pos-1] = 1\t\r\n\r\nif pos==t:\r\n\tprint(ans)\r\nelse:\r\n\tprint(-1)\t\r\n# print(ans, flag, pos)", "import sys\ninput = sys.stdin.readline\nn,s,t=map(int,input().split())\nar=list(map(int,input().split()))\nk=0\nd={s}\nwhile True:\n\tif s==t:\n\t\tprint(k)\n\t\texit()\n\ts=ar[s-1]\n\tif s in d:\n\t\tbreak\n\tk+=1\nprint(-1)\n \t \t\t\t\t \t\t \t \t \t \t\t\t\t\t", "n,s,t=[int(x)-1 for x in input().split()]\r\np=[int(x)-1 for x in input().split()]\r\nvis=[True]*(n+1)\r\nk=0\r\nwhile(s!=t):\r\n if vis[s]==False:\r\n k=-1\r\n break\r\n vis[s]=False\r\n s=p[s]\r\n k+=1\r\nprint(k)", "n, s, t = map(int, input().split())\r\np = list(map(int, input().split()))\r\nflag = 0\r\nwhile s != t and flag < n:\r\n flag += 1\r\n s = p[s - 1]\r\nif flag >= n:\r\n print(-1)\r\nelse:\r\n print(flag)", "import sys\r\nimport itertools\r\nimport collections\r\n\r\n\r\ndef rs(x=''): return sys.stdin.readline().strip() if len(x) == 0 else input(x).strip()\r\ndef ri(x=''): return int(rs(x))\r\ndef rm(x=''): return map(str, rs(x).split())\r\ndef rl(x=''): return rs(x).split()\r\ndef rmi(x=''): return map(int, rs(x).split())\r\ndef rli(x=''): return [int(x) for x in rs(x).split()]\r\ndef println(val): sys.stdout.write(str(val) + '\\n')\r\n\r\n\r\ndef solve(testCase):\r\n n, s, end = rmi()\r\n s -= 1\r\n end -= 1\r\n p = [x - 1 for x in rmi()]\r\n # no yes no no\r\n # 2 3 4 1\r\n # after first: iteration: no no yes no\r\n # after second: no no no yes\r\n # after thrid: yes no no no\r\n if s == end:\r\n print(0)\r\n return\r\n start = p[s]\r\n ans = 1\r\n while start != end:\r\n ans += 1\r\n start = p[start]\r\n if start == s:\r\n break\r\n if start == end:\r\n print(ans)\r\n else:\r\n print(-1)\r\n\r\n\r\nfor _ in range(ri() if 0 else 1):\r\n solve(_ + 1)", "import sys\r\ninput = lambda:sys.stdin.readline()\r\n\r\nint_arr = lambda: list(map(int,input().split()))\r\nstr_arr = lambda: list(map(str,input().split()))\r\nget_str = lambda: map(str,input().split())\r\nget_int = lambda: map(int,input().split())\r\nget_flo = lambda: map(float,input().split())\r\n\r\ndef solve(n,s,t,arr):\r\n c = 0\r\n for i in range(len(arr)):\r\n if s == t:\r\n print(c);return\r\n else:\r\n s = arr[s-1]\r\n c += 1\r\n print(-1)\r\n\r\n# for _ in range(int(input())):\r\nn,s,t = get_int()\r\narr = int_arr()\r\nsolve(n,s,t,arr)\r\n", "n,s,t=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ncurrent=s\r\nf=0\r\ncount=0\r\nif s==t:\r\n print(0)\r\nelse:\r\n while(True):\r\n count+=1\r\n current=arr[current-1]\r\n if current==t:\r\n f=1\r\n break\r\n if current==s:\r\n f=-1\r\n break\r\n if f==1:\r\n print(count)\r\n if f==-1:\r\n print(-1)", "n,s,t=[int(i) for i in input().split()]\r\np=[int(i)-1 for i in input().split()]\r\ni=s-1\r\nh=0\r\nt-=1\r\nwhile h<n and i!=t-1+1:\r\n i=p[i]\r\n h+=1\r\nif i==t:\r\n print(h)\r\nelse:\r\n print(-1)\r\n \r\n", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import add\r\n\r\ninf = float('inf')\r\n# input = sys.stdin.readline\r\nflush = lambda : sys.stdout.flush\r\ncomb = lambda x , y : (factorial(x) // factorial(y)) // factorial(x - y) \r\n\r\n\r\n#inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda : input()\r\nii = lambda : int(input())\r\nr = lambda : map(int, input().split())\r\nrr = lambda : list(r())\r\n\r\n\r\nn , a , b =r()\r\nchance = [0] + rr()\r\n\r\n\r\nok = defaultdict(lambda:0)\r\nc = 0\r\nwhile not ok[a]:\r\n if a == b:\r\n print(c)\r\n exit()\r\n ok[a] = 1\r\n a = chance[a]\r\n c+=1\r\n \r\nprint(-1)", "n, start, finish = [int(i) for i in input().split(' ')]\narr = [int(i) for i in input().split(' ')]\n\nif start == finish:\n print(0)\n\nelse:\n temp = arr[start-1]\n #print(arr)\n count = 1\n\n while 1:\n #print(temp, arr[temp-1])\n if temp == start:\n print(-1)\n break\n elif temp == finish:\n print(count)\n break\n else:\n temp = arr[temp-1]\n count += 1", "n,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=s\r\nc=0\r\nif s==t:\r\n print(0)\r\nelse:\r\n while True:\r\n k=l[k-1]\r\n c+=1\r\n if k==t or k==s:\r\n break\r\n if k==t:\r\n print(c)\r\n else:\r\n print(-1)\r\n \r\n \r\n", "import sys\r\nfrom math import *\r\nfrom collections import Counter, defaultdict, deque\r\ninput = sys.stdin.readline\r\nmod = 10**9+7\r\n\r\nn, s, t = [int(i) for i in input().split()]\r\np = [int(i) for i in input().split()]\r\n# n-> glasses s->initial t-> final position\r\nstep_count = 0\r\nstart_pointer = s\r\nwhile (start_pointer != t):\r\n # print(start_pointer)\r\n if (p[start_pointer-1] != s):\r\n step_count += 1\r\n start_pointer = p[start_pointer-1]\r\n else:\r\n step_count = -1\r\n break\r\nprint(step_count)\r\n", "n, s, t = list(map(int, input(\"\").split(\" \")))\nA = list(map(int, input(\"\").split(\" \")))\n\ninitial = s\nmoves = 0\nfound = True\n\nwhile s != t:\n s = A[s-1]\n if s == initial:\n found = False\n break\n moves += 1\n\nif found == True: print(moves)\nelse : print(-1)\n\t\t\t\t \t\t\t\t\t \t \t \t", "n,i,f=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif i==f:\r\n print(0)\r\nelse:\r\n if l[i-1]==i or l[f-1]==f:\r\n print(-1)\r\n else:\r\n x=i\r\n flag=0\r\n flag2=0\r\n c=1\r\n while True:\r\n if l[x-1]==f:\r\n flag=1\r\n break\r\n elif l[x-1]==i:\r\n flag2=1\r\n break\r\n #print(x)\r\n x=l[x-1]\r\n c=c+1\r\n if flag==1:\r\n print(c)\r\n elif flag2==1:\r\n print(-1)\r\n else:\r\n print(-1)\r\n\r\n", "n, s, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n if s == t:\r\n print(i)\r\n exit()\r\n s = l[s - 1]\r\nprint(-1)", "def cs(f,l,v):\r\n\ts=set()\r\n\tt,c=f,0\r\n\twhile 1:\r\n\t\tif t==l:\r\n\t\t\treturn c\r\n\t\tt=v[t]\r\n\t\tif t in s:\r\n\t\t\treturn -1\r\n\t\ts.add(t)\r\n\t\tc+=1\r\n\t\t\r\n\t\t\r\nn,f,l=[int (c)-1 for c in input().split()]\r\nv=[int (c)-1 for c in input().split()]\r\nprint(cs(f,l,v))", "n, s, t = map(int, input().split())\r\np = list(map(int, input().split()))\r\n\r\nseen = set()\r\ncount = 0\r\n\r\nwhile s != t and s not in seen:\r\n seen.add(s)\r\n s = p[s-1]\r\n count += 1\r\n\r\nif s == t: print(count)\r\nelse: print(-1)\r\n", "g=input()\r\nn,s,t=[int(x) for x in g.split()]\r\nr=input()\r\ndic={}\r\ni=1\r\nl=0\r\nfor x in r.split():\r\n\tdic[i]=int(x)\r\n\ti+=1\t\r\njoker=s\t\t\r\nwhile l>=0:\r\n\tl+=1\r\n\tif dic[joker]==t:\r\n\t\tif s==t:\r\n\t\t\tprint(\"0\")\r\n\t\telse:\t\r\n\t\t\tprint(l)\r\n\t\tbreak\r\n\telif dic[joker]==s:\r\n\t\tprint(\"-1\")\r\n\t\tbreak\t\r\n\telse:\r\n\t\tjoker=dic[joker]\t\r\n", "def isPossible(n, s, t, a):\r\n visited = [False for i in range(n)]\r\n visited[s - 1] = True\r\n pos = s\r\n count = 0\r\n while pos != t:\r\n pos = a[pos - 1]\r\n count += 1\r\n if visited[pos - 1]:\r\n break\r\n visited[pos - 1] = True\r\n if pos == t:\r\n return count\r\n else:\r\n return -1\r\nn, s, t = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nprint(isPossible(n, s, t, a))\r\n ", "n, s, t = [int(x) for x in input().split()]\np = [int(x) for x in input().split()]\ns=s-1\nt=t-1\nfor i in range(n):\n p[i] -= 1\ncount=0\npos = s\nvisited = [0] * n\nvisited[s] = 1\n\nif s==t:\n print(\"0\")\n exit(0)\nfor i in range(n):\n pos = p[pos]\n if visited[pos] == 1:\n print('-1')\n exit(0)\n visited[pos] = 1\n count+=1\n if pos == t:\n print(count)\n exit(0)\nprint(\"-1\")\n\n", "from heapq import heappush,heappop\r\nfrom collections import deque\r\n\r\n#t = int(input())\r\nt = 1\r\nfor tc in range(1,t+1):\r\n #n = int(input())\r\n n,s,t = map(int,input().split())\r\n a = [-1]+list(map(int,input().split()))\r\n #s = input()\r\n seen = set()\r\n seen.add(s)\r\n cur = s\r\n cnt = 0\r\n for i in range(n+1):\r\n if cur==t:\r\n break\r\n cur = a[cur]\r\n if cur in seen:\r\n cnt = -1\r\n break\r\n cnt+=1\r\n print(cnt)", "n, s, t = map(int, input().split())\r\nz = list(map(int, input().split()))\r\nfor i in range(n):\r\n if t == s:\r\n print(i)\r\n break\r\n s = z[s-1]\r\nelse:\r\n print(-1)", "n, s, t = [int(i) for i in input().split()]\np = [int(i) for i in input().split()]\n\namount = 0\nwhile s != t and amount <= n:\n s = p[s - 1]\n amount += 1\n\nif amount > n:\n print(-1)\nelse:\n print(amount)", "n, s, t = map(int, input().split())\r\nmapping = list(map(int, input().split()))\r\nmarble_loc = s\r\ncount = 0\r\nwhile marble_loc != t:\r\n count += 1\r\n marble_loc = mapping[marble_loc-1]\r\n if count > n-1:\r\n count = -1\r\n break\r\nprint(count)", "\r\nn,s,t=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nst=s\r\nc=0\r\nwhile s!=t:\r\n c=c+1\r\n s=p[s-1]\r\n if s==st:\r\n c=-1\r\n break\r\nprint(c)\r\n", "n, s, t = map(int, input().split())\r\nop = list(map(int, input().split()))\r\ntemp = [0] * n\r\ns-= 1\r\nt-=1 \r\nres= 0\r\nfor i in range(n):\r\n if t == s:\r\n print(res)\r\n break\r\n if op[s]-1 == s:\r\n print(-1)\r\n break\r\n s = op[s]-1\r\n res +=1 \r\nelse:\r\n print(-1)", "n, s, t = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\npos = s\r\nchk = pos\r\ncnt = 0\r\nwhile True:\r\n if pos == t:\r\n break\r\n pos = lst[pos - 1]\r\n cnt += 1\r\n if chk == pos:\r\n print(-1)\r\n exit()\r\n\r\nprint(cnt)", "n, s, t = map(int, input().split())\r\np = list(map(int, input().split()))\r\ns -= 1\r\nt -= 1\r\nif s == t:\r\n\tprint(0)\r\n\texit(0)\r\ncnt = 0\r\nfor i in range(n):\r\n\tnext = p[s]\r\n\tif next == -1:\r\n\t\tbreak\r\n\tp[s] = -1\r\n\ts = next - 1\r\n\tcnt += 1\r\n\tif s == t:\r\n\t\tprint(cnt)\r\n\t\texit(0)\r\nprint(-1)", "\r\n\r\nclass DiGraphHashable(object):\r\n def __init__(self):\r\n self.adj=dict()\r\n \r\n def addNode(self,node):\r\n assert node not in self.adj, f\"INVALID OPERATION: Node {node} is already in the graph\"\r\n self.adj[node]=[]\r\n \r\n def connect(self,node1,node2):\r\n assert node1 in self.adj,\"\"\r\n assert node2 in self.adj,\"\"\r\n assert node2 not in self.adj[node1],f\"INVALID OPERATION: ({(node1,node2)}) already in Graph \"\r\n self.adj[node1].append(node2)\r\n\r\n def DFS(self,node1,node2):\r\n step=0\r\n current=node1\r\n while step<len(self.adj) and current!=node2:\r\n step+=1\r\n current=self.adj[current][0]\r\n \r\n return step if current==node2 else -1\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\nMAP = lambda x : int(x)-1\r\nn,s,t = map(int,input().split(\" \"))\r\nedges=list(map(MAP,input().split(\" \")))\r\nGRAPH=DiGraphHashable()\r\nfor i in range(n):GRAPH.addNode(i)\r\nfor i in range(n): GRAPH.connect(i,edges[i])\r\nprint(GRAPH.DFS(s-1,t-1))\r\n\r\n", "n, s, t = map(int, input().split())\r\nd = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if s == t:\r\n print(i)\r\n exit()\r\n\r\n s = d[s-1]\r\n \r\nprint(-1)", "n,s,t=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nif s==t:\r\n print(0)\r\nelif s==lst[s-1]:\r\n print(-1)\r\nelse:\r\n count=0\r\n i=s-1\r\n flag=0\r\n while count!=n:\r\n if lst[i]==t:\r\n count+=1\r\n flag=1\r\n break\r\n else:\r\n count+=1\r\n i=lst[i]-1\r\n if flag==0:\r\n print(-1)\r\n else:\r\n print(count)", "\"\"\"\r\n~~ author : dokueki\r\n~~ created : 10~05~2020\r\n\"\"\"\r\n\r\nimport sys\r\nINT_MAX = sys.maxsize\r\nINT_MIN = -(sys.maxsize)-1\r\nsys.setrecursionlimit(10**6)\r\nmod = 1000000007\r\n\r\n\r\ndef IOE():\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\n# chain = dict()\r\n\r\n\r\ndef main():\r\n n, s, t = map(int, sys.stdin.readline().split())\r\n a = list(map(int, sys.stdin.readline().split()))\r\n c = 0\r\n for i in range(n):\r\n\r\n if s == t:\r\n print(i)\r\n break\r\n s = a[s - 1]\r\n else:\r\n print(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n try:\r\n IOE()\r\n except:\r\n pass\r\n main()\r\n", "from collections import defaultdict\r\nn, s, t = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nif s == t:\r\n print(0)\r\n exit()\r\ng = defaultdict(int)\r\nfor i in range(n):\r\n g[i+1] = li[i]\r\nvisited = defaultdict(bool)\r\nc = 0\r\nf = 1\r\nwhile not visited[t]:\r\n if visited[s]:\r\n f = 0\r\n break\r\n visited[s] = True\r\n s = g[s]\r\n if not visited[t]:\r\n c += 1\r\nif f:\r\n print(c)\r\nelse:\r\n print(-1)", "n,s,t= map(int,input().split())\r\nl= list(map(int,input().split()))\r\nflag= 0\r\nd= dict()\r\nfor k in range(n):\r\n d[l[k]] = k+ 1\r\n#print(d)\r\ncount = 0\r\nfor p in range(n):\r\n #print(t)\r\n if s == t:\r\n flag = 1\r\n break\r\n else:\r\n t = d[t]\r\n count += 1\r\nif flag == 1:\r\n print(count)\r\nelse:\r\n print(-1)\r\n", "from sys import stdin,stdout\r\nn,s,t=map(int,stdin.readline().split())\r\nw=[int(x) for x in stdin.readline().split()]\r\nfor k in range(n):\r\n if(s==t):\r\n stdout.write(str(k))\r\n exit()\r\n s=w[s-1]\r\nstdout.write('-1') \r\n", "n, s, t = [int(k) for k in input().split()]\r\narr = [int(k) for k in input().split()]\r\n\r\ndef marble(n, s, t, arr):\r\n arr = [-1] + arr\r\n cur_idx = s\r\n moves = 0\r\n\r\n seen = {}\r\n\r\n while cur_idx != t:\r\n if cur_idx in seen:\r\n return -1\r\n seen[cur_idx] = True\r\n cur_idx = arr[cur_idx]\r\n moves += 1\r\n\r\n return moves\r\n\r\n\r\nprint(marble(n, s, t, arr))", "from collections import defaultdict\r\nn,s,t=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\np1=s\r\nd={}\r\nd=defaultdict(lambda:-1,d)\r\nfor i in range(len(a)):\r\n d[i+1]=a[i]\r\ncount=0\r\nwhile(p1!=t):\r\n p1=d[p1]\r\n if p1==s:\r\n count=-1\r\n break\r\n count+=1\r\nif count==-1:\r\n print(-1)\r\nelse:\r\n print(count)\r\n", "n, s ,t = map(int, input().rstrip().split())\r\nop = list(map(int, input().rstrip().split()))\r\nans=0\r\ncurr=s-1\r\nwhile(curr!=t-1):\r\n if ans>n:\r\n ans=-1\r\n break\r\n curr = op[curr]-1\r\n ans+=1\r\nprint(ans)\r\n", "n, s, t = map(int, input().split())\r\np = [int(i) for i in input().split()]\r\n\r\ndp = [s]\r\nfor i in range(n - 1):\r\n s = p[s - 1]\r\n dp.append(s)\r\ntime = -1\r\nif (t in dp):\r\n time = dp.index(t)\r\nprint (time)", "a,b,c=map(int,input().split())\r\np=list(map(int,input().split()))\r\nfor i in range(a):\r\n if b==c:print(i);exit()\r\n b=p[b-1]\r\nelse:print(-1)", "n,s,t = map(int,input().split())\r\np = list(map(int,input().split()))\r\n# 4 2 1\r\n# 2 3 4 1\r\ngraph = dict()\r\nfor x in range(n):\r\n u = x+1\r\n v = p[x]\r\n graph[u] = v\r\n\r\nseen = set()\r\ncurrent = s\r\nwhile current not in seen:\r\n seen.add(current)\r\n if current == t:\r\n break\r\n current = graph[current]\r\n\r\nif t in seen:\r\n print (len(seen)-1)\r\nelse:\r\n print (-1)\r\n \r\n", "def shuffle(n,s,t,l):\r\n for i in range(n):\r\n if s==t:\r\n return i\r\n s=l[s-1]\r\n return -1\r\n\r\nn,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(shuffle(n,s,t,l))", "from collections import deque\ndef main():\n n,s,t = map(int,input().split())\n move = list(map(int,input().split()))\n graph = {}\n\n for i in range(1,n+1):\n graph[i] = move[i-1]\n visited = [False]*n\n swaps = 0\n\n d = deque()\n flag = True\n count = 0\n d.append(s)\n\n while d:\n s = d.popleft()\n if s == t:\n break\n if visited[s-1]:\n flag=False\n break\n else:\n count += 1\n visited[s-1]=True\n d.append(graph[s])\n\n\n if flag:\n print(count)\n else:\n print(-1)\nif __name__ == '__main__':\n main()\n", "c=list(map(int,input().split(\" \")))\r\nn,s,t=c[0],c[1],c[2]\r\np=list(map(int,input().split(\" \")))\r\ncount=0\r\nval=0\r\nvisit=set()\r\nwhile s!=t:\r\n if p[s-1]==s:\r\n val=-1\r\n break\r\n if s in visit:\r\n val=-1\r\n break\r\n visit.add(s)\r\n s=p[s-1]\r\n count+=1\r\nif val==-1:\r\n print(-1)\r\nelse:\r\n print(count)\r\n \r\n \r\n ", "def main():\r\n n, s, t = map(int, input().split())\r\n p = [0] + list(map(int, input().split()))\r\n\r\n step = 0\r\n while s != t and p[s] != 0:\r\n temp = p[s]\r\n p[s] = 0\r\n s = temp\r\n step += 1\r\n\r\n print(step if s == t else -1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,s,t = map(int, input().split(\" \"))\n\nl = list(map(int, input().split(\" \")))\n\na = s\ntemp = 0\nflag = 0\n\nwhile True:\n a = l[a-1]\n temp = temp + 1\n if a == s:\n flag = 1\n break\n elif a == t:\n break\n else:\n continue\n\nif s == t:\n print(0) \nelse:\n if flag == 1:\n print(-1)\n else:\n print(temp)\n", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom sys import stdin\r\nfrom collections import defaultdict\r\n\r\nn, s, t = arr_inp()\r\np, mem = arr_inp(), defaultdict(int)\r\np.insert(0, 0)\r\nans, root = 0, s\r\nwhile (root != t):\r\n if mem[root]:\r\n exit(print(-1))\r\n else:\r\n mem[root] = 1\r\n root = p[root]\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n,start,end=map(int,input().split())\r\nL=list(map(int,input().split()))\r\ncount=0\r\npos=start\r\nco=True\r\nwhile(pos!=end and co):\r\n if(count>10 and pos==start):\r\n co=False\r\n else:\r\n pos=L[pos-1]\r\n count+=1\r\nif(co):\r\n print(count)\r\nelse:\r\n print(\"-1\")\r\n", "'''\r\ndef main():\r\n from sys import stdin,stdout\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#118B\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n for i in range(n+1):\r\n stdout.write(' '*(2*(n-i)))\r\n for k in range(i+1):\r\n if k:\r\n if k==1:\r\n stdout.write(' 1 ')\r\n else:\r\n stdout.write(str(k)+' ')\r\n else:\r\n stdout.write('0')\r\n for k in range(i-1,-1,-1):\r\n if k:\r\n stdout.write(str(k)+' ')\r\n else:\r\n stdout.write('0')\r\n stdout.write('')\r\n for j in range(i-1,-1,-1):\r\n stdout.write(' '*2*(n-j))\r\n for k in range(j+1):\r\n if k:\r\n if k==1:\r\n stdout.write(' 1 ')\r\n else:\r\n stdout.write(str(k)+' ')\r\n else:\r\n stdout.write('0')\r\n for k in range(j-1,-1,-1):\r\n if k:\r\n stdout.write(str(k)+' ')\r\n else:\r\n stdout.write('0')\r\n stdout.write('')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#499B\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,m=map(int,stdin.readline().split())\r\n mydic={}\r\n for _ in range(m):\r\n a,b=map(str,stdin.readline().strip().split())\r\n mydic[a]=b\r\n for k in stdin.readline().strip().split():\r\n if len(mydic[k])<len(k):\r\n stdout.write(mydic[k]+' ')\r\n else:\r\n stdout.write(k+' ')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#450A\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n,m=map(int,stdin.readline().split())\r\n k=list(range(1,n+1))\r\n a=list(map(int,stdin.readline().split()))\r\n while k!=[]:\r\n top=k[0]\r\n if a[top-1]<=m:\r\n k=k[1:]\r\n a[top-1]=0\r\n else:\r\n a[top-1]-=m\r\n k=k[1:]+[top]\r\n stdout.write(str(top))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#550C\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n n=stdin.readline().strip()\r\n i=0\r\n k=2\r\n t=''\r\n for j in n[::-1]:\r\n if j=='0':\r\n t='0'\r\n break\r\n elif j=='8':\r\n tz='8'\r\n break\r\n i+=1\r\n if k==16:\r\n break\r\n if int(j+t) & (k-1):\r\n continue\r\n else:\r\n t=j+t\r\n k<<=1\r\n #print(t,i)\r\n if t!='':\r\n if int(t)%8==0:\r\n if i!=len(n) and t!='0' and t!='8':\r\n stdout.write('YES\\n'+n[:len(n)-i+1]+t)\r\n else:\r\n stdout.write('YES\\n'+t)\r\n else:\r\n stdout.write('NO')\r\n else:\r\n stdout.write('NO')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#476B\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n a=stdin.readline().strip()\r\n b=stdin.readline().strip()\r\n apc=0\r\n anc=0\r\n bpc=0\r\n bnc=0\r\n bqc=0\r\n for i in a:\r\n if i =='+':\r\n apc+=1\r\n elif i=='-':\r\n anc+=1\r\n for i in b:\r\n if i=='+':\r\n bpc+=1\r\n elif i=='-':\r\n bnc+=1\r\n else:\r\n bqc+=1\r\n #print(apc,anc,bpc,bnc,bqc)\r\n if apc==bpc and anc==bnc and bqc==0:\r\n p=1\r\n elif bpc>apc or bnc>anc or len(a)!=len(b):\r\n p=0\r\n else:\r\n denom=(1<<bqc)\r\n numer=1\r\n maxim=max(apc-bpc,anc-bnc)\r\n minim=min(aspc-bpc,anc-bnc)\r\n while(bqc>maxim):\r\n #print(numer)\r\n numer*=bqc\r\n bqc-=1\r\n if minim>1:\r\n k=minim\r\n while(minim>=2):\r\n #print('k',k)\r\n k*=(minim-1)\r\n minim-=1\r\n numer/=k\r\n p=numer/denom\r\n stdout.write('{:.12f}'.format(p))\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n'''\r\ndef main():\r\n from sys import stdin,stdout\r\n for _ in range(int(stdin.readline())):\r\n l1,l2,l3,n=stdin.readline().strip().split()\r\n L=l1+l2*int(n)+l3\r\n n=int(L,2)\r\n c=0\r\n while n>=0:\r\n n=(n&(n+1)) -1\r\n #print(n)\r\n c+=1\r\n stdout.write(str(c)+'\\n')\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#230B\r\n'''\r\ndef main():\r\n\tfrom sys import stdin,stdout\r\n\ts=[]\r\n\tfor i in range(1000000):\r\n\t\ts.append(True)\r\n\tfor i in range(2,1000000):\r\n\t\tif s[i-1]:\r\n\t\t\tj=2*i\r\n\t\t\twhile j<=1000000:\r\n\t\t\t\ts[j-1]=False\r\n\t\t\t\tj+=i\r\n\t#print(s[:10])\r\n\tt=int(stdin.readline())\r\n\tfor i in stdin.readline().strip().split():\r\n\t\tn=int(i)\r\n\t\tk=n**0.5\r\n\t\tif int(k)==k and s[int(k)-1] and n!=1:\r\n\t\t\tstdout.write('YES\\n')\r\n\t\telse:\r\n\t\t\tstdout.write('NO\\n')\r\nif __name__=='__main__':\r\n\tmain()\r\n'''\r\n#489C\r\n'''\r\ndef main():\r\n\timport sys\r\n\ta,b=map(int,sys.stdin.readline().split())\r\n\tif not a:\r\n\t\tmaxim='-1'\r\n\t\tminim='-1'\r\n\telif not b:\r\n\t\tif a==1:\r\n\t\t\tmaxim='0'\r\n\t\t\tminim='0'\r\n\t\telse:\r\n\t\t\tmaxim='-1'\r\n\t\t\tminim='-1'\r\n\telse:\r\n\t\t#finding the maximum number\t\r\n\t\tmaxim=0\r\n\t\tn=b\r\n\t\twhile n:\r\n\t\t\tif 9>n:\r\n\t\t\t\tmaxim=maxim*10+n\r\n\t\t\t\tn=0\r\n\t\t\telse:\r\n\t\t\t\tn-=9\r\n\t\t\t\tmaxim=maxim*10+9\r\n\t\ts=str(maxim)\r\n\t\tdiff=a-len(s)\r\n\t\tif diff<0:\r\n\t\t\tmaxim='-1'\r\n\t\telif diff>0:\r\n\t\t\tmaxim=s+'0'*diff\r\n\t\telse:\r\n\t\t\tmaxim=s\r\n\t\t#finding the minimum number\r\n\t\tif diff:\r\n\t\t\tif diff<0:\r\n\t\t\t\tminim='-1'\r\n\t\t\telse:\r\n\t\t\t\ts=maxim[::-1]\r\n\t\t\t\tfor i in range(len(s)):\r\n\t\t\t\t\tif int(s[i]):\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\r\n\t\t\t\tminim='1'+'0'*(i-1)+str(int(s[i])-1)+s[i+1:]\r\n\t\telse:\r\n\t\t\tminim=maxim[::-1]\r\n\tsys.stdout.write(minim+' '+maxim+'\\n')\r\nif __name__=='__main__':\r\n\tmain()\r\n'''\r\n#230B\r\n'''\r\ndef main():\t\r\n\timport sys\r\n\timport bisect\r\n\tC=int(1e6)\r\n\tl=[]\r\n\tfor i in range(C):\r\n\t\tl.append(True)\r\n\tfor i in range(3,C,2):\r\n\t\tif l[i-1]:\r\n\t\t\tj=3*i\r\n\t\t\twhile j<=C:\r\n\t\t\t\tl[j-1]=False\r\n\t\t\t\tj+=2*i\r\n\tfor i in range(3,C,2):\r\n\t\tl[i]=False\r\n\tl[0]=False\r\n\ts=[]\r\n\tfor i in range(C):\r\n\t\tif l[i]:\r\n\t\t\ts.append((i+1)*(i+1))\r\n\t#print(s[:10])\r\n\tn=int(sys.stdin.readline())\r\n\ttup=tuple(map(int,sys.stdin.readline().split()))\r\n\tfor i in tup:\r\n\t\tpos=bisect.bisect_left(s,i)\r\n\t\tif pos!=len(s) and s[pos]==i:\r\n\t\t\tsys.stdout.write('YES\\n')\r\n\t\telse:\r\n\t\t\tsys.stdout.write('NO\\n')\r\n\t#print(s[:10])\r\nif __name__=='__main__':\r\n\tmain()\r\n'''\r\n#508B TLE\r\n'''\r\ndef main():\r\n\timport sys\r\n\tflag=False\r\n\tminim=10\r\n\tminindex=-1\r\n\tmaxindex=-1\r\n\tn=sys.stdin.readline().strip()\r\n\tfor i in range(len(n)):\r\n\t\tif (n[i]=='2' or n[i]=='4' or n[i]=='6' or n[i]=='8'or n[i]=='0') and int(n[i])<=minim:\r\n\t\t\tif minindex<0:\r\n\t\t\t\tminindex=i\r\n\t\t\t\tminim=int(n[i])\r\n\t\t\t\tflag=True\r\n\t\t\telse:\r\n\t\t\t\tmaxindex=i\r\n\tif flag:\t\r\n\t\ts=''\r\n\t\tfor i in range(len(n)):\r\n\t\t\tif i==minindex:\r\n\t\t\t\ts+=n[-1]\r\n\t\t\telif i==len(n)-1:\r\n\t\t\t\ts+=str(minim)\r\n\t\t\telse:\r\n\t\t\t\ts+=n[i]\r\n\t\tif maxindex>0:\r\n\t\t\tt=''\r\n\t\t\tfor i in range(len(n)):\r\n\t\t\t\tif i==maxindex:\r\n\t\t\t\t\tt+=n[-1]\r\n\t\t\t\telif i==len(n)-1:\r\n\t\t\t\t\tt+=str(minim)\r\n\t\t\t\telse:\r\n\t\t\t\t\tt+=n[i]\r\n\t\t\ts=str(max(int(s),int(t)))\r\n\telse:\r\n\t\ts='-1'\r\n\tsys.stdout.write(s)\r\nif __name__=='__main__':\r\n\tmain()\r\n'''\r\n#466C\r\n'''\r\ndef main():\r\n\timport sys\r\n\tn=int(sys.stdin.readline())\r\n\tt=tuple(map(int,sys.stdin.readline().split()))\r\n\tacc=sum(t)\r\n\tif acc % 3:\r\n\t\tsys.stdout.write('0')\r\n\telse:\r\n\t\tcnt=[]\r\n\t\tconst=acc//3\r\n\t\tss=0\r\n\t\tfor i in t:\r\n\t\t\tif acc-ss==const:\r\n\t\t\t\tcnt.append(1)\r\n\t\t\telse:\r\n\t\t\t\tcnt.append(0)\r\n\t\t\tss+=i \r\n\t\tfor i in range(n-2,-1,-1):\r\n\t\t\tcnt[i]+=cnt[i+1];\t\t\r\n\t\t#print(cnt)\r\n\t\tans=0\r\n\t\tss=0\r\n\t\tfor i in range(n-2):\r\n\t\t\tss+=t[i]\r\n\t\t\tif ss==const:\r\n\t\t\t\tans+=cnt[i+2]\r\n\t\tsys.stdout.write(str(ans)+'\\n')\r\nif __name__=='__main__':\r\n\tmain()\r\n'''\r\n#285B\r\ndef main():\r\n\tfrom sys import stdin,stdout\r\n\timport collections\r\n\tstack=collections.deque()\r\n\tn,s,t=map(int,stdin.readline().split())\r\n\tM=tuple(map(int,stdin.readline().split()))\r\n\tvisited=list(0 for x in range(n))\r\n\tcount=0\r\n\tstack.appendleft(s-1)\r\n\twhile(len(stack)):\r\n\t\ttop=stack.popleft()\r\n\t\tif top==t-1:\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tif not visited[M[top]-1]:\r\n\t\t\t\tstack.appendleft(M[top]-1)\r\n\t\t\t\tvisited[M[top]-1]=1\r\n\t\t\t\tcount+=1\r\n\tif top==t-1:\r\n\t\tstdout.write(str(count)+'\\n')\r\n\telse:\r\n\t\tstdout.write('-1\\n')\r\nif __name__=='__main__':\r\n\tmain()\r\n", "import math\r\nimport bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n# N, M = inlt()\r\n# A = inlt()\r\n# T = inp()\r\n# print(T)\r\n# for t in range(T):\r\nn, s, t = inlt()\r\nP = inlt()\r\nout = 0\r\nseen = {}\r\nwhile s != t and s not in seen:\r\n\tseen[s] = True\r\n\ts = P[s-1]\r\n\tout += 1\r\n# print(s)\r\nif s != t:\r\n\tprint(-1)\r\nelse:\r\n\tprint(out)", "n, s, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nk = 0\r\ntemp = s\r\nwhile temp != t:\r\n temp = a[temp - 1]\r\n if temp == s:\r\n print(-1)\r\n exit()\r\n k += 1\r\nprint(k)\r\n", "n,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif s==t:\r\n print(0)\r\n quit()\r\nc=0\r\nins=s\r\nwhile l[s-1]!=t:\r\n c+=1\r\n s=l[s-1]\r\n if l[s-1]==ins:\r\n print(-1)\r\n quit()\r\nprint(c+1)", "n,s,t = [int(x) - 1 for x in input().split()]\r\np = [int(x) - 1 for x in input().split()]\r\n\r\nfor i in range(n+1):\r\n if s == t: \r\n print(i)\r\n exit()\r\n s = p[s]\r\nprint(-1)", "n,s,t=map(int,input().split())\r\nl=[int(i)-1 for i in input().split()]\r\nif s==t:\r\n print(0)\r\n exit()\r\nvis=[0]* n \r\ns-=1 \r\nt-=1\r\np=s\r\ncnt=0 \r\nwhile p!=t:\r\n p=l[p]\r\n #print(p)\r\n cnt+=1 \r\n if p==s:\r\n print(-1)\r\n exit()\r\nprint(cnt)", "N,s,t=map(int,input().split())\n\nA=list(map(int,input().split()))\n\ns-=1\nt-=1\nans=0\nTaken=[False]*(N+1)\nwhile(Taken[s]==False and s!=t):\n Taken[s]=True\n s=A[s]-1\n ans+=1\n\nif(s==t):\n print(ans)\nelse:\n print(-1)\n", "n, s , t = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\nif s== t:\r\n print(0)\r\n exit()\r\ncount = 0\r\nfor i in range(n):\r\n s = arr[s-1]\r\n if s==t:\r\n count += 1\r\n print(count)\r\n break\r\n else :\r\n count += 1\r\nelse:\r\n print(-1) \r\n", "import math\r\n\r\n\r\ndef main():\r\n n,s,t = map(int,input().split())\r\n arr = list(map(int,input().split()))\r\n if s==t:\r\n return 0\r\n\r\n c = 1\r\n ind = s - 1\r\n while c <= n + 1:\r\n if ind == t - 1:\r\n return c - 1\r\n else:\r\n ind = arr[ind] - 1\r\n c += 1\r\n return -1\r\n\r\n\r\nprint(main())", "import sys\r\ninput = sys.stdin.readline\r\nN,S,T = map(int,input().split())\r\noperations = list(map(int,input().split()))\r\nans = 0\r\nS -= 1\r\nT -= 1 \r\nfor i in range(N):\r\n if S == T :\r\n print(ans)\r\n exit()\r\n S = operations[S] -1\r\n ans += 1\r\nprint(-1) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Find_Marble():\r\n n,s,t = invr()\r\n swapSequence = inlt()\r\n\r\n steps = 0 \r\n initialPos = s\r\n currentPos = s \r\n while currentPos != t:\r\n currentPos = swapSequence[currentPos-1]\r\n if currentPos == initialPos:\r\n break \r\n steps += 1 \r\n \r\n if currentPos == t:\r\n print(steps)\r\n else:\r\n print(-1)\r\n\r\n\r\nFind_Marble()", "A = [int(i) for i in input().split()]\r\nn = A[0]\r\ns = A[1]\r\nt = A[2]\r\nB = [int(i) for i in input().split()]\r\nused = [0 for i in range(n+1)]\r\ncount = 0\r\nflag = True\r\nif(s==t):\r\n print(0)\r\n exit(0)\r\ni = s-1\r\nwhile(1):\r\n if(B[i]==i+1):\r\n print(-1)\r\n break\r\n elif(B[i]!=i+1 and B[i]!=t):\r\n count += 1\r\n if(used[B[i]]==1):\r\n print(-1)\r\n break\r\n # i = B[i] - 1\r\n used[B[i]] = 1\r\n i = B[i]-1\r\n elif(B[i] == t):\r\n count+=1\r\n print(count)\r\n break\r\n", "def main():\n (n, s, t) = map(int, input().split(' '))\n s -= 1\n t -= 1\n if s == t:\n return 0\n nums = list(map(lambda i: int(i) - 1, input().split(' ')))\n slow = s\n fast = nums[slow]\n i = 0\n while slow != t:\n if slow == fast:\n i = -1\n break\n slow = nums[slow]\n fast = nums[nums[fast]]\n i += 1\n return i\n\nprint(main())\n", "n,s,t=[int(i)for i in input().split()]\r\np=[int(i)for i in input().split()]\r\n\r\na=0\r\nwhile s!=t and a<=n:\r\n s=p[s-1]\r\n a+=1\r\nif a>n:\r\n print(-1)\r\nelse:\r\n print(a)\r\n", "n,s,t=map(int,input().split())\r\np=list(map(int,input().split()))\r\np.insert(0,-1)\r\ni=s; cnt=0; f=0\r\nwhile i!=t:\r\n i=p[i]\r\n if i==s: f=1; break\r\n cnt+=1\r\nprint(-1 if f else cnt)", "n, s, t = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n if t == s:\r\n print(i)\r\n break\r\n s = l[s-1]\r\nelse:\r\n print(-1)", "n,s,t = map(int,input().split())\r\np = list(map(int,input().split()))\r\nc = 0\r\nwhile s != t and c < n+2:\r\n s = p[s-1]\r\n c += 1\r\n\r\nif c == n + 2:\r\n print(-1)\r\nelse:\r\n print(c)", "n ,s , t= list(map(int, input().split()))\r\np = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n if s == t:\r\n print(i)\r\n break\r\n s = p[s-1]\r\nelse:\r\n print(-1)", "a = input()\r\nb = input()\r\n\r\na = a.split(\" \")\r\nb = b.split(\" \")\r\n\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\n\r\nfor j in range(len(b)):\r\n b[j] = int(b[j])\r\n\r\nc = a[1]\r\nd = a[2]\r\ne = 0\r\nf = 0\r\nif c == d:\r\n print(0)\r\nelse:\r\n for k in range(a[0]):\r\n e = b[c-1]\r\n c = e\r\n f = f + 1\r\n if e == d:\r\n break\r\n \r\n if f == a[0]:\r\n print(-1)\r\n else:\r\n print(f)", "n,s,t = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\ncnt=0\r\n\r\nwhile s!=t and a[s-1]!=0:\r\n \r\n temp=a[s-1]\r\n a[s-1]=0\r\n s=temp\r\n cnt+=1\r\n \r\nif s==t:\r\n print(cnt)\r\n \r\nelse:\r\n print(-1)", "n, s, t = map(int, input().strip().split())\r\nP = list(map(int, input().strip().split()))\r\n\r\narr = []\r\nfor i in range(n):\r\n\tarr.append(i)\r\n\r\nif s == t:\r\n\tprint(0)\r\nelse:\r\n\tcount = 0;\r\n\twhile s!=t and P[s-1] != 0:\r\n\t\ttemp = P[s-1]\r\n\t\tP[s-1] = 0\r\n\t\ts = temp;\r\n\t\tcount +=1\r\n\tif s==t:\r\n\t\tprint(count)\r\n\telse:\r\n\t\tprint(-1)", "n, s, t = [int(x) for x in input().strip().split()]\r\np = [int(x) for x in input().strip().split()]\r\ncount = 0\r\nflag = True\r\ncurr = s\r\nwhile curr!=t:\r\n\t if curr==t:\r\n\t \tbreak\r\n\t curr = p[curr-1]\r\n\t count+=1\r\n\t if s==curr:\r\n\t \tflag = False\r\n\t \tbreak\r\nif flag:\r\n\tprint(count)\r\nelse:\r\n\tprint(-1)", "n, start, end = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.insert(0,0)\r\ni = start\r\ns = set()\r\nwhile i != end:\r\n s.add(i)\r\n i = arr[i]\r\n if i in s:\r\n print(-1)\r\n exit(0)\r\nprint(len(s))\r\n\r\n", "n,s,t =map(int,input().split())\r\nP=list(map(int,input().split()))\r\noperations=0\r\nL=list(range(1,n+1))\r\nfor i in range(n):\r\n if s==t:\r\n print(i)\r\n exit()\r\n s=P[s-1]\r\nprint(-1)\r\n\r\n\r\n\r\n\r\n", "def find_marble(n,s,t,x):\r\n step=0\r\n while(s!=t and x[s-1]!=0):\r\n temp = x[s-1]\r\n x[s-1] = 0\r\n s = temp\r\n step+=1\r\n if s==t:\r\n return step\r\n else:\r\n return -1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn,s,t = map(int,input().split())\r\nx = list(map(int,input().split()))\r\nprint(find_marble(n,s,t,x))", "from math import sqrt,gcd,ceil,floor,log,factorial\r\nfrom itertools import permutations,combinations\r\nfrom collections import Counter, defaultdict\r\nimport collections,sys,threading\r\nsys.setrecursionlimit(10**9)\r\nthreading.stack_size(10**8)\r\n\r\ndef solve():\r\n def dfs(s,t,lev):\r\n if visited[s]==1:\r\n return -1\r\n \r\n elif s==t:\r\n return lev\r\n \r\n visited[s]=1\r\n return dfs(graph[s],t,lev+1)\r\n \r\n n,s,t = map(int,input().split())\r\n a = list(map(int,input().split()))\r\n graph = [0]*(n+1)\r\n visited = [0]*(n+1)\r\n \r\n for i in range(n):\r\n graph[i+1] = a[i]\r\n \r\n print(dfs(s,t,0))\r\n \r\nthreading.Thread(target=solve).start()", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\n\r\nn,s,t = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nnxt = s\r\ncnt=0\r\nwhile nxt!=t:\r\n nxt = p[nxt-1]\r\n cnt+=1\r\n if nxt==s:\r\n cnt=-1\r\n break\r\nprint(cnt)\r\n\r\n", "\r\nn , s , t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\ncur = s\r\nflag = True\r\ni = 0\r\nwhile cur != t:\r\n cur = l[cur - 1]\r\n #print(cur)\r\n i += 1\r\n if i > 10**5:\r\n flag = False\r\n break\r\n\r\n#print(cur)\r\nif flag:\r\n print(i)\r\nelse:\r\n print('-1')", "n,s,t=map(int, input().split())\np=[None]+list(map(int, input().split()))\nc=0\nwhile s!= t and s != p[s]:\n temp=s\n s=p[s]\n p[temp]=temp\n c+=1\nif s==t:\n print(c)\nelse:\n print(-1)\n", "n, s, t = map(int, input().split())\r\na = list(map(int, input().split()))\r\nf = 0\r\nfor i in range(n):\r\n if s == t:\r\n print(i)\r\n f = 1\r\n break\r\n s = a[s-1]\r\nif f == 0:\r\n print(-1)\r\n ", "n,s,t=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\narr.insert(0,0)\r\nif s==t:\r\n print(0)\r\nelse:\r\n temp=0\r\n q=s\r\n c=0\r\n while(temp!=t and temp!=s):\r\n temp=arr[q]\r\n q=arr[q]\r\n c+=1\r\n if temp==s:\r\n print(-1)\r\n else:\r\n print(c)\r\n", "n, s, t = map(int, input().split())\r\np = [0] + list(map(int, input().split()))\r\nd = {s:0}\r\ncurr = s\r\nnex = p[curr]\r\nwhile nex not in d:\r\n d[nex] = d[curr] + 1\r\n curr = nex\r\n nex = p[curr]\r\nif t in d:\r\n print(d[t])\r\nelse:\r\n print(-1)", "def main():\r\n n, s, t = map(int, input().split())\r\n arr = [int(x) for x in input().split()]\r\n\r\n s -= 1\r\n t -= 1\r\n\r\n if s == t:\r\n print(0)\r\n return\r\n seen = {s}\r\n\r\n turns = 1\r\n\r\n while True:\r\n s = arr[s] - 1\r\n if s == t:\r\n print(turns)\r\n return\r\n elif s in seen:\r\n print(-1)\r\n return\r\n seen.add(s)\r\n turns += 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# your code goes here\r\nrd = lambda : list(map(int,input().strip().split()))\r\nn,s,t = rd()\r\nA = rd()\r\nfor i in range(n):\r\n if s == t:\r\n print(i);exit()\r\n s = A[s-1]\r\nprint(-1) \r\n ", "n, s, t = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\ns, t = s - 1, t - 1\r\nv = []\r\nfor i in range(100000):\r\n v.append(0)\r\nif s == t:\r\n print(0)\r\n exit()\r\n\r\ncount = 1\r\n\r\nwhile True:\r\n if arr[s] - 1 == t:\r\n print(count)\r\n break\r\n\r\n if v[arr[s] - 1] == 1:\r\n print(-1)\r\n break\r\n\r\n v[arr[s] - 1] = 1\r\n s = arr[s] - 1\r\n count += 1", "n , s , t = list(map(int,input().split()))\r\npos = list(map(int,input().split()))\r\nfor i in range(len(pos)):\r\n pos[i]-=1\r\ncount = 0\r\ns , t = s-1 , t-1\r\ncur = s\r\ns = set()\r\npost = 0\r\nwhile(not (cur == t)):\r\n q = len(s)\r\n s.add(pos[cur])\r\n cur = pos[cur]\r\n r = len(s)\r\n if(q==r):\r\n post=-1\r\n break\r\n else:\r\n count += 1\r\nif(post == 0 and count>=0):\r\n print(count)\r\nelse:\r\n print(-1) ", "n,s,t = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\nvisited = [0]*(n+1)\r\ncnt = 0\r\nwhile(s!=t and visited[s-1]==0):\r\n cnt+=1\r\n visited[s-1] = 1\r\n s = arr[s-1]\r\n\r\nif (s!=t):\r\n print(-1)\r\nelse:\r\n print(cnt)\r\n", "n,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n if(s==t):\r\n print(i)\r\n break\r\n s=l[s-1]\r\nelse:\r\n print(-1)", "n, s, t = list(map(int, input().split()))\r\n\r\nshuffles = list(map(int, input().split()))\r\n\r\nstep = 0\r\ncurrent = s\r\n\r\nwhile current != t:\r\n current = shuffles[current-1]\r\n step+=1\r\n if current == s:\r\n step = -1\r\n break\r\n \r\n\r\nprint(step)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, s, t = map(int, input().split())\r\nw = [i - 1 for i in map(int, input().split())]\r\nc = 0\r\ns -= 1\r\nt -= 1\r\nwhile c <= n:\r\n if s == t:\r\n break\r\n s = w[s]\r\n c += 1\r\nif c == n+1:\r\n print(-1)\r\nelse:\r\n print(c)", "nst=input().split()\r\nn,s,t=int(nst[0]),int(nst[1]),int(nst[2])\r\narr=list(map(int,(input().split())))\r\nc=0\r\nx=s\r\nwhile x!=t:\r\n x=arr[x-1]\r\n c+=1\r\n if x==s:\r\n print(-1)\r\n break\r\nif x!=s or c==0:\r\n print(c)", "n, s, t = list(map(int, input().split()))\nprr = list(map(int, input().split()))\nfor i in range(n):\n if s == t:\n print(i)\n exit()\n s = prr[s-1]\nprint(-1)\n", "from sys import *\r\nfrom math import *\r\nfrom sys import stdin,stdout\r\nfrom collections import *\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\nn,s,t = get_int()\r\narr = int_arr()\r\nind = s - 1\r\nct = 0\r\nwhile 1:\r\n if ind + 1 == t:\r\n print(ct)\r\n break\r\n else:\r\n if arr[ind] != -1:\r\n prev = ind\r\n ind = arr[ind] - 1\r\n arr[prev] = -1 \r\n ct += 1\r\n else:\r\n print(-1)\r\n break\r\n", "[n,s,t]=[int(x) for x in input().split()]\r\ns-=1\r\nt-=1\r\np=[]\r\nfor x in input().split():\r\n\tp.append(int(x)-1)\r\n\r\nop=0\r\npointer=p[s]\r\nflag=False\r\nif pointer != s:\r\n\top=1\r\nwhile op <= n:\r\n\tif s==t:\r\n\t\tprint(0)\r\n\t\tflag=True\r\n\t\tbreak\r\n\tif pointer==t:\r\n\t\tflag=True\r\n\t\tprint(op)\r\n\t\tbreak\r\n\tpointer\t= p[pointer]\r\n\top+=1\t\t\t\r\n\r\n\r\nif flag==False: print(-1)", "n,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.insert(0,0)\r\nif(s==t):\r\n print(0)\r\nelse:\r\n count=0\r\n flag=1\r\n s1=l[s]\r\n count=count+1\r\n while(s1!=t):\r\n if(s1==s):\r\n print(-1)\r\n flag=0\r\n break\r\n #print(s1)\r\n s1=l[s1]\r\n count=count+1\r\n if(flag==1):\r\n print(count)\r\n", "n, s, t = map(int, input().split())\r\np = [[x, False] for x in map(int, input().split())]\r\nans = 0\r\n\r\nwhile True:\r\n if s == t:\r\n print(ans); break\r\n \r\n if p[s-1][1]:\r\n print(-1); break\r\n else:\r\n p[s-1][1] = True\r\n s = p[s-1][0]\r\n\r\n ans += 1", "for _ in range(1):\r\n n, s, t = map(int, input().split())\r\n P = [int(p) for p in input().split()]\r\n A = [x for x in range(1, n + 1)]\r\n B = [0] * n\r\n \r\n m = 0\r\n flag = False\r\n\r\n if s == t:\r\n flag = True\r\n else:\r\n aux = P[s - 1]\r\n m = 1\r\n while s != aux:\r\n if aux == t:\r\n flag = True\r\n break\r\n aux = P[aux - 1]\r\n m += 1\r\n \r\n if flag:\r\n print(m)\r\n else:\r\n print(-1)", "n,s,t=map(int,input().split())\r\np=list(map(int,input().split()))\r\nind=s\r\ncount=0\r\nwhile True:\r\n if ind==t:\r\n break\r\n ind=p[ind-1]\r\n count+=1\r\n if ind==s:\r\n break\r\n\r\nif ind==t:\r\n print(count)\r\nelse:\r\n print(-1)", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\n\r\nn,s,t = M()\r\narr = L()\r\nseen = set()\r\npos = s\r\nflag=1\r\ncnt =0\r\nwhile True:\r\n if pos==t:\r\n seen.add(pos)\r\n # cnt+=1\r\n break\r\n \r\n if pos in seen:\r\n flag =0\r\n break\r\n else:\r\n seen.add(pos)\r\n pos = arr[pos-1]\r\n cnt+=1\r\n\r\n# print(seen)\r\n\r\nif flag==0:\r\n print(-1)\r\nelse:\r\n print(cnt)\r\n", "from collections import defaultdict\nn, s, t = map(int, input().split())\ns = s-1\nt = t-1\narr = list(map(int, input().split()))\nmap1 = defaultdict(int)\ni = s\npossible = True\nans = 0\nwhile i != t:\n if map1[i] == 1:\n possible = False\n break\n map1[i] = 1\n i = arr[i]-1\n ans += 1\nif possible:\n print(ans)\nelse:\n print(-1)\n", "import sys\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n \r\n \r\ndef iinput():\r\n return int(input())\r\n \r\n \r\ndef tinput():\r\n return input().split()\r\n \r\n \r\ndef rinput():\r\n return map(int, tinput())\r\n \r\n \r\ndef rlinput():\r\n return list(rinput())\r\n\r\nn,initial,final = rinput()\r\ninitial -= 1\r\nfinal -= 1\r\nA = rlinput()\r\nmoves = 0\r\nvisited = [False]*n\r\ncur = initial\r\nflag = True\r\nwhile cur != final:\r\n moves += 1\r\n visited[cur] = True\r\n if not visited[A[cur]-1]:\r\n cur = A[cur]-1\r\n else:\r\n flag = False\r\n break\r\nif flag:\r\n print(moves)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "import sys\r\nimport math\r\n\r\nn, s, t = [int(x) for x in (sys.stdin.readline()).split()]\r\np = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nres = 0\r\nk = s\r\nwhile(s != t and res < n):\r\n s = p[s - 1]\r\n res += 1\r\n \r\nif(t != s and res >= n):\r\n print(-1)\r\nelse: \r\n print(res)", "import sys\ninput = sys.stdin.readline\n\nn, s, t = map(int, input().split())\npos = list(map(int, input().split()))\n\ncount = 0\nseen = set()\nwhile s != t:\n if s not in seen:\n seen.add(s)\n else:\n print(-1)\n break\n count += 1\n s = pos[s-1]\nelse:\n print(count)\n", "# Aditya Morankar\r\n# lsta = list(map(int,input().split()))\r\ndef main():\r\n n,i,f = list(map(int,input().split()))\r\n lst = [0]\r\n lst.extend(list(map(int,input().split())))\r\n \r\n isdone = [0 for i in range(n+1)]\r\n counter=0\r\n indexx = i\r\n \r\n if i==f:\r\n print(0)\r\n else:\r\n while(1):\r\n if isdone[indexx]==1:\r\n print(-1)\r\n break\r\n \r\n \r\n isdone[indexx] = 1\r\n indexx = lst[indexx]\r\n # print(indexx)\r\n \r\n counter+=1\r\n if indexx==f:\r\n print(counter)\r\n break\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n t = 1\r\n while t!=0:\r\n main()\r\n t-=1", "n,s,t=map(int,input().split())\r\nx=[int(q) for q in input().split()]\r\n\r\nfor i in range(len(x)):\r\n if s==t:\r\n print(i)\r\n break\r\n s=x[s-1]\r\n #print(s)\r\nelse:\r\n print(-1)", "n, s, t = map(int, input().split())\nlst = list(map(int, input().split()))\n\ncount = 0\np = True\nnow = s\nfor i in range(n):\n if s != t:\n s = lst[s - 1]\n count += 1\n else:\n print(count)\n p = False\n break\nif p:\n print(-1)", "n,s,e = list(map(int,input().split()))\r\ns-=1\r\ne-=1\r\na = list(map(int,input().split()))\r\na = [x-1 for x in a]\r\ni =s\r\nfound = False\r\nif s==e:\r\n print(0)\r\n found=True\r\ncount = 0\r\n#print(s,e,\"start\",a)\r\nwhile (not (i==s and count>0)) and (not found) :\r\n i = a[i]\r\n count+=1\r\n #print(i,count)\r\n if i==e:\r\n print(count)\r\n found=True\r\nif not found:\r\n print(-1)\r\n", "def marble(n,s,t,l):\r\n if s == t:\r\n return 0\r\n count = 0\r\n l.insert(0,0)\r\n arr = [0]*(n+1)\r\n scopy = s\r\n while arr[t] != 1:\r\n arr[s] = 0\r\n arr[l[s]] = 1\r\n s = l[s]\r\n count += 1\r\n if arr[scopy] == 1:\r\n return -1\r\n return count\r\nn,s,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nprint(marble(n,s,t,l))", "n,s,t = [int(x) for x in input().split()]\r\np = [int(x) for x in input().split()]\r\nif s != t :\r\n i = 0\r\n m = p[s-1]\r\n flag = 0\r\n while i<n:\r\n if t == m :\r\n flag = 1\r\n break\r\n else :\r\n m = p[m-1]\r\n i = i+1\r\n if flag == 1:\r\n print(i+1)\r\n else:\r\n print(\"-1\")\r\nelse:\r\n print(\"0\")\r\n \r\n ", "n,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[0]*(n+1)\r\ni=1\r\nfor i in range(1,n+1):\r\n l1[i]=l[l[i-1]-1]\r\ncnt=0\r\ni=0\r\nif(s!=t):\r\n while(s!=t):\r\n cnt+=1\r\n s=l[s-1]\r\n i+=1\r\n if(i>n):\r\n cnt=-1\r\n break \r\nprint(cnt) \r\n\r\n", "\r\n\r\nn,s,t = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\nif(s==t):\r\n print(0)\r\nelse:\r\n st = set()\r\n k=l[s-1]\r\n f=0\r\n c=1\r\n while(1):\r\n if(k==t):\r\n f=1\r\n break\r\n if(k in st):\r\n break\r\n st.add(k)\r\n k=l[k-1]\r\n \r\n c+=1\r\n \r\n \r\n if(f==1):\r\n print(c)\r\n else:\r\n print(-1)\r\n ", "n,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=0\r\ncheck=s\r\nwhile check!=t and l[check-1]!=0:\r\n b=l[check-1]\r\n l[check-1]=0\r\n check=b\r\n ans+=1\r\nif check==t:\r\n print(ans)\r\nelse:\r\n print(-1)", "n,s,t = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\n\r\nfound = False\r\nres = 0\r\nhashset = set()\r\nhashset.add(s)\r\nwhile True:\r\n if s == t:\r\n found = True\r\n break\r\n s = arr[s-1]\r\n res += 1\r\n if s in hashset:\r\n break\r\n\r\nif found:\r\n print(res)\r\nelse:\r\n print(-1)\r\n \r\n", "def inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\ndef found(s, t, goto):\r\n if s == t:\r\n return 0\r\n\r\n if s == goto[s]:\r\n return -1\r\n\r\n vis = set()\r\n while s != t:\r\n if s in vis:\r\n return -1\r\n\r\n vis.add(s)\r\n s = goto[s]\r\n \r\n return len(vis) \r\n\r\nn, s, t = invr()\r\ngoto = [0] + inlt()\r\n\r\nprint(found(s, t, goto))\r\n", "n,s,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nx=s-1\r\nc=0\r\nf=0\r\nwhile c<=n:\r\n c+=1\r\n q=a[x]\r\n x=q-1\r\n if q==a[t-1]:\r\n f=1\r\n print(c-1)\r\n break\r\nif f==0:\r\n print(-1)", "n, s, t = input().split(\" \")\nn = int(n)\ns = int(s)\nt = int(t)\n\nseq = input().split(\" \")\narr = []\nfor i in seq:\n arr.append(int(i))\n \nisPossible = False\nfor i in range(len(arr)):\n if s == t:\n isPossible = True\n print(i)\n break\n s = arr[s-1]\nif isPossible is not True:\n print(-1)\n \t\t\t \t \t\t \t\t \t \t \t \t\t\t\t", "n, s, t = map(int, input().split())\r\na = [0] + [int(x) for x in input().split()]\r\nif s==t:\r\n print(\"0\")\r\nelse:\r\n count = 0\r\n found = False\r\n temp = s\r\n while(a[temp]!=s):\r\n count += 1\r\n temp = a[temp]\r\n if temp == t:\r\n found = True\r\n break\r\n if found:\r\n print(count)\r\n else:\r\n print(\"-1\")\r\n \r\n", "n,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n if s==t:\r\n print(i)\r\n quit()\r\n s=l[s -1]\r\nprint(-1)", "n,s,t=map(int,input().split())\r\np=[0]+list(map(int,input().split()))\r\nans=0\r\nwhile ans<=n and s!=t:\r\n s=p[s]\r\n ans+=1\r\nprint([-1,ans][ans<=n])\r\n", "import sys\nimport math\ninput = sys.stdin.readline\nfrom collections import defaultdict\nn, s, t = map(int, input().split())\nlst = list(map(int, input().split()))\nif s == t:\n print(0)\n exit()\n# for i in range(n):\n# if lst[i] == i+1 or lst[lst[i] - 1] == lst[i]:\n# print(-1)\n# exit()\np = lst[s-1]\ncount = 1\nwhile t != p:\n p = lst[p-1]\n count += 1\n if count > n:\n print(-1)\n exit()\nprint(count)", "n, s, t = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nfor i in range(n):\r\n if(s == t):\r\n print(i)\r\n break\r\n s = arr[s-1]\r\nelse:\r\n print(-1)\r\n", "import sys\r\nfrom math import sqrt\r\nfrom collections import Counter, deque\r\nfrom collections import defaultdict as dd\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var): sys.stdout.write(str(var)+\"\\n\")\r\ndef outa(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var)) + end)\r\ndef l(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\n\r\n\r\nn, s, t = sp()\r\np = l()\r\ngraph = dd(list)\r\nfor i in range(n):\r\n graph[i + 1].append(p[i])\r\ndistance = Counter()\r\nd = deque([[s, 0]])\r\ndistance[s] = 0\r\nwhile d:\r\n src, dist = d.popleft()\r\n for child in graph[src]:\r\n if child not in distance:\r\n distance[child] = dist + 1\r\n d.append([child, distance[child]])\r\n if child == t:\r\n out(distance[child])\r\n exit()\r\nif t in distance:\r\n out(distance[t])\r\n exit()\r\nout(-1)\r\n", "n, s, t = map(int, input().split())\r\nshuffling_operations = list(map(int, input().split()))\r\n\r\ncurrent_position = s\r\nshuffles = 0\r\n\r\nwhile current_position != t:\r\n current_position = shuffling_operations[current_position - 1]\r\n shuffles += 1\r\n \r\n # If we end up back at the starting position, it's impossible to reach t\r\n if current_position == s:\r\n shuffles = -1\r\n break\r\n\r\nprint(shuffles)\r\n", "def main():\r\n n, s, t = [int(c) for c in input().split()]\r\n positions = [int(c) - 1 for c in input().split()]\r\n s -= 1\r\n t -= 1\r\n\r\n if s == t:\r\n print(0)\r\n return\r\n\r\n i = 1\r\n cur = s\r\n while i < n:\r\n cur = positions[cur]\r\n if cur == t:\r\n print(i)\r\n return\r\n i += 1\r\n\r\n print(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,s,t=map(int,input().split())\r\na=list(map(int, input().split()))\r\ndef fn(a,n,s,t):\r\n if s==t:return 0\r\n ans=0\r\n cur=s-1\r\n while True:\r\n cur=a[cur]-1\r\n ans+=1\r\n if cur==t-1:return ans\r\n if cur==s-1:return -1\r\nprint(fn(a,n,s,t))\r\n", "a,b,c=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nfor _ in range(a):\r\n if(b==c):\r\n print(_)\r\n exit()\r\n b=d[b-1]\r\nprint(-1)\r\n\r\n\r\n# CodeBy: RAHUL MAHAJAN\r\n# A2OJ: rahulmahajan\r\n# CC: anonymous0201\r\n# CF: rahulmahajan\r\n# CSES: rahulmahajan", "n,s,t=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nmarble=s\r\nchance=0\r\np=list(range(1,n+1))\r\nwhile(marble!=t):\r\n chance=chance+1\r\n p[marble-1]=-1\r\n marble=a[marble-1]\r\n if(p[marble-1]<0):\r\n chance=-1\r\n break\r\n else:\r\n pass\r\nprint(chance)", "c = []\r\na = []\r\nc = input().split()\r\nb = []\r\nb = input().split()\r\nn = int(c[0])\r\ns = int(c[1])\r\nt = int(c[2])\r\nfor i in range(n):\r\n ele = int(b[i])\r\n a.append(ele)\r\nif s == t:\r\n print(0)\r\n exit()\r\nj = 0\r\nv = []\r\ncount = 0\r\nv.append(int(a[s-1]))\r\nfor j in range(n-1):\r\n v.append(int(a[int(v[j]-1)]))\r\nfor i in range(n):\r\n if t == v[i]:\r\n print(i+1)\r\n exit()\r\nprint(-1)\r\n", "'''input\n4 3 4\n1 2 3 4\n'''\n\n\n\nn, s, t = map(int, input().split())\narr = list(map(int, input().split()))\n\n\nif s == t:\n print(0)\n exit()\n \n\n\n\n\nvisited = set()\ncount = 0\nflag = 0\ni = arr[s-1]\nwhile(i not in visited):\n if i == t:\n flag = 1\n break\n\n count += 1\n visited.add(i)\n i = arr[i-1]\n\n\nif flag == 1:\n print(count+1)\nelse:\n print(-1)\n\n\n", "n,a,t=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a==t:\r\n print(i)\r\n exit()\r\n a=x[a-1]\r\nprint(-1)", "from collections import deque\n\ndef bfs(s,t):\n\tvis = [0]*n\n\tq = deque()\n\tq.append(s)\n\tcount = 0\n\twhile len(q)!=0:\n\t\te = q.popleft()\n\t\tvis[e] = 1\n\t\tif not vis[graph[e]]:\n\t\t\tq.append(graph[e])\n\t\t\tcount += 1\n\t\t\tif graph[e]==t:\n\t\t\t\treturn count\n\t\telse:\n\t\t\treturn -1\n\nn,s,t = map(int,input().split())\na = list(map(int,input().split()))\nif s==t:\n\tprint (0)\n\texit()\ngraph = [-1]*n\nfor i in range(n):\n\tgraph[i] = a[i]-1\ns,t = s-1,t-1\nprint (bfs(s,t))", "n,s,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=0\r\noriginal_s=s\r\nflag=0\r\nwhile(flag==0):\r\n if s==t:\r\n print(ans)\r\n flag=1\r\n elif l[s-1]==t:\r\n ans+=1\r\n print(ans)\r\n flag=1\r\n elif l[s-1]!=t and l[s-1]!=original_s:\r\n ans+=1 \r\n s=l[s-1] \r\n else:\r\n print(-1)\r\n flag=1 ", "v=input().split()\r\nn=int(v[0])\r\ns=int(v[1])\r\nt=int(v[2])\r\n\r\nb=input().split()\r\nif s==t:\r\n print(0)\r\n exit()\r\nshar=s\r\nfor i in range(n):\r\n b[i]=int(b[i])\r\n\r\nfor i in range(n):\r\n shar=b[shar-1]\r\n if shar==t:\r\n print(i+1)\r\n exit()\r\n\r\nprint(-1) \r\n", "# coding: utf-8\nn, s, t = [int(i) for i in input().split()]\np = [0] + [int(i) for i in input().split()]\nif s == t:\n print(0)\n exit()\npos = p[s]\nans = 1\nwhile pos != t:\n pos = p[pos]\n ans += 1\n if pos == s:\n print('-1')\n break\nelse:\n print(ans)\n", "n,s,t = map(int,input().split())\r\nL = list(map(int,input().split()))\r\nfor i in range (n):\r\n if(s == t):\r\n print(i)\r\n exit()\r\n s = L[s-1]\r\nprint(-1)", "a=list(map(int,input().split()))\r\nn=a[0]\r\ns=a[1]\r\ng=a[2]\r\na=[0]\r\na=a+list(map(int,input().split()))\r\nc=0\r\ncurr=s\r\nl=[]\r\nfor x in range(n+1):\r\n l.append(0)\r\nwhile(curr!=g):\r\n c+=1\r\n l[curr]+=1\r\n if(l[curr]>1):\r\n c=-1\r\n break\r\n curr=a[curr]\r\nprint(c)\r\n\r\n", "n, s, t = map(int, input().split())\narray = list(map(int, input().split()))\n\nif s == t:\n print(0)\nelse:\n for i in range(n):\n if s == t:\n print(i)\n break\n s = array[s - 1]\n else:\n print(-1)\n", "from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\"\"\"\r\n#from heapq import *\r\n#from random import *\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(3*(10**5))\r\nglobal flag\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n,s,d=ma()\r\n a=lis()\r\n if(s==d):\r\n print(0)\r\n exit(0)\r\n vis=set()\r\n ss=0\r\n while(1):\r\n x=a[s-1]\r\n if(x==d):\r\n ss+=1\r\n break\r\n if(x not in vis):\r\n vis.add(x)\r\n s=a[s-1]\r\n ss+=1\r\n else:\r\n ss=-1\r\n break\r\n print(ss)\r\n \r\n \r\n \r\n \r\n" ]

[ "import sys\r\nimport math\r\n\r\nMAXN = 55\r\nINF = 1e9\r\nMOD = 1e9+7\r\nL_INF = 4e18\r\nEPS = 1e-10\r\n\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nt = input()\r\nl = len(t)\r\n\r\ndp = [INF] * (l + 1)\r\ndp[0] = 0\r\n\r\nfor i in range(l):\r\n for j in range(n):\r\n _l, _r = i, 0\r\n while _r < len(s[j]) and _l < l:\r\n if s[j][_r] == t[_l]:\r\n _l += 1\r\n _r += 1\r\n dp[_l] = min(dp[_l], dp[i] + 1)\r\n\r\nif dp[l] >= INF / 2:\r\n dp[l] = -1\r\nprint(dp[l])\r\n\r\n\r\n" ]

[ "x = list(input())\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(len(x)):\r\n if x[-1] == \"(\" and c1 == 0:\r\n x.pop()\r\n elif x[-1] == \")\":\r\n x.pop()\r\n c1+=1\r\n else:\r\n x.pop()\r\n c1-=1\r\n c2+=2\r\n\r\nprint(c2)", "m=input()\r\n\r\ncont=0\r\ncont2=0\r\nB=[]\r\nC=[]\r\n\r\nfor i in m :\r\n if i == \"(\" :\r\n B.append(i)\r\n if i == \")\" :\r\n if len(B)!=0:\r\n if B.pop() == \"(\" :\r\n cont+=1\r\n else:cont2+=1\r\n\r\nprint(cont*2)\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nS = input()\r\ncnt=0\r\nans=0\r\nfor c in S:\r\n if c==')' and cnt>0:\r\n cnt-=1\r\n ans+=2\r\n elif c=='(':\r\n cnt+=1\r\nprint(ans)\r\n\r\n", "#from dust i have come dust i will be\r\n\r\ns=input()\r\n\r\na=list()\r\n\r\ncnt=0\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n a.append('(')\r\n else:\r\n if len(a)==0:\r\n cnt+=1\r\n else:\r\n a.pop()\r\n\r\ncnt+=len(a)\r\nprint(len(s)-cnt)", "s=input()\r\nn=len(s)\r\nz=[]\r\nk=0\r\nb=0\r\nfor i in range(n):\r\n z.append(s[i])\r\n b+=1\r\n if b>=2:\r\n if z[b-2]=='(' and z[b-1]==')':\r\n z.pop(b-1)\r\n z.pop(b-2)\r\n k+=2\r\n b-=2\r\nprint(k)", "from math import *\r\ns=list(input())\r\nn=len(s)\r\nc,k=0,0\r\nans=0\r\nfor i in range(n):\r\n if s[i]=='(':\r\n c=c+1\r\n else:\r\n k=k+1\r\n if (c-k)<0:\r\n if s[i]==')':\r\n k=k-1\r\nprint(2*k)\r\n\r\n ", "def max_regular_length(bracket_sequence):\n stack = []\n max_length = 0\n\n for bracket in bracket_sequence:\n if bracket == '(':\n stack.append(bracket)\n else: # Closing bracket ')'\n if stack:\n stack.pop()\n max_length += 2\n\n return max_length\n\ndef main():\n bracket_sequence = input().strip()\n result = max_regular_length(bracket_sequence)\n print(result)\n\nif __name__ == \"__main__\":\n main()\n\n\t\t\t\t \t\t\t \t\t\t\t \t\t \t\t \t", "k=2\r\nif k!=0:\r\n seq = input()\r\n count = 0\r\n maxn = 0\r\n \r\n for i in range(len(seq)):\r\n \r\n if(seq[i] == \"(\"):\r\n count += 1 \r\n \r\n elif(count > 0):\r\n count -= 1 \r\n maxn += 2 \r\n \r\n print(maxn)\r\n", "a=input()\nn=0\ntot=0\ni=0\nwhile i<len(a):\n if a[i]==')' and n==0:\n i+=1\n elif a[i]==')' and n>0:\n n-=1\n tot+=1 \n i+=1\n elif a[i]=='(':\n n+=1\n i+=1\nprint (tot*2) \n\t\t \t\t\t \t \t \t\t \t\t\t \t \t\t\t\t \t\t", "s, stack, cnt = input(), [], 0\r\nfor i in range(len(s)):\r\n if s[i] == '(': stack.append(s[i])\r\n else:\r\n if len(stack) > 0:\r\n if stack.pop() != '(': cnt +=1\r\n else: cnt += 1\r\nprint(len(s) - cnt - len(stack))", "brackets = input()\r\n\r\ncount_open_brackets = 0\r\ncount_closed_brackets = 0\r\n\r\nfor _ in brackets: \r\n if _ == \"(\":\r\n count_open_brackets += 1\r\n elif _ == \")\" and count_open_brackets > count_closed_brackets:\r\n count_closed_brackets +=1\r\n\r\n_result = count_closed_brackets * 2 \r\nprint(_result)", "'''\r\nDescripttion: your project\r\nversion: 1.0\r\nAuthor: ElysiaRealme\r\nDate: 2023-10-30 09:57:18\r\nLastEditors: ElysiaRealme\r\nLanguage: Python\r\n'''\r\nfrom io import BytesIO, IOBase\r\nimport sys\r\nimport os\r\n\r\n# import time\r\nimport bisect\r\n# import functools\r\nimport math\r\nimport random\r\n# import re\r\nfrom collections import Counter, defaultdict, deque\r\n# from copy import deepcopy\r\nfrom functools import cmp_to_key, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\nfrom itertools import accumulate, combinations, permutations\r\n# from operator import add, iand, ior, itemgetter, mul, xor\r\n# from string import ascii_lowercase, ascii_uppercase\r\nfrom typing import *\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef II():\r\n return int(input())\r\n\r\n\r\ndef MII():\r\n return map(int, input().split())\r\n\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndx, dy = [0, 1, 0, -1, 1, -1, 1, -1], [1, 0, -1, 0, -1, -1, 1, 1]\r\ninf = float('inf')\r\ns = I()\r\nn = len(s)\r\nst = []\r\nres = 0\r\nfor x in s:\r\n if x == '(':\r\n st.append(x)\r\n else:\r\n if st:\r\n st.pop()\r\n res += 2\r\nprint(res)\r\n ", "s = input()\r\nstack = []\r\nres = 0\r\nfor ch in s:\r\n if ch == \"(\":\r\n stack.append(ch)\r\n else:\r\n if len(stack):\r\n res += 2\r\n stack.pop()\r\nprint(res)", "\r\n\r\nb = input() \r\n\r\ni = 0\r\nN = 0\r\nx = 0\r\ny = 0\r\nwhile(i < len(b)):\r\n if(b[i] == '('):\r\n x = x + 1\r\n elif(b[i] == ')'):\r\n x = x - 1\r\n if(x >= 0):\r\n N = N + 1\r\n else:\r\n x = 0\r\n# print(b[i],x,N) \r\n# input()\r\n i = i + 1\r\n\r\n \r\nprint(N*2)\r\n", "x=input()\r\ny=0\r\nz=0\r\nfor i in x:\r\n if i=='(':\r\n y+=1\r\n elif y>0:\r\n z+=1\r\n y-=1\r\nprint((2*z))", "s = input()\r\nn = len(s)\r\nl = r = 0\r\n\r\nfor c in s:\r\n if c == '(':\r\n l += 1\r\n elif l > 0:\r\n l -= 1\r\n else:\r\n r += 1\r\n\r\nprint(n - l - r)", "stack = []\r\nbracket = input()\r\n\r\ncount = 0\r\nfor i in bracket:\r\n if i == '(':\r\n stack.append(i)\r\n else:\r\n if stack != []:\r\n stack.pop()\r\n count+=2\r\nprint(count)", "ls = input()\r\nleft = \"(\"\r\nright = \")\"\r\ncount = 0\r\nl = []\r\nfor j in ls:\r\n if j == left:\r\n l.append(j)\r\n elif j == right:\r\n if len(l) > 0: # if its right and l not empty, that means i have left,\r\n l.pop() # so ill pop the left and add to count the ( )\r\n count += 2\r\n\r\nprint(count)", "s=input()\r\nz=0\r\nc=0\r\nfor i in s:\r\n if i=='(':\r\n z+=1\r\n elif i==')' and z>0:\r\n z-=1\r\n c+=2\r\nprint(c) ", "s = input()\r\na = []\r\ncount = 0\r\nfor c in s:\r\n if c == '(':\r\n a.append(c)\r\n elif len(a) != 0:\r\n count += 2\r\n a.pop()\r\nprint(count)\r\n", "cou = 0\r\na = input()\r\nans = 0\r\nfor j in range(len(a)):\r\n if a[j] == '(':\r\n cou += 1\r\n \r\n else:\r\n if cou > 0:\r\n cou -= 1\r\n ans += 1\r\n \r\nprint(ans*2)\r\n ", "s = input()\nl = []\nans = 0\nfor i in range(len(s)):\n if len(l):\n if l[-1] == \"(\" and s[i] == \")\":\n l.pop()\n ans += 2\n elif l[-1] == \"(\" and s[i] == \"(\":\n l += [\"(\"]\n elif s[i] == \"(\":\n l += [\"(\"]\nprint(ans)\n\n\t\t\t \t\t\t\t\t\t\t\t \t\t \t \t \t \t\t\t \t", "a,b=0,0\r\nfor i in input():\r\n if i == '(':\r\n a += 1\r\n elif a > 0:\r\n a -= 1\r\n b += 1\r\nprint(2*b)", "bra = input()\nstack = []\ncount = 0\nfor i in bra:\n if i == '(':\n stack.append(i)\n elif i == ')':\n if stack:\n stack.pop()\n else:\n count += 1\ncount += len(stack)\nprint(len(bra) - count)\n\t \t \t\t \t \t \t\t\t \t \t\t\t", "s = input()\r\nstack = []\r\nans = 0\r\n\r\nfor char in s:\r\n if char == '(':\r\n stack.append(char)\r\n elif char == ')' and stack:\r\n stack.pop()\r\n ans += 2\r\n\r\nprint(ans)\r\n", "x,y=0,0\r\nfor i in input():\r\n if i=='(':x+=1\r\n elif x>0:x-=1;y+=2\r\nprint(y)", "s = input().strip()\r\n\r\nnewList = []\r\nopeners = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"(\":\r\n newList.append(\"(\")\r\n openers += 1\r\n elif s[i] == \")\":\r\n if openers > 0:\r\n openers-=1\r\n newList.append(\")\")\r\n\r\nprint(len(newList) - openers)\r\n ", "a = input()\r\ns = []\r\n\r\nfor i in range (len(a)):\r\n if len(s) != 0 and a[i] == ')' and s[-1] == '(':\r\n s.pop()\r\n else:\r\n s.append(a[i])\r\n\r\nprint(len(a)- len(s))\r\n\r\n\r\n", "get_input = input\r\n# print(get_input().strip())\r\ns = get_input()\r\nbr_dict = {\"{\":\"}\", \"[\":\"]\", \"(\":\")\"}\r\n\r\nnot_matched = []\r\nmax_count = 0\r\ncur_count = 0\r\nfor br in s:\r\n if len(not_matched) == 0:\r\n if br in br_dict:\r\n not_matched.append(br)\r\n else:\r\n if br in br_dict:\r\n not_matched.append(br)\r\n elif br == br_dict[not_matched[-1]]:\r\n cur_count += 2\r\n del not_matched[-1]\r\n else:\r\n max_count = max(max_count, cur_count)\r\n cur_count = 0\r\n not_matched = []\r\nmax_count = max(max_count, cur_count)\r\nprint(max_count)\r\nexit()\r\n", "ch=input()\r\nn=len(ch)\r\nlst=[]\r\nnb=0\r\ni=0\r\nwhile i<n:\r\n c=ch[i]\r\n if c=='(':\r\n lst.append('(')\r\n if c==')':\r\n if len(lst)==0:\r\n nb+=1\r\n else:\r\n lst.pop() \r\n i+=1\r\n\r\nprint(n-(nb+len(lst)))", "\r\n\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n n = len(s)\r\n st = []\r\n ans = 0\r\n for i in range(n):\r\n if s[i] == '(':\r\n st.append(1)\r\n elif len(st) > 0:\r\n ans += 2\r\n st.pop()\r\n print(ans)", "seq = input()\r\nstack = []\r\ninc = 0\r\nfor c in seq:\r\n\tif c == '(':\r\n\t\tstack.append('x')\r\n\t\tinc += 1\r\n\tif c == ')':\r\n\t\tif len(stack) > 0:\r\n\t\t\tstack.pop()\r\n\t\t\tinc += 1\r\nprint(inc - len(stack))", "s = list(input())\nleft = 0\ncnt = 0\nfor i in s:\n if i == \"(\":\n left += 1\n else:\n if left != 0:\n left -= 1\n cnt += 2\nprint(cnt)\n\n\t\t\t\t \t \t \t\t\t\t \t\t \t \t", "ch=input()\r\nstk=[]\r\nlength=len(ch)\r\nj=0\r\nfor i in range (length):\r\n if(( ch[i]==')') and (stk==[])):\r\n j+=1\r\n if ( ch[i]=='('):\r\n stk.append(ch[i])\r\n else:\r\n if(( ch[i]==')') and (stk!=[])):\r\n stk.pop()\r\n\r\nprint (length- len(stk)-j)", "def max_regular_length(bracket_sequence):\r\n count = 0\r\n stack = []\r\n\r\n for char in bracket_sequence:\r\n if char == '(':\r\n stack.append(char)\r\n elif char == ')':\r\n if stack:\r\n stack.pop()\r\n count += 2\r\n\r\n return count\r\n\r\nbracket_sequence = input()\r\n\r\nmax_length = max_regular_length(bracket_sequence)\r\nprint(max_length)\r\n", "s = input() \r\nn = len(s) \r\nlst = [ ] \r\nct=0 \r\nfor i in range(n):\r\n if (s[i]=='('):\r\n lst.append(i) \r\n elif (s[i]==')'):\r\n if (len(lst)==0):\r\n ct+=1 \r\n else:\r\n lst.pop() \r\nct +=len(lst) \r\nprint(n-ct) \r\n", "s=input()\r\nst=[]\r\nans=0\r\nfor i in s:\r\n if i == '(':\r\n st.append('(')\r\n else:\r\n if len(st) > 0:\r\n ans += 2\r\n st.pop()\r\nprint(ans)", "s = input()\r\ncount = 0\r\nl = 0\r\nfor c in s:\r\n if c == '(':\r\n l += 1\r\n elif c == ')':\r\n if l > 0:\r\n l -= 1\r\n count += 2\r\nprint(count)", "s = input()\nc = 0\nr = 0\nn = len(s)\nfor x in s:\n if x == \"(\":\n c += 1\n else:\n if c == 0:\n r += 1\n else:\n c -= 1\nprint(n - (r + c))", "b = input() \r\n\r\nN = 0\r\nx = 0\r\n\r\nfor i in range(b.find('('),len(b)):\r\n if(b[i] == '('):\r\n x = x + 1\r\n else:\r\n x = x - 1\r\n if(x >= 0):\r\n N = N + 2\r\n else:\r\n x = 0\r\n# print(b[i],x,N) \r\n# input()\r\n\r\n \r\nprint(N)", "# https://codeforces.com/contest/26/problem/B\r\n\r\nnb_parentheses = 0\r\nnb_pbs = 0\r\ns = input()\r\nfor c in s:\r\n if c == '(':\r\n nb_parentheses += 1\r\n else:\r\n if nb_parentheses > 0:\r\n nb_parentheses -= 1\r\n else:\r\n nb_pbs += 1\r\n\r\nprint(len(s) - nb_parentheses - nb_pbs)\r\n", "import sys\r\n\r\ninput = lambda:sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef I(): return input()\r\ndef II(): return int(input())\r\ndef MII(): return map(int, input().split())\r\ndef LI(): return list(input().split())\r\ndef LII(): return list(map(int, input().split()))\r\n\r\ninf = float(\"inf\")\r\nmod = 10**9 + 7\r\n# for _ in range(II()):\r\ns = I()\r\ncnt = ans = 0\r\nfor c in s:\r\n if c == '(':\r\n cnt += 1\r\n else:\r\n if cnt:\r\n ans += 2\r\n cnt -= 1\r\nprint(ans)", "from collections import deque\nstring=input()\nfiltered=deque()\ncount=0\nfor i in string:\n if not filtered: \n filtered.append(i)\n continue\n last=filtered.pop()\n if last=='(' and i==')':\n count+=1\n continue\n filtered.append(last)\n filtered.append(i)\nprint(count*2)\n\t\t\t\t\t\t\t\t \t\t \t\t\t \t \t \t \t", "brackets = list(input())\r\n\r\nopen_brackets = 0\r\npair_brackets = 0\r\nfor bracket in brackets:\r\n if bracket == '(':\r\n open_brackets += 1\r\n if bracket == ')':\r\n if open_brackets >= 1:\r\n pair_brackets += 1\r\n open_brackets -= 1\r\n\r\nprint(pair_brackets * 2)", "cnt, cur = 0, 0\n\nfor ch in input():\n\t\n\tif ch == \"(\":\n\t\tcur += 1\n\telse:\n\t\tcur -= 1\n\t\n\tif cur < 0:\n\t\tcur = 0\n\telse:\n\t\tcnt += 1\n\nprint(cnt-cur)\n", "brackets = input()\nopend = 0\nclose = 0\nleng = 0\nfor i in brackets:\n if i == \"(\":\n opend += 1\n elif i == \")\" and opend > 0:\n opend -= 1\n leng += 2\nprint(leng)\n \t\t \t \t\t\t\t \t \t\t \t \t \t\t\t\t \t", "l = input()\r\ncorrect = 0\r\nAux = 0\r\nfor i in l:\r\n if i =='(':\r\n correct +=1\r\n else:\r\n if correct==0:\r\n Aux+=1\r\n else:\r\n correct -= 1\r\nprint(len(l)-correct-Aux)", "s = input()\r\nstack = []\r\na = 0\r\nfor i in s:\r\n if i == '(':\r\n stack.append(1)\r\n else:\r\n if stack:\r\n stack.pop()\r\n else:\r\n a += 1\r\nprint(len(s) - a - len(stack))", "s=input()\r\no=0\r\nc=0\r\nans=\"\"\r\nfor i in s:\r\n if i==\"(\":\r\n o+=1\r\n ans+=i\r\n if i==\")\":\r\n if o>c:\r\n c+=1\r\n ans+=i\r\nwhile o>c+1:\r\n o-=1\r\n#print(ans)\r\nprint(((c+o)//2)*2)", "x=input()\r\no=[]\r\nc=0\r\nfor i in x:\r\n if i==\"(\":\r\n o.append(i)\r\n elif i==\")\"and len(o)>0:\r\n o.pop()\r\n c+=2\r\nprint(c)\r\n ", "s=input()\r\nop=0\r\ncl=0\r\nfor i in range(len(s)):\r\n if(s[i]=='('):\r\n op+=1\r\n else:\r\n if(op>0):\r\n cl+=1\r\n op-=1\r\n \r\nprint(2*cl)\r\n\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\n\r\nc = 0\r\nd = 0\r\nfor i in s:\r\n if i == '(':\r\n c += 1\r\n else:\r\n c -= 1\r\n\r\n if c < 0:\r\n d += 1\r\n c += 1\r\n\r\nprint(len(s) - d - c)", "seq = input()\r\ncount = 0\r\nmaxn = 0\r\n\r\nfor i in range(len(seq)):\r\n \r\n if(seq[i] == \"(\"):\r\n count += 1 \r\n \r\n elif(count > 0):\r\n count -= 1 \r\n maxn += 2 \r\n \r\nprint(maxn)\r\n\r\n", "s, a, b = input(), 0, 0\r\nfor ch in s:\r\n if ch == '(':\r\n a += 1\r\n else:\r\n if a == 0:\r\n b += 1\r\n else:\r\n a -= 1\r\nprint(len(s) - a - b)", "def costToBalance(s):\r\n stack=[]\r\n for i in s:\r\n if(i==\"(\"):\r\n stack.append(i)\r\n elif(i==\")\" and stack and stack[-1]==\"(\"):\r\n stack.pop(-1)\r\n else:\r\n stack.append(i)\r\n return len(stack)\r\ns =input().strip()\r\nprint(len(s)-costToBalance(s))\r\n\r\n", "a,ans=0,0\r\nfor c in input():\r\n if c==\"(\":\r\n a+=1\r\n else:\r\n if a>0:\r\n ans+=2\r\n a-=1\r\nprint(ans)\r\n", "bracket_sequence = input().strip()\nstack = []\nmax_length = 0\n\nfor char in bracket_sequence:\n if char == '(':\n stack.append(char)\n elif char == ')' and stack:\n stack.pop()\n max_length += 2\n\nprint(max_length)\n\n\t\t \t \t \t \t\t\t \t \t \t \t\t\t\t\t", "st=[]\r\ns=input()\r\nans=len(s)\r\nfor i in s:\r\n if st and i==')'and st[-1]=='(':st.pop(-1)\r\n else:st.append(i)\r\nprint(ans-len(st))", "s = input()\r\nc = 0\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"(\":\r\n c += 1\r\n ans += 1\r\n elif c:\r\n ans += 1\r\n c -= 1\r\nprint(ans - c)", "s=str(input())\r\nopen=0\r\nclose=0\r\nfor i in s:\r\n if i==\"(\":\r\n open+=1\r\n elif i==\")\" and open>0:\r\n open-=1\r\n close+=1\r\n\r\nprint(2*close)\r\n \r\n \r\n \r\n", "p=[]\r\nch=str(input())\r\nx=0\r\nfor i in range(len(ch)):\r\n if ch[i]==\"(\" :\r\n p.append(ch[i])\r\n else :\r\n if ch[i]==\")\" and (len(p)!=0):\r\n p.pop()\r\n x=x+2\r\nprint(x)\r\n \r\n \r\n \r\n \r\n \r\n", "s = input()\nstack = []\ncount = 0\nfor char in s:\n if char == '(':\n stack.append(char)\n elif char == ')' and stack:\n stack.pop()\n count += 2\nprint(count)\n\n \t \t \t \t\t\t\t \t\t \t\t \t \t \t\t", "s = str(input())\r\nq=0;w=0\r\nfor i in s :\r\n if i == \"(\" : q+=1\r\n if i == \")\" and q > 0 : q-=1; w+=2\r\nprint(w)", "c=input()\r\nstack=[]\r\ncount=0\r\n\r\nfor i in c:\r\n if i=='(':\r\n stack.append(i)\r\n elif stack and stack[-1] =='(':\r\n stack.pop()\r\n count+=2\r\n else:\r\n stack.append(i)\r\n\r\nprint(count)", "s = input()\r\n\r\nst = []\r\ncounter = 0\r\nfor character in s:\r\n if character == '(':\r\n st.append(character)\r\n else:\r\n if len(st) > 0:\r\n st.pop()\r\n counter += 2\r\n\r\nprint(counter)\r\n", "l,r = 0, 0\n\nfor s in input():\n\n if s=='(':\n\n l+=1\n\n elif l>0:\n\n r+=1\n\n l-=1\n\nprint(2*r)\n\n\n\n\n\n\n\n# Made By Mostafa_Khaled", "s=input()\r\nc1=0\r\nc2=0\r\nans=0\r\nfor i in s:\r\n if i==\"(\":\r\n ans+=1\r\n c1+=1\r\n elif i==\")\" and c1>0:\r\n c1-=1\r\n ans+=1\r\nprint(ans-c1)\r\n", "s = input()\nl =[]\ncnt = 0\nfor i in s:\n\tif i == '(':\n\t\tl.append(i)\n\telse:\n\t\tif len(l) and l[-1] == '(':\n\t\t\tcnt += 2\n\t\t\tl.pop()\n\t\telse:\n\t\t\tl.append(i)\nprint(cnt)\n\t \t\t\t\t \t \t\t \t \t \t \t \t", "s = input()\r\nn = len(s)\r\n\r\nopen = 0\r\nclose = 0\r\ntotal = 0\r\nfor c in s:\r\n\tif c == '(':\r\n\t\topen += 1\r\n\telse:\r\n\t\tif open > 0:\r\n\t\t\topen -= 1\r\n\t\t\tclose += 1\r\nprint(close*2)\r\n\t", "x1 = list(map(str, input()))\r\n\r\nu = []\r\n\r\nv = \")\"\r\n\r\nc = 0\r\nfor i in x1:\r\n\r\n if (\"(\" == i):\r\n u.append(i)\r\n else:\r\n if len(u) == 0:\r\n continue\r\n u.pop()\r\n c+=2\r\n \r\nprint(c) ", "\r\nbrakets = input()\r\n\r\nminScore = 0\r\nscore = 0\r\ntoBeRemoved = 0\r\n\r\nfor b in brakets:\r\n if b == \"(\":\r\n score += 1\r\n else:\r\n score -= 1\r\n\r\n if score < minScore:\r\n toBeRemoved += 1\r\n minScore = score\r\n\r\nminScore = 0\r\nscore = 0\r\nfor b in reversed(brakets):\r\n if b == \")\":\r\n score += 1\r\n else:\r\n score -= 1\r\n\r\n if score < minScore:\r\n toBeRemoved += 1\r\n minScore = score\r\n\r\nprint(len(brakets) - toBeRemoved)", "from collections import deque\r\ns= input()\r\nstk=deque()\r\ncount=0\r\nstk.append(s[0])\r\nfor i in s[1:]:\r\n if i == ')':\r\n if stk:\r\n top = stk.pop()\r\n if top == '(':\r\n count+=1\r\n else:\r\n stk.append(top)\r\n stk.append(i)\r\n else:\r\n stk.append(i)\r\n\r\nprint(count*2)\r\n", "s = input()\r\nopen_c = 0\r\ntot = 0\r\nfor i in s:\r\n if i == '(':\r\n open_c += 1\r\n elif open_c > 0:\r\n open_c -= 1\r\n tot += 2\r\nprint(tot)\r\n", "c = 0\r\na = str(input())\r\narr = []\r\nfor i in a:\r\n if i == '(':\r\n arr.append(i)\r\n elif len(arr) > 0 and i == ')':\r\n arr.pop()\r\n c += 1\r\n\r\nprint(c*2)", "a= input()\nb=0\nc=0\nfor i in a:\n if i=='(':\n b += 1\n elif i==')' and b:\n b -=1\n c +=2\n \nprint (c)\n\t \t\t \t \t \t\t \t \t\t \t\t \t\t\t\t \t", "class Stack:\r\n def __init__(self):\r\n self.items = []\r\n\r\n def isEmpty(self):\r\n return self.items == []\r\n\r\n def push(self, item):\r\n self.items.append(item)\r\n\r\n def pop(self):\r\n return self.items.pop()\r\n\r\n def peek(self):\r\n return self.items[len(self.items)-1]\r\n\r\n def size(self):\r\n return len(self.items)\r\n \r\ns=Stack()\r\nnb=0\r\nch=str(input())\r\nfor i in range (len(ch)) :\r\n if ch[i] in \"(\":\r\n s.push(ch[i])\r\n else:\r\n if ch[i] in \")\":\r\n if( s.isEmpty()):\r\n continue\r\n else:\r\n s.pop()\r\n nb+=2\r\nprint(nb)\r\n", "s =input()\r\nstack = []\r\nc=0\r\nfor i in s:\r\n if i==\"(\":\r\n stack.append(i)\r\n else:\r\n if len(stack)!=0 and stack[-1] ==\"(\" :\r\n stack.pop()\r\n c+=1\r\nprint(c*2)", "a=input()\r\nb=[0,0]\r\nc=0\r\nfor i in range(len(a)):\r\n\tif a[i]=='(':\r\n\t\tb[0]+=1\r\n\telse:\r\n\t\tif b[0]>0:\r\n\t\t\tb[0]-=1\r\n\t\t\tc+=2\r\nprint(c)", "s = input()\r\n\r\nl = 0\r\nh = 0\r\n\r\nfor c in s:\r\n if c == '(':\r\n h += 1\r\n else:\r\n if h > 0:\r\n h -= 1\r\n l += 2\r\n\r\nprint(l)\r\n", "a=input().strip()\r\nst=[]\r\nc=0\r\nfor i in a:\r\n if i=='(':\r\n st.append(i)\r\n else:\r\n if len(st)!=0:\r\n st.pop()\r\n c+=2\r\nprint(c)\r\n \r\n \r\n", "a=input()\r\nk=0\r\nc=0\r\nfor i in a:\r\n if i =='(':\r\n c+=1\r\n k+=1\r\n elif c>0:\r\n c-=1\r\n k+=1\r\nprint(k-c)", "from queue import LifoQueue\r\n\r\ns = input()\r\n\r\ncount = 0\r\nanswer = 0\r\nst = []\r\n\r\nx = len(s)\r\nfor i in range(x):\r\n if s[i] == '(':\r\n st.append(s[i])\r\n elif (len(st) > 0):\r\n st.pop(len(st) - 1)\r\n count += 1\r\nprint(count * 2)", "s = input()\r\n\r\nleft, right = 0, 0\r\nfor i in s:\r\n if i == '(':\r\n left += 1\r\n else:\r\n if left == 0:\r\n right += 1\r\n else:\r\n left -= 1\r\nprint( len(s) - (left + right) )", "\r\ns=str(input())\r\n\r\nopen_was = 0\r\n\r\nres = 0\r\nfor i in s:\r\n\r\n if i==\"(\":\r\n open_was+=1\r\n else:\r\n if open_was>0:\r\n open_was-=1\r\n res+=2\r\n\r\nprint(res)\r\n", "import sys\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappop, heappush\r\nfrom itertools import accumulate, groupby\r\nfrom math import ceil, comb, floor, gcd, inf, lcm, log2, prod, sqrt\r\nfrom string import ascii_lowercase\r\n\r\nMOD = 10**9 + 7\r\n\r\n\r\n# 2023-10-30 20:09:03\r\ndef main():\r\n s = input()\r\n st = []\r\n res = 0\r\n for ch in s:\r\n if ch == \")\":\r\n if st and st[-1] == \"(\":\r\n st.pop()\r\n res += 2\r\n else:\r\n st.append(\"(\")\r\n print(res)\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef read_ints():\r\n return map(int, input().split())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # t = int(input())\r\n t = 1\r\n for _ in range(t):\r\n main()\r\n", "s = input()\r\nstack=[]\r\nans=0\r\nfor i in s:\r\n if i=='(':\r\n stack.append(i)\r\n elif stack and i==')' and stack[-1]=='(':\r\n ans+=2\r\n stack.pop()\r\nprint(ans)", "import sys\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# endregion fastio\r\n\r\n# MOD = 998_244_353\r\n# MOD = 10 ** 9 + 7\r\n# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL\r\n# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))\r\n\r\ndef solve() -> None:\r\n s = input()\r\n ans = cnt = 0\r\n for c in s:\r\n if c == '(':\r\n cnt += 1\r\n elif cnt:\r\n ans += 2\r\n cnt -= 1\r\n print(ans)\r\n\r\nsolve()", "def maxi(sequence):\r\n stack = []\r\n cp= 0\r\n for bracket in sequence:\r\n if bracket == '(':\r\n stack.append(bracket)\r\n elif stack:\r\n stack.pop()\r\n cp += 2\r\n return (cp)\r\n\r\nsequence = input()\r\nresult = maxi(sequence)\r\nprint(result)", "# The same file will be used throughout Problem Set by saving after writing different codes\r\n#Ques URL - https://codeforces.com/contest/26/problem/B\r\nstring = input();\r\nlength = 0;\r\nstack = [];\r\ndelete = 0;\r\nfor x in string:\r\n length += 1;\r\n if x == '(':\r\n stack.append(1);\r\n else:\r\n if stack:\r\n stack.pop();\r\n else:\r\n delete += 1;\r\nprint(length - len(stack) - delete);\r\n", " \r\nstring=input()\r\nstack=[]\r\n\r\nc=0\r\n \r\nfor i in string:\r\n if i == \")\" and len(stack)>=1 and stack[-1] == \"(\":\r\n stack.pop()\r\n c+=2\r\n else:\r\n stack.append(i)\r\n \r\nprint(c)", "s = input()\r\n\r\nstack = []\r\nres = 0\r\nfor x in s:\r\n if x == '(':\r\n stack.append(x)\r\n else:\r\n if len(stack) == 0:\r\n continue\r\n res += 2\r\n stack.pop()\r\n\r\nprint(res)", "ch=input()\r\nL=[]\r\nfor i in ch:\r\n try:\r\n if i==')' and L[-1]=='(':\r\n L.pop()\r\n else:\r\n L.append(i)\r\n except:\r\n L.append(i)\r\nprint(len(ch)-len(L))", "s = input()\r\ncount = 0\r\ntotal = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '(':\r\n count +=1\r\n else:\r\n if count != 0 :\r\n count -=1\r\n total +=2\r\n\r\nprint(total)\r\n\r\n\r\n", "t = input()\r\nl=[]\r\nc=0\r\nfor i in range(len(t)):\r\n if t[i]=='(':\r\n l.append(t[i])\r\n elif t[i]==')':\r\n if len(l)!=0:\r\n l.pop()\r\n c+=1\r\n else:\r\n c+=0 \r\nprint(c*2)", "def skobki(s):\r\n count1, count2 = 0, 0\r\n for i in range(len(s)):\r\n if s[i] == '(':\r\n count1 += 1\r\n elif s[i] == ')':\r\n count1 -= 1\r\n if count1 < 0:\r\n count2 += 1\r\n count1 += 1\r\n if count1 > 0:\r\n count2 += count1\r\n return len(s) - count2\r\n\r\n\r\nt = input()\r\nprint(skobki(t))\r\n", "\r\ns = input()\r\n\r\nres = cur = 0\r\n\r\nfor c in s:\r\n \r\n if c == '(':\r\n cur += 1\r\n else:\r\n cur -= 1\r\n \r\n if cur < 0:\r\n res += 1 \r\n cur = 0\r\n\r\nprint(len(s) - (res + cur))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Dec 26 08:41:07 2019\n\n@author: vadim\n\"\"\"\n\nseq = input()\n\nnr = 0\nans=0\nfor c in seq:\n\tif c=='(': \n\t\tnr+=1\n\telif nr>0:\n\t\tnr-=1\n\t\tans+=2\nprint(ans)", "s = input()\r\ncount_open = 0\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] == '(':\r\n count_open += 1\r\n elif count_open != 0:\r\n count += 2\r\n count_open -= 1\r\nprint(count)", "s=input() ; c=0\r\narr=[]\r\nfor i in s:\r\n if i=='(':arr.append(i)\r\n else:\r\n if arr:c+=2 ;arr.pop()\r\nprint(c)", "l=list(input())\r\nans=0\r\nstack=[]\r\nfor item in l:\r\n if item=='(':\r\n stack.append(1)\r\n else:\r\n if len(stack):\r\n stack.pop()\r\n ans+=1\r\n\r\nprint(2*ans)", "y = str(input())\r\nstack = []\r\ns = 0\r\nfor char in y:\r\n if char == '(':\r\n stack.append(char)\r\n elif char == ')' and len(stack) > 0:\r\n stack.pop()\r\n s += 2\r\nprint(s)\r\n", "a,b=0,0\r\nfor i in input():\r\n if i=='(':\r\n a+=1\r\n elif a>0 and i==')':\r\n a-=1\r\n b+=1\r\nprint(2*b)", "def main():\r\n s = list(input())\r\n ls = len(s)\r\n some_list = []\r\n count_pairs = 0\r\n for i in range(ls):\r\n some_list.append(s[i])\r\n if len(some_list) >= 2 and some_list[-2] == '(' and some_list[-1] == ')':\r\n some_list.pop(-2)\r\n some_list.pop(-1)\r\n count_pairs += 2\r\n print(count_pairs)\r\n\r\n\r\nmain()", "S=input()\r\n\r\nnow=0\r\nANS=0\r\n\r\nfor i in range(len(S)):\r\n if S[i]==\"(\":\r\n now=max(now,i)\r\n while now<len(S) and S[now]!=\")\":\r\n now+=1\r\n if now<len(S) and S[now]==\")\":\r\n ANS+=1\r\n now+=1\r\n\r\nprint(ANS*2)\r\n", "s = input()\nstk = []\nc = 0\nfor i in range(len(s)):\n\tif(s[i] == \"(\"):\n\t\tstk.append(s[i])\n\tif(s[i] == \")\"):\n\t\tif(len(stk) != 0):\n\t\t\tc += 2\n\t\t\tstk.pop()\nprint(c)\n \t\t\t \t \t\t\t\t\t \t\t\t\t\t\t \t", "ain = input()\r\nn = len(ain)\r\na = [-1] * (n+1)\r\n\r\nbadplace = -1\r\ncounter = 0\r\ncnt = 0\r\nans = 0\r\nfor i in range(0, n):\r\n\tif ain[i] is '(':\r\n\t\tcounter += 1\r\n\telse:\r\n\t\tif counter > 0:\r\n\t\t\tcounter -= 1\r\n\t\telse:\r\n\t\t\tcnt += 1\r\n\r\nprint(n-cnt-counter)", "brackets = []\ncount = 0\n\nfor c in input():\n if c == '(':\n brackets.append(c)\n else:\n if not brackets:\n continue\n \n count += 2\n brackets.pop()\n\nprint(count)", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\n\r\ns = input()\r\nstack = []\r\nans = 0\r\nfor i in s:\r\n if i == '(':\r\n stack.append(i)\r\n elif i == ')' and stack:\r\n stack.pop()\r\n else:\r\n ans += 1\r\nprint(len(s) - (ans+len(stack)))\r\n ", "c = input()\r\nstack = []\r\ncount =0\r\nfor i in c:\r\n\tif i == '(':\r\n\t\tstack.append(i)\r\n\telif i == ')':\r\n\t\tif stack:\r\n\t\t\tstack.pop()\r\n\t\t\tcount+=2\r\n\t\telse:\r\n\t\t\tcontinue\r\nprint(count)", "def solve(s, n):\r\n stack = []\r\n cnt = 0\r\n for i in range(n):\r\n if s[i] == '(':\r\n stack.append(s[i])\r\n else:\r\n if len(stack) > 0:\r\n p = stack.pop()\r\n if p == '(':\r\n continue\r\n else:\r\n cnt +=1\r\n else:\r\n cnt += 1\r\n cnt += len(stack)\r\n return n - cnt\r\n\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nprint(solve(s, n))", "seq = input()\r\nstack = []\r\nfor i in seq:\r\n if i == \"(\":\r\n stack.append(i)\r\n elif i == \")\":\r\n if len(stack) > 0 and stack[-1] == \"(\":\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n\r\nprint(len(seq)-len(stack))", "for t in range(1):\r\n bracket=list(input())\r\n open=0\r\n ans=0\r\n for i in bracket:\r\n if i==\"(\":\r\n open+=1\r\n else:\r\n if open>0:\r\n open-=1\r\n ans+=1\r\n print(2*ans)", "\r\ns = input()\r\nl,r = 0,0\r\nfor i in s:\r\n if ( i=='(' ):\r\n l += 1\r\n else :\r\n if ( l-r>0 ):\r\n r += 1\r\nprint ( 2*r )\r\n", "def regular_bracket_sequence(brackets):\r\n wrong_open = []\r\n wrong_close = []\r\n for i in range(len(brackets)):\r\n if brackets[i] == \"(\":\r\n wrong_open.append(i)\r\n else:\r\n if len(wrong_open) > 0:\r\n wrong_open.pop()\r\n else:\r\n wrong_close.append(i)\r\n return(len(brackets) - len(wrong_open) - len(wrong_close))\r\n \r\nb = input()\r\nprint(regular_bracket_sequence(b))", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\na = input()\r\no,c = 0,0\r\nfor i in range(len(a)):\r\n if a[i] == '(':\r\n o += 1\r\n else:\r\n if o <= 0:\r\n continue\r\n else:\r\n o -= 1\r\n c += 1\r\nprint(c*2)", "def max_regular_length(s):\n opening_count = 0\n max_length = 0\n\n # Forward traversal to count opening brackets\n for c in s:\n if c == '(':\n opening_count += 1\n else:\n # If there are matching opening brackets, increase the max length\n if opening_count > 0:\n max_length += 2\n opening_count -= 1\n\n return max_length\n\ndef main():\n bracket_sequence = input().strip()\n max_length = max_regular_length(bracket_sequence)\n print(max_length)\n\nif __name__ == \"__main__\":\n main()\n\n\t \t \t\t\t \t\t\t\t \t \t \t\t\t \t \t \t\t", "x = input()\ng = 0\nli = []\nfor i in x:\n if i == '(':\n li.append(i)\n else:\n if len(li) == 0:\n continue\n else:\n li.pop()\n g += 1\nprint(g*2)\n\n\t \t \t \t\t \t \t\t\t\t \t\t\t\t\t\t\t \t", "import math\r\nimport sys\r\n#####sorting a dictionary by the values#####\r\ndef dict_sort(ans):\r\n ans=sorted(ans.items(),reverse=True,key=lambda kv:(kv[1]))\r\n#####Primes till Nth#####\r\ndef seive_primes(n):\r\n flag=[0]*(n+10)\r\n flag[1]=flag[0]=1\r\n i=2\r\n while i*i<=n+1:\r\n if flag[i]==0:\r\n j=i*i\r\n while j<=n+1:\r\n flag[j]=1\r\n j+=i\r\n i+=1\r\n return flag\r\n##### naive method for testing prime or not#####\r\ndef is_prime(n):\r\n if n==1:\r\n return 0\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n#####greatest common divisor of two numbers#####\r\ndef gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\n#####least common multiplyer of two numbers#####\r\ndef lcm(a,b):\r\n return (a*b)//gcd(a,b)\r\n#####function that return all the letters#####\r\ndef alphbates():\r\n return \"abcdefghijklmnopqrstuvwxyz\"\r\n#####taking an array/list as input#####\r\ndef inp():\r\n ls=list(map(int,input().split()))\r\n return ls\r\n#####taking multiple inputs#####\r\ndef mult_inp():\r\n return map(int,input().split())\r\n#####Main function starts from here#####\r\ns=input()\r\nans=\"\"\r\nls=[]\r\nfor i in s:\r\n if i=='(':\r\n ls.append(\"(\")\r\n else:\r\n if len(ls)>0:\r\n ans+=ls.pop()+\")\"\r\nprint(len(ans))", "c,t=0,0\r\nfor i in input():\r\n if i=='(':c+=1\r\n elif c>0:c-=1;t+=2\r\nprint(t)", "str = input()\r\nx = 0\r\nans = 0\r\nfor i in str:\r\n if i == '(':\r\n x += 1\r\n ans += 1\r\n elif x > 0:\r\n x-=1\r\n ans += 1\r\nprint(ans - x)", "s = input()\r\nx = s\r\ns=s.lstrip(')')\r\ns=s.rstrip('(')\r\nr,l = 0,0\r\ncnt = 0\r\nfor i in range(len(s)):\r\n if r and s[i]==\")\":\r\n cnt+=1\r\n r-=1\r\n elif s[i]=='(':\r\n r+=1\r\nprint(cnt*2)\r\n", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/2/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\ns = input()\n\nc = 0\nans = 0\nfor i, v in enumerate(s):\n if v == '(':\n c += 1\n else:\n c -= 1\n if c >= 0:\n ans += 1\n else:\n c = 0\n\nprint(ans * 2)", "import sys\r\ns=sys.stdin.readline().split()[0]\r\nans=0\r\nr=0\r\nfor i in range(len(s)):\r\n if(s[i]=='('):\r\n ans+=1\r\n r+=1\r\n else:\r\n if(r>0):\r\n ans+=1\r\n r-=1\r\nprint(ans-r)\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\ns = input().rstrip()\r\nstack = 0\r\nans = 0\r\n\r\nfor c in s:\r\n if c == '(':\r\n stack += 1\r\n else:\r\n if stack:\r\n ans += 2\r\n stack -= 1\r\n\r\nprint(ans)\r\n", "s = input()\r\nans, cnt = len(s), 0\r\nfor i, c in enumerate(s):\r\n if c == '(':\r\n cnt += 1\r\n else:\r\n if cnt > 0:\r\n cnt -= 1\r\n else:\r\n ans -= 1\r\nprint(ans - cnt)", "def maxi(sequence):\r\n stack = []\r\n cp= 0\r\n for bracket in sequence:\r\n if bracket == '(':\r\n stack.append(bracket)\r\n elif bracket == ')' and stack:\r\n stack.pop()\r\n cp += 2\r\n return cp\r\nsequence = input()\r\nresult = maxi(sequence)\r\nprint( result) ", "'''\r\nhttps://codeforces.com/problemset/problem/26/B\r\nComment\r\n'''\r\nimport sys\r\nimport queue\r\n\r\ndef FILE_IO():\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n'''____________________________________________________________________________________________'''\r\n\r\n#_____main_____\r\n#FILE_IO()\r\n\r\nseq = list(input())\r\ncnt = res = 0\r\n\r\nfor ch in seq:\r\n if ch == '(':\r\n cnt += 1\r\n else:\r\n if cnt:\r\n res += 2\r\n cnt -= 1\r\n\r\nprint(res)\r\n", "'''\r\n ___ ___ ___ ___ ___ ___\r\n /\\__\\ /\\ \\ _____ /\\ \\ /\\ \\ /\\ \\ /\\__\\\r\n /:/ _/_ \\:\\ \\ /::\\ \\ \\:\\ \\ ___ /::\\ \\ |::\\ \\ ___ /:/ _/_\r\n /:/ /\\ \\ \\:\\ \\ /:/\\:\\ \\ \\:\\ \\ /\\__\\ /:/\\:\\__\\ |:|:\\ \\ /\\__\\ /:/ /\\ \\\r\n /:/ /::\\ \\ ___ \\:\\ \\ /:/ \\:\\__\\ ___ /::\\ \\ /:/__/ /:/ /:/ / __|:|\\:\\ \\ /:/ / /:/ /::\\ \\\r\n /:/_/:/\\:\\__\\ /\\ \\ \\:\\__\\ /:/__/ \\:|__| /\\ /:/\\:\\__\\ /::\\ \\ /:/_/:/__/___ /::::|_\\:\\__\\ /:/__/ /:/_/:/\\:\\__\\\r\n \\:\\/:/ /:/ / \\:\\ \\ /:/ / \\:\\ \\ /:/ / \\:\\/:/ \\/__/ \\/\\:\\ \\__ \\:\\/:::::/ / \\:\\~~\\ \\/__/ /::\\ \\ \\:\\/:/ /:/ /\r\n \\::/ /:/ / \\:\\ /:/ / \\:\\ /:/ / \\::/__/ ~~\\:\\/\\__\\ \\::/~~/~~~~ \\:\\ \\ /:/\\:\\ \\ \\::/ /:/ /\r\n \\/_/:/ / \\:\\/:/ / \\:\\/:/ / \\:\\ \\ \\::/ / \\:\\~~\\ \\:\\ \\ \\/__\\:\\ \\ \\/_/:/ /\r\n /:/ / \\::/ / \\::/ / \\:\\__\\ /:/ / \\:\\__\\ \\:\\__\\ \\:\\__\\ /:/ /\r\n \\/__/ \\/__/ \\/__/ \\/__/ \\/__/ \\/__/ \\/__/ \\/__/ \\/__/\r\n\r\n'''\r\n\"\"\"\r\n░░██▄░░░░░░░░░░░▄██\r\n░▄▀░█▄░░░░░░░░▄█░░█░\r\n░█░▄░█▄░░░░░░▄█░▄░█░\r\n░█░██████████████▄█░\r\n░█████▀▀████▀▀█████░\r\n▄█▀█▀░░░████░░░▀▀███\r\n██░░▀████▀▀████▀░░██\r\n██░░░░█▀░░░░▀█░░░░██\r\n███▄░░░░░░░░░░░░▄███\r\n░▀███▄░░████░░▄███▀░\r\n░░░▀██▄░▀██▀░▄██▀░░░\r\n░░░░░░▀██████▀░░░░░░\r\n░░░░░░░░░░░░░░░░░░░░\r\n\"\"\"\r\nimport sys\r\nimport math\r\nimport collections\r\nimport operator as op\r\nfrom collections import deque\r\nfrom math import gcd, inf, sqrt, pi, cos, sin, ceil, log2, floor, log\r\nfrom bisect import bisect_right, bisect_left, bisect\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nfrom functools import reduce\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nsetrecursionlimit(2**20)\r\n\r\n\r\ndef ncr(n, r):\r\n r = min(r, n - r)\r\n numer = reduce(op.mul, range(n, n - r, -1), 1)\r\n denom = reduce(op.mul, range(1, r + 1), 1)\r\n return numer // denom # or / in Python 2\r\n\r\n\r\ndef prime_factors(n):\r\n i = 2\r\n factors = []\r\n while i * i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.append(i)\r\n if n > 1:\r\n factors.append(n)\r\n return (list(factors))\r\n\r\n\r\ndef isPowerOfTwo(x):\r\n return (x and (not(x & (x - 1))))\r\n\r\nMOD = 1000000007\r\nPMOD = 998244353\r\nN = 10**6\r\nLOGN = 30\r\nalp = 'abcdefghijklmnopqrstuvwxyz'\r\nT = 1\r\n# T = int(stdin.readline())\r\nfor _ in range(T):\r\n # n, k = list(map(int, stdin.readline().rstrip().split()))\r\n # n = int(stdin.readline())\r\n # a = list(map(int, stdin.readline().rstrip().split()))\r\n # b = list(map(int, stdin.readline().rstrip().split()))\r\n s = list(stdin.readline().strip('\\n'))\r\n # b = list(stdin.readline().strip('\\n'))\r\n # m = int(stdin.readline())\r\n # c = list(map(int, stdin.readline().rstrip().split()))\r\n ans = 0\r\n st = []\r\n for i in s:\r\n if len(st) == 0:\r\n st.append(i)\r\n else:\r\n if st[-1] == '(' and i == ')':\r\n st.pop(-1)\r\n else:\r\n st.append(i)\r\n print(len(s) - len(st))\r\n", "string = input()\r\nstack = ['#']\r\ncounter = 0\r\n\r\nfor i in range(0, string.__len__()):\r\n if string[i]=='(':\r\n stack.append('(')\r\n elif string[i]==')' and stack[-1]=='(':\r\n stack.pop()\r\n else:\r\n counter+=1\r\n\r\nprint(string.__len__() - (counter+stack.__len__()-1))\r\n", "# LUOGU_RID: 132402501\ns = input()\nans = 0\nst = 0\nfor c in s:\n if c == '(':\n st += 1\n else:\n if st:\n st -= 1\n ans += 1\nprint(ans * 2)", "# Wadea #\r\n\r\nw = input()\r\nr = 0\r\nl = 0\r\nfor j in w:\r\n if j == \")\" and r > l:\r\n l +=1\r\n elif j == \"(\":\r\n r += 1\r\nprint(min(l,r)*2)", "stack=[]\r\n\r\nstring=input()\r\ncnt=0;\r\n\r\nfor it in string:\r\n if(it == \")\" and len(stack)>=1 and stack[-1] == \"(\"):\r\n stack.pop();cnt+=2\r\n else:\r\n stack.append(it)\r\n\r\nprint(cnt)", "def is_matched(expr):\r\n counter = 0\r\n lefty = '('\r\n righty = ')'\r\n S =[]\r\n\r\n for c in expr:\r\n if c in lefty:\r\n S.append(c)\r\n elif c in righty:\r\n if len(S)==0:\r\n continue\r\n if righty.index(c) == lefty.index(S.pop()):\r\n counter += 1\r\n\r\n if counter <= 0:\r\n return 0\r\n return counter * 2\r\n\r\n\r\nprint(is_matched(input()))", "s = input().strip()\r\nstack = []\r\ncount = 0\r\nfor ch in s:\r\n if ch == '(':\r\n stack.append(ch)\r\n elif stack:\r\n stack.pop()\r\n count += 1\r\nmax_length = count * 2\r\nprint(max_length)", "\r\n\r\nb = input() \r\n\r\ni = 0\r\nN = 0\r\nx = 0\r\n\r\nwhile(i < len(b)):\r\n if(b[i] == '('):\r\n x = x + 1\r\n else:\r\n x = x - 1\r\n if(x >= 0):\r\n N = N + 2\r\n else:\r\n x = 0\r\n# print(b[i],x,N) \r\n# input()\r\n i = i + 1\r\n\r\n \r\nprint(N)\r\n", "n=input()\r\nlong_var=len(n)\r\nlong_fixe=long_var\r\ncomp=0\r\ni=0\r\nfor i in range(long_fixe):\r\n if n[i]==\"(\":\r\n comp+=1\r\n else:\r\n comp-=1\r\n if comp<0:\r\n comp=0\r\n long_var-=1\r\nprint(long_var-comp)\r\n", "p,r = 0,0\r\nfor c in input():\r\n if c=='(': p += 1\r\n elif p: r += 2; p -= 1\r\nprint(r)", "ch=input()\r\np=0\r\nt=0\r\nfor i in range(len(ch)):\r\n if ch[i]==\"(\":\r\n p+=1\r\n if p>t and ch[i]==\")\" :\r\n t+=1\r\nprint(2*min(t,p))\r\n", "from fractions import Fraction\nimport sys\nsys.setrecursionlimit(1000*100)\n#c=int(input())\n#a,b=tuple(map(int,input().split()))\n#edges=dict((i,[]) for i in range(1,c+1))\n#children=filter(lambda x: x != p, edges[r])\n#cs.sort(key=lambda x:Fraction(x[0],x[1]),reverse=True)\n#if dp[r] is not None:\n\ns=input()\nb=0\nret=len(s)\n#print(ret)\nfor c in s:\n if c=='(':\n b+=1\n else:\n b-=1\n if b<0:\n b=0\n ret-=1\n\nret-=b\nprint(ret)\n\n\n", "x=str(input())\r\ny=0\r\nz=0\r\nfor i in range(len(x)):\r\n if x[i] == \"(\":\r\n y+=1\r\n elif y!=0:\r\n y-=1\r\n z+=2\r\nprint(z) ", "from collections import Counter\nimport math\n\n\ndef T(): return int(input())\ndef S(): return str(input())\ndef A(): return list(map(int, input().split(\" \")))\ndef M(): return map(int, input().split(\" \"))\n\ndef gcd(a, b):\n if (a == 0):\n return b\n if (b == 0):\n return a\n if (a == b):\n return a\n if (a > b):\n return gcd(a-b, b)\n return gcd(a, b-a)\n\ndef binarySearch(n, a):\n l = 0\n h = len(a)-1\n ans = 0\n while l <= h:\n mid = (l+h)//2\n if a[mid] == n:\n return 1\n elif a[mid] > n:\n h = mid - 1\n else:\n l = mid + 1\n return ans\n\ndef sumOfDigits(n):\n n = str(n)\n su = 0\n for i in n:\n su += int(i)\n return su\n\ndef lofint(n): return math.floor(math.log10(n))+1\n\ndef sumNat(n): return (n*(n+1))//2\n\ns = S()\nstack = []\nk = \"\"\nfor i in range(len(s)):\n if s[i] == \"(\":\n stack.append(s[i])\n else:\n if stack:\n k+=stack.pop()\n k+=s[i]\nprint(len(k))\n ", "brackets = input()\r\n\r\nob = 0\r\ncb = 0\r\n\r\nfor b in brackets:\r\n if b == \"(\":\r\n ob += 1\r\n elif b == \")\" and ob > cb:\r\n cb += 1\r\n \r\nprint(cb * 2)", "txt=input()\nopened=0\nclosed=0\nfor c in txt:\n if c=='(': opened+=1\n if c==')' and opened>0:\n opened-=1\n closed+=1\nprint(closed*2)\n \t \t\t\t \t\t \t\t \t \t\t", "from collections import *\r\n# from math import ceil, gcd,inf\r\nfrom functools import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\n\r\nss=input()\r\nstack=[];ans=0\r\nfor i in ss:\r\n if i=='(':stack.append(i)\r\n else:\r\n if stack:stack.pop();ans+=2\r\nprint(ans) \r\n \r\n ", "s = input()\nn = len(s)\n\nopen = 0\nclose = 0\ntotal = 0\nfor c in s:\n\tif c == '(':\n\t\topen += 1\n\telse:\n\t\tif open > 0:\n\t\t\topen -= 1\n\t\t\tclose += 1\nprint(close*2)\n\t\n\t\t \t \t \t\t\t\t\t \t \t \t \t\t", "bracket = input();cnt = total = 0\r\nfor i in bracket:\r\n if i=='(':\r\n cnt+=1\r\n elif cnt>0:\r\n cnt-=1\r\n total+=2\r\nprint(total)", "# author: violist\r\n# created: 28.04.2021 14:27:42\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nstack = 0\r\nans = 0\r\nfor c in s:\r\n if c == \"(\":\r\n stack += 1\r\n else:\r\n if stack:\r\n stack -= 1\r\n ans += 2\r\nprint(ans) ", "A = input()\r\ns=0\r\nx=0\r\nfor k in A:\r\n if(k==\"(\"):\r\n s+=1\r\n elif(k==\")\"):\r\n if(s==0):\r\n x+=1\r\n else:\r\n s-=1\r\nprint(len(A)-x-s)", "import re\r\nct = 0\r\ntotal = 0\r\ny = input().strip()\r\nh = \" \".join(y)\r\nc = re.split(r\"\\s+\", h)\r\nfor i in c:\r\n if i == '(':\r\n ct += 1\r\n elif i == ')' and ct != 0:\r\n ct -= 1\r\n total += 2\r\nprint(total)", "s=input()\r\nstack=[]\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]=='(':\r\n stack.append('(')\r\n else:\r\n if stack==[]:\r\n stack.append(s[i])\r\n if stack[-1]=='(':\r\n stack.pop()\r\n c+=2\r\nprint(c)\r\n \r\n \r\n", "s=input()\r\nl=[]\r\nans=0\r\nfor i in range(0,len(s)):\r\n if(s[i]=='('):\r\n l.append('(')\r\n if(s[i]==')' and len(l)!=0):\r\n l.pop()\r\n ans+=2\r\nprint(ans)\r\n\r\n\r\n \r\n", "a = str(input())\r\nstack = []\r\nresult = 0\r\nfor x in a:\r\n if x == '(':\r\n stack.append(1)\r\n else:\r\n if len(stack) > 0:\r\n stack.pop(-1)\r\n result += 2\r\nprint(result)", "s = input() \r\nopen = 0 \r\n\r\nres = 0\r\nfor c in s:\r\n\tif c == ')':\r\n\t\tif open > 0:\r\n\t\t\tres += 1\r\n\t\t\topen -= 1 \r\n\telse:\r\n\t\topen += 1\r\n\t\t\r\nprint(res * 2)", "s = input()\r\nstack = 0\r\nans = 0\r\nfor i in s:\r\n if i == '(':\r\n stack += 1\r\n else:\r\n if stack == 0:\r\n ans += 1\r\n else:\r\n stack -= 1\r\n \r\nprint(len(s)-ans-stack)", "ans = cnt = 0\r\nfor c in input():\r\n if c == '(':\r\n cnt += 1\r\n elif(c == ')'):\r\n if cnt > 0:\r\n cnt -= 1\r\n ans += 2\r\n\r\nprint(ans)\r\n", "a = input()\n\nl = 0\nr = 0\n\nfor i in a:\n if i == '(':\n l += 1\n\n if i == ')' and l > r:\n r += 1\n\nprint(r*2)\n", "import sys\ninput = sys.stdin.readline\n \ns = input().strip()\nstack = []\nans = 0\nfor c in s:\n if c == '(':\n stack.append(c)\n else: # c == ')'\n if not stack:\n continue\n stack.pop()\n ans += 2\nsys.stdout.write(str(ans) + '\\n')", "\"\"\"\ns = list(input())\n\nwhile (s[0] == ')' or s[-1] == '(') and len(s) != 1:\n if s[0] == ')':\n del s[0]\n if s[-1] == '(':\n s.pop()\n\nop = s.count('(')\ncl = s.count(')')\n\nwhile cl != op:\n if op > cl:\n i = s.index('(')\n del s[i]\n elif cl > op:\n i = s.index(')')\n del s[i]\n op = s.count('(')\n cl = s.count(')')\n\nprint(len(s))\n\"\"\"\n\nstack = []\nc = 0\ns = input()\n\nfor i in range(len(s)):\n if s[i] == '(':\n stack.append('(')\n else:\n if len(stack):\n stack.pop()\n else:\n c += 1\n\nc += len(stack)\n\nprint(len(s) - c)", "s=input()\r\nstack=[]\r\nres=0\r\nfor i in s:\r\n if i=='(':\r\n stack.append(i)\r\n else:\r\n if stack:\r\n p=stack.pop()\r\n res+=2\r\nprint(res)", "b = []\ns = 0\nfor i in input():\n if i == \"(\":\n b.append(i)\n else:\n if i == \")\" and len(b) > 0:\n b.pop(len(b) - 1)\n s += 2\n\nprint(s)\n\t\t \t \t \t \t\t \t\t\t \t\t", "seq = input()\r\n\r\nob = 0\r\ncb = 0\r\nnc = 0\r\n\r\nfor i in range(len(seq)):\r\n if seq[i] == ')':\r\n if ob > 0:\r\n ob -= 1\r\n else:\r\n nc += 1\r\n\r\n elif seq[i] == '(':\r\n ob += 1\r\n\r\nnc += ob\r\n\r\nprint(len(seq)-nc)\r\n", "s=list()\r\nch=input()\r\nr=0\r\nfor x in range(len(ch)):\r\n if(ch[x] == '('):\r\n s.append(\"(\")\r\n else:\r\n if s:\r\n s.pop()\r\n r=r+1\r\n\r\n\r\nprint(r*2)\r\n", "y = str(input())\nstack = []\ns = 0\nfor char in y:\n if char == '(':\n stack.append(char)\n elif char == ')' and len(stack) > 0:\n stack.pop()\n s += 2\nprint(s)\n\n \t\t \t\t\t \t\t \t\t\t\t \t \t \t\t\t \t", "brackets = input()\r\ndelete = 0\r\nopen_brackets = 0\r\nfor c in brackets:\r\n if c == '(':\r\n open_brackets += 1\r\n else:\r\n if open_brackets > 0:\r\n open_brackets -= 1\r\n else:\r\n delete += 1\r\nprint(len(brackets) - (delete + open_brackets))\r\n", "# coding: utf-8\r\ns = input()\r\ncnt, ans = 0, 0\r\nfor i in s:\r\n if i == '(':\r\n cnt += 1\r\n else:\r\n if cnt:\r\n ans += 2\r\n cnt -= 1\r\nprint(ans)\r\n", "lines=input()\ncount=0\nhere=0\nfor i in range(0,len(lines)):\n if lines[i]==\"(\":\n here+=1\n if here>=1 and lines[i]==\")\":\n here-=1\n count+=2\nprint(count) \n\t \t\t\t \t \t \t\t \t\t\t\t\t\t\t\t\t\t", "s = input()\nst = []\nans = 0\nfor c in s:\n if c=='(':\n st.append(c)\n elif st:\n st.pop()\n ans+=2\nprint(ans) \n ", "c=0\r\np=0\r\nk=list(input())\r\nfor i in range(len(k)-1,-1,-1):\r\n if k[i]==\"(\" and c==0:\r\n k.pop(i)\r\n elif k[i]==\")\" :\r\n c+=1\r\n k.pop(i)\r\n else:\r\n c-=1\r\n p+=2\r\n k.pop(i)\r\n \r\nprint(p)", "s=input()\r\nO=0\r\nZ=0\r\nfor i in s:\r\n if i=='(':\r\n O+=1\r\n if i==')':\r\n if O-Z>0:\r\n Z+=1\r\nprint(2*Z)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na, b = 0, 0\r\nfor i in input().strip():\r\n if i == \"(\":\r\n a += 1\r\n elif a > 0:\r\n a -= 1; b += 2\r\nprint(b)", "# LUOGU_RID: 133249708\ndef max_regular_length(seq):\r\n stack = [] \r\n count = 0 \r\n for c in seq:\r\n if c == '(':\r\n stack.append(c)\r\n elif c == ')':\r\n if stack:\r\n stack.pop()\r\n count += 1\r\n return count * 2\r\ns=input()\r\nprint(max_regular_length(s)) ", "def main():\r\n seq = input()\r\n\r\n stack, remove = 0, 0\r\n for bracket in seq:\r\n if bracket == '(':\r\n stack += 1\r\n else:\r\n stack -= 1\r\n if stack < 0:\r\n remove += 1\r\n stack = 0\r\n\r\n print(len(seq) - remove - stack)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x,y = 0,0\r\nfor i in input():\r\n if i == \"(\":\r\n x+=1\r\n elif x>0:\r\n x-=1\r\n y+=2\r\nprint(y) ", "s=input()\r\nc=0\r\na=0\r\nfor i in s:\r\n if i==\"(\":\r\n c+=1\r\n else:\r\n if c>=1:\r\n a+=2\r\n c-=1\r\nprint(a)\r\n", "s=input()\r\n# print(s)\r\non = len(s)\r\nl=[]\r\nc=0\r\nfor i in s:\r\n if i =='(':\r\n l.append('(')\r\n else:\r\n if len(l)==0:\r\n continue\r\n else:\r\n l.pop()\r\n c+=2\r\nprint(c)\r\n", "line = list(input())\r\nopening = 0\r\nsize = 0\r\nfor char in line:\r\n\tif char == \"(\":\r\n\t\topening +=1\r\n\telse:\r\n\t\tif opening>=1:\r\n\t\t\tsize +=2\r\n\t\t\topening -=1\r\n\r\nprint(size)\r\n\r\n", "string = input(\"\")\n\nn = len(string)\ncounter = 0\nfor i in string:\n if i == '(':\n counter += 1\n else:\n counter -= 1\n if counter < 0:\n n -= 1\n counter = 0\nprint(n - counter)\n", "s = input()\r\nstack = []\r\nresult = 0\r\n\r\nfor c in s:\r\n if c == '(':\r\n stack.append(c)\r\n else:\r\n if stack and stack[-1] == '(':\r\n stack.pop()\r\n result += 2\r\n \r\nprint(result)\r\n", "def main():\r\n s=input()\r\n o=0\r\n ans=0\r\n for ch in s:\r\n if ch=='(':\r\n o+=1\r\n if o>0 and ch==')':\r\n ans+=2\r\n o-=1\r\n print(ans)\r\nmain()", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, sqrt, gcd, log2\r\nfrom math import lcm, comb\r\n# from sortedcontainers import SortedList\r\nfrom copy import deepcopy\r\nimport heapq\r\nimport random\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\nrd = random.randint(10**9, 10**10)\r\n\r\ndef main():\r\n s = input()\r\n left = 0\r\n right = 0\r\n for c in s:\r\n if c == \"(\":\r\n left += 1\r\n elif c == \")\":\r\n if left > right:\r\n right += 1\r\n print(right * 2)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import deque\r\ns = deque(input()); q = deque(); ans = 0\r\nwhile s:\r\n if s[0] == '(' : q.append(s.popleft())\r\n elif q : s.popleft(); q.popleft(); ans += 2\r\n else :s.popleft()\r\nprint(ans) \r\n \r\n", "l = list(input())\r\nx = []\r\noutput =0\r\nfor i in l :\r\n if len(x) > 0 : \r\n if x[-1] == '(' and i == ')' :\r\n x.pop() \r\n output += 2\r\n else:\r\n x.append(i)\r\n else : \r\n x.append(i)\r\nprint(output)\r\n", "n = input()\r\nstack = []\r\ncount = 0\r\nfor i in n :\r\n \r\n \r\n if (i == \"(\"):\r\n stack.append(i)\r\n elif (i == \")\"):\r\n if (len(stack)>0):\r\n stack.pop()\r\n count+=2\r\n else:\r\n continue\r\nprint(count)", "total = count = 0\ns = input()\nfor i in s:\n if i == \"(\":\n count += 1\n else:\n if count != 0:\n count = count - 1\n total += 2\nprint(total)\n\n \t \t\t \t\t\t\t\t\t\t \t\t\t\t \t \t\t \t", "s = input()\r\n\r\nstack = []\r\n\r\nfor ch in s:\r\n if stack and ch == \")\" and stack[-1] == '(':\r\n stack.pop()\r\n continue\r\n\r\n else:\r\n stack.append(ch)\r\n\r\nprint(len(s) -len(stack))\r\n", "n = input()\r\nr,t = 0,0\r\nfor i,x in enumerate(n):\r\n if x=='(':\r\n r+=1\r\n if x==')':\r\n if r==0:\r\n t+=1\r\n else:\r\n r-=1\r\nprint(len(n)-r-t)\r\n", "x=input()\r\nr , c = 0 , 0\r\nfor i in x:\r\n if i == '(':\r\n r += 1\r\n elif i==')' and r > 0 :\r\n r -= 1\r\n c += 2\r\nprint(c)", "n = input()\r\na = []\r\nres = 0\r\n\r\nfor i in n:\r\n if (i == '('):\r\n a.append(i)\r\n else:\r\n if (len(a) and a[-1] == '('):\r\n res += 2\r\n a.pop()\r\n else:\r\n a.append(i)\r\n\r\nprint(res)\r\n", "s = input()\r\n\r\nst = []\r\n\r\nsiz = len(s)\r\nans = 0\r\n\r\nfor i in range(siz):\r\n if (s[i] == \"(\"):\r\n st.append(\"(\")\r\n elif s[i] == \")\":\r\n if (len(st) != 0):\r\n ans += 1\r\n st.pop()\r\nprint(ans * 2)\r\n", "import copy\r\nimport sys\r\nfrom itertools import accumulate\r\nfrom math import inf\r\n\r\n\r\n#from functools import cache\r\n\r\n\r\n#from math import comb\r\n# import math\r\n# from bisect import *\r\n# from collections import *\r\n# from functools import *\r\n# from heapq import *\r\n# from itertools import *\r\n# from random import *\r\n# from string import *\r\n# from types import GeneratorType\r\n\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\ndef infun(f):\r\n input = lambda: f.readline().rstrip()\r\n sint = lambda: int(input())\r\n mint = lambda: map(int, input().split())\r\n ints = lambda: list(map(int, input().split()))\r\n return input,sint,mint,ints\r\ninput=sint=mint=ints=0\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n#MOD = 998244353\r\n# MOD = 10 ** 9 + 7\r\n# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef solve() -> None:\r\n s=input()\r\n a=ans=0\r\n for c in s:\r\n if c=='(':a+=1\r\n elif a>0:\r\n a-=1\r\n ans+=2\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n fm=0#+1\r\n f = open(\"input.txt\", \"r\") if fm else sys.stdin;input,sint,mint,ints=infun(f);n = sint() if fm else 1;[solve() for i in range(n)]", "L=input()\r\nc1=0\r\nc2=0\r\nfor i in L:\r\n if i==\"(\":\r\n c1+=1\r\n else:\r\n if c1>0:\r\n c2+=2\r\n c1-=1\r\nprint(c2)", "a = list(input())\r\nans = 0\r\nstack = []\r\nfor x in a:\r\n if x == \"(\":\r\n stack.append(\"(\")\r\n else:\r\n if len(stack) == 0:\r\n pass\r\n else:\r\n stack.pop()\r\n ans += 1\r\nprint(ans*2)", "from sys import stdin\r\n\r\ndef solve(s):\r\n word = list(s)\r\n word.pop(len(word)-1)\r\n op = 0\r\n clo = 0\r\n sobr = 0\r\n flag = False\r\n for i in range(len(word)):\r\n if not flag:\r\n if word[i] == ')':\r\n sobr += 1\r\n else:\r\n flag = True\r\n op += 1\r\n else:\r\n if word[i] == '(':\r\n op += 1\r\n else : \r\n clo += 1\r\n if clo > op:\r\n sobr += 1\r\n if op == clo:\r\n flag = False\r\n op = 0\r\n clo = 0\r\n sobr += abs(op - clo)\r\n return len(word) - sobr\r\n\r\ndef main():\r\n string_ = stdin.readline()\r\n print(solve(string_))\r\n\r\nmain()\r\n ", "L=[]\r\nS=input()\r\nC=0\r\nfor i in range(len(S)):\r\n if S[i] == \"(\":\r\n L.append(\"(\")\r\n elif S[i] == \")\":\r\n if not L:\r\n continue\r\n else:\r\n L.pop()\r\n C+=1\r\nprint(C*2)\r\n", "s = input()\nx = len(s)\nc = 0\nfor i in range(x):\n if(s[i]=='('):\n c+=1\n elif(s[i]==')'):\n c-=1\n if(c<0):\n x-=1\n c = 0\nprint(x-c)\n \t\t \t\t\t \t \t \t\t\t \t \t\t \t\t \t\t", "s = input()\r\nl, r, a = 0, 0, 0\r\nfor c in s:\r\n if c == \"(\":\r\n r += 1\r\n elif r > 0:\r\n r -= 1\r\n a += 2\r\nprint(a)\r\n", "s = input()\r\nl = list(s)\r\npile = list()\r\nk = 0\r\nfor i in l:\r\n if i == '(':\r\n pile.append(i)\r\n elif i == ')':\r\n if (len(pile)!=0):\r\n k+=1\r\n pile.pop()\r\nprint(2*k)\r\n", "def max_regular_length(s):\n stack = []\n max_length = 0\n\n for char in s:\n if char == '(':\n stack.append(char)\n elif char == ')' and stack:\n stack.pop()\n max_length += 2\n\n return max_length\n\n# Input and Output\nbracket_sequence = input()\nresult = max_regular_length(bracket_sequence)\nprint(result)\n\n \t \t\t\t\t\t \t\t \t \t \t\t\t \t \t\t", "s = input()\r\nst = []\r\nfor i in s:\r\n if i == ')':\r\n if len(st) != 0 and st[-1] == '(':\r\n st.pop()\r\n else:\r\n st.append(')')\r\n else:\r\n st.append(i)\r\n\r\nprint(len(s) - len(st))", "x=input()\r\na=0\r\nb=0\r\nfor i in range (len(x)):\r\n if x[i]==\"(\":\r\n a=a+1\r\n if x[i]==\")\" and a!=0:\r\n b=b+1\r\n a=a-1\r\nprint(b*2)\r\n", "ch=input()\r\nl=len(ch)\r\na=0\r\ns=0\r\nfor i in range(l) :\r\n if ch[i] == \"(\" :\r\n s+=1\r\n a+=1\r\n else :\r\n if (s) :\r\n s-=1\r\n a+=1\r\na=a-s\r\nprint(a)\r\n", "s = input()\r\nl = []\r\nfor i in s :\r\n if(len(l) == 0):\r\n l.append(i)\r\n else:\r\n if l[-1] == '(' and i == ')':\r\n l.pop()\r\n else :\r\n l.append(i)\r\nprint(len(s)-len(l))", "lst = list(input())\r\nans = 0\r\nq = []\r\nfor i in range(len(lst)):\r\n if len(q) == 0:\r\n q.append(lst[i])\r\n elif q[len(q)-1] == '(' and lst[i] == ')':\r\n ans += 2\r\n q.pop()\r\n else:\r\n q.append(lst[i])\r\nprint(ans)", "c, t=0, 0\nfor i in input():\n if i=='(' :c+=1 \n elif c>0:c-=1;t+=2\nprint (t)\n\t \t\t \t \t\t \t \t\t \t \t \t", "class solve:\r\n def __init__(self):\r\n s=input()\r\n stack=[]\r\n ans=0\r\n for i in s:\r\n if i==\"(\":\r\n stack.append(\"(\")\r\n else:\r\n if stack:\r\n stack.pop()\r\n ans+=1\r\n print(ans*2)\r\n \r\nobj=solve()", "import sys\ninput = sys.stdin.readline\n\ns = input().strip()\n\nd = 0\nans = 0\nfor c in s:\n if c == \"(\":\n d += 1\n elif c == \")\":\n if d > 0:\n ans += 2\n d -= 1\n d = max(0, d)\n\nprint(ans)\n", "# cook your dish here\nimport sys\nif __name__ == \"__main__\":\n a = sys.stdin.readline().strip()\n ob = 0\n ans1 = 0\n for b in a:\n if b == '(':\n ob += 1\n elif b == ')':\n if ob > 0:\n ob -= 1\n ans1 += 2\n print(ans1)\n\t\t \t\t \t \t\t\t \t \t\t\t \t\t" ]

[ "n = int(input())\r\n\r\nif n % 2 != 0 or n < 6:\r\n print(0)\r\nelse:\r\n k = n // 2\r\n if n % 4 == 0:\r\n print(k//2-1)\r\n else:\r\n print(k//2)", "import math\n\nn = int(input())\n\nq = n/4\n\nprint(int(math.ceil(q) - 1) if n % 2 == 0 else 0)\n\t\t \t \t \t \t \t\t\t \t\t \t", "\r\ndef f(n):\r\n if n%2>0:\r\n return 0\r\n n = n//2\r\n return (n-1)//2\r\n\r\nn = int(input())\r\nprint(f(n))\r\n", "n=int(input()) \r\nif n%2==1: print(\"0\")\r\nelse:\r\n n=n//2\r\n if n%2==1: print((n//2))\r\n else:\r\n n=n//2\r\n print(n-1)\r\n ", "\r\nimport math\r\na = int(input())\r\nif(a % 2 == 0):\r\n\tk = math.ceil(a / 4)\r\n\tprint(k-1)\r\nelse:\r\n\tprint(0)", "x=int(input())\n\nif (x%2 == 0) :\n print((x//4)-(x%4==0))\nelse :\n print(0)\n ", "k = int(input())\r\nif k %2 == 1:\r\n k = 1\r\nn = int(k)//2\r\nprint(max(0,(n+1)//2-1))\r\n", "n = int(input())\r\n\r\nif n%2 != 0:\r\n print(0)\r\n\r\nelif n%4 != 0: \r\n print(n//4)\r\nelse:\r\n print(n//4 -1)", "n = int(input())\nif (n%2 != 0):\n print(\"0\")\nelif(n%4 ==0):\n print((n//4)-1)\nelse:\n print((n//4))\n \t \t \t \t\t \t\t \t \t \t\t\t\t", "n=int(input())\r\nif(n%2!=0):\r\n print(0)\r\nelse: \r\n q=n//4\r\n r=n%4\r\n if r==0:\r\n print(q-1)\r\n else:\r\n print(q)", "l = int(input())\r\n\r\nif l%2:\r\n print (0)\r\nelse:\r\n f = l//4\r\n r = l == f*4\r\n print (f-r)", "n = int(input())\r\nif n%2!=0:\r\n x = 0\r\nelif n==2:\r\n x=0\r\nelif n%4==0:\r\n x = int(n//4)-1\r\nelse:\r\n x = int(n//4)\r\nprint(x)", "n=int(input())\r\nif n%2!=0:\r\n print(0)\r\nelif n//4==n/4:\r\n print(n//4-1)\r\nelse:\r\n print(n//4)", "n = int(input())\r\nif n & 1:\r\n print(0)\r\nelse:\r\n n //= 2\r\n print((n-1)//2)", "def solve(n: int) -> int:\r\n if n % 2 == 1:\r\n return 0\r\n elif n % 4 == 0:\r\n return n // 4 - 1\r\n else:\r\n return n // 4\r\n \r\nprint(solve(int(input())))", "p = int(input())\r\nl_plus_b = p/2\r\nif p%2!=0:\r\n print(0)\r\nelse:\r\n if l_plus_b%2==0:\r\n print(int(((l_plus_b/2)-1)))\r\n else:\r\n print(int((((l_plus_b - 1)/2))))", "n = int(input())\nif n & 1:\n print(0)\nelse:\n print(n//4 if n % 4 else n // 4 - 1)\n", "n = int(input())\r\nif n % 2 == 1:\r\n print(0)\r\nelse:\r\n print(n//4 if n % 4 != 0 else n//4 - 1)\r\n", "n= int(input())\r\nif(n%2==0):\r\n n=int(n/2)\r\n if(n%2==0):\r\n n=int(n/2)\r\n n=n-1\r\n else:\r\n n=int(n/2)\r\n print(n)\r\nelse:\r\n print(0)\r\n\r\n", "n = int(input())\r\nif n < 4 or n % 2 == 1:\r\n print(0)\r\nelse:\r\n n = n // 2\r\n\r\n print(n//2 - int(n % 2 == 0))\r\n", "n = int(input())\r\nif(n%2==1):\r\n\tans = 0\r\nelse:\r\n\tl = n//2 # (x + y = 2*l)\r\n\tans = (l-1)//2\r\nprint(ans)", "#imgur.com/Pkt7iIf.png\r\n\r\n#n, m = map(int, input().split())\r\n#n = int(input())\r\n#d = list(map(int, input().split()))\r\n\r\nimport math\r\nn = int(input())\r\nprint(math.ceil(n/4)-1) if n%2 == 0 else print (0)\r\n", "'''\r\n##======================================================================================================================================##\r\n ## _____ _ _ _ _____ _ _ _ _ _____ _____ ____ ___ ____ ___ ##\r\n ## | / \\ | \\ / | | | | |\\ | | | | | | | | \\ | | | ##\r\n ## |_____ / \\ | \\/ | |_____ | | | \\ | | __ --- |_____ |____| | | | |___ |___| ##\r\n ## | / \\ | | | | | | \\ | | | | | | | | | | \\ ##\r\n ## _____| / \\ | | _____| \\ __ / | \\| |_____| _____| | | |___/ |____ | \\ ##\r\n##======================================================================================================================================##\r\n------------------------------Samsung_Spider------------------------------\r\n'''\r\nn = float(input())\r\nif n <= 4:\r\n print(\"0\")\r\nelif n % 2 != 0:\r\n print(\"0\")\r\nelse:\r\n n = ((n / 2) - 2) / 2\r\n if n % 1 == 0.5:\r\n n += 0.5\r\n print(int(n))", "a=int(input())\r\nprint((a//4-(int(a%4==0)*1))*int(a%2==0))", "import sys\n\ndef readnum():\n input = sys.stdin.readline\n a=list(map(int,input().split()))\n return a\n\ndef printf(val):\n sys.stdout.write(str(val) + '\\n')\n\nn = readnum()[0]\n\nif n % 2 != 0:\n print (0)\nelse:\n n = n // 2\n print (n//2 - 1 + n % 2)\n", "n = int(input())\r\nif n % 2:\r\n print(0)\r\n exit()\r\nprint(n // 4 - (n // 2 % 2 == 0))", "from math import ceil\nx = int(input())\nprint(0 if x % 2 else ceil(x / 4) - 1)", "n=int(input())\r\nif n%2!=0:\r\n print (0)\r\nelse:\r\n if n%4==0:\r\n print (int((n/4)-1))\r\n else:\r\n print (int(n//4))\r\n", "import sys\n\nn = int(sys.stdin.readline())\n\nif n % 2 != 0:\n print(0)\nelse:\n print((n - 1) // 4)\n\n \t \t\t \t \t\t\t \t \t\t \t \t\t \t \t\t", "# author: violist\n# created: 28.07.2021 17:51:08\n\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\nif (n & 1):\n print(0)\nelse:\n if (n % 4):\n print(n // 4)\n else:\n print(n // 4 - 1)\n", "x=int(input())\r\nprint((x%2==0)*((x//2-1)//2))\r\n#fueaijskrgd/t\r\n\r\n\r\n\r\n#if odd then 0\r\n#else n//2 bcz point will be reepeated becz of symmetricity \r\n#n//2 - 1 tpo avaoid squares\r\n#again divide by 2 to get 4 lengths to form square\r\n#diving 2 times by 2 so we 4vpairs of equal lengths\r\n#it is bcz point if n is even then point n//2 will be symmetric and if we divide it by 2\r\n#again we will get all 4 points equal\r\n", "n = int(input())\r\nif n%2!=0:\r\n\tprint(\"0\")\r\nelse:\r\n\tx = n//2\r\n\tif x%2==0:\r\n\t\tprint((x//2)-1)\r\n\telse:\r\n\t\tprint(x//2)", "n= int(input())\r\nif(n%2 != 0):\r\n print(0)\r\nelse:\r\n n=n-1;\r\n p=n/4\r\n print(int (p))", "f=lambda:map(int,input().split())\r\nn=int(input())\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n n//=2\r\n print([n//2-1,n//2][n%2!=0])\r\n", "n=int(input())\r\nif n%2!=0:print(0)\r\nelse:\r\n n=n//2\r\n if n%2==0:h=n//2\r\n else:h=n//2+1\r\n print(h-1)", "def main():\n n = int(input())\n print(0 if n & 1 else (n - 2 + (n & 2)) // 4)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nif n&1:\n print(0)\nelse:\n print(n//2-n//4-1)\n", "from sys import stdin,stdout\r\n# stdin.readline()\r\nfor _ in range(1):\r\n n=int(stdin.readline())\r\n if n%2!=0:\r\n print(0)\r\n continue\r\n \r\n print((n-1)//4)\r\n ", "a=int(input())\r\nprint((a//2-1)//2 if a%2==0 else 0)", "def pas(k):\r\n if k <= 4 or k%2 != 0:\r\n return 0\r\n k1 = k/2\r\n k2 = 0\r\n if k1%2 !=0:\r\n k2 = k1//2\r\n elif k1%2 == 0:\r\n k2 = (k1//2) -1\r\n return int(k2)\r\nk = int(input())\r\nprint(pas(k))", "n=int(input())\r\ni=1\r\nj=n//4\r\nc=0\r\nif(n%2!=0):\r\n c=0\r\nelse:\r\n if n%4==0:\r\n c=(n//4)-1\r\n else:\r\n c=n//4\r\nprint(c)\r\n ", "n = int(input())\n# NOT 4*x=n => x != n/4\n# 2*x + 2*x = n => x = n/2 - y => x = [1, n/2), due to symmetry x = [1, n/4)\nres = 0 if n & 1 == 1 else ((n + 3) // 4 - 1)\nprint(res)\n", "n = int(input())\nif n&1 == 1:\n\tprint(0)\nelif n&3 == 0:\n\tprint((n>>2)-1)\nelse:\n\tprint(n>>2)\n", "import math\r\n\r\nn = int(input())\r\n\r\nprint([math.ceil(n/4) - 1, 0][n % 2 != 0])\r\n", "n=int(input());print(0if(n&1)else(n//4)-(1^bool(n%4)))", "n=int(input())\r\ndef fn(n):\r\n if n%2!=0:return 0\r\n else:return (n//2-1)//2\r\nprint(fn(n))\r\n", "if __name__ == '__main__':\n n = int(input())\n\n if n % 2:\n print(0)\n else:\n print(n // 4 - int(not n % 4))\n", "length = int(input())\nif length&1:\n print(0)\nelse:\n limite = length//2\n print((limite-1)//2)\n\n", "from math import ceil as c\r\nn=int(input())\r\nprint(0 if n%2 else c((n-n//2)/2)-1)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nif N%2:\r\n exit(print(0))\r\n \r\nt = N//2\r\nans = t//2\r\nif t%2==0:\r\n ans-=1\r\nprint(ans)", "n=int(input())\r\np=n-((n*0.5)+1)\r\nif n%2==0:\r\n if p%2==0:print(int(p//2))\r\n elif p%2!=0:print(int(p-((p+1)//2)))\r\nelse:print(0)", "def pos(n: int) -> int:\n \n if n % 2 != 0:\n return 0\n\n maxSize = n/4\n\n if n % 4 != 0:\n return int(n/4)\n else:\n return int (n/4) - 1\n\nprint(pos(int(input())))\n \t \t\t \t\t \t \t\t \t \t\t\t \t\t", "# https://codeforces.com/problemset/problem/610/A\n\nn = int(input())\nif n&1:\n print(0)\nelse:\n half = n//2\n flag = 1 if half%2==0 else 0\n print(half//2 - flag)", "n=int(input())\r\nif n%2 :\r\n print(0)\r\nelse:\r\n print(n//4 if n%4 else n//4-1)", "n = int(input())\n\nif n % 2 != 0:\n print(0)\nelse:\n n2 = n // 4\n if n2 * 4 == n:\n n2 -= 1\n\n print(n2)\n", "def count_ways(n):\r\n if n % 2 != 0:\r\n return 0 # If n is odd, no way to represent as product of two distinct integers\r\n\r\n half = n // 2\r\n if half % 2 == 0:\r\n return half // 2 - 1\r\n else:\r\n return half // 2\r\n\r\n\r\nn = int(input())\r\nways = count_ways(n)\r\nprint(ways)\r\n", "import math\r\nn=int(input())\r\nif n<6 or n%2==1:\r\n print(0)\r\nelse:\r\n k=n//2\r\n if k%2==0:\r\n print(k//2-1)\r\n else: \r\n print(k//2) \r\n ", "n=int(input())\r\nres=n//4\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n if n%4==0:\r\n print(res-1)\r\n else:\r\n print(res)\r\n", "import itertools, math, functools, operator, collections, heapq, re, string\r\nfrom sys import stdin; inp = stdin.readline\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QIA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return list(input())\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ''.join(map(str, l))\r\n\r\ndef main():\r\n n = I()\r\n if n%2 or n < 6:\r\n return 0 \r\n half = n//2\r\n has_square = 1 if not n%4 else 0\r\n return (half//2)-1 if has_square else half//2\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n=int(input())\r\nif(n%2==1):\r\n print(0)\r\nelse:\r\n a=n//2\r\n if a%2==1:\r\n print((a-1)//2)\r\n else:\r\n print((a-2)//2)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\nif n % 2 > 0:\r\n print(0)\r\nelse:\r\n print(n // 4 - (n % 4 == 0))", "def main():\r\n # input\r\n n = int(input())\r\n\r\n # soln\r\n if n%2 != 0:\r\n print(0)\r\n return\r\n n = n//2\r\n if n%2 == 0:\r\n print(n//2-1)\r\n else:\r\n print(n//2)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\nn = int(input())\r\nif n % 2 == 0:\r\n\tm = math.ceil(n/4.0) - 1\r\n\tprint(m)\r\nelse:\r\n\tprint(0)", "n=int(input())\r\nprint(((n+3)//4-1)*(n%2==0))", "n = int( input() )\r\n\r\nif n%2 == 1:\r\n print(0)\r\n exit(0)\r\n \r\nsol = ((n//2)-1)//2\r\nprint(sol)\r\n", "n=int(input());s=set()\r\nif n%2==1:print(0)\r\nelif n%4==0:print(n//4-1)\r\nelse:print(n//4)\r\n", "def stickProb():\r\n stickSize=int(input())\r\n count=0\r\n duplicates=1\r\n if(stickSize>=12):\r\n duplicates=2\r\n if(stickSize%2!=0 or int(stickSize/2-2)<=0):\r\n print(0)\r\n else:\r\n if(stickSize/2-2)%2==0:\r\n print(int((stickSize/2-2)/2))\r\n else:\r\n print(int((stickSize/2-2)/2)+1)\r\n\r\n\r\nstickProb()\r\n", "from math import floor\n\nif __name__ == \"__main__\":\n l = int(input())\n \n if l % 2 != 0:\n print(0)\n elif l % 2 == 0 and l % 4 != 0:\n print(floor(l/4))\n else:\n print((int(l/4 - 1)))\n\t\t\t \t \t \t\t \t \t \t \t\t \t\t", "x = int(input())\r\nif x%2 == 1:\r\n print(0)\r\nelse:\r\n z = 0\r\n x //= 2\r\n if x%2 == 0:\r\n z = 1\r\n #print(x, z)\r\n x = x//2 - z\r\n print(x)\r\n", "n = int(input())\r\nc = 0\r\nif n %2 != 0:\r\n print(0)\r\n exit(0)\r\nif n%4 == 0:\r\n c-=1\r\nelse:\r\n c = 0\r\nprint(int((n/2)//2+c))\r\n ", "n = int(input())\r\nif n%2 == 0:\r\n if n%4 == 0:\r\n print(int(n/4-1))\r\n else:\r\n print(int((n-2)/4))\r\nelse:\r\n print(0)", "\"\"\"\r\nCases:\r\n6\r\n1 1 2 2 \r\n8\r\n1 1 3 3 \r\n1 2 2 3\r\n2 2 2 2 --\r\n10\r\n1 1 4 4 \r\n2 2 3 3 \r\n20\r\n1 1 9 9\r\n2 2 8 8\r\n3 3 7 7\r\n4 4 6 6 \r\n5 5 5 5 --\r\n\r\n\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\nif(n%2 == 0):\r\n print((n-2)//4)\r\nelse:\r\n print(0)", "n = int(input())\r\nprint(((n-4)//4 if (n//2)%2 == 0 else (n-2)//4) if n%2 == 0 else 0)", "n=int(input())\r\nif n%2==1:\r\n print(0)\r\n exit(0)\r\n\r\nn=n//2\r\nif n%2==0:\r\n n-=1\r\n\r\nprint(n//2)", "n = int(input())\r\nif n%2 != 0:\r\n\tprint('0')\r\nelse:\r\n\tans = int(((n/2)-1)//2)\r\n\tprint(ans)", "from math import ceil\r\n\r\nn = int(input())\r\n\r\nif n>=6 and n%2==0:\r\n print(ceil(n/4.0 - 1))\r\nelse:\r\n print(0)\r\n", "a = int(input())\nif (a < 6 or a % 2 == 1):\n print(\"0\")\nelse:\n if (a % 4 == 0):\n print((a//4) - 1)\n else:\n print((a-2)//4)\n\t \t\t \t\t \t\t\t \t\t \t\t\t\t \t", "entrada = int(input())\nif entrada % 2 != 0:\n print(0)\nelif entrada % 4 != 0:\n print(entrada//4)\nelse:\n print((entrada // 4) - 1)\n\n\n \t \t\t \t \t \t \t \t\t\t \t\t\t\t\t\t", "def count_rectangles(n):\r\n if n % 2 == 0:\r\n half = n // 2\r\n return (half - 1) // 2\r\n else:\r\n return 0\r\n\r\nn = int(input())\r\nresult = count_rectangles(n)\r\nprint(result)\r\n", "n = int(input())\r\nif n <= 4 or n%2 == 1:\r\n print (0)\r\nelse:\r\n print(n//4 - 1 + n//2%2)\r\n \r\n", "length = int(input())\r\nif length % 2:\r\n print(0)\r\nelse:\r\n quo = length / 2\r\n odd = quo % 2\r\n if odd == 0:\r\n print(int(quo // 2 -1))\r\n else:\r\n print(int(quo // 2))", "n = int(input())\r\nif n % 2:\r\n print(0)\r\n quit()\r\nif (n // 2) % 2:\r\n print(n//4)\r\nelse:\r\n print(n//4 - 1)", "# your code goes here\r\nn=int(input())\r\nif n%2==1:\r\n\tprint(0)\r\nelse:\r\n\tif (n//2)%2==1:\r\n\t\tprint(n//4)\r\n\telse:\r\n\t\tprint(n//4-1)", "'''\r\n shelby70\r\n'''\r\nn= int(input())\r\nif n%2: print(0)\r\nelse: print(n//4 if n%4 else n//4-1)\r\n", "a = int(input())\r\nx = a//4-1\r\nif a%4 == 1 or a%4 == 3:\r\n print(0)\r\nelif a%4==0:\r\n print(x)\r\nelse:\r\n print(x+1)\r\n", "n = int(input())-2\r\nif n%2 != 0:print(0)\r\nelse:no = n//4;print(no)", "n = int(input())\r\n\r\nif n % 2:\r\n print(0)\r\n\r\nelse:\r\n if n % 4:\r\n print(int(n / 4))\r\n else:\r\n print(int(n / 4) - 1)", "#!/usr/bin/env python3\nimport sys\n\nN = int(input())\n\ndef ans(N):\n if N % 2 == 1:\n return 0\n half = N/2\n\n if half % 2 == 0:\n return int(half / 2 - 1)\n if half % 2 == 1:\n return int((half - 1) / 2)\n\nprint(ans(N))", "n = int(input())\nif n%2==1:\n print(0)\nelse:\n ans = int(n/4)\n if ans*4 == n:\n ans -= 1\n print(ans)\n\n \t\t\t\t \t\t\t\t\t \t \t \t\t \t\t\t\t", "n = int(input())\n\nif n % 2 == 0:\n if n % 4 == 0:\n print(int((n/4 )-1))\n else:\n print(int(n/4))\nelse:\n print(0)\n\t \t\t \t\t \t\t\t \t\t\t\t \t \t\t\t\t \t\t\t\t", "# -*- coding: utf-8 -*-\r\n#George-\r\nn=int(input());\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n print((n-1)//4)", "\nn = int(input())\n\ndef even(x):\n if x%2 == 0:\n return True\n else:\n return False\nif even(n):\n print(int(((n/2)-1)/2))\nelse:\n print(0)\n# I have to fill this with something\n", "def stick(n):\n if n % 2 or n <= 4:\n return 0\n m = n//2\n return (m-1)//2\n\n\nif __name__ == '__main__':\n n = int(input())\n print(stick(n))\n", "x=int(input())\r\nif x%2!=0:\r\n print(0)\r\nelse:\r\n print((x//4)-(x%4==0))\r\n \r\n", "n = int(input())\n\n# Perimetro do retangulo não pode ser impar.\nif n % 2 != 0:\n print(0)\nelse:\n # Excluir a divisão de partes iguais pois será um quadrado.\n if n % 4 == 0:\n print(n // 4 - 1)\n # Caso ñ divida em partes iguais então ñ tem nem um quadrado.\n else:\n print(n // 4)", "import math\r\n\r\ndef solve():\r\n n= int(input())\r\n if n&1:\r\n print(0)\r\n return \r\n print(math.ceil((n/4)-1))\r\nsolve()", "n = int(input())\r\na = n//2 \r\nif ((n>5) and (n%2 ==0)):\r\n if a%2 == 0:\r\n print(int(a/2 - 1))\r\n else:\r\n print(int(a//2))\r\nelse:\r\n print(0)", "\n\nn = int(input())\n\nif n % 2 == 0:\n m = (n - 2) // 4\nelse:\n m = 0\n\nprint(m)\n\n\n", "# You lost the game.\nn = int(input())\nif n % 2:\n print(0)\nelse:\n e = n // 2 - 1\n print(e//2)\n", "l = int(input())\r\nif l%2==0:\r\n j=(l//2)-1\r\n k=(j//2)\r\n print(k)\r\nelse:\r\n print(0)\r\n\r\n", "import math\r\n\r\nn = int(input())\r\nif n%2==0:\r\n n = math.ceil(n//2/2)-1\r\nelse:\r\n n=0\r\nprint(n)", "# https://vjudge.net/contest/505445#problem/C\n\nfrom math import ceil\n\nn = int(input())\n\nif n % 2 == 0:\n print(ceil(n / 4) - 1)\nelse:\n print(0)\n \t\t \t\t\t \t \t \t\t \t \t\t\t", "# ===================================\n# (c) MidAndFeed aka ASilentVoice\n# ===================================\n# import math \n# import collections\n# ===================================\nn = int(input())\nans = 0 if n&1 else n//4\nans -= 1 if n%4 == 0 else 0\nprint(ans)\n", "n = int(input())\r\na = int()\r\nif n % 2 != 0:\r\n print(0)\r\nif n % 2 == 0:\r\n a = n // 2\r\n if a % n != 0:\r\n print((a-1)//2)\r\n if a % n == 0:\r\n print((a-2)//2)\r\n", "n=int(input())\nif n%2!=0:\n\tprint(0)\nelse:\n\tyo=n//2\n\tif yo%2==0:\n\t\tprint((yo//2)-1)\n\telse:\n\t\tprint(yo//2)\t\t\n", "n=int(input())\r\nprint((1-n%2)*((n//2-1)//2))", "x=int(input())\r\nif(x%2==1):\r\n print(0)\r\nelse:\r\n print((x-1)//4)", "s = int(input())\r\n\r\nif s%2 != 0:\r\n print(0)\r\nelse:\r\n s = s//2\r\n if s%2 == 0:\r\n print(s//2 - 1)\r\n else:\r\n print(s//2)\r\n", "n=int(input())\r\nif n%2==0:\r\n n=n/2\r\n if n%2==0:\r\n n=(n/2)-1\r\n else:\r\n n=n//2\r\n print(int(n))\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\nif n % 2 == 1:\r\n print(0)\r\n exit(0)\r\n\r\nprint(int(((n/2)-1)//2))", "n=int(input())\r\nif n%2!=0:\r\n\tprint(0)\r\nelse:\r\n\tif (n//2)%2!=0:\r\n\t\tprint((n//2)//2)\r\n\telse:\r\n\t\tprint(((n//2)//2)-1)", "import os\r\nimport sys\r\nimport time\r\n\r\nDEBUG = os.getenv(\"_DEBUG\")\r\nif DEBUG:\r\n input = open(\"cmake-build-debug/input.txt\", \"r\").readline\r\n # sys.stdout = open(\"output.txt\", 'w')\r\nelse:\r\n input = sys.stdin.readline\r\n output = sys.stdout.write\r\n\r\n\r\ndef main(tc):\r\n n = int(input())\r\n if n % 2 == 0:\r\n ans = n // 4\r\n if n % 4 == 0:\r\n ans -= 1\r\n print(ans)\r\n else:\r\n print(0)\r\n\r\n\r\nif __name__ == '__main__':\r\n start_time = time.time()\r\n T = 1\r\n # T = int(input())\r\n for tc in range(T):\r\n main(tc)\r\n if DEBUG:\r\n print(\"\\n--- %s ms ---\" % ((time.time() - start_time) * 1000))\r\n", "n = int(input())\r\nif n % 2 == 0:\r\n if(n%4 == 0):\r\n print((n//4) - 1)\r\n else:\r\n print(n//4)\r\nelse:\r\n print(0)\r\n", "n=int(input())\r\nif n%2==0:\r\n n=int(n/2)\r\n cnt=0\r\n x,y=1,n-1\r\n while x<y:\r\n cnt+=1\r\n x+=1\r\n y-=1\r\n print(cnt)\r\nelse:\r\n print(0)", "n=int(input())\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n print(n//4-int(not n//2%2))", "n = int(input())\r\nprint((n//2 - 1)//2 if n != 1 and n%2 == 0 else 0)", "k = int(input())\r\nm = k//2\r\nif k%2!=0 or k<=4:\r\n print(0)\r\nelse:\r\n if m%2==0:\r\n print(m//2-1)\r\n else:\r\n print(m//2)", "def mapit():\r\n\ttemp=list(map(int,input().split()))\r\n \r\n\treturn temp\r\n\r\ndef solution():\r\n\tn=int(input())\r\n\tif n%2:\r\n\t\tprint(0)\r\n\t\treturn\r\n\tif not n%4:\r\n\t\tprint(n//4-1)\r\n\telse:\r\n\t\tprint(n//4)\r\n\t\r\n\r\n\t\r\n\r\n\r\n# t=int(input())\r\n \r\n# while t:\r\n# \tt-=1\r\nsolution()\r\n", "n = int(input()); print(0 if n%2==1 else (n-2)//4)", "x = int(input())\r\nif x % 2 == 1:\r\n print(\"0\")\r\n exit(0)\r\ny = x // 4\r\nif x % 4 == 0:\r\n\ty -= 1\r\nprint(y)", "k=int(input())\nif k%2!=0:\n print(int(0))\nelif (k/2)%2==0:\n print(int(k/4-1))\nelse:\n print(int(k/4))\n \t \t\t \t\t\t\t \t \t\t \t", "n = int(input())\r\nif n % 2 or n < 6:\r\n ans = 0\r\nelse:\r\n ans = n // 4 + int(bool(n % 4)) - 1\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nnow=0\r\nif n%2==0:\r\n if n%4==0:\r\n now=int(n/4-1)\r\n else:\r\n now=n//4\r\nprint(now)\r\n \r\n\r\n", "n=int(input())\r\nif (n&1):\r\n\tprint(0)\r\nelif (n%4)==0:\r\n\tprint(n//4-1)\r\nelse:\r\n\tprint(n//4)", "t = int(input())\r\nif t%2!=0:\r\n print(0)\r\nelse:\r\n print(t//4+t//2%2-1)", "n=int(input())\r\nprint((n-1)*(~n&1)//4)\r\n", "n = int(input())\nprint(0 if n & 1 else ((n + 3)// 4) - 1)", "n=int(input())\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n t=int(n/2)\r\n if t%2==1:\r\n print(int(t/2))\r\n else:\r\n print(int(t/2-1))\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Oct 24 08:38:40 2021\r\n\r\n@author: varrs\r\n\"\"\"\r\n\r\na=int(input())\r\nif a%2==0:\r\n half=a/2\r\n n=half-1\r\n if int(n//2)<0:\r\n print(0)\r\n else:\r\n print(int(n//2))\r\nelse:\r\n print(0)", "n =int(input())\r\nif n<6 or n%2>0:\r\n print(0)\r\nelse:\r\n n = n//2\r\n print ((n+1)//2-1)", "n = int(input())\r\nif n % 2 == 1:\r\n print(0)\r\n quit()\r\nprint(max(0, n // 4 - (1 if n % 4 == 0 else 0)))", "n = int(input())\n\nif(n%2 == 1):\n print('0')\nelse:\n if(n%4 ==0):\n print(int(n/4)-1)\n else:\n print(int(n/4))\n \t \t \t\t \t \t \t\t \t\t \t \t \t \t", "n = int(input())\r\nif n % 2 == 1:\r\n print(\"0\")\r\nelse:\r\n n //= 2\r\n n -= 1\r\n n //= 2\r\n print(n)", "n=int(input())\r\nif n<6 or n%2==1:\r\n print(0)\r\nelif n%2==0:\r\n n1=n//2\r\n n2=n1//2\r\n if n1%2==0:\r\n print(n2-1)\r\n else:\r\n print(n2)", "n=int(input())\r\no=n//4\r\nif n%2!=0:\r\n\tprint(0)\r\nelse:\r\n\tif n%4==0:\r\n\t\to-=1\r\n\tprint(o)", "n = int(input())\n\nif n%2 == 0:\n if n%4 == 0:\n print (int((n/4) - 1))\n\n else:\n print (int(n/4))\n\nelse:\n print(0)\n\n \t\t \t \t \t\t \t \t\t\t \t\t\t\t\t\t \t", "n = int(input())\r\n\r\nif n&1:\r\n print(0)\r\nelse:\r\n if not(n%4):\r\n print(n//4-1)\r\n else:\r\n print(n//4)\r\n", "N=int(input())\r\nif N%2==1 or N<=4:\r\n\tprint(\"0\")\r\n\texit()\r\nelse:\r\n\tif N//2==0:\r\n\t\tprint(N//4-1)\r\n\telse:\r\n\t\tN=N//2\r\n\t\tprint((N-1)//2)", "import math\r\n\r\nn = int(input())\r\n\r\nif n % 2 == 1:\r\n print(0)\r\nelse:\r\n print(int(math.ceil(n / 4.0) - 1))", "n=int(input())\r\ns=0\r\nif n%4==0:\r\n s+=n//4-1\r\nelse:\r\n s+=n//4\r\nif n%2==0 and n>2:\r\n print(s)\r\nelse:\r\n print(0)", "n = int(input())\r\na = n // 2\r\nanswer = (a-1) // 2\r\nif n % 2 == 1:\r\n answer = 0\r\nprint(answer)", "n = int(input())\r\nif n%2 == 1 or n < 6:\r\n print(0)\r\nelif n%4 == 0:\r\n print(n//4-1)\r\nelse:\r\n print(n//4)", "n=int(input())\r\nans = (1 - n % 2) * ((n // 2 - 1) // 2)\r\nprint(ans)\r\n", "n=int(input())\r\nans=n//4\r\nif n%4==0:\r\n ans -= 1\r\nif n&1:\r\n print(0)\r\nelse:\r\n print(ans)", "n=int(input())\nif(n%2==1):\n print(0)\nelse:\n n=n//2\n if(n%2==0):\n print((n-2)//2)\n else:\n print((n-1)//2)\n\t\t \t\t \t\t\t \t\t\t\t\t \t \t\t\t\t \t\t", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn = mint()\r\nif n%2 != 0:\r\n\tprint(0)\r\nelse:\r\n\tn //= 2\r\n\tx = n//2-1\r\n\twhile x+1 < n-(x+1):\r\n\t\tx += 1\r\n\tif x < 0:\r\n\t\tprint(0)\r\n\telse:\r\n\t\tprint(x)\r\n", "a=int(input())\r\nif (a%2==1):\r\n print(0)\r\nelse:\r\n a//=2\r\n if (a%2==1):\r\n print(a//2)\r\n else:\r\n print((a//2)-1)\r\n\r\n", "\na = int(input())\n\nif a % 2 == 1:\n print(0)\nelse:\n a //= 2\n if a % 2 == 0:\n a -= 1\n\n print(a // 2) \n\n", "n = int(input())\nans = 0\n\nif n % 2 == 0:\n ans = (n // 4) - (1 if n % 4 == 0 else 0)\n\nprint(ans)\n \t\t\t \t\t \t \t\t \t \t \t\t \t", "import logging\r\nimport copy\r\nimport sys\r\n\r\nlogging.basicConfig(stream=sys.stderr, level=logging.DEBUG)\r\n\r\ndef solve(firstLine):\r\n n = firstLine[0]\r\n\r\n result = [1,1,1,1]\r\n \r\n \r\n if n <= 4:\r\n return 0\r\n if n % 2 != 0:\r\n return 0\r\n \r\n # 2a + 2b = n\r\n # a + b = 2/n\r\n\r\n an = int(int(n/2)/2)\r\n if n%4 == 0:\r\n an-=1\r\n return an\r\n\r\ndef main():\r\n firstLine = input().split()\r\n firstLine = list(map(int, firstLine))\r\n \r\n print(solve(firstLine))\r\n \r\n\r\ndef log(*message):\r\n logging.debug(*message)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nif n%2==0:\r\n print((n+3)//4-1)\r\nelse:\r\n print(0)\r\n", "n=int(input())\r\nif n%2 != 0:\r\n print(0)\r\n exit()\r\nelif n%4 == 0:\r\n print(n//4-1)\r\n exit()\r\nelse:\r\n print(int((n//2-1)/2))", "n = int(input())\n\nif n % 2 == 1:\n print('0')\nelif n % 4 != 0:\n print(n//4)\nelse:\n print((n//4)-1)\n\t\t\t\t\t\t\t\t\t\t\t \t \t \t \t \t \t", "n=int(input())\r\nif n%2==0:\r\n print((n//4) -1*(n%4==0) )\r\nelse:\r\n print(0)\r\n ", "n = int(input())\n\nif n%2:\n print(0)\nelse:\n out = n//4\n if n%4 == 0: out -= 1\n\n print(out)", "n = int(input())\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n n = n//2\r\n ans = n-1\r\n print(ans//2)", "n=int(input());print(0if(n&1)else(n//2-1)>>1)", "from math import ceil, sqrt, floor\r\nimport sys \r\n\r\nn = int(input())\r\nif n % 2:\r\n print(0)\r\nelif not(n % 4):\r\n print(n//4 - 1)\r\nelse:\r\n print(n//4)", "n = int(input())\r\nif n < 6 or n&1:\r\n print(0)\r\nelse:\r\n value = n//2\r\n one = 0\r\n if (value//2 == value/2):\r\n one +=1\r\n print((value)//2-one)", "n = int(input())\r\n\r\nif n % 2 == 0:\r\n out = n / 4\r\n print(int(out) - (out % 1 == 0))\r\nelse:\r\n print(0)\r\n", "x=int(input())\r\ndef find(n):\r\n if(n%2==1):\r\n return 0\r\n y=n/2\r\n return int((y-1)/2)\r\n\r\nprint(find(x))\r\n", "n = int(input())\r\nif n%2==0 and n>=6:\r\n if n%4==0:\r\n print(n//4-1)\r\n else:\r\n print(n//4)\r\nelse:\r\n print(0)", "n = int(input())\r\nif n % 2 != 0:\r\n print(0)\r\n exit()\r\nprint(n // 4 - 1) if n%4==0 else print(n // 4)\r\n", "n=int(input())\r\nif n%2:\r\n print(0)\r\n exit()\r\nif (n//2)%2:\r\n print((n//2)//2)\r\nelse:\r\n print((n//2-2)//2)", "N = int(input())\r\n\r\nif (N%2) is 0 :\r\n if (N%4) is 0 :\r\n print(int(N/4 - 1))\r\n \r\n else :\r\n print(int(N/4))\r\n\r\nelse :\r\n print(\"0\")", "import math\r\nn=int(input())\r\nif(n%2!=0):\r\n print(0)\r\nelse:\r\n a=n//2\r\n i=1\r\n k=a-1\r\n \r\n print(math.ceil((k-i)/2))\r\n", "a=int(input())\r\nb=0\r\nif(a%2==1):\r\n print(\"0\")\r\nelse:\r\n if(a%4==0):\r\n print(a//4 -1)\r\n else:\r\n print(a//4)", "'''MOD=10**9+7\r\ndef power(x, a):\r\n if(a==0):\r\n return(1)\r\n z=power(x, a//2)\r\n z=(z*z)%MOD\r\n if(a%2):\r\n z=(z*x)%MOD\r\n return(z)\r\ndef fact(n):\r\n factn=1\r\n for i in range(2, n+1):\r\n factn=(factn*i)%MOD\r\n return(factn)\r\ndef oddfact(n):\r\n res, i = 1, 1\r\n while(i<=n):\r\n res=(res*i)%MOD\r\n i+=2\r\n return(res)\r\nn=int(input()) \r\nif(n%2):\r\n print((fact(n)*oddfact(n))%MOD)\r\nelse:\r\n print(0)'''\r\nn=int(input())\r\nif(n%2):\r\n print(0)\r\nelse:\r\n n=n//2\r\n print(n//2-(n%2==0))\r\n", "n=int(input())\r\nif(n % 2):\r\n\tprint(0)\r\nelif(n < 6):\r\n\tprint(0)\r\nelse:\r\n\tlargest=(n-2)//2\r\n\tcount=(largest-1)//2\r\n\tif((n//2)% 2):\r\n\t\tcount+=1\r\n\tprint(count)", "num = int(input())\n\nif num % 2 != 0:\n print('0')\nelse:\n if num % 4 != 0:\n print(int(num/4))\n else:\n print(int(num/4 - 1))\n \t\t \t\t \t\t\t \t\t\t\t \t\t\t \t\t", "n = int(input())\r\n\r\nif n%2:\r\n print(0)\r\nelse:\r\n temp = n//4 - (n%4==0)\r\n print(temp)\r\n", "import sys\r\nip = lambda : int(sys.stdin.readline())\r\narr = lambda : list(map(int,sys.stdin.readline().split(' ')))\r\narr1 = lambda n : [arr() for _ in range(n)]\r\n# 1 n-2 n-1\r\nn=ip()\r\nif n==6:\r\n print(1)\r\nelif n%4==0:\r\n print(n//4-1)\r\nelif n%2==0:\r\n print(n//4)\r\nelse:\r\n print(0)", "n=int(input())\r\na=n%2\r\nanswer=0\r\n\r\nif a!=0:\r\n answer=0\r\nelse:\r\n n=n/2\r\n n=n-1\r\n answer=int(n//2)\r\n\r\n\r\nprint(answer)\r\n", "n = int(input())\r\nif n %2 == 0:\r\n if n%4 == 0:\r\n print(n//4 -1)\r\n else:\r\n print(n//4)\r\nelse:\r\n print(0)", "n=int(input())\r\nif(n%2==0):\r\n\tx=n-2\r\n\tprint((x//2)-(n//4))\r\nelse:\r\n\tprint(0)", "n=int(input())\r\nimport math\r\nif n%2==0:\r\n print(math.ceil(n/4)-1)\r\nelse:\r\n print(0)\r\n", "n=int(input())\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n t=n//2\r\n if t%2==0:\r\n print((t//2)-1)\r\n else:\r\n print(t//2)", "from math import *\r\ndef main():\r\n n=int(input())\r\n if n%2!=0:\r\n print(0)\r\n else:\r\n ans=ceil((n/4)-1)\r\n print(ans)\r\nmain()", "import math\n\nn = int(input())\n\nif n > 5 and not (n & 1):\n print( math.floor(((n/2) -1)/2))\nelse:\n print(0)\n\t \t\t \t\t \t \t \t\t \t\t\t\t\t", "n=int(input())\r\n\r\nl=0;r=n\r\nif n<6 or n%2==1:\r\n print(0)\r\nelse:\r\n if (n//2)%2==1:\r\n print((n//2)//2)\r\n else:\r\n print(((n//2)//2)-1)\r\n \r\n", "n = int(input())\r\nprint((n-1)//4 if n%2 == 0 else 0 )", "n=int(input())\r\nif n%2 or n<6:\r\n\tprint(0)\r\nelse:\r\n\tprint((n-2)//4)", "n=int(input())\nif n%2==0:\n\tprint(int(((n/2)-1)/2))\nelse:\n\tprint(\"0\")", "from math import ceil\nn = int(input())\n\nif n < 6 or n % 2:\n\tprint(0)\nelse:\n\ta = (n - 2) // 2\n\tprint(ceil((a - 1) / 2))", "n = int(input())\r\nif n % 2 == 1:\r\n\tprint(0)\r\n\texit(0)\r\nt = n // 2\r\nif t % 2 == 0:\r\n\tprint(t // 2 - 1)\r\nelse:\r\n\tprint(t // 2)\r\n", "X = int(input())\r\nif X < 6 or X % 2 != 0:\r\n print(0)\r\n exit()\r\nprint(X // 4 if X / 4 != X // 4 else X // 4 - 1)\r\n", "n=int(input())\r\nif n%2!=0:\r\n ans=0\r\nelse:\r\n n//=2\r\n n-=1\r\n ans=n//2\r\nprint(ans)\r\n", "n = int(input())\nif (n%2 == 1):\n print(0)\nelse:\n n = n // 2\n if (n%2 == 0):\n print(str(n//2 - 1))\n else:\n print(n//2)\n \n", "n=int(input())\r\nif n==0 or n%2==1:\r\n\tprint('0')\r\n\texit()\r\nn=n//2\r\nprint(-1+(n+1)//2)", "n = int(input())\r\nif n % 2 != 0:\r\n print(0)\r\nelse:\r\n k = min(n % 4, 1)\r\n print(n // 4 - (1 - k))", "n = int(input())\r\nif n % 2 or n < 6:\r\n print(0)\r\n exit()\r\nprint((n - 2) // 4)\r\n", "n=int(input())\r\nif(n&1):\r\n print('0')\r\nelse:\r\n if(n%4==0):\r\n print(int(n//4)-1)\r\n else:\r\n print(int(n//4))\r\n", "from math import sqrt\r\n\r\nn = int(input())\r\nif 1 <= n <= 2*pow(10,9):\r\n if n%2 == 1:\r\n print(\"0\")\r\n else:\r\n half = n/2\r\n if half % 2 == 0:\r\n print(int((half/2)-1))\r\n else:\r\n print(int((half-1)/2))\r\n\r\n", "n=int(input())\r\nif n%2:\r\n print(0)\r\nelse:\r\n print(((n//2)+1)//2-1)", "from math import floor\n\nn = int(input())\n\ncount = 0\n\nif n % 2 != 0:\n print(0)\nelse:\n if n % 4 == 0:\n print(n//4-1)\n else:\n print(int(floor(n/4)))\n\n", "import math\r\nn = int(input())\r\nif (n&1) :\r\n print('0')\r\n exit()\r\nres = n/4\r\nres = int(math.ceil(res))\r\nprint(max(res, 0)-1)", "n=int(input())\r\nif(n%2!=0):\r\n print(0)\r\nelse:\r\n d=n//4\r\n if(d+d+d+d==n):\r\n print(d-1)\r\n else:\r\n print(d)", "n=int(input())\r\nvar=n//2\r\nif n//4>=1:\r\n var-=1\r\n\r\nif n%2==1:\r\n print(0)\r\nelse:\r\n print(var//2)\r\n \r\n#for _ in range(in\r\n# t(input())):\r\n#n,m=map(int,input().split())\r\n #s=input()\r\n\r\n", "n=int(input())\r\nif n%2==1 or n<=5:\r\n print(0)\r\nelse:\r\n n=n//2\r\n if n%2:\r\n print(n//2)\r\n else:\r\n print(n//2-1)", "n = int(input())\ntotal = 0\n\nif n % 2 == 0:\n\ttotal = n//4\n\tif n % 4 == 0:\n\t\ttotal -= 1\n\nprint(total)\n \t\t\t \t\t \t\t\t\t\t\t\t \t \t\t\t \t\t\t\t", "n = int(input())\r\nprint([((n // 2) - 1) // 2, 0][n % 2 == 1])", "n = int(input())\r\nprint(0 if n % 2 else n // 4 - (n % 4 == 0))\r\n", "n=int(input())\r\nif n&1:\r\n print(0)\r\nelif n%4==0:\r\n print(n//4-1)\r\nelse:\r\n print(n//4)\r\n", "n = int(input())\r\nprint(0 if n % 2 else (n // 2 - 1) // 2)\r\n", "n=int(input())\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n if (n//2)%2==0:\r\n print((n//4) - 1)\r\n else:\r\n print(n//4)\r\n", "ll=lambda:map(int,input().split())\r\nt=lambda:int(input())\r\nss=lambda:input()\r\nlx=lambda x:map(int,input().split(x))\r\n#from math import log10 ,log2,ceil,factorial as fac,gcd\r\n#from itertools import combinations_with_replacement as cs \r\n#from functools import reduce\r\n#from bisect import bisect_right as br,bisect_left as bl\r\nfrom collections import Counter\r\n#from math import inf\r\n\r\n\r\n\r\n \r\n#for _ in range(t()):\r\ndef f():\r\n n=t()\r\n if n<=5 or n%2:\r\n print(0)\r\n return\r\n print((n//2-1)//2)\r\n \r\n'''\r\n1 10\r\n2 9\r\n3 8\r\n4 7\r\n6 5\r\n\r\n'''\r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\nf()\r\n", "a=int(input())\r\nb=a//2\r\ns=0\r\nif a%2==1:\r\n print(0)\r\nelif a%4==0:\r\n print((a//4)-1)\r\nelif a%2==0:\r\n print((a//4))\r\n", "def ans(n):\n \n if n % 2 == 1 or n <= 4:\n return 0\n\n else:\n rect = 0\n h = 0\n while h < n:\n h += 2\n n -= 2\n rect += 1\n\n return rect - 1\n \n \n\n\nn = int(input())\nprint(ans(n))\n", "n = int(input())\r\nif (n% 4== 2 ):\r\n print(int(n/4))\r\nelif (n%4 == 0):\r\n print(int(n/4)-1)\r\nelse:\r\n print(0)\r\n\r\n\r\n", "a=int(input())\r\nif a%2:print(0)\r\nelse:print((a//2-1)//2)\r\n", "\"\"\"x=int(input())\r\ni=1\r\nwhile 1:\r\n y=x\r\n y=(y-(2*i))/2\r\n if y<=i:\r\n break\r\n i+=1\r\ni-=1\r\nprint(i)\r\n\"\"\"\r\nn=int(input())\r\nif(n%2==1):\r\n print(0)\r\nelse:\r\n m=n//2\r\n if(m%2==0):\r\n m-=1\r\n print(m//2)\r\n", "n = int(input())\r\nif n%2:\r\n print(0)\r\nelse:\r\n length = n//2\r\n numRec = (length//2 -1)\r\n if length%2:\r\n numRec +=1\r\n print(numRec)\r\n", "def pasha_and_stick(n: int) -> int:\n if (n <= 4 or n % 2 > 0):\n return 0\n\n if (n % 4 > 0):\n return int(n/4)\n\n sticks = n / 4\n\n if (sticks < 2):\n return 1\n else:\n return int(sticks) - 1\n\n# Inputs\nn = int(input())\nprint(pasha_and_stick(n))\n\n \t\t\t \t\t \t\t\t\t\t \t \t \t\t\t \t\t", "n = int(input())\r\nif(n%2==1):\r\n print(0)\r\n exit(0)\r\nx = n//4\r\nif(n%4==0): x-=1\r\nprint(x)", "n = int(input())\nif(n%2 or n<6):\n print(0)\nelse:\n print(((n//2)+1)//2-1)\n\t\t\t \t\t\t\t \t \t\t \t \t\t\t \t\t \t", "# Matheus de Souza Oliveira RA: 203407\n\nn = int(input())\n\nif n > 4:\n if n % 2 == 0:\n aux = n - 2\n aSide = int(aux/2)\n bSide = 1\n print(int(aSide/2))\n else:\n print(0)\nelse:\n print(0)\n\t\t \t\t\t\t\t\t \t\t\t \t \t\t \t\t\t \t\t\t", "if __name__ == \"__main__\":\n\tn = int(input())\n\tif n%2:\n\t\tprint(0)\n\telse:\n\t\tx,y= 1,n//2-1\n\t\tc = 0\n\t\tif x<y:\n\t\t\tif (y-x+1)//2>0:\n\t\t\t\tc = (y-x+1)//2\n\t\t\telse:\n\t\t\t\tc = 1\n\t\tprint(c)\n\t\t\t\n", "n = int(input())\r\nif n % 2 == 1:\r\n print(0)\r\nelse:\r\n res = 0\r\n p = int(n / 2)\r\n if p % 2 == 0:\r\n print(int(p / 2) - 1)\r\n else:\r\n print(int(p / 2))", "n = int(input())\r\nif n%2>0:\r\n print(0)\r\nelif n%4>0:\r\n print(n//4)\r\nelse:\r\n print(n//4-1)", "n=int(input())\r\n\r\nif n%2==1:\r\n\tprint(0)\r\n\r\nelse:\r\n\tval=n//2\r\n\t\r\n\tf=0\r\n\t\r\n\tif val%2==0:\r\n\t\tf=1\r\n\tans=val//2\r\n\t\r\n\tif f==1:\r\n\t\tans=ans-1\r\n\tprint (ans)\t\r\n\t", "n=int(input())\r\nif n<=5 or n%2:\r\n print(0)\r\nelse:\r\n print((n-1)//4)", "from collections import defaultdict\r\nimport math\r\nx=int(input())\r\nif(x%2!=0):\r\n ans=0\r\nelse:\r\n ans=(x//2 -1)//2\r\nprint(ans)", "x = int(input())\r\n\r\nif x % 2 == 1 :\r\n print(\"0\")\r\nelse:\r\n print((x-1)//4)", "def ways(n: int) -> int:\n \"\"\"ways returns the number of ways it is possible to split a rod into\n valid rectangles.\n\n If n < 6 or n is not divisible by 2, then it cannot be divided into a\n rectangle where the sum of all the sides equals n.\n\n If n not divisible by 4, then it cannot be divided into a square with\n sum of sides equal to n.\n\n For n = 14, n/2 = 7, square does not exist.\n b: 1 2 3|4 5 6\n a: 6 5 4|3 2 1\n\n For n = 16, n/2 = 8, n/4 = 4, square exists.\n b: 1 2 3|4|5 6 7\n a: 7 6 5|4|3 2 1\n\n We enumerate b or a from 1 to (n/2 - 1). As we can see, half of the\n enumerations are duplicates. So number of unique ways is half length\n of the enumeration.\n Also, we do not need to consider the square case as, if a square\n exists then that means the length of the sequence is odd, and flooring\n that when dividing by 2 gives us the correct value.\n \"\"\"\n if n < 6:\n return 0\n if n % 2 != 0:\n return 0\n length = n//2 - 1\n return length // 2\n # return len(range(1, n//2))//2\n\nprint(ways(int(input())))\n", "n=int(input())\r\nif(n%2==1):\r\n print (0)\r\nelse:\r\n x=n//2\r\n if(x%2==1):\r\n print (x//2)\r\n else:\r\n print (x//2-1)", "n=int(input());s=set()\r\nif n%2==1:print(0)\r\nelse:\r\n ans=(n-2)//4\r\n print(ans)\r\n", "n = int(input())\r\nif n<=4 or n%2!=0:\r\n print(0)\r\nelse:\r\n if n/4==n//4:\r\n print((n//4)-1)\r\n else:\r\n print(n//4)", "total_length=int(input())\r\nif total_length%2!=0:\r\n\tprint(0)\r\nelse:\r\n\tprint((total_length-1)//4)", "n=int(input())\nk=n//2\nif n%2==1 :\n print(0)\nelif k%2==0 :\n print((k//2)-1)\nelse:\n print(k//2)\n\t \t \t \t\t \t\t\t \t \t \t \t \t \t", "n=int(input())\r\nif n%2!=0: print(0)\r\nelse:\r\n h=n//2\r\n print((h//2)-(h%2==0))\r\n", "n = int(input())\ncnt = 0\nif n % 2 == 1 or n <= 5:\n print(0)\n exit()\na = n//2-2\nif a % 2 == 0:\n print(a // 2)\nelse:\n print((a-1) // 2 + 1)\n", "n = int(input())\nif n < 6 or n % 2 != 0:\n print(0)\nelse:\n print((n - 2) // 4)\n", "n=int(input())\r\nif n<=5 or n%2!=0:\r\n print(0)\r\nelse:\r\n n=n//2\r\n print((n-1)//2)", "n = int(input())\r\nif n%2==1:print(0)\r\nelse:print((n//2-1)//2)\r\n", "a = int(input())\r\nif a % 2 == 1:\r\n print(0)\r\nelse:\r\n b = a // 2\r\n if b % 2 == 0:\r\n print((b // 2) - 1)\r\n else:\r\n print(b // 2)", "# cook your dish here\r\nimport math\r\nn = int(input())\r\nif n%2!=0:\r\n print(\"0\")\r\nelse:\r\n a = n//2\r\n print(math.ceil(a/2)-1)", "import math\r\nn=int(input())\r\nif(n%2!=0):\r\n print(0)\r\nelse:\r\n a=math.ceil(n/4)\r\n print(a-1)", "n=int(input())\r\nif n%4==0:\r\n print(n//4-1)\r\nelif n%2!=0 or n<=4:\r\n print(0)\r\nelse:\r\n print(n//4)", "n=int(input())\r\na=(n-1)//4\r\n\r\nif n%2==0:\r\n print(a)\r\nelse:\r\n print(0)", "def PS():\r\n uOutput = 0;\r\n uInput = int(input());\r\n if(uInput % 2 == 0):\r\n bQuart = 0;\r\n if(uInput % 4 == 0):\r\n bQuart = 1;\r\n uHalf = uInput // 2;\r\n uOutput = (uHalf // 2) - bQuart;\r\n\r\n return uOutput;\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(PS());\r\n #print(\"Hello\")", "n = int(input(\"\"))\r\nif n <= 2 :\r\n print(0)\r\nelif n % 2 == 1:\r\n print(0)\r\nelse:\r\n if n % 4 == 0:\r\n ans = ((n//2)-2)//2\r\n print(ans)\r\n else :\r\n ans = ((n//2)-1)//2\r\n print(ans)\r\n\r\n", "n = int(input())\r\nprint(n // 4 - (n % 4 == 0) if n % 2 == 0 else 0)", "import math\r\nn=int(input())\r\nif n%2==0:\r\n x=math.ceil(n/4)\r\n print(x-1)\r\nelse:\r\n print(0)", "n=int(input());from math import ceil;print(0 if n%2!=0 else ceil(n/4)-1)", "n=int(input())\r\nif(n%2==0):\r\n a=n//2\r\n res=a//2\r\n if(a%2==0):\r\n res-=1\r\n print(res)\r\nelse:\r\n print(0)", "n=int(input())\r\nif n%2 == 1: print(0)\r\nelif n%4 == 0: print(n//4-1)\r\nelse: print(n//4)\r\n", "import math,sys,re,itertools\r\nrs,ri,rai=input,lambda:int(input()),lambda:list(map(int, input().split()))\r\nn = ri()\r\nif n%2 != 0:\r\n print(0)\r\nelse:\r\n n //= 2\r\n k = n//2\r\n if n%2 == 0:\r\n k -= 1\r\n print(k)", "n=int(input())\r\nif n%2:print(0)\r\nelse:\r\n\td=n//2\r\n\tif d%2:print(d//2)\r\n\telse:print(d//2-1)", "x = int(input())\r\nprint((((x//2) - 1)//2) * 1 if x % 2 == 0 else 0)\r\n# CodeForcesian\r\n# ♥\r\n# نمیدونم چمه\r\n", "x=int(input());print(abs((x//2-1)//2*(x%2-1)))", "a=int(input())\r\nif(a%2==1):\r\n print(0)\r\nelse:\r\n print((a-1)//4)", "from math import ceil\nn = int(input())\nif n%2==1:\n print(0)\nelse:\n a = 1\n b = (n-2)//2\n print(ceil((b-a)/2))", "n = int(input())\r\nprint(0 if n % 2 else (n - 1) // 4)", "n = int(input())\r\nif n%2:\r\n print(0)\r\nelse:\r\n targ = n//2\r\n\r\n if targ%2:\r\n print(targ//2)\r\n else:\r\n targ-=1\r\n print(targ//2)\r\n", "n=int(input())\r\nif n%2==0:\r\n n=n//2\r\n x=0\r\n for i in range (1,n//2+1):\r\n if i!=n-i:\r\n x+=1\r\n print(x)\r\nelse:\r\n print(0)\r\n", "n=int(input())\r\n\r\nx=n//4+(n%4!=0)\r\n\r\nx-=1\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n print(x)", "n=int(input())\r\nprint([n//4-(n%4<1),0][n%2])", "num = int(input())\r\n\r\nif num % 2 == 1 or num < 5:\r\n print(0)\r\nelse:\r\n cnt = (num - 4 + 3) //4\r\n\r\n print(cnt)\r\n\r\n", "n = int(input())\r\nfrom sys import exit\r\nif n % 2 != 0 :\r\n print(0)\r\n exit()\r\nif n % 4 == 0:\r\n x = int(n / 4 - 1)\r\nelse:\r\n x = int(n / 4)\r\n \r\nprint(x)\r\n", "x = int(input())\nresult = ((x + 3) // 4 - 1) * (x % 2 == 0)\nprint(result)\n\n \t\t\t\t \t\t \t \t\t\t \t \t\t \t", "n=int(input())\r\nif n%2==1:\r\n print(0)\r\n exit()\r\nprint(-(-n//4)-1)", "n = int(input())\r\nif n % 2 == 1 or n < 6:\r\n print(0)\r\nelse:\r\n print(n // 4 - 1 + (n % 4)//2)\r\n", "v = int(input())\n\n\ndef solve(x):\n if x % 2 == 1:\n return 0\n y = x //2\n y -= 1\n #if y % 2 == 0:\n # y -= 2\n #else:\n # y -= 1\n return y // 2\n\nprint(solve(v))\n\n\n\n\n\n", "n = int(input())\r\nif n<6 or n%2==1:\r\n print(0)\r\nelse:\r\n R = (n-2)//2\r\n print(R//2)\r\n \r\n", "a = int(input())\r\nif(a % 2 == 1 or a <= 5) :\r\n print(0)\r\n quit()\r\nprint((a // 2 + 1) // 2 - 1)", "n = int(input())\r\nprint([0, n//4 - (n % 4 == 0)][n % 2 == 0])", "sticklength = int(input())\r\nif sticklength % 2 != 0:\r\n print(0)\r\nelse:\r\n print(((sticklength // 2)-1) // 2)\r\n", "n=int(input())\r\nif(n%2!=0):\r\n\tprint(0)\r\nelse:\r\n\tx=0\r\n\tif(n%4==0):\r\n\t\tx=1\r\n\tn=n//4 -x\r\n\tprint(n)\r\n", "import math\r\nn = int(input().strip())\r\nif n%2 !=0:\r\n print(0)\r\nelse:\r\n print(math.ceil(n/4)-1)\r\n", "n=int(input())\r\nif n%2!=0:\r\n\tprint(0)\r\nelse:\r\n\tx=n//4\r\n\tif n%4==0:\r\n\t\tx-=1\r\n\tprint(x)", "n = int(input())\nif n&1:\n print(0)\nelse:\n ans = n>>2\n if (n & 3) == 0:\n ans -= 1\n print(ans)\n\n \t\t \t\t\t\t \t\t \t \t \t\t", "n = int(input())\r\nif n % 2 != 0:\r\n\tprint(0)\r\nelse:\r\n\tif n % 4 == 0:\r\n\t\tx = n //4\r\n\t\tprint(x - 1)\r\n\telse:\r\n\t\tprint(n//4)", "n = int(input())\r\nif n < 4 or n%2:\r\n print(\"0\")\r\n \r\nelse:\r\n total = n//2\r\n if total %2:\r\n print(total//2)\r\n else:\r\n print(total//2 - 1)\r\n", "from math import ceil\r\nn = int(input())\r\nif n&1 == 0:\r\n\tans = ceil(n/4)-1\r\nelse :ans = 0\r\nprint(ans)", "n = int(input())\r\nif n % 2 == 1:\r\n\tprint(\"0\")\r\nelse:\r\n\tn //= 2\r\n\tm = n // 2\r\n\tif n % 2 == 0:\r\n\t\tm += -1\r\n\tprint(m)", "n = int(input())\r\nif n%2:\r\n print(0)\r\nelse:\r\n k = n//2\r\n print(k//2 - int(k%2==0))\r\n", "from sys import stdin\r\nfrom collections import deque\r\nmod = 10**9 + 7\r\nimport sys\r\nsys.setrecursionlimit(10**5)\r\nfrom queue import PriorityQueue\r\n# def rl():\r\n# return [int(w) for w in stdin.readline().split()]\r\nfrom bisect import bisect_right\r\nfrom bisect import bisect_left\r\nfrom collections import defaultdict\r\nfrom math import sqrt,factorial,gcd,log2,inf,ceil\r\n# map(int,input().split())\r\n# # l = list(map(int,input().split()))\r\n# from itertools import permutations\r\nimport heapq\r\n# input = lambda: sys.stdin.readline().rstrip()\r\ninput = lambda : sys.stdin.readline().rstrip()\r\nfrom sys import stdin, stdout\r\nfrom heapq import heapify, heappush, heappop\r\n\r\nn = int(input())\r\n\r\nif n%2 == 0:\r\n\r\n if n%4 == 0:\r\n print(n//4 - 1)\r\n else:\r\n print(n//4)\r\nelse:\r\n print(0)\r\n", "n = int(input())\n\nans = 0\nif n % 2 == 0:\n half = n >> 1\n if half % 2 == 0:\n ans = (half >> 1) - 1\n else:\n ans = (half - 1) >> 1\n\nprint(ans)\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\tn=read_int()\n\tif n%2==1:\n\t\tprint(0)\n\t\treturn\n\tn//=2\n\tif n%2==0:\n\t\tprint(n//2-1)\n\telse:\n\t\tprint(n//2)\n\nsolve()\n", "from sys import stdin\n\ndef r(): return stdin.readline().strip()\ndef r_t(tp): return map(tp, r().strip().split())\ndef r_a(tp): return list(r_t(tp))\n\ndef main():\n n = int(r())\n print(0 if n&1 else (n//4-1 if not (n//2)&1 else n//4))\nmain()\n", "a = int(input())\r\nif a%2!=0:print(0)\r\nelse:\r\n\tif a%4==0:print((a//4)-1)\r\n\telse:print(a//4)", "n = int(input())\r\nif n%2 != 0: print(0)\r\nelse: print(((n//2)-1)//2)", "#import sys ; input=sys.stdin.readline\n\nn=int(input())\nif n%2!=0 or n<=4:\n print(0)\nelse:\n n=n//2\n if n%2==0:\n print((n//2)-1)\n else:\n print(n//2)\n \t \t \t\t \t\t \t \t \t\t\t\t \t \t\t \t", "entrada = int(input())\r\nif entrada % 2 != 0:\r\n print(0)\r\nelif entrada % 4 != 0:\r\n print(entrada//4)\r\nelse:\r\n print((entrada // 4) - 1)\r\n\r\n", "from sys import stdin as Si\r\nfrom math import floor as F \r\nfrom collections import defaultdict as dt\r\nfrom operator import itemgetter as ig\r\n\r\nif __name__== '__main__':\r\n\r\n n = int(Si.readline())\r\n if n%2!=0: print(0)\r\n else:\r\n n/=2\r\n if n%2==0: print(F((n-1)/2))\r\n else: print(F(n/2))\r\n \r\n \r\n \r\n\r\n \r\n'''\r\n n,m = map(int,Si.readline().split())\r\n d = set(map(int,Si.readline().split()))\r\n pt = set(i for i in range(1,m) if i not in d)\r\n print(pt)\r\n\r\n d = tuple(map(int,Si.readline().split()))\r\n t = 1\r\n pt = ()\r\n while m>0:\r\n if t in d:\r\n t+=1\r\n else:\r\n m-=t\r\n if m>=0:\r\n pt+=(str(t),)\r\n t+=1\r\n else: break\r\n print(len(pt))\r\n'''\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\n\r\nif n % 2 ==0:\r\n print(n // 4 if n % 4 else n // 4 - 1)\r\nelse:\r\n print(0)\r\n", "import math\r\nn = int(input())\r\nif n % 2 != 0:\r\n print(0)\r\nelse:\r\n m = math.floor((n//2)//2)\r\n if n % 4 == 0:\r\n m -= 1\r\n print(m)", "n=int(input())\r\nif(n%2==1):\r\n print(int(0))\r\nelse:\r\n if(n%4==0):\r\n print(int((n/4)-1))\r\n else:\r\n print(n//4)\r\n", "n = int(input())\nrects = 0\nif n%2!=0 or n<=4:\n\trects = 0\nelse:\n\ta = b = 1\n\tc = d = int((n-2)/2)\n\trects = c - int((b+c)/2)\nprint (rects)\t\t\n", "\r\ndef solve(n: int) -> int:\r\n if n % 2 == 0:\r\n k = 1\r\n if n%4 != 0:\r\n k = 0\r\n return(n // 4 - k)\r\n else:\r\n return(0)\r\n\r\nn = int(input())\r\nprint(solve(n))\r\n ", "n = int(input())\r\n\r\nif (n < 4) or (n % 2 == 1):\r\n print(0)\r\nelse:\r\n x = n / 2\r\n\r\n if (x % 2 == 1):\r\n print(int(x//2))\r\n else:\r\n print(int(x//2 - 1))", "def solve(n):\r\n if n % 2 == 1:\r\n return 0\r\n res = 0\r\n for i in range(1, n // 4 + 1):\r\n t = n - 2 * i\r\n if t // 2 != i:\r\n res += 1\r\n return res\r\n\r\n\r\nn = int(input())\r\nprint(solve(n))\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\nif n%2:\r\n\tprint(0)\r\nelif (n//2)%2:\r\n\tprint(n//4)\r\nelse:\r\n\tprint((n//4)-1)", "l = int(input())\nif l % 2 == 1:\n print('0')\nelse:\n if l % 4 == 0:\n print(l // 4 - 1)\n else:\n print(l // 4)\n", "n = int(input())\r\nif n%2==0:\r\n x = n//2\r\n if x%2==0:\r\n print((x//2)-1)\r\n else:\r\n print(x//2)\r\nelse:\r\n print(0)\r\n", "x=int(input())\r\nprint((x//2-1)//2 if x!=1 and x%2==0 else 0) ", "n = int(input())\r\nif(n%2):\r\n print(0)\r\nelse:\r\n print(int((n/2-1)/2))", "import math\n\n############################ CUSTOMS ######################\n\nTEST_MODE = False\n\ndef cust_print(stuff):\n if TEST_MODE:\n print(stuff)\n else:\n pass\n\n\n############################ SOLUTION ######################\n\n# --- Global vars --- #\noutput = []\n\n\n# --- Algorithm --- #\ndef f(n):\n if n % 2 != 0:\n return \"0\"\n elif n % 4 == 0:\n return f\"{math.trunc(n/4) - 1}\"\n else:\n return f\"{math.trunc(n/4)}\"\n\n\n# --- Run --- #\n\n# input and computation\nprint(f(int(input())))\n", "import math\r\nn=int(input())\r\nif(n%4==0):\r\n\tprint(int(n/4-1))\r\nelif(n%2==0):\r\n\tprint(int(n/4))\r\nelif(n%2!=0):\r\n\tprint(\"0\")\r\n", "import math\r\nn= int(input())\r\n\r\nc= math.ceil(n/4)-1\r\n\r\nif c<0:\r\n c=0\r\n \r\nif n%2!=0:\r\n c=0\r\n \r\nprint(c)\r\n\r\n\r\n", "result=0\r\n\r\nn=int(input())\r\nif n<=4 or n%2!=0:\r\n result=0\r\nelse:\r\n if (n/2)%2!=0:\r\n result=int(n/4)\r\n else:\r\n result=int((n/4)-1)\r\n\r\nprint(result)", "n = int(input())\nif n%2 == 1:\n print(0)\n exit()\nprint((n//2-1)//2)\n", "n = int (input ())\r\nprint (0 if (n % 2) else (n - 1) // 4)", "n=int(input())\r\nif n%2==0:\r\n k=n//4\r\nelse:\r\n k=0\r\nif n%4==0:\r\n k-=1\r\nprint(k)\r\n", "# https://codeforces.com/problemset/problem/610/A\n\nimport math\n\ndef handle():\n value = int(input())\n\n if value % 2 == 1:\n return 0\n\n right_side = (value // 2) - 1\n left_side = math.floor(value / 4)\n\n return right_side - left_side\n\nprint(handle())", "def sol(n):\r\n if n%2==1:return 0\r\n else: return int(((n/2)-1)/2)\r\na=int(input())\r\nprint(sol(a))", "n = int(input())\r\nif n % 2 != 0 or n <= 5:\r\n print(0)\r\n\r\nelif n == 6:\r\n print(1)\r\nelse:\r\n if n % 4 == 0:\r\n print((n//4)-1)\r\n else:\r\n print(n//4)\r\n# 22\r\n# 1 1 10 10\r\n# 2 2 9 9\r\n# 3 3 8 8\r\n# 4 4 7 7 \r\n# 5 5 6 6\r\n", "lenght = int(input())\nif lenght % 2 == 1:\n print(0)\nelse:\n new_lenght = lenght / 2\n if new_lenght % 2 == 1:\n x = int((new_lenght - 1)/2)\n else:\n x = int(new_lenght/2) - 1\n print(x)\n", "n = int(input())\nnumber = int(n/4)\nif n % 4 == 0:\n number -= 1\nif n % 2 != 0:\n print(0)\nelse:\n print(number)\n\t \t\t\t \t \t\t \t \t\t \t\t\t \t\t \t \t\t", "n = int(input())\r\nif n % 2 == 0:\r\n k = 1\r\n if n%4 != 0:\r\n k = 0\r\n print(n // 4 - k)\r\nelse:\r\n print(0)\r\n", "t = int(input())\nif t % 2 == 0:\n if t % 4 == 0:\n print(int(t/4 - 1))\n else:\n print(t//4)\nelse:\n print(\"0\")\n\n\t\t\t\t \t \t\t\t\t\t\t\t \t \t \t \t\t\t", "# coding=utf-8\r\n\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tif n % 2 == 1:\r\n\t\tprint(0)\r\n\telse:\r\n\t\tprint((n // 2 - 1) // 2)\r\n", "n=int(input())\r\ndef fun(n):\r\n if(n%2!=0):\r\n return 0\r\n a,b=divmod(n,4)\r\n if(b==0):\r\n return a-1\r\n else:\r\n return a\r\n\r\nprint(fun(n))", "from sys import stdin\r\nn = int(stdin.readline())\r\nprint (0 if (n % 2) else (n - 1) // 4)", "from math import *\r\nn=int(input())\r\nans=0\r\nif n&1==0:\r\n n//=2\r\n ans=(ceil(n/2))-1\r\nprint(ans)", "from sys import stdin\r\ndef ii(): return int(stdin.readline())\r\ndef mi(): return map(int, stdin.readline().split())\r\ndef li(): return list(mi())\r\ndef si(): return stdin.readline()\r\nn=ii()\r\nif n%2:\r\n p=0\r\nelse:\r\n p=n//4\r\n if not n%4:\r\n p-=1\r\nprint(p)", "n = int(input())\r\nif n % 2 == 1:\r\n print(0)\r\nelse:\r\n target = n // 2\r\n ans = (target - 1) // 2\r\n print(ans)", "import math\r\nn=int(input())\r\nprint(math.ceil(n/4)-1) if n%2==0 else print(0)", "n = int(input())\r\nif n%2==1 or n<6:\r\n print(0)\r\nelse:\r\n n = n//2\r\n print((n-1)//2)", "n=int(input())\r\nif n%2==0 and n>=6:\r\n\tp=(n//2)\r\n\tif p%2==0:print((p//2)-1)\r\n\telse:print(p//2)\r\nelse:print(0)", "from math import ceil\r\n\r\nn = int(input())\r\nprint(0 if n % 2 else ceil(n / 4) - 1)\r\n", "n=int(input())\r\nif n<6 or n%2==1:print(0)\r\nelif n%4==0:print(((n//2)//2)-1)\r\nelse:print((n//2)//2)\r\n", "a = int(input())\r\nif a % 4 == 0:\r\n print(int(((a / 2) - 2) / 2))\r\nelif a % 2 == 0:\r\n print(int(((a / 2) - 1) / 2))\r\nelse: \r\n print(0)", "\r\nn=int(input())\r\nprint(0 if n%2 else 0--n//4-1) ", "n=int(input())\r\nif n%2==1:\r\n print(0)\r\nelse:\r\n if (n/2)%2==1:\r\n print(int((n/2)/2))\r\n else:\r\n print(int((n/2)/2)-1)\r\n", "\"\"\"\nhttps://codeforces.com/problemset/problem/610/A\n\"\"\"\nx = int(input())\n\n# x=2*a+2*b (a!=b)\nif x <= 5 or x % 2 == 1:\n print(0)\nelse:\n k = x // 2\n if k % 2 == 0:\n print(k // 2 - 1)\n else:\n print(k // 2)\n", "def divide(k):\r\n if k < 6 or k % 2 != 0:\r\n return 0\r\n k1 = k//2\r\n k2 = 0\r\n if k1 % 2 != 0:\r\n k2 = k1//2\r\n else:\r\n k2 = (k1//2)-1\r\n return k2\r\n\r\n\r\nk = int(input())\r\nprint(divide(k))\r\n", "n = int(input())\r\n\r\nprint(0 if n%2 == 1 else (n//4 if n%4 != 0 else n//4-1))\r\n", "n = int(input())\r\nprint(0 if n%2 == 1 else (n//4-1 if n%4 == 0 else n//4))", "n=int(input())\r\nif(n%2==1):\r\n print(0)\r\nelse:\r\n x=n//4\r\n if(n%4==0):\r\n x=x-1\r\n print(x)", "n = int(input())\nif n < 6 or n % 2 == 1:\n print(0)\n exit(0)\nn = n//2\nprint(n//2 - (1 - n%2))\n", "\r\n\r\n\r\nn = int(input())\r\n\r\nif n & 1:\r\n print(0)\r\n exit()\r\n\r\n\r\nquart = n//4\r\nmod = n%4\r\n\r\nprint(quart - int(mod == 0))", "import math \r\nn = int(input())\r\nif n%2 != 0:\r\n print(0)\r\nelse :\r\n \r\n print(math.ceil(n/4 -1))\r\n", "l = int(input())\r\n\r\nif l % 2 == 1:\r\n print(0)\r\nelse:\r\n l //= 2\r\n if l%2 == 1:\r\n print(l // 2)\r\n else:\r\n print(l // 2 - 1)", "n = int(input())\r\nprint((n // 2 - 1) // 2 if n % 2 == 0 else 0)\r\n", "n = int(input())\r\nanswer = 0\r\nk = n // 2\r\nif k*2 == n:\r\n answer = (k-1) // 2\r\nprint(answer)", "x = int(input())\r\nif x%2 == 1:\r\n\tprint(0)\r\nelse:\r\n\tk = x//2\r\n\tif k%2 == 1:\r\n\t\tprint((k-1)//2)\r\n\telse:\r\n\t\tprint((k)//2-1)", "n=int(input())\r\nif n%2!=0:\r\n print(0)\r\nelif n<6:\r\n print(0)\r\nelse:\r\n c=0\r\n n=n//2\r\n c=n-1\r\n print(c//2)", "a = int(input())\r\nif a % 2 != 0:\r\n print(0)\r\n exit()\r\nprint((a // 2 - 1) // 2)", "def solve(a):\r\n if a%2==1:\r\n return 0\r\n tmp=a//4\r\n if a%4==0:\r\n tmp-=1\r\n return tmp\r\n\r\na=int(input())\r\nprint(solve(a))\r\n", "n=int(input())\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n print(((n//2)-1)//2)", "x=int(input())\r\nprint((x%2==0)*((x//2-1)//2))", "# @author Matheus Alves dos Santos\n\ndef divisible_by(value, n):\n return ((value % n) == 0)\n\nlength = int(input())\nways = 0\n\nif (divisible_by(length, 2)):\n ways = (length // 4)\n \n if (divisible_by(length, 4)):\n ways -= 1\n\nprint(ways)", "n = int(input())\r\nprint([((n//2)-1)//2,0][n%2==1])", "n = int(input())\n\nif n % 2:\n x = 0\nelse:\n x = n // 4 - (not n % 4)\n\nprint(x)\n", "from collections import defaultdict, deque, Counter, OrderedDict\r\nfrom bisect import insort, bisect_right, bisect_left\r\nimport threading, sys\r\n\r\ndef main():\r\n n = int(input())\r\n if n%2 == 0:\r\n n //= 2\r\n ans = n // 2\r\n if n%2 == 0:\r\n ans -= 1\r\n else:\r\n ans = 0\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n \"\"\"sys.setrecursionlimit(400000)\r\n threading.stack_size(40960000)\"\"\"\r\n thread = threading.Thread(target=main)\r\n thread.start()", "n = int(input())\r\n\r\nif n%2 == 0:\r\n print((n-1)//4)\r\nelse:\r\n print(0)\r\n", "import math\r\n\r\ndef ncr(n,r):\r\n f = math.factorial\r\n return f(n) / f(r) / f(n-r)\r\n\r\nn = int(input())\r\nif n%2 == 0 :\r\n\tn = n//2\r\n\tif n% 2 == 0 : \r\n\t\tn= n-1 \r\n\tprint( n//2 ) \r\nelse :\r\n\tprint(0)\r\n\r\n", "\n\nn=int(input())\nprint(((n+3)//4-1)*(n%2==0))\n#jhbvvfdfvgxsedcrzawxsedcrvftgbynhujmik,ol.", "n = int(input())\r\nj = n/2\r\nc= j/2\r\nf = j-1\r\nif n>0:\r\n if n%2 ==1:\r\n print(0)\r\n if n%2 ==0:\r\n if j%2 == 1:\r\n print(int(f/2))\r\n if j%2 ==0:\r\n print(int(c-1))\r\n", "#code\r\n\r\nn = int(input())\r\n\r\nif n%2!=0:\r\n print(0)\r\nelse:\r\n a = n/2\r\n ans=0;\r\n\r\n\r\n if a%2==0:\r\n ans = a/2 -1\r\n\r\n else:\r\n ans = a/2\r\n \r\n\r\n print(int(ans))\r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n", "n = int(input())\nif (n % 2):\n\tprint(0)\nelse:\n\tans = 0\n\tprint((n // 2 - 1) // 2)\n", "N = int(input())\nif N % 2 != 0 or N <= 5:\n print(\"0\")\n exit()\n\nans = (N // 2 - 1) // 2\nprint(ans)\n", "n = int(input())\r\nx = 0\r\nif n%4 ==0:\r\n x = int((n//4) -1)\r\nelif n%2 == 0 :\r\n x = int(n//4)\r\nprint(x) ", "n = int(input())\r\nif n%2!=0:\r\n\tprint(0)\r\nelse:\r\n\tif (n//2)%2==0:\r\n\t\tprint(((n//2)-2)//2)\r\n\telse:\r\n\t\tprint((((n//2)-1)//2))", "n = int(input())\r\nif n % 2 == 1:\r\n print(0)\r\nelse: \r\n print((n-1) // 4)", "n = int(input())\r\nprint((n//2//2 if n%4 != 0 else n//2//2 - 1) if n%2==0 else 0)", "def main(a):\n if a % 2 == 1:\n return 0\n if (a // 2) % 2 == 0:\n return a // 4 - 1\n else:\n return a // 4\n\nprint(main(int(input())))\n", "n = int(input())\r\nif n % 2 == 1:\r\n print(0)\r\nelse:\r\n twoSides = n // 2\r\n if twoSides % 2 == 0:\r\n print(twoSides // 2 - 1)\r\n else:\r\n print(twoSides // 2)", "import math\r\nn=int(input())\r\nif n%2==0:\r\n print(math.ceil(n/4)-1)\r\nelse:\r\n print(0)", "t = int(input())\r\nif (t % 2) == 0:\r\n if (t % 4) == 0:\r\n print(t // 4 - 1)\r\n else:\r\n print(t // 4)\r\nelse:\r\n print(0)\r\n", "\r\nn=int(input())\r\nif n%2!=0:\r\n\tprint(0)\r\nelse:\r\n\ta=n//4\r\n\tif n%4==0:\r\n\t\ta-=1\r\n\tprint(a)", "i=int(input())\r\nif i%2==0:\r\n if i%4==0:\r\n print((i//2-2)//2)\r\n else:\r\n print((i//2-1)//2)\r\nelse:\r\n print('0')", "def solve(n):\r\n if n % 2 == 1:\r\n return 0\r\n res = n//4\r\n if n % 4 == 0:\r\n res -= 1\r\n return res\r\n\r\n\r\nn = int(input())\r\nprint(solve(n))\r\n", "a = int(input())\r\nif a%2==0:\r\n\tb = a//2\r\n\tif(b%2==0):\r\n\t\tprint (b//2 -1)\r\n\telse:\r\n\t\tprint (b//2)\r\nelse:\r\n\tprint(\"0\")", "def ways(n: int) -> int:\n \"\"\"ways returns the number of ways it is possible to split a rod into\n valid rectangles.\n \"\"\"\n if n < 6:\n return 0\n if n % 2 != 0:\n return 0\n return len(range(1, n//2))//2\n\nprint(ways(int(input())))\n", "def main():\r\n\tn = int(input())\r\n\tprint(solver(n))\r\n\r\ndef solver(n):\r\n\tif n % 2 == 1:\r\n\t\treturn 0\r\n\telse:\r\n\t\tmaxWidth = (n - 1) // 4\r\n\t\treturn maxWidth\r\n\r\n#print(solver(20))\r\n\r\nmain()\r\n", "\nn = int(input())\nprint(0 if n % 2 else (n - 1) // 4)\n \t\t\t \t \t \t \t\t \t\t\t\t\t\t \t \t", "n = int(input())\r\nt = 1\r\nif(n%2!=0):\r\n print(\"0\")\r\nelse:\r\n if(n%4!=0):\r\n print(n//4)\r\n else:\r\n print((n//4)-1)\r\n", "n = int(input())\r\nprint(0 if n%2==1 else (n//4 - (1 if n%4==0 else 0)))", "def up (n):\r\n\tif n==int(n):\r\n\t\treturn n\r\n\treturn int(n+1)\r\n\r\nn= int(input())\r\nif n%2 != 0:\r\n print(0)\r\nelse:\r\n print(int(up(n/4)-1))\r\n", "n = int(input())\r\nif n%2 == 1:\r\n print(0)\r\nelif n%4 == 0:\r\n print(n//4 - 1)\r\nelse:\r\n print(n//4)", "n = int(input())\nprint(0 if n & 1 else (n - 2) >> 2)\n", "# http://codeforces.com/contest/610/problem/A\n\nn = int(input())\n\nif (n%2 == 1):\n print(0)\nelse:\n half = int(n/2)\n temp = int(half/2)\n if(n%4 == 0):\n print(temp -1)\n else:\n print(temp)\n\n\n# 4\n\n# 3 1\n# 2 2\n# 1 3\n\n# 5\n\n# 1 4 \n# 2 3\n# 3 2\n# 4 1\n\n", "\r\nn = int(input())\r\nif n % 2 == 1:\r\n print(0)\r\n exit(0)\r\n\r\nres = (n+3)//4 - 1\r\nprint(res)\r\n\r\n", "n = int(input())\r\nans = (n // 2 + 1) // 2 - 1\r\nans *= (n + 1) % 2\r\nprint(ans)", "n=int(input())\r\nif n%2>0:print(0)\r\nelse:print(n//4 if n%4!=0 else n//4-1)", "#!/usr/bin/python\nimport sys\nN = int(input())\nif(N % 2 == 1):\n\tprint(0)\n\tsys.exit()\nelse:\n\tN = int(N / 2)\n\tif(N % 2 == 0):\n\t\tprint(int(N/2) - 1)\n\telse:\n\t\tprint(int(N/2))\n\n", "n=int(input());print([0,n//4-[1,0][n%4>0]][n%2<1])\r\n", "n=int(input())\r\nif(n%2==1):\r\n print(0)\r\nelse:\r\n n=n//2\r\n if(n%2==1):\r\n print(n//2)\r\n else:\r\n print((n//2)-1)", "# LUOGU_RID: 129646402\na=int(input())\nprint((a//2-1)//2 if a%2==0 else 0)" ]

[ "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\n\r\ndef gcd(a, b):\r\n if b > 0:\r\n return gcd(b, a % b)\r\n else:\r\n return a\r\n\r\n\r\nallGcd = array[0]\r\nfor elem in array:\r\n allGcd = gcd(allGcd, elem)\r\n\r\nif allGcd > 1:\r\n print(-1)\r\nelse:\r\n ones = 0\r\n for elem in array:\r\n if elem == 1:\r\n ones += 1\r\n\r\n if ones > 1:\r\n print(n - ones)\r\n else:\r\n res = 2000000000\r\n for i in range(n):\r\n tmp = array[i]\r\n for j in range(i, n):\r\n tmp = gcd(tmp, array[j])\r\n if tmp == 1:\r\n res = min(res, j-i)\r\n print(n + res - 1)\r\n", "import math\r\n\r\ndef iterArr(arr, num):\r\n dist = num\r\n for i in range(num):\r\n for j in range(i+1, num):\r\n if math.gcd(arr[i], arr[j]) == 1:\r\n if j-i < dist:\r\n dist = j-i\r\n return dist\r\n\r\nn = int(input())\r\narrIn = list(map(int, input().split()))\r\ni = arrIn.count(1)\r\nif i > 0:\r\n print(n-i)\r\nelse:\r\n dist1 = iterArr(arrIn, n)\r\n if dist1 == n:\r\n arr1 = []\r\n for k in range(n-1):\r\n arr1.append(math.gcd(arrIn[k], arrIn[k+1]))\r\n lenArr1 = len(arr1)\r\n dist2 = iterArr(arr1, lenArr1)\r\n if dist2 == lenArr1:\r\n print(-1)\r\n else:\r\n print(dist2+n)\r\n else:\r\n print(n-1+dist1)", "def gcd(a,b):\r\n\tif b==0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn(gcd(b,a%b))\r\n\r\nn = int(input())\r\nlst = list()\r\nlst = input().split(' ')\r\nnum=0\r\nflag=0\r\n\r\nfor i in lst:\r\n\tif int(i)==1:\r\n\t\tnum+=1\r\n\r\nif num!=0:\r\n\tprint(n - num)\r\n\texit()\r\n\r\nfor i in range(1,n):\r\n\tfor j in range(n-i):\r\n\t\tlst[j]=gcd(int(lst[j]),int(lst[j+1]))\r\n\t\tif int(lst[j])==1:\r\n\t\t\tprint(i+n-1)\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\tif flag!=0:\r\n\t\tbreak\r\nif not flag:\r\n\tprint(-1)", "import math\r\ndef answer(n,A):\r\n \r\n count=0\r\n for i in range(n):\r\n if A[i]==1:\r\n count+=1\r\n \r\n if count:\r\n return n-count\r\n flag=0\r\n mini=2147483647\r\n for i in range(0,n):\r\n g=A[i]\r\n for j in range(i,n):\r\n g=math.gcd(g,A[j])\r\n if g==1:\r\n flag=1\r\n if mini>(j-i):\r\n mini=j-i\r\n break\r\n if flag:\r\n return mini+n-1 \r\n return -1\r\n \r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(answer(n,arr))", "def gcd(a, b):\r\n while b:\r\n a, b = b, a%b\r\n return a\r\n\r\ndef gcda(a):\r\n ans = a[0]\r\n for i in range(1, len(a)):\r\n ans = gcd(a[i], ans)\r\n return ans\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nif 1 in a:\r\n print(sum([1 for i in a if i != 1]))\r\n exit()\r\n \r\nif gcda(a) != 1:\r\n print(-1)\r\n exit()\r\n\r\nmr=n+1\r\nfor i in range(n):\r\n g = a[i]\r\n for j in range(i+1, n):\r\n g = gcd(g, a[j])\r\n if g == 1:\r\n mr = min(mr, j-i)\r\n break\r\n \r\nprint(mr + n - 1) ", "def gcd(a,b):\r\n return b if a==0 else gcd(b%a,a)\r\n\r\ndef fun():\r\n if r :\r\n return n-r\r\n for i in range(1,n):\r\n for j in range(n):\r\n if j+i>=n :\r\n break\r\n a[j]=gcd(a[j],a[j+1])\r\n if a[j]==1:\r\n return i+n-1\r\n return -1\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nr = 0\r\nfor i in range(n) :\r\n if a[i]==1:\r\n r+=1\r\nprint(fun())\r\n", "import sys\r\nfrom math import gcd\r\nfrom collections import Counter as cc\r\ninput=sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\n\r\ndef ok(x):\r\n\tx+=1\r\n\tfor i in range(n-x+1):\r\n\t\tgd = l[i]\r\n\t\tfor j in range(i+1,i+x):\r\n\t\t\tgd = gcd(gd,l[j])\r\n\t\tif gd==1:\r\n\t\t\treturn 1\r\n\treturn 0\r\n\r\nt,=[1]\r\nfor _ in range(t):\r\n\tn, = I()\r\n\tl = I()\r\n\tan = n-max(l.count(1),1)\r\n\tgd = l[0]\r\n\tfor i in range(1,n):\r\n\t\tgd = gcd(gd,l[i])\r\n\tif gd>1:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tif 1 not in l:\r\n\t\t\tlo = 1;hi = n\r\n\t\t\twhile lo < hi:\r\n\t\t\t\tmd = (lo + hi)//2\r\n\t\t\t\tif ok(md):\r\n\t\t\t\t\thi = md\r\n\t\t\t\telse:\r\n\t\t\t\t\tlo = md+1\r\n\t\t\tan += lo\r\n\t\tprint(an)\r\n", "from math import gcd\nn = int(input())\narr = list(map(int, input().split()))\nones = arr.count(1)\nif ones > 0:\n print(n - ones)\nelse:\n gcds = [[0] * n for i in range(n)]\n for i in range(n):\n gcds[i][i] = arr[i]\n seglen = 10000\n for i in range(n + 1):\n for j in range(i + 1, n):\n gcds[i][j] = gcd(gcds[i][j - 1], arr[j])\n if gcds[i][j] == 1:\n seglen = min(seglen, j - i + 1)\n if seglen == 10000:\n print(-1)\n else:\n makeone = seglen - 1\n ones = 1\n res = makeone + n - ones\n print(res)\n", "import sys\r\n# sys.setrecursionlimit(300000)\r\nimput = sys.stdin.readline\r\nfrom math import gcd\r\n\r\nn = int(input())\r\na = [0] + list(map(int, input().split()))\r\ntree = [0] * ((n * 4) + 10)\r\n \r\ndef pushup(o):\r\n tree[o] = gcd(tree[o << 1], tree[o << 1 | 1])\r\n\r\ndef build(o, l, r):\r\n if l == r:\r\n tree[o] = a[l]\r\n return \r\n mid = (l + r) >> 1\r\n build(o << 1, l, mid)\r\n build(o << 1 | 1, mid + 1, r)\r\n pushup(o)\r\n\r\ndef query(o, l, r, ql, qr):\r\n if ql <= l and qr >= r:\r\n return tree[o]\r\n mid = (l + r) >> 1\r\n res = 0\r\n if ql <= mid:\r\n res = gcd(res, query(o << 1, l, mid, ql, qr))\r\n if qr > mid:\r\n res = gcd(res, query(o << 1 | 1, mid + 1, r, ql, qr))\r\n return res\r\n\r\nbuild(1, 1, n)\r\nif 1 in a:\r\n print(n - a.count(1))\r\n sys.exit(0)\r\nif query(1, 1, n, 1, n) != 1:\r\n print(-1)\r\n sys.exit(0)\r\n\r\nans = int(1e9) + 10\r\nl = 1\r\nfor r in range(1, n + 1):\r\n while query(1, 1, n, l, r) == 1:\r\n ans = min(ans, r - l)\r\n l += 1\r\nprint(ans + n - 1)\r\n\r\n'''\r\n3\r\n4 6 9\r\n'''\r\n", "import sys\r\nread = lambda: sys.stdin.readline().strip()\r\nreadi = lambda: map(int, read().split())\r\nfrom collections import *\r\nfrom math import *\r\n\r\ndef gcd(a, b):\r\n while a != b:\r\n if a > b:\r\n a = a - b\r\n else:\r\n b = b - a\r\n return a\r\n\r\nn = int(read())\r\nnums = list(readi())\r\nones = nums.count(1)\r\nif ones > 0:\r\n print(n - ones)\r\nelse:\r\n ans = None\r\n minimum = float('inf')\r\n for i in range(n):\r\n gc = nums[i]\r\n for j in range(i+1, n):\r\n gc = gcd(gc, nums[j])\r\n if gc == 1:\r\n minimum = min(minimum, j - i)\r\n break\r\n\r\n if minimum != float('inf'):\r\n ans = minimum + (n - 1)\r\n print(ans)\r\n else:\r\n print(-1)", "import traceback\r\nimport math\r\n\r\ndef main(): \r\n N = int(input())\r\n nums = list(map(int, input().split()))\r\n\r\n ones = nums.count(1)\r\n if ones > 0:\r\n return N - ones\r\n\r\n ans = float('inf')\r\n for l in range(N-1, -1, -1):\r\n gcd = nums[l]\r\n for r in range(l+1, N):\r\n if r-l > ans:\r\n break\r\n gcd = math.gcd(gcd, nums[r])\r\n if gcd == 1:\r\n ans = min(ans, r-l)\r\n break\r\n return N - 1 + ans if ans != float('inf') else -1\r\n\r\ntry:\r\n ans = main()\r\n print(ans)\r\nexcept Exception:\r\n traceback.print_exc()", "import math\n\n\ndef solve(arr):\n ones = arr.count(1)\n n = len(arr)\n\n if ones:\n return n - ones\n\n ans = math.inf\n for i in range(n):\n cur = arr[i]\n for j in range(i+1, n):\n cur = math.gcd(cur, arr[j])\n if cur == 1:\n ans = min(ans, j - i + n - 1)\n\n return ans if ans < math.inf else -1\n\n\nif __name__ == '__main__':\n _ = input()\n print(solve([int(x) for x in input().split()]))\n\n", "import sys\r\nfrom math import sqrt, gcd, ceil, log\r\nfrom bisect import bisect\r\nfrom collections import defaultdict, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\n\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\n\r\ndef solve():\r\n n = int(input()); arr = read()\r\n one_count = arr.count(1)\r\n if one_count:\r\n print(n - one_count)\r\n return\r\n ans = 10**5\r\n flag = 0\r\n for i in range(n):\r\n _gcd = arr[i]\r\n for j in range(i+1, n):\r\n _gcd = gcd(_gcd, arr[j])\r\n if _gcd == 1:\r\n flag = 1\r\n ans = min(ans, j-i+n-1)\r\n break\r\n print([-1, ans][flag == 1])\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nc=0\r\nans = n\r\nfor i in a :\r\n\tif(i==1):\r\n\t c+=1\r\nif (c>=1):\r\n\tprint(n-c)\r\n\tquit()\r\n\t\r\nfor i in range(n) :\r\n\tt=a[i]\r\n\tfor j in range(i, n) :\r\n\t\tt= math.gcd(t,a[j])\r\n\t\tif(t==1):\r\n\t\t ans = min(ans,j-i)\r\n\t\t\t\r\nif(ans == n):\r\n\tprint(-1)\r\nelse :\r\n\tprint(ans+n-1)", "import math\r\nn=int(input())\r\narr=[int(x) for x in input().split()]\r\nk=arr.count(1)\r\nif k!=0:\r\n print(n-k)\r\nelse:\r\n min=float('inf')\r\n for i in range(n-1):\r\n g=arr[i]\r\n # print(i,\":\")\r\n for j in range(i+1,n):\r\n # print(j)\r\n g=math.gcd(g,arr[j])\r\n # print(g)\r\n if g==1:\r\n if j-i<min:\r\n min=j-i\r\n break\r\n # print(\"\\n\")\r\n if(min<float('inf')):\r\n print(min+n-1)\r\n else:\r\n print(\"-1\")", "n=int(input())\r\na=list(map(int,input().split()))\r\ndef gcd(a, b):\r\n if a < b:\r\n a, b = b, a\r\n if a % b == 0:\r\n return b\r\n if a == 1 or b == 1:\r\n return 1\r\n\r\n return gcd(b, a % b)\r\ncnt=0\r\nfor i in range(n):\r\n if a[i]==1:\r\n cnt+=1\r\nif cnt>0:\r\n print(n-cnt)\r\nelse:\r\n minimum=1e10\r\n for i in range(0,n):\r\n x=a[i]\r\n for j in range(i+1,n):\r\n x=gcd(x,a[j])\r\n if x==1:\r\n minimum=min(minimum,j-i+1)\r\n if minimum==1e10:\r\n print(-1)\r\n else:\r\n print(n-1+(minimum-1))\r\n", "def gcd1(x,y):\r\n if y==0:\r\n return x\r\n else:\r\n return gcd1(y,x%y)\r\ndef minimumCount(a):\r\n count_one=sum([1 for i in a if i==1])\r\n if count_one>0:\r\n return len(a)-count_one\r\n L=0\r\n R=1\r\n G=a[L]\r\n count=0\r\n while R!=len(a):\r\n G=gcd1(G,a[R])\r\n if gcd1(a[L],a[R])==1:\r\n count=0\r\n break\r\n if G!=1:\r\n if G!=a[L] or G!=a[R]:\r\n count=count+1\r\n L+=1\r\n R+=1\r\n if G==1:\r\n return count+len(a)\r\n else:\r\n return -1\r\n\r\nn=int(input())\r\nlist_of_numbers=[int(i) for i in input().split()]\r\nprint(minimumCount(list_of_numbers))", "import sys\r\nimport fractions\r\n\r\nn = int(sys.stdin.readline())\r\ndata = list(map(int, sys.stdin.readline().split()))\r\n\r\none_count = 0\r\nfor v in data:\r\n if v == 1:\r\n one_count += 1\r\n\r\nif one_count > 0:\r\n print(n - one_count)\r\nelse:\r\n ans = -1\r\n for i in range(0, n):\r\n v = data[i]\r\n for j in range(i + 1, n):\r\n v = fractions.gcd(v, data[j])\r\n if v == 1:\r\n cand = j - i + n - 1\r\n if ans == -1 or cand < ans:\r\n ans = cand\r\n print(ans)\r\n", "from math import gcd\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\n\r\ndef getans():\r\n\tcnt1s = arr.count(1)\r\n\tif cnt1s>0: return n-cnt1s\r\n\tminlen = n\r\n\tfor i in range(n):\r\n\t\tg = arr[i]\r\n\t\tfor j in range(i+1,n):\r\n\t\t\tg = gcd(g,arr[j])\r\n\t\t\tif g==1:\r\n\t\t\t\tminlen = min(minlen,j-i)\r\n\t\t\t\tbreak\r\n\tif minlen==n: return -1\r\n\treturn (minlen+n-1)\r\n\r\nprint(getans())", "def read():\r\n\treturn list(map(int, input().split()))\r\n\r\n\r\ndef gcd(a, b):\r\n\twhile b:\r\n\t\ta, b = b, a % b\r\n\treturn a\r\n\r\ndef check(l):\r\n\tfor t in l:\r\n\t\tif t != 1:\r\n\t\t\treturn False\r\n\telse:\r\n\t\treturn True\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tl = read()\r\n\r\n\tones = len(list(filter(lambda i: i == 1, l)))\r\n\tif ones > 0:\r\n\t\treturn n - ones\r\n\tsum = 1e10\r\n\tfor i in range(n - 1):\r\n\t\tg = 0\r\n\t\tfor j in range(i, n):\r\n\t\t\tg = gcd(g, l[j])\r\n\t\t\tif g == 1:\r\n\t\t\t\tsum = min(sum, j - i + n - 1)\r\n\treturn sum if sum != 1e10 else -1\r\nprint(main())", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint\r\nmod = 1000000007\r\n\r\n\r\ndef vector(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef matrix(rowNum, colNum, val=0):\r\n mat = []\r\n for i in range(rowNum):\r\n collumn = [val for j in range(colNum)]\r\n mat.append(collumn)\r\n return mat\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in a:\r\n if i == 1:\r\n cnt += 1\r\nif cnt > 0:\r\n print(n - cnt)\r\n sys.exit()\r\nans = 10**4\r\nfor i in range(n):\r\n g = a[i]\r\n for j in range(i + 1, n):\r\n g = math.gcd(g, a[j])\r\n if g == 1:\r\n ans = min(ans, n - 1 + j - i)\r\nif ans == 10**4:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nmi=100000000000000000000\r\nfor i in range(n) :\r\n prev=l[i]\r\n if prev==1 :\r\n mi=1\r\n for j in range(i+1,n) :\r\n prev=math.gcd(l[j],prev)\r\n if prev==1 :\r\n mi=min(mi,j-i)\r\nif mi!=100000000000000000000 :\r\n print(mi+n-l.count(1)-1)\r\nelse :\r\n print(-1)\r\n \r\n \r\n", "import math\r\nn = int(input())\r\narr = list(map(int, input().strip().split()))\r\n\r\ngcd = arr[0]\r\nfor i in arr:\r\n gcd = math.gcd(i, gcd)\r\n\r\nif gcd > 1:\r\n print(-1)\r\nelse:\r\n\r\n cnt = arr.count(1)\r\n if cnt > 0:\r\n print(n-cnt)\r\n else:\r\n mini = float('inf')\r\n for i in range(n-1):\r\n gcd = arr[i]\r\n for j in range(i+1, n):\r\n gcd = math.gcd(arr[j], gcd)\r\n if gcd == 1:\r\n mini = min(j-i, mini)\r\n break\r\n print(mini + n-1)\r\n\r\n", "import math\r\n\r\n# Input the number of elements in the list\r\nnum_elements = int(input())\r\n\r\n# Input the list of integers\r\nelements = list(map(int, input().split()))\r\n\r\nmin_operations, count_ones = num_elements, elements.count(1)\r\n\r\nfor i in range(num_elements):\r\n current_gcd = elements[i]\r\n for j in range(i + 1, num_elements):\r\n current_gcd = math.gcd(current_gcd, elements[j])\r\n if current_gcd == 1:\r\n min_operations = min(min_operations, j - i - 1)\r\n\r\nif count_ones > 0:\r\n print(num_elements - count_ones)\r\nelif min_operations == num_elements:\r\n print(-1)\r\nelse:\r\n print(num_elements + min_operations)\r\n", "from math import gcd\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nn1 = a.count(1)\r\nif n1:\r\n print(n - n1)\r\n exit()\r\nret = float('inf')\r\nfor left in range(n):\r\n g = a[left]\r\n for right in range(left, n):\r\n g = gcd(g, a[right])\r\n if g == 1:\r\n ret = min(ret, n + right - left - 1)\r\nprint(ret if ret != float('inf') else -1)", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nx=[1 for x in a if x==1]\r\nx=len(x)\r\nif(x>=1): \r\n print(n-x)\r\n quit()\r\nans=n\r\nfor i in range(n):\r\n g=a[i]\r\n for j in range(i,n):\r\n g=math.gcd(g,a[j])\r\n if(g==1): ans=min(ans,j-i)\r\nif(ans==n): print(-1)\r\nelse: print(ans+n-1)\r\n", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial\r\nfrom collections import deque\r\ndef gcd(a,b):\r\n\ta,b=max(a,b),min(a,b)\r\n\twhile a%b!=0:\r\n\t\ta,b=b,a%b\r\n\treturn b\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nt=l.count(1)\r\nif t>=1:\r\n\tprint(n-t)\r\n\texit()\r\nelse:\r\n\tz=list(l)\r\n\ta=1\r\n\twhile len(z)>1:\r\n\t\tfor i in range(len(z)-1):\r\n\t\t\tz[i]=gcd(z[i],l[i+a])\r\n\t\t\tif z[i]==1:\r\n\t\t\t\tprint(n-1+a)\r\n\t\t\t\texit()\r\n\t\tz.pop()\r\n\t\ta+=1\r\nprint(-1)", "import math\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\n\r\nfor i in a :\r\n\tif i == 1 :\r\n\t\tcnt += 1\r\n\t\t\r\nif cnt >= 1 :\r\n\tprint(n - cnt)\r\n\tquit()\r\n\t\r\nans = n\r\nfor i in range(n) :\r\n\ttmp = a[i]\r\n\tfor j in range(i, n) :\r\n\t\ttmp = math.gcd(tmp, a[j])\r\n\t\t#print(tmp)\r\n\t\tif tmp == 1 :\r\n\t\t\tans = min(ans, j - i)\r\n\t\t\t\r\nif ans == n :\r\n\tprint(-1)\r\nelse :\r\n\tprint(ans + n - 1)", "def gcd(a, b):\r\n while a!=0 and b!=0:\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n return a+b\r\nn=int(input())\r\na=list(map(int, input().split()))\r\nc=0\r\nif (a.count(1)>0):\r\n print (n-a.count(1))\r\nelse:\r\n f=1\r\n while (a.count(1)==0):\r\n if (len(a)-c==1 and a[0]!=1):\r\n f=0\r\n break\r\n c+=1\r\n for i in range(len(a)-c):\r\n a[i]=gcd(a[i], a[i+1])\r\n if (f==0):\r\n print (-1)\r\n else:\r\n print (c+n-1)", "from math import gcd\n\n\ndef main():\n n = int(input())\n a = b = list(map(int, input().split()))\n if 1 in b:\n print(n - b.count(1))\n return\n while b:\n b = [gcd(*p) for p in zip(a, b[1:])]\n if 1 in b:\n print(n * 2 - len(b) - 1)\n return\n print(-1)\n\n\nif __name__ == '__main__':\n main()\n", "from math import gcd\r\n\r\nn = int(input())\r\nlst = [int(i) for i in input().split()]\r\nd, i, g = n, -1, lst[0]\r\nfor j in range(n):\r\n g = gcd(g, lst[j])\r\n if g == 1:\r\n g = lst[j]\r\n for k in range(j, i, -1):\r\n g1 = gcd(g, lst[k])\r\n if g1 == 1:\r\n d = min(d, j - k)\r\n i = k\r\n break\r\n g = g1\r\nif d == 0:\r\n print(n - lst.count(1))\r\nelif d < n:\r\n print(d - 1 + n - lst.count(1))\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "n = int(input())\nA = list(map(int, input().split()))\nif n == 1:\n if A[0] != 1:\n print(-1)\n else:\n print(0)\n exit()\n\nimport math\nfrom functools import reduce\n\ndef gcd(*numbers):\n return reduce(math.gcd, numbers)\n\ndef gcd_list(numbers):\n return reduce(math.gcd, numbers)\n\ng = gcd_list(A)\nif g != 1:\n print(-1)\n exit()\n\ncnt = 0\nfor i in range(n):\n if A[i] == 1:\n cnt += 1\nif cnt:\n print(n-cnt)\n exit()\n\nwhile len(A) >= 2:\n B = []\n for i in range(len(A)-1):\n B.append(gcd(A[i], A[i+1]))\n for i in range(len(B)):\n if B[i] == 1:\n print(n-len(B)+n-1)\n exit()\n A = B\n", "from math import gcd\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = [[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(n):\r\n b[i][i] = a[i]\r\n if a[i] == 1:\r\n print(n - a.count(1))\r\n exit()\r\n\r\nfor j in range(1, n):\r\n for i in range(n-j):\r\n t = gcd(b[i][i], b[i + 1][i + j])\r\n if t == 1:\r\n print(n + j - 1)\r\n exit()\r\n else:\r\n b[i][i+j] = t\r\nprint(-1)", "import math\r\n\r\nn=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\n\r\ncnt=0\r\nfor i in a:\r\n if i==1:\r\n cnt+=1\r\n\r\nif cnt!=0:\r\n print(n-cnt)\r\nelse: \r\n choto=9999999999\r\n flg=0\r\n for i in range(n-1):\r\n gosagu=a[i]\r\n for j in range(i+1,n):\r\n gosagu=math.gcd(gosagu,a[j])\r\n if gosagu==1:\r\n choto=min(choto,j-i)\r\n flg=1\r\n\r\n if flg==1: \r\n print(n-1+choto)\r\n else:\r\n print(-1) ", "import math\r\nn = int(input())\r\nA = list(map(int,input().split()))\r\nans = n\r\ncnt = A.count(1)\r\n\r\nfor i in range(n):\r\n m = A[i]\r\n for j in range(i+1,n):\r\n m = math.gcd(m,A[j])\r\n if m == 1:\r\n ans = min(ans,j-i-1)\r\nif cnt > 0:\r\n print(n-cnt)\r\n\r\nelif ans == n:\r\n print(-1)\r\nelse:\r\n print(n + ans)", "# -*- coding:utf-8 -*-\n# author : utoppia\n# description : solutions for codeforces\n# updated at : 2023-08-28 00:34:32\n# -----------------------------------------------------\n# File Name : $%file%$\n# Language : Python\n# ----------------------------------------------------\n\nfrom math import gcd\n\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n if 1 in a:\n return n - a.count(1)\n b = []\n for i in range(n - 1):\n b.append(gcd(a[i], a[i + 1]))\n\n ans = 10**9\n for i in range(n - 1):\n if b[i] == 1:\n ans = min(ans, 0)\n for j in range(i + 1, n - 1):\n if gcd(b[i], b[j]) == 1:\n ans = min(ans, j - i)\n\n if ans == 10**9:\n return -1\n\n return n + ans\n\n\nif __name__ == \"__main__\":\n print(main())\n", "import math\r\nn = int(input())\r\na = []\r\nk = 0\r\nline = input().split()\r\nfor i in range(n):\r\n a.append(int(line[i]))\r\n if a[i] != 1:\r\n k += 1\r\n continue\r\nans = n\r\nfor i in range(n):\r\n temp = a[i]\r\n cur = 0\r\n for j in range(i + 1, n):\r\n cur += 1\r\n temp = math.gcd(temp, a[j])\r\n if temp == 1:\r\n if ans > cur:\r\n ans = cur\r\n pass\r\n pass\r\n continue\r\n continue\r\nif k == 0:\r\n print('0')\r\nelif ans == n:\r\n print('-1')\r\nelse:\r\n print(ans + k - 1)\r\n", "n=int(input(''))\r\ns=list(map(int,input('').split()))\r\na=s.count(1)\r\nans=0\r\ndef gcd(x,y):\r\n x,y=max(x,y),min(x,y)\r\n if y==0:\r\n return x\r\n return gcd(y,x%y)\r\nif a!=0:\r\n ans=n-a\r\nelse:\r\n dp=[[0 for i in range(n)] for j in range(n)]\r\n for i in range(n):\r\n dp[i][i]=s[i]\r\n mins=n\r\n for i in range(n):\r\n for j in range(i,n):\r\n dp[i][j]=gcd(dp[i][j-1],s[j])\r\n if dp[i][j]==1:\r\n mins=min(j-i,mins)\r\n if mins==n:\r\n ans=-1\r\n else:\r\n ans=mins+(n-1)\r\nprint(ans)\r\n \r\n \r\n", "from math import sqrt,gcd,ceil,floor,log,factorial\r\nfrom itertools import permutations,combinations\r\nfrom collections import Counter, defaultdict\r\nimport collections,sys,threading\r\nimport collections,sys,threading\r\n#sys.setrecursionlimit(10**9)\r\n#threading.stack_size(10**8)\r\n\r\ndef ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\nn=ii()\r\na=li()\r\n\r\nif a.count(1)>0:\r\n print(n-a.count(1))\r\n \r\nelse:\r\n dp=[[0 for j in range(n)] for i in range(n)]\r\n for i in range(n):\r\n for j in range(i,n):\r\n if i==j:\r\n dp[i][j]=a[j]\r\n \r\n else:\r\n dp[i][j]=gcd(dp[i][j-1],a[j])\r\n \r\n res=10**5\r\n flag=0\r\n for i in range(n):\r\n for j in range(i,n):\r\n if dp[i][j]==1:\r\n flag=1\r\n res=min(res,j-i)\r\n \r\n if flag==0:\r\n print(-1)\r\n \r\n else:\r\n print(res+n-1)\r\n ", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nimport math \r\nfrom types import GeneratorType\r\n#from functools import cache 3.9\r\nmod = 10**9+7\r\ninf = int(1e20)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nMI = lambda :map(int,input().split())\r\nli = lambda :list(MI())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\n\r\n\r\n\r\ndef gcd(n1,n2):\r\n return gcd(n2,n1%n2) if n2>0 else n1 #最大公约数\r\n\r\n\r\nn=ii()\r\n\r\narr=li()\r\n\r\nif 1 in arr:\r\n print(n-arr.count(1))\r\n exit()\r\n\r\ng=arr[0]\r\n\r\nfor a in arr:\r\n g=gcd(g,a)\r\n\r\nif g!=1:\r\n print(-1)\r\n exit()\r\n\r\nst=[]\r\nmin_size=n\r\nfor i,a in enumerate(arr):\r\n for j in range(len(st)):\r\n st[j][0]=gcd(st[j][0],a)\r\n nst=[]\r\n for v,j in st:\r\n if len(nst)==0 or v!=nst[-1][0]:\r\n nst.append([v,j])\r\n nst.append([a,i])\r\n for j in range(len(nst)-1):\r\n v,s,e=nst[j][0],nst[j][1],nst[j+1][1]-1\r\n st=nst\r\n if st[0][0]==1:\r\n min_size=min(min_size,i-(st[1][1]-1)+1)\r\n #print(st)\r\n if len(st)>1 and st[-1][0]==st[-2][0]:\r\n st.pop()\r\n\r\nprint(min_size+n-2)\r\n\r\n", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\n\r\ncount=0\r\nfor i in range(n):\r\n if l[i]==1:\r\n count+=1\r\n\r\nif count!=0:\r\n print(n-count)\r\n exit()\r\n \r\nss=0\r\nmi=10**9+7\r\nfor i in range(n):\r\n ss=l[i]\r\n for j in range(i+1,n):\r\n ss=math.gcd(l[j],ss)\r\n if ss==1:\r\n mi=min(mi,j-i)\r\n\r\nif mi==10**9+7:\r\n print(-1)\r\nelse:\r\n print(mi+n-1) ", "from math import*\r\ninf=10**9+1\r\nn=int(input())\r\nq=list(map(int,input().split()))\r\nc=0\r\nr=inf\r\nfor i in q: c+=(i==1)\r\nif c==0:\r\n for i in range(n):\r\n g=gcd(q[i],q[i])\r\n for j in range(i,n):\r\n g=gcd(g,q[j])\r\n if g==1: r=min(j-i+n-1,r)\r\n if r==inf: print(-1)\r\n else: print(r)\r\nelse: print(n-c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncnt=l.count(1)\r\nif cnt>0:\r\n print(n-cnt)\r\n exit(0)\r\nimport math\r\nm=n+1\r\nfor i in range(n):\r\n g=l[i]\r\n for j in range(n-i):\r\n g=math.gcd(g,l[i+j])\r\n if g==1:\r\n m=min(m,j)\r\nif m==n+1:\r\n print(-1)\r\nelse:\r\n print(m+n-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import gcd\r\nn = int(input())\r\nls = list(map(int,input().split()))\r\nhcf, ct1 = ls[0], 0\r\nfor i in range(n) :\r\n if ls[i] == 1 :\r\n ct1 += 1\r\n hcf = gcd(hcf,ls[i])\r\nif hcf != 1 :\r\n print(-1)\r\nelif ct1 :\r\n print(n-ct1)\r\nelse :\r\n mn = 5000\r\n for i in range(n-1) :\r\n hcf = ls[i]\r\n for j in range(i+1,n) :\r\n hcf = gcd(hcf,ls[j])\r\n if hcf == 1 :\r\n mn = min(mn,j-i)\r\n break\r\n print(mn+n-1)", "def gcd(x, y):\r\n while y:\r\n x, y = y, x%y\r\n return x\r\nn=int(input())\r\nAr=[int(x) for x in input().split()]\r\nG=Ar[0]\r\nfor i in range(1,n):\r\n G=gcd(G,Ar[i])\r\nif 1 in Ar:\r\n cnt=Ar.count(1)\r\n print(n-cnt)\r\nelif G!=1:\r\n print(-1)\r\nelse:\r\n l=n\r\n for i in range(n-1):\r\n G=Ar[i]\r\n for j in range(i+1,n):\r\n G=gcd(Ar[j],G)\r\n if G==1:\r\n l=min(l,j-i)\r\n break\r\n print(l+n-1)", "import math\nn = int(input())\na = list(map(int, input().split()))\nev = 0\none = 0\nodd = 0\nfor x in a:\n if x == 1:\n one += 1\n if x % 2 == 0:\n ev += 1\n else:\n odd += 1\nif one > 0:\n print(n - one)\n exit()\nif ev == n or odd == n:\n print(-1)\n exit()\nt = n + 1\nfor i in range(n):\n g = a[i]\n x = 0\n for j in range(i + 1, n):\n g = math.gcd(g, a[j])\n x += 1\n if g == 1:\n t = min(t, x)\nprint(n + t - 1)", "from math import gcd\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=a.count(1)\r\nif m>0:\r\n print(n-m)\r\n exit()\r\nans=-1\r\nfor i in range(n):\r\n d=a[i]\r\n c=i\r\n for j in range(i+1,n):\r\n d=gcd(d,a[j])\r\n if d==1:\r\n c=j\r\n break\r\n if c>i:\r\n if ans<0:\r\n ans=c-i+n-1\r\n else:\r\n ans=min(ans,c-i+n-1)\r\nprint(ans)", "from math import gcd\nn = int(input())\na = list(map(int, input().split()))\ng = a[0]\none = 0\nev = 0\nodd = 0\nfor x in a:\n if x == 1:\n one += 1\n if x % 2 == 0:\n ev += 1\n else:\n odd += 1\nif one > 0:\n print(n - one)\nelif odd == n or ev == n:\n print(-1)\nelse:\n t = n + 2\n for i in range(n):\n g = a[i]\n x = 0\n for j in range(i + 1, n):\n x += 1\n g = gcd(g, a[j])\n if g == 1:\n t = min(t, x)\n print(n + t - 1)", "n = int(input())\r\n\r\nl1 = list( map( int, input().split()))\r\n\r\nflag = -1\r\nsz = n-l1.count(1)\r\n\r\nif (n - sz) > 0:\r\n flag = sz\r\nimport math\r\n\r\nfor j in range(n):\r\n if flag != -1:\r\n break\r\n if l1.count(1) > 0:\r\n flag = j + sz - 1\r\n break\r\n\r\n for i in range(n-1):\r\n l1[i] = math.gcd(l1[i], l1[i+1])\r\n\r\n l1.pop()\r\n n -= 1\r\n\r\nprint(flag)", "from math import gcd\n\nn = int(input())\na = list(map(int, input().split()))\n\nans = -1\n\nones = a.count(1)\ng = a[0]\nfor x in a:\n g = gcd(g, x)\n\nif ones > 0:\n ans = n - ones\nelif g == 1:\n ans = n + n - 1\n for i in range(n):\n g = a[i]\n sz = 1\n while i + 1 < n and g > 1:\n sz += 1\n i += 1\n g = gcd(g, a[i])\n if g == 1:\n ans = min(ans, sz - 1 + n - 1)\n\nprint(ans)\n", "def gcd(a,b):\r\n while b:\r\n a%=b\r\n a,b=b,a\r\n return a\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ng=l[0]\r\nfor i in range(1,n):\r\n g=gcd(g,l[i])\r\nif g!=1:\r\n print(-1)\r\nelse:\r\n a=l.count(1)\r\n if a>0:\r\n print(n-a)\r\n else:\r\n ans=float('inf')\r\n for i in range(n):\r\n g=l[i]\r\n for j in range(i+1,n):\r\n g=gcd(g,l[j])\r\n if g==1:\r\n d=j-i+n-1\r\n #print(d)\r\n ans=min(ans,d)\r\n print(ans)", "import math\r\nfrom sys import stdin\r\nn= int(stdin.readline().rstrip())\r\nl = list(map(int, stdin.readline().rstrip().split(\" \")))\r\nm = min(l)\r\nif m == 1:\r\n print(n-l.count(1))\r\n\r\nelse:\r\n mi = 9999999999\r\n for i in range(n):\r\n gcd = l[i]\r\n for j in range(i+1, n):\r\n gcd = math.gcd(l[j], gcd)\r\n if gcd == 1:\r\n mi = min(j-i, mi)\r\n break\r\n if mi == 9999999999:\r\n print(-1)\r\n else:\r\n print(n + mi-1)", "\r\n\r\n\r\nn= int(input())\r\n\r\nt= list(map(int,input().split()))\r\n\r\n\r\n\r\none =0\r\nfor j in t:\r\n if j ==1 :\r\n one+=1\r\n\r\nm=n+1\r\n\r\nif one >0:\r\n print(n-one)\r\nelse:\r\n import math\r\n\r\n for i in range(n):\r\n u=t[i]\r\n for j in range(i+1,n):\r\n u= math.gcd(u,t[j])\r\n\r\n if u==1:\r\n m= min(m, j-i)\r\n break\r\n\r\n if m==n+1:\r\n print(-1)\r\n else:\r\n print(m+n-1)\r\n", "# HEY STALKER\r\nimport math\r\nfrom collections import Counter\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\ng = l[0]\r\nfor t in l:\r\n g = math.gcd(g,t)\r\nif g != 1:\r\n print(-1)\r\nelse:\r\n k = 1e18\r\n for i in range(n):\r\n g = 0\r\n for j in range(i,n):\r\n g = math.gcd(g,l[j])\r\n if g == 1:\r\n k = min(k,(j-i))\r\n break\r\n x = Counter(l)\r\n no_1 = x[1]\r\n if no_1:\r\n print(n - no_1)\r\n else:\r\n print(n + k - 1)", "import math\r\ndef slve(n,a):\r\n c1=a.count(1);ans=10**20\r\n if c1>0:return n-c1\r\n for i in range(n):\r\n g=a[i]\r\n for j in range(i+1,n):\r\n g=math.gcd(g,a[j])\r\n if g==1:ans=min(ans,j-i)\r\n return -1 if ans==10**20 else n-1+ans\r\nn=int(input());a=list(map(int,input().split()));print(slve(n,a))\r\n", "from math import gcd\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\nmark = False\r\nl, r = -1, -1\r\nif 1 in data:\r\n print(n - data.count(1))\r\n exit(0)\r\ngc = data[0]\r\nfor i in range(n):\r\n gc = data[i]\r\n for j in range(i, n):\r\n gc = gcd(gc, data[j])\r\n if gc == 1:\r\n mark = True\r\n if abs(i - j) + 1 < r - l + 1 or r == -1:\r\n r, l = max(i, j), min(i, j)\r\nif not mark:\r\n print(-1)\r\n exit(0)\r\nprint(n + r - l - 1)", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nt=[1 for i in a if i==1]\r\nif len(t)>0:\r\n print(n-len(t))\r\n quit()\r\nelse:\r\n ans=n\r\n for i in range(n):\r\n g=a[i]\r\n for j in range(i,n):\r\n g=math.gcd(g,a[j])\r\n if g==1:\r\n ans=min(ans,(j-i))\r\n #print(ans)\r\n if ans==n:\r\n print(-1)\r\n else:\r\n #print(ans)\r\n print(ans+n-1)\r\n ", "def gcd(a,b):\r\n\tif b==0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn gcd(b,a%b)\r\nN=int(input())\r\na=[int(x) for x in input().split()]\r\n\r\ncount1=0\r\nfor i in range(N):\r\n\tif a[i]==1:\r\n\t\tcount1+=1\r\nif count1>0:\r\n\tprint(N-count1)\r\n\texit()\r\n\r\nminimum=N+1\r\nfor i in range(N):\r\n\tL=gcd(0,a[i])\r\n\tfor j in range(N-i):\r\n\t\tL=gcd(L,a[i+j])\r\n\t\tif L==1:\r\n\t\t\tminimum=min(minimum,j)\r\nif minimum!=N+1:\r\n\tprint(N+minimum-1)\r\nelse:\r\n\tprint(\"-1\")\r\n", "from math import gcd\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncnt = arr.count(1)\r\nif cnt != 0:\r\n print(n - cnt)\r\n exit()\r\n\r\ndis = int(2e9)\r\nfor i in range(len(arr)):\r\n g = arr[i]\r\n for j in range(i+1, len(arr)):\r\n g = gcd(g, arr[j])\r\n if g == 1:\r\n dis = min(dis, j-i)\r\n\r\nprint(-1 if dis == int(2e9) else n + dis - 1)\r\n", "from math import gcd\nn = int(input())\narr = list(map(int, input().split()))\nif arr.count(1) > 0:\n print(n - arr.count(1))\n exit()\n\nans = float(\"inf\")\nfor i in range(n):\n acc = arr[i]\n l = float(\"inf\")\n for j in range(i+1, n):\n acc = gcd(acc, arr[j])\n if acc == 1:\n l = j-i\n break\n ans = min(ans, l)\nif ans == float(\"inf\"):\n print(-1)\nelse:\n print(ans+n-1)\n", "n = int(input())\r\nai = list(map(int,input().split()))\r\nnum = 0\r\nar = [[0] * n for i in range(n)] \r\nfor i in range(n):\r\n ar[0][i] = ai[i]\r\n if ai[i] == 1:\r\n num += 1\r\ndef gcd(i,j):\r\n a = ar[i][j-1]\r\n b = ai[j]\r\n while b != 0:\r\n a, b = b, a % b\r\n ar[i+1][j] = a\r\n return a\r\nif num == 0:\r\n ans = -1\r\n for i in range(1,n):\r\n for j in range(i,n):\r\n if gcd(i-1,j) == 1:\r\n ans = n - 1 + i\r\n if ans != -1:\r\n break\r\n print(ans)\r\nelse:\r\n print(n - num)\r\n", "# Сложность по времени O(n^2 * log (max a_i))\r\n# Сложность запуска gcd(a, b) loga\r\n# Сложность по памяти O(1)\r\n\r\ndef gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\ncnt_ones = 0\r\nfor x in a:\r\n if x == 1:\r\n cnt_ones += 1\r\nif cnt_ones > 0:\r\n print(n - cnt_ones)\r\nelse:\r\n min_len = n + 1\r\n for i in range(n):\r\n p = a[i]\r\n for j in range(i + 1, n):\r\n p = gcd(p, a[j])\r\n if p == 1:\r\n min_len = min(min_len, j - i)\r\n break\r\n if min_len == n + 1:\r\n print(-1)\r\n else:\r\n print(min_len + n - 1)", "from sys import stdin, stdout\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n\r\ndef gcd(a, b):\r\n return a if b == 0 else gcd(b, a % b)\r\n\r\n\r\ng = 0\r\ncnt1 = 0\r\nfor i in range(n):\r\n g = gcd(g, a[i])\r\n if a[i] == 1:\r\n cnt1 += 1\r\n\r\nif g != 1:\r\n print(-1)\r\n exit()\r\n\r\nif cnt1 > 0:\r\n ans = n - cnt1\r\n print(ans)\r\n exit()\r\n\r\n\r\nmin_len = n\r\nfor i in range(n):\r\n g = 0\r\n for j in range(i, n):\r\n g = gcd(g, a[j])\r\n if g == 1:\r\n cur_len = j - i\r\n min_len = min(min_len, cur_len)\r\n break\r\n\r\nans = min_len + n-1\r\nprint(ans)", "from queue import PriorityQueue\nfrom queue import Queue\nimport math\nfrom collections import defaultdict\nimport sys\nimport operator as op\nfrom functools import reduce\n\n\nn= int(input())\nar= list(map(int, input().split()))\n \nif ar.count(1) > 0:\n\tprint(n- ar.count(1))\nelse: \n\tmi = n + 1\n\tfor k in range(n):\n\t\tit = k+1\n\t\tg= ar[k]\n\t\twhile it < n:\n\t\t\tg = math.gcd(g, ar[it])\n\t\t\tif g == 1:\n\t\t\t\tmi = min(mi, it - k)\n\t\t\t\tbreak\n\t\t\tit += 1\n\t \n\tif mi == n+1:\n\t\tprint(-1)\n\telse:\n\t\tprint(mi+ n- 1)\n\n\n\n\n\n\n", "n=int(input())\r\nlst=[*map(int,input().split())]\r\nif 1 in lst:\r\n from sys import exit\r\n print(n-lst.count(1));exit()\r\nitem,i,res=lst[0],-1,1000000000\r\nfrom math import gcd\r\nfor j,x in enumerate(lst):\r\n item=gcd(item,x)\r\n if item==1:\r\n item=x\r\n for k in range(j,i,-1):\r\n item=gcd(item,lst[k])\r\n if item==1:\r\n res=min(res,j-k)\r\n i=k\r\n item=lst[k+1]\r\nif res==1000000000:print(-1)\r\nelse:print(n+res-1)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nfrom math import gcd\r\nif 1 in a:\r\n print(n - a.count(1))\r\nelse:\r\n while 1 not in a:\r\n gcx = []\r\n for i in range(1, len(a)):\r\n gcx.append(gcd(a[i - 1], a[i]))\r\n a = gcx\r\n if len(a) == 0:\r\n print(-1)\r\n break\r\n else:\r\n print(n - len(a) + n - 1)", "def gcd(a, b):\r\n while b:\r\n a, b = b, a%b\r\n return a\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\none = a.count(1)\r\n\r\nif one>0:\r\n print(n-one)\r\n exit()\r\n\r\nans = 10**18\r\n\r\nfor i in range(n):\r\n G = 0\r\n \r\n for j in range(i, n):\r\n G = gcd(G, a[j])\r\n \r\n if G==1:\r\n ans = min(ans, j-i+n-1)\r\n break\r\n \r\nif ans==10**18:\r\n print(-1)\r\nelse:\r\n print(ans)", "def gcd(a,b):\n if b==0:\n return a\n return gcd(b,a%b)\nn = int(input())\nl = list(map(int,input().split()))\nc = 0\nf = 0\nif 1 in l:\n print(n-l.count(1))\nelse:\n while True:\n c+=1\n for i in range(n-c):\n a = gcd(l[i],l[i+1])\n if a==1:\n f = 1\n break\n l[i] = a\n if f==1:\n break\n if c==n:\n break\n if f==0:\n print(-1)\n else:\n print(c+n-1)", "from functools import lru_cache\n\n@lru_cache(None)\ndef gcd(a, b):\n if a%b==0:\n return b\n return gcd(b%a, a)\n\ndef func(n, arr):\n one_cnt = len(list(filter(lambda x:x==1, arr)))\n if one_cnt:\n return n - one_cnt\n # 2, 6, 9\n cnt = 0\n while arr:\n tmp = []\n for i in range(len(arr)-1):\n tmp.append(gcd(arr[i], arr[i+1]))\n if tmp[-1] == 1:\n return cnt+n\n arr = tmp\n cnt += 1\n return -1\n \n\nif __name__ == \"__main__\":\n n = int(input())\n arr = [int(num) for num in input().split()]\n ans = func(n, arr)\n print(ans)\n", "from math import gcd\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\nif 1 in a:print(n-a.count(1));exit()\r\n\r\nms=1<<33\r\nfor l in range(n-1):\r\n g=a[l]\r\n for r in range(l+1,n):\r\n g=gcd(g,a[r])\r\n if g==1:ms=min(ms,r-l)\r\n\r\nif ms==1<<33:print(-1);exit()\r\nprint(ms+n-1)", "import math\n\n\ndef main():\n input()\n numList = list(map(int, input().split()))\n cnt = numList.count(1)\n if (cnt > 0):\n print(str(len(numList) - cnt))\n return\n minimum = -1\n for L in range(0, len(numList)):\n gcdCounter = -1\n for R in range(L + 1, len(numList)):\n if R == L + 1:\n gcdCounter = math.gcd(numList[L], numList[R])\n else:\n gcdCounter = math.gcd(gcdCounter, numList[R])\n if gcdCounter == 1:\n if minimum == -1:\n minimum = (R - L) + (len(numList) - 1)\n else:\n minimum = min(minimum, (R - L) + (len(numList) - 1))\n print(minimum)\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\na=int(input())\r\nz=list(map(int,input().split()))\r\nif(z.count(1)>0):\r\n print(len(z)-z.count(1))\r\n exit()\r\nmini=math.inf\r\nfor i in range(len(z)):\r\n ans=z[i]\r\n for j in range(i+1,len(z)):\r\n ans=math.gcd(ans,z[j])\r\n if(ans==1):\r\n mini=min(j-i,mini)\r\nif(mini==math.inf):\r\n print(-1)\r\nelse:\r\n print(mini+len(z)-1)\r\n \r\n \r\n \r\n", "import math\n\ndef nextfront(i, N, T):\n\tdiv = T[i]\n\tfor j in range(i + 1, N):\n\t\tdiv = math.gcd(div, T[j])\n\t\tif div == 1:\n\t\t\treturn j\n\treturn -1\n\n\ndef nextback(k, N, T):\n\tdiv = T[k]\n\tfor j in range(k - 1, -1):\n\t\tdiv = math.gcd(div, T[j])\n\t\tif div == 1:\n\t\t\treturn j\n\treturn -1\n\n\ndef qtduns(T, N):\n\tresp = 0\n\tfor i in range(N):\n\t\tif T[i] == 1:\n\t\t\tresp+=1\n\treturn resp\n\n\ndef main():\n\tN = int(input())\n\tT = [int(i) for i in input().split()]\n\tx = qtduns(T, N)\n\tif x > 0:\n\t\tprint(N - x)\n\t\treturn\n\tl = N + 1\n\ti = 0\n\tk = N + 1\n\tflag = False\n\twhile i != N and l != 2:\n\t\t#print(i, k, l)\n\t\tdiv = T[i]\n\t\tfor j in range(i + 1, N):\n\t\t\tdiv = math.gcd(div, T[j])\n\t\t\tif div == 1:\n\t\t\t\tl = min(l, j - i + 1)\n\t\t\t\tk = j\n\t\t\t\t#print(\" \", i, j, l)\n\t\t\t\tbreak\n\t\tif div != 1:\n\t\t\tflag = True\n\t\t\tk = N - 1\n\t\tdiv = T[k]\n\t\tfor j in range(k - 1, i - 1):\n\t\t\tdiv = math.gcd(div, T[j])\n\t\t\tif div == 1:\n\t\t\t\tl = min(l, k - j + 1)\n\t\t\t\t#print(\" \", j, k, l)\n\t\t\t\tbreak\n\t\tif flag:\n\t\t\tbreak\n\t\telse:\n\t\t\ti = k - l + 2\n\tif l == N + 1:\n\t\tprint(-1)\n\telse:\n\t\tprint(N + l - 2)\n\n\nmain()\n\n# 1511548364391\n", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nclass Solution:\r\n def gcd(self, a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n \r\n def minOperations(self, nums):\r\n n = len(nums)\r\n if nums.count(1) > 0:\r\n return n - nums.count(1)\r\n minops = float('inf')\r\n for i in range(n):\r\n j = i\r\n g = nums[i]\r\n while j >= 0:\r\n g = self.gcd(g, nums[j])\r\n if g == 1:\r\n break\r\n j -= 1\r\n if g == 1:\r\n minops = min(minops, i - j)\r\n j = i\r\n g = nums[i]\r\n while j < n:\r\n g = self.gcd(g, nums[j])\r\n if g == 1:\r\n break\r\n j += 1\r\n if g == 1:\r\n minops = min(minops, j - i)\r\n if minops == float('inf'):\r\n return -1\r\n return n - 1 + minops\r\n \r\nprint(Solution().minOperations(arr))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nfrom math import gcd\r\ng=a[:]\r\ndef solve(k):\r\n for i in range(n-k):\r\n g[i]=gcd(g[i],a[i+k])\r\n if g[i]==1:\r\n return k\r\n return -1\r\nif n==1:\r\n if a[0]==1:\r\n print(0)\r\n else:\r\n print(-1)\r\nelif a.count(1)!=0:\r\n print(n-a.count(1))\r\nelse:\r\n for i in range(n):\r\n cur=solve(i)\r\n if cur==i:\r\n print(n+cur-1)\r\n break\r\n else:\r\n print(-1)\r\n", "from math import gcd\r\nfrom functools import *\r\n@lru_cache(maxsize=None)\r\ndef gcd1(a,b):\r\n return gcd(a,b)\r\ndef solve(k,n,a,g): \r\n for i in range(n-k):\r\n g[i]=gcd1(g[i],a[i+k])\r\n if g[i]==1:\r\n return k\r\n return -1\r\ndef easy():\r\n n=int(input())\r\n a=[int(i) for i in input().split()]\r\n g=a[:]\r\n if n==1:\r\n if a[0]==1:\r\n print(0)\r\n else:\r\n print(-1)\r\n elif a.count(1)!=0:\r\n print(n-a.count(1))\r\n else:\r\n for i in range(n):\r\n cur=solve(i,n,a,g)\r\n if cur==i:\r\n print(n+cur-1)\r\n break\r\n else:\r\n print(-1)\r\neasy()\r\n", "#Complexity - O(n^2)\nfrom collections import Counter\nimport math\n\nn = int(input())\narr = list(map(int, input().split()))\ncounter = Counter(arr)\nif counter[1] > 0:\n print(n- counter[1])\n exit(0)\n\ndef find_result(arr):\n counter = 1\n while len(arr) > 1:\n newarr = []\n for i in range(len(arr)-1):\n hcf = math.gcd(arr[i], arr[i+1])\n if hcf == 1:\n return counter\n newarr.append(hcf)\n counter += 1\n arr = newarr\n return -1 if arr[0] != 1 else counter\n\nrounds_to_achieve_1 = find_result(arr)\nif rounds_to_achieve_1 == -1:\n print(-1)\nelse:\n print(len(arr)-1+rounds_to_achieve_1)\n", "from functools import reduce\n\n\ndef gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a % b)\n\n\nn = int(input())\na = list(map(int, input().split(\" \")))\n\nif a.count(1) > 0:\n print(n - a.count(1))\n exit(0)\n\nc = reduce(gcd, a)\nif (c != 1):\n print(-1)\n exit(0)\nc = n\nfor i in range(0, n-1):\n g = a[i]\n for j in range(i+1, n):\n g = gcd(g, a[j])\n if g == 1:\n c = min(c, j-i)\n break\n\nprint(c+n-1)\n", "import itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n if 1 in a:\r\n print(n - a.count(1))\r\n return\r\n\r\n mn_op = 1 << 60\r\n for l in range(n - 1):\r\n t = a[l]\r\n for r in range(l + 1, n):\r\n t = gcd(t, a[r])\r\n if t == 1:\r\n mn_op = min(mn_op, r - l)\r\n break\r\n\r\n if mn_op == 1 << 60:\r\n print(-1)\r\n else:\r\n print(n - 1 + mn_op)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "from math import gcd\r\nclass Node:\r\n def __init__(self,l,r):\r\n self.l,self.r = l,r\r\n self.left = self.right = None\r\n self.val = 0\r\nclass segtree:\r\n def __init__(self,a):\r\n self.a = a\r\n self.rt = Node(0,len(a)-1)\r\n self.build(self.rt)\r\n def build(self,node):\r\n if node.l == node.r:\r\n node.val = self.a[node.l]\r\n return \r\n mid = node.l+node.r>>1\r\n node.left,node.right = Node(node.l,mid),Node(mid+1,node.r)\r\n self.build(node.left);self.build(node.right)\r\n node.val = gcd(node.left.val,node.right.val)\r\n def find(self,node,low,hig):\r\n if low == node.l and hig == node.r:\r\n return node.val\r\n mid = node.l+node.r>>1\r\n res = []\r\n if low <= mid:\r\n res.append(self.find(node.left,low,min(hig,mid)))\r\n if hig >= mid+1:\r\n res.append(self.find(node.right,max(low,mid+1),hig))\r\n if len(res) == 2:return gcd(res[0],res[1])\r\n return res[0]\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nseg = segtree(a)\r\nif 1 in a:\r\n print(n-a.count(1))\r\nelse:\r\n ans = n+1\r\n for i in range(n):\r\n l,r = i,n\r\n while l+1 != r:\r\n mid = l+r>>1\r\n if seg.find(seg.rt,i,mid) != 1:\r\n l = mid\r\n else:\r\n r = mid\r\n if r != n:ans = min(ans,(l-i+1))\r\n if ans == n+1:print(-1)\r\n else:print(ans+n-1)\r\n", "import math\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nif l.count(1): print(n - l.count(1))\r\nelse:\r\n\ttmp1 = n+1\r\n\tfor i in range(n):\r\n\t\ttmp2 = l[i]\r\n\t\tfor j in range(n-i):\r\n\t\t\ttmp2 = math.gcd(tmp2,l[i+j])\r\n\t\t\tif (tmp2 == 1): tmp1 = min(tmp1,j)\r\n\tif (tmp1==n+1): print(\"-1\")\r\n\telse: print(tmp1+n-1)", "from fractions import gcd\r\nn = int(input())\r\na = [int(z) for z in input().split()]\r\ncnt = 0\r\nfor i in range(n):\r\n if a[i] == 1:\r\n cnt += 1\r\nif cnt > 0:\r\n print(n - cnt)\r\n exit(0)\r\nminlen = 1000000000\r\nfor l in range(n):\r\n cur = a[l]\r\n for r in range(l + 1, n):\r\n cur = gcd(cur, a[r])\r\n if cur == 1:\r\n minlen = min(minlen, r - l)\r\n \r\nif minlen == 1000000000:\r\n print(-1)\r\nelse:\r\n print(minlen + n - 1)", "import math\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na1 = a.count(1)\r\nif a1:\r\n print(n - a1)\r\n exit()\r\nans = n\r\nfor i in range(n):\r\n x = a[i]\r\n for j in range(i + 1, n):\r\n x = math.gcd(x, a[j])\r\n if x == 1:\r\n ans = min(ans, j - i)\r\n break\r\nif ans != n:\r\n print(n + ans - 1)\r\nelse:\r\n print(-1)\r\n", "# coding=utf-8\r\nfrom math import gcd,inf\r\n \r\nm = 0\r\ndef build(k,l,r):\r\n global m\r\n if l == r:\r\n tree[k] = a[l]\r\n if tree[k] == 1:\r\n m += 1 # 第一种情况\r\n return\r\n mid = l + r >> 1\r\n build(k << 1,l,mid)\r\n build(k << 1 | 1,mid + 1,r)\r\n tree[k] = gcd(tree[k << 1],tree[k << 1 | 1])\r\n \r\ndef queryGCD(k,l,r,x,y):\r\n if l == x and r == y: return tree[k]\r\n mid = l + r >> 1\r\n if y <= mid: g = queryGCD(k << 1,l, mid,x,y)\r\n else:\r\n if x > mid: g = queryGCD(k << 1 | 1,mid + 1, r ,x,y)\r\n else: g = gcd( queryGCD(k << 1,l, mid,x,mid) ,queryGCD(k << 1|1,mid + 1, r,mid + 1,y) )\r\n return g\r\n \r\ndef main():\r\n global tree,a,m\r\n n = int(input())\r\n a = [0] + list(map(int,input().split()))\r\n tree = [0] * (4 * n)\r\n build(1,1,n) # 建树\r\n if m > 0: print(n - m)\r\n else:\r\n m,i = inf,1\r\n for j in range(1,n+1):\r\n while i < j and queryGCD(1,1,n,i + 1,j) == 1: i += 1\r\n if queryGCD(1,1,n,i,j) == 1: m = min(j - i,m)\r\n \r\n print(n + m - 1 if m < n else -1 )\r\n \r\nmain()\r\n\t\t \t\t\t\t \t\t \t \t \t\t \t \t\t", "import math \r\nclass SegmentTree:\r\n def __init__(self, data, default=0,func=lambda a,b:math.gcd(a,b)):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n \r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n \r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n \r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n \r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n \r\n def __len__(self):\r\n return self._len\r\n \r\n def query(self, start, stop):\r\n if start == stop:\r\n return self.__getitem__(start)\r\n stop += 1\r\n start += self._size\r\n stop += self._size\r\n \r\n res = self._default\r\n while start < stop:\r\n if start & 1:\r\n res = self._func(res, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res = self._func(res, self.data[stop])\r\n start >>= 1\r\n stop >>= 1\r\n return res\r\n \r\n def __repr__(self):\r\n return \"SegmentTree({0})\".format(self.data)\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nif 1 in l:\r\n print(n-l.count(1))\r\nelse:\r\n s=SegmentTree(l)\r\n m=999999999999999999999999 \r\n for i in range(n):\r\n for j in range(i,n):\r\n if s.query(i,j)==1:\r\n m=min(m,j-i+1)\r\n if m==999999999999999999999999:\r\n print (-1) \r\n else:\r\n print(n-2+m)", "from math import gcd\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm, k, s = a[0], 0, a.count(1)\r\nfor i in range(1, n):\r\n\tm = gcd(m, a[i])\r\n\tk |= gcd(a[i], a[i - 1]) == 1\r\nif m != 1:\r\n\tprint (-1)\r\n\texit()\r\nif s:print (n - s)\r\nelif k: print (n)\r\nelse:\r\n\td = n\r\n\tfor i in range(n):\r\n\t\tm = a[i]\r\n\t\tfor j in range(i + 1, n):\r\n\t\t\tm = gcd(m, a[j])\r\n\t\t\tif m == 1:\r\n\t\t\t\td = min(d, j - i - 1)\r\n\t\t\t\tbreak\r\n\tprint (n + d)", "a=int(input());from math import gcd as z;b=list(map(int,input().split()))\r\nif b.count(1):exit(print(a-b.count(1)))\r\nans=a\r\nfor i in range(a):\r\n g=b[i]\r\n for j in range(i+1,a):\r\n g=z(g,b[j])\r\n if g==1:ans=min(ans,j-i);break\r\nprint([a+ans-1,-1][ans==a])", "from math import gcd\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in a:\r\n cnt += (i == 1)\r\nif cnt != 0:\r\n print(n - cnt)\r\n exit(0)\r\nans = 1e9\r\nfor i in range(n):\r\n gcd_cur = 0\r\n for j in range(i, n):\r\n gcd_cur = gcd(gcd_cur, a[j])\r\n if gcd_cur == 1:\r\n ans = min(ans, j - i)\r\nif ans == 1e9:\r\n print(-1)\r\nelse:\r\n print(ans + n - 1)# 1691072502.5029635", "def gcd(x,y):\n\twhile(y):\n\t\tx,y=y,x%y\n\treturn x\n\nn=int(input())\na=[int(x) for x in input().split()]\nones=0\nfor i in range(n):\n\tif a[i]==1:\n\t\tones+=1\n\nmini=n+1\nif ones==0:\n\tfor i in range(n):\n\t\tg=a[i]\n\t\tfor j in range(i,n):\n\t\t\tg=gcd(g,a[j])\n\t\t\tif g==1:\n\t\t\t\tmini=min(mini,j-i)\nelse:\n\tmini=0\n\tones-=1\nif mini==n+1:\n\tans=-1\nelse:\n\tans=mini+len(a)-1-ones\nprint(ans)", "import math\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ncnt_1=arr.count(1)\r\nif cnt_1>0:print(n-cnt_1)\r\nelse:\r\n minn=n\r\n for i in range(n):\r\n g=arr[i]\r\n for j in range(i,n):\r\n g=math.gcd(g,arr[j])\r\n if g==1:\r\n minn=min(minn,j-i);break\r\n if minn==n:print(-1)\r\n else:print(minn+n-1)\r\n \r\n", "import math\r\nn = (int(input()))\r\na = list(map(int , input().split()))\r\ncnt_one = 0\r\nfor i in range(n):\r\n if(a[i] == 1):\r\n cnt_one += 1\r\nif(cnt_one > 0):\r\n print(n - cnt_one)\r\n quit()\r\nL = n + 1\r\nfor i in range(n):\r\n cur = a[i]\r\n for j in range(i , n):\r\n cur = math.gcd(cur , a[j])\r\n if cur == 1:\r\n L = min(L , j - i + 1)\r\n break\r\nif(L == n + 1):\r\n print(-1)\r\nelse:\r\n print(L + n - 2)\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ng = sorted([list(map(int, input().split())) for i in range(n)])\r\n\r\na = -1\r\nb = -1\r\nfor i, j in g:\r\n if a > b:\r\n a, b = b, a\r\n if i > a:\r\n a = j\r\n elif i > b:\r\n b = j\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print('YES')", "import io, os\r\nimport sys\r\nfrom atexit import register\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nsys.stdout = io.BytesIO()\r\nregister(lambda: os.write(1, sys.stdout.getvalue()))\r\n\r\ntokens = []\r\ntokens_next = 0\r\n\r\n\r\ndef nextStr():\r\n global tokens, tokens_next\r\n while tokens_next >= len(tokens):\r\n tokens = input().split()\r\n tokens_next = 0\r\n tokens_next += 1\r\n\r\n if type(tokens[tokens_next - 1]) == str:\r\n return tokens[tokens_next - 1]\r\n return tokens[tokens_next - 1].decode()\r\n\r\n\r\ndef nextInt():\r\n return int(nextStr())\r\n\r\n\r\ndef nextIntArr(n):\r\n return [nextInt() for i in range(n)]\r\n\r\n\r\ndef print(s, end='\\n'):\r\n sys.stdout.write((str(s) + end).encode())\r\n\r\n\r\ndef solve(shows):\r\n tv1 = None\r\n tv2 = None\r\n\r\n for cur in sorted(shows):\r\n if not tv1 or tv1[1] < cur[0]:\r\n tv1 = cur\r\n continue\r\n elif not tv2 or tv2[1] < cur[0]:\r\n tv2 = cur\r\n continue\r\n\r\n return 'NO'\r\n return 'YES'\r\n\r\n\r\nn = nextInt()\r\nshows = [(nextInt(), nextInt()) for _ in range(n)]\r\n\r\nprint(solve(shows))\r\n", "n = int(input())\r\nsegment = []\r\n\r\nfor _ in range(n):\r\n segment.append(list(map(int, input().split())))\r\n\r\nsegment.sort(key = lambda x: x[0])\r\n\r\nstart1 = 0\r\nend1 = -float('inf')\r\nstart2 = 0\r\nend2 = -float('inf')\r\n\r\nfor x in segment:\r\n start = x[0]\r\n end = x[1]\r\n\r\n if start > end1:\r\n start1 = start\r\n end1 = end\r\n elif start > end2:\r\n start2 = start\r\n end2 = end\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "n = int(input())\r\ntv1 = -1\r\ntv2 = -1\r\na = []\r\ndrop = False\r\n\r\nfor _ in range(n):\r\n a.append(tuple(int(x) for x in input().split()))\r\na.sort()\r\n\r\nfor s, f in a:\r\n if tv1 < s:\r\n tv1 = f\r\n elif tv2 < s:\r\n tv2 = f\r\n else: drop = True\r\n \r\nprint('YNEOS'[drop::2])\r\n \r\n", "# brownfox2k6\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\na = sorted([*map(int, input().split())] for _ in range(int(input())))\r\ntv = [[-1, -1], [-1, -1]]\r\nfor l, r in a:\r\n if tv[0][1] < l:\r\n tv[0] = [l, r]\r\n elif tv[1][1] < l:\r\n tv[1] = [l, r]\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "# Two TVs\r\nimport sys\r\nn = int(input())\r\nshows = []\r\nfor i in range(n):\r\n lis = list(map(int, input().split()))\r\n shows.append(lis)\r\nif n > 2:\r\n tv1 = []\r\n tv2 = []\r\n shows.sort()\r\n tv1.append(shows[0])\r\n tv2.append(shows[1])\r\n i = 2\r\n while i < n :\r\n if shows[i][0] > tv1[len(tv1) - 1][1]:\r\n tv1.append(shows[i])\r\n elif shows[i][0] > tv2[len(tv2) - 1][1]:\r\n tv2.append(shows[i])\r\n else: \r\n print('NO')\r\n sys.exit()\r\n i += 1\r\n print('YES')\r\n\r\nelse:\r\n print('YES')", "n = int(input())\r\nshows = [list(map(int, input().split())) for _ in range(n)]\r\nshows.sort()\r\nif n < 3:\r\n print(\"YES\")\r\nelse:\r\n tv1 = shows[0]\r\n tv2 = shows[1]\r\n flag = True\r\n for i in range(2, n):\r\n if tv1[1] < shows[i][0]:\r\n tv1 = shows[i]\r\n elif tv2[1] < shows[i][0]:\r\n tv2 = shows[i]\r\n else:\r\n print(\"NO\")\r\n flag = False\r\n break\r\n if flag:\r\n print(\"YES\")", "n = int(input())\r\n\r\nshows = []\r\nfor _ in range(n):\r\n shows.append(tuple(map(int, input().split())))\r\n\r\nshows.sort()\r\n\r\nend_1 = -1\r\nend_2 = -1\r\nfor show in shows:\r\n if show[0] > end_1:\r\n end_1 = show[1]\r\n continue\r\n if show[0] > end_2:\r\n end_2 = show[1]\r\n continue\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\n\r\nl = []\r\nfor _ in range(n):\r\n l.append(tuple(map(int, input().split())))\r\n\r\nl.sort()\r\n\r\nt1 = -1\r\nt2 = -1\r\n\r\nfor i in l:\r\n if i[0] > t1:\r\n t1 = i[1]\r\n elif i[0] > t2:\r\n t2 = i[1]\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "n = int(input())\r\nhorarios = [tuple(map(int, input().split())) for i in range(n)]\r\nhorarios.sort()\r\n\r\naux = []\r\nflag = True\r\n\r\nfor i in range(n):\r\n if len(aux) < 2:\r\n aux.append(horarios[i])\r\n continue\r\n if horarios[i][0] > aux[0][1]:\r\n aux[0] = horarios[i]\r\n elif horarios[i][0] > aux[1][1]:\r\n aux[1] = horarios[i]\r\n else:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import deque\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n a.append((l,r))\r\n\r\na = deque(sorted(a))\r\n\r\nb = deque()\r\nc = deque()\r\n\r\nwhile len(a):\r\n show = a.popleft()\r\n if len(b) and len(c):\r\n if show[0] > b[0][1]:\r\n b.pop()\r\n b.append(show)\r\n elif show[0] > c[0][1]:\r\n c.pop()\r\n c.append(show)\r\n else:\r\n print('NO')\r\n break\r\n else:\r\n if not len(b):\r\n b.append(show)\r\n else:\r\n c.append(show)\r\nelse:\r\n print('YES')\r\n", "n=int(input())\r\nc=[]\r\nfor i in range(n):\r\n a=list(map(int,input().strip().split(' ')))\r\n c.append(a)\r\nc.sort()\r\nif(n<=2):\r\n print(\"YES\")\r\nelse:\r\n u=0\r\n tv1=[]\r\n tv2=[]\r\n tv1.append(c[0])\r\n tv2.append(c[1])\r\n for i in range(2,n):\r\n if(c[i][0]>tv1[0][1]):\r\n tv1[0]=c[i]\r\n elif(c[i][0]>tv2[0][1]):\r\n tv2[0]=c[i]\r\n else:\r\n u=1\r\n break\r\n if(u==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "num_shows = int(input())\n\nshowtimes = []\nfor i in range(num_shows):\n showtime = [int(i) for i in input().split(\" \")]\n showtimes.append((showtime[0], showtime[1]))\n\nshowtimes = sorted(showtimes)\n\ntv1 = -1\ntv2 = -1\n\nstart_time = min(st[0] for st in showtimes)\nend_time = max(st[1] for st in showtimes)\n\nfail_signal = False\n\nfor st in showtimes:\n start_time = st[0]\n end_time = st[1]\n\n if (start_time <= tv1) and (start_time <= tv2):\n fail_signal = True\n break\n else:\n if start_time > tv1: tv1 = end_time\n else: tv2 = end_time\n\nif fail_signal: print(\"NO\")\nelse: print(\"YES\")", "n = int(input())\r\narr = list()\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n arr.append((l, r))\r\ne1, e2 = -1, -1\r\narr.sort()\r\nans = 'YES'\r\nfor i in arr:\r\n if i[0] > e1:\r\n e1 = i[1]\r\n elif i[0] > e2:\r\n e2 = i[1]\r\n else:\r\n ans = 'NO'\r\nprint(ans)\r\n", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nX = set()\r\nLR = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n l -= 1\r\n r -= 1\r\n X.add(l)\r\n X.add(l+1)\r\n X.add(r)\r\n X.add(r+1)\r\n LR.append((l, r))\r\nX = list(X)\r\nX.sort()\r\nd = {}\r\nfor i, x in enumerate(X):\r\n d[x] = i\r\nN = len(d)\r\nimos = [0]*(N+5)\r\nfor l, r in LR:\r\n l = d[l]\r\n r = d[r]\r\n imos[l] += 1\r\n imos[r+1] -= 1\r\nfrom itertools import accumulate\r\nimos = list(accumulate(imos))\r\nif max(imos) <= 2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\nl = []\nt = int(input())\nfor _ in range(t):\n n,m = map(int,input().split())\n l.append((n,m))\nl.sort()\n#print(l)\nle,ri=-1,-1\nfor i in range(t):\n if l[i][0]>le:\n le = l[i][1]\n elif l[i][0]>ri:\n ri = l[i][1]\n else:\n print(\"NO\")\n exit()\n\nprint(\"YES\")\n \t\t \t \t \t \t \t \t\t\t\t \t\t \t", "#!/usr/bin/env python3\nfrom collections import defaultdict\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\nn = int(input())\n\np = defaultdict(int)\n\nfor i in range(n):\n a, b = rint()\n p[a] += 1\n p[b+1] -= 1\n\npl = []\nfor k in p.keys():\n pl.append((k, p[k]))\n\npl.sort()\nsum = 0\nfor i in range(len(pl)):\n sum += pl[i][1]\n if sum > 2:\n print(\"NO\")\n exit()\n\nprint(\"YES\")\n\n", "n = int(input())\nt = []\nflag = True\nfor i in range(n):\n t.append(list(map(int,input().split(' '))))\nt.sort()\nl1,l2 = -1,-1\nfor i in range(n) :\n if t[i][0] > l1 and t[i][0] > l2 :\n if l1 > l2 :\n l1 = t[i][1]\n else :\n l2 = t[i][1]\n elif t[i][0] > l1 :\n l1 = t[i][1]\n elif t[i][0] > l2 :\n l2 = t[i][1]\n else :\n print(\"NO\")\n flag = False\n break\nif (flag) :\n print(\"YES\")", "no_of_shows = int(input())\r\nshows_startEnd_time_list = [tuple(map(int, input().split()[:2])) for _ in range(no_of_shows)]\r\n# Sort shows based on start times\r\nshows_startEnd_time_list.sort(key=lambda x: x[0])\r\nend_tv1 = end_tv2 = -1\r\nflag = 0\r\n\r\nfor show in shows_startEnd_time_list:\r\n start_time, end_time = show\r\n\r\n if start_time <= end_tv1:\r\n end_tv1 = end_time\r\n print(\"NO\") # Cannot watch the show on any TV\r\n break\r\n\r\n end_tv1 = end_time\r\n\r\n if end_tv2 < end_tv1:\r\n end_tv1, end_tv2 = end_tv2, end_tv1\r\n\r\nelse:\r\n print(\"YES\") # All shows can be watched\r\n\r\n# If the for loop breaks prematurely, the next `else` part is skipped, else it is executed.\r\n", "def main():\n l, c = [], 0\n for _ in range(int(input())):\n a, b = map(int, input().split())\n l.append(a * 2)\n l.append(b * 2 + 1)\n l.sort()\n for a in l:\n if a & 1:\n c -= 1\n else:\n c += 1\n if c > 2:\n print(\"NO\")\n break\n else:\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nD = []\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n D.append((l,-1))\r\n D.append((r,1))\r\nD.sort()\r\nans = 0\r\nuu = True\r\nfor o,t in D:\r\n ans += t\r\n if ans < -2:\r\n print('NO')\r\n uu = False\r\n break\r\nif uu == True:\r\n print('YES')\r\n", "import sys\r\nfrom heapq import heappush, heappop\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\na = sorted(list(map(int, line.decode('utf-8').split()))\r\n for line in sys.stdin.buffer)\r\nhq = []\r\n\r\nfor l, r in a:\r\n while hq and hq[0] < l:\r\n heappop(hq)\r\n heappush(hq, r)\r\n if len(hq) > 2:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\n", "n=int(input())\r\ntv1=(-1,-1)\r\ntv2=(-1,-1)\r\ntgr=True\r\na=[]\r\nfor i in range(n):\r\n a.append(tuple(int(x) for x in input().split()))\r\na.sort()\r\nfor l, r in a:\r\n if tv1[1]<l:\r\n tv1=(l, r)\r\n elif tv2[1]<l:\r\n tv2=(l, r)\r\n else:\r\n tgr=False\r\nif tgr is True:\r\n print('YES')\r\nelse:\r\n print('NO')", "k = int(input())\r\nnacalo = []\r\nkonec = []\r\ns = 0\r\nfor gh in range(k):\r\n x, y = map(int, input().split())\r\n nacalo.append(x)\r\n konec.append(y)\r\nnacalo.sort()\r\nkonec.sort()\r\n\r\ni_nach = 0\r\ni_kon = 0\r\n\r\nwhile i_nach < k and i_kon < k:\r\n tek = min(nacalo[i_nach], konec[i_kon])\r\n while i_nach < k and nacalo[i_nach] == tek:\r\n s += 1\r\n if s >= 3:\r\n print('NO')\r\n exit(0)\r\n i_nach += 1\r\n while i_kon < k and konec[i_kon] == tek:\r\n s -= 1\r\n i_kon += 1\r\n\r\nprint('YES')", "n = int(input())\nshows = [tuple( map(int, input().split())) for _ in range(n)]\nshows = sorted(shows, key = lambda t: t[1])\nshows = sorted(shows, key = lambda t: t[0])\nfirst, second = -1, -1\nfor l, r in shows:\n if l > first:\n first = r\n elif l > second:\n second = r\n else:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nlr = [list(map(int, input().split())) for _ in range(n)]\r\ns = set()\r\nfor l, r in lr:\r\n s.add(2 * l)\r\n s.add(2 * r + 1)\r\ns = list(s)\r\ns.sort()\r\nd = dict()\r\nfor i in range(len(s)):\r\n d[s[i]] = i\r\nx = [0] * (len(s) + 1)\r\nfor l, r in lr:\r\n x[d[2 * l]] += 1\r\n x[d[2 * r + 1]] -= 1\r\nans = \"YES\" if x[0] <= 2 else \"NO\"\r\nfor i in range(1, len(x)):\r\n x[i] += x[i - 1]\r\n if x[i] > 2:\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "n=int(input())\r\ntv1=-1\r\ntv2=-1\r\na=[]\r\nd=False\r\nfor _ in range(n):\r\n a.append(tuple(int(x) for x in input().split()))\r\na.sort()\r\nfor b,c in a:\r\n if tv1 < b:\r\n tv1=c\r\n elif tv2 < b:\r\n tv2=c\r\n else:\r\n d=True\r\nif d==False:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n = int(input())\r\nshows = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nshows.sort(key=lambda x: x[0])\r\n\r\ntv1 = [-1, -1]\r\ntv2 = [-1, -1]\r\n\r\noutput = 'YES'\r\n\r\nfor show in shows:\r\n if show[0] > tv1[1]:\r\n tv1 = show\r\n elif show[0] > tv2[1]:\r\n tv2 = show\r\n else:\r\n output = 'NO'\r\n break\r\n\r\nprint(output)", "num_shows = int(input())\n\nshowtimes = []\nfor i in range(num_shows):\n showtime = [int(i) for i in input().split(\" \")]\n showtimes.append((showtime[0], showtime[1]))\n\nshowtimes = sorted(showtimes)\n\nclass TV:\n def __init__(self):\n self.endtime = -1\n\ntv1 = TV()\ntv2 = TV()\n\nstart_time = min(st[0] for st in showtimes)\nend_time = max(st[1] for st in showtimes)\n\nfail_signal = False\n\nfor st in showtimes:\n start_time = st[0]\n end_time = st[1]\n\n if (start_time <= tv1.endtime) and (start_time <= tv2.endtime):\n fail_signal = True\n break\n else:\n if start_time > tv1.endtime:\n tv1.endtime = end_time\n else:\n tv2.endtime = end_time\n\nif fail_signal: print(\"NO\")\nelse: print(\"YES\")", "n = int(input())\r\n\r\ntvs = {1: -1, 2: -1}\r\n\r\nresult = \"YES\"\r\n\r\nappointments = []\r\n\r\nfor i in range(n):\r\n start, end = list(map(int, input().split()))\r\n appointments.append((start, end))\r\n\r\nappointments_sorted = sorted(appointments, key=lambda appt: appt[0])\r\n\r\nfor start, end in appointments_sorted:\r\n if tvs[1] < start:\r\n tvs[1] = end\r\n elif tvs[2] < start:\r\n tvs[2] = end\r\n else:\r\n result = \"NO\"\r\n break\r\n\r\nprint(result)\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n b = list(map(int,input().split()))\r\n a.append([b[0],-1])\r\n a.append([b[1],1])\r\na.sort()\r\ncur = 0\r\nfor i in a:\r\n cur += i[1]\r\n if cur <= -3:\r\n print(\"NO\")\r\n break\r\nelse: print(\"YES\") \r\n", "n = int(input())\r\ntv1 = (-1, -1)\r\ntv2 = (-1, -1)\r\nf = True\r\na = []\r\nfor i in range(n):\r\n a.append(tuple(int(x) for x in input().split()))\r\na.sort()\r\nfor l, r in a:\r\n if tv1[1] < l:\r\n tv1 = (l, r)\r\n elif tv2[1] < l:\r\n tv2 = (l, r)\r\n else:\r\n f = False\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "def main():\r\n\tarrl = []\r\n\tarrr = []\r\n\tn = int(input())\r\n\tfor t in range(n):\r\n\t\ta, b = map(int, input().split())\r\n\t\tarrl.append(a)\r\n\t\tarrr.append(b)\r\n\tarrl.sort()\r\n\tarrr.sort()\r\n\tl = 0 \r\n\tr = 0 \r\n\tcnt = 0\r\n\twhile(l<n and r<n):\r\n\t\tif(arrl[l]<=arrr[r]):\r\n\t\t\tcnt+=1\r\n\t\t\tl+=1\r\n\t\telse:\r\n\t\t\tcnt-=1\r\n\t\t\tr+=1\r\n\t\tif(cnt>2):\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn\r\n\tprint(\"YES\")\r\n\treturn\r\n\t\r\nmain()\r\n", "n = int(input())\nsequence = []\nflag = False\n\nfor i in range(n):\n l, r = map(int, input().split())\n sequence.append((l, r))\n\nsequence.sort()\n\ntv1 = -1\ntv2 = -1\n\nfor i in range(n):\n if sequence[i][0] > tv1:\n tv1 = sequence[i][1]\n elif sequence[i][0] > tv2:\n tv2 = sequence[i][1]\n else:\n flag = True\n print(\"NO\")\n break\n\nif not flag:\n print(\"YES\")\n \t \t\t\t \t \t\t\t\t\t\t\t \t\t\t \t", "from operator import itemgetter\nn = int(input())\nA = []\nfor i in range(n):\n A.append([int(i) for i in input().split()])\nA = sorted(A, key = itemgetter(0))\nfirst_tv = []\nsecond_tv = []\nfirst_end = -1\nsecond_end = -1\nfor i in range(n):\n if A[i][0] > first_end:\n first_end = A[i][1]\n elif A[i][0] > second_end:\n second_end = A[i][1]\n else:\n print('NO')\n break\nelse:\n print('YES')", "tv1=-1\r\ntv2=-1\r\nshows=[]\r\nn=int(input())\r\nfor i in range(n):\r\n l, r=map(int, input().split())\r\n shows.append((l, r))\r\nshows.sort()\r\n#print(shows)\r\nfor l, r in shows:\r\n #print(l, r)\r\n if(tv1<l):\r\n tv1=r\r\n elif tv2<l:\r\n tv2=r\r\n else:\r\n print(\"NO\")\r\n break\r\n #print(tv1, tv2)\r\nelse:\r\n print(\"YES\")\r\n", "shows = int(input())\r\n\r\ntv1 = []\r\ntv2 = []\r\n\r\nhorarios = []\r\nfor i in range(shows):\r\n horario = [*map(int, input().split())]\r\n horarios.append(horario)\r\n\r\nhorarios.sort(key = lambda x : x[0])\r\npossible = \"YES\"\r\nfor horario in horarios:\r\n if(len(tv1) == 0):\r\n tv1.append(horario)\r\n elif(len(tv2) == 0):\r\n tv2.append(horario)\r\n elif(tv1[-1][1] < horario[0]):\r\n tv1.append(horario)\r\n elif(tv2[-1][1] < horario[0]):\r\n tv2.append(horario)\r\n else:\r\n possible = \"NO\"\r\n break\r\n\r\nprint(possible)", "n = int(input())\r\nd=[]\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n d.append((l,1))\r\n d.append((r+1,-1))\r\nd.sort()\r\nres=0\r\na=True\r\nfor i in d:\r\n res=res+i[1]\r\n if res>2:\r\n print(\"NO\")\r\n a=False\r\n break\r\nif a:\r\n print(\"YES\")", "n = int(input())\r\n\r\nd = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n d.append((a, -1))\r\n d.append((b, 1))\r\n\r\nd.sort()\r\nt = 0\r\nfor a, b in d:\r\n t -= b\r\n if t > 2:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\") \r\n", "n = int(input())\nd = {}\ns = []\nfor i in range(n):\n a = list(map(int,input().split(' ')))\n if a[0] in d:\n d[a[0]][0] += 1\n else:\n d[a[0]] = [1,0]\n s.append(a[0])\n if a[1] in d:\n d[a[1]][1] += 1\n else:\n d[a[1]] = [0,1]\n s.append(a[1])\ns.sort()\nt = 0\nr = 0\nfor i in s:\n t += d[i][0]\n if t > 2:\n r = 1\n break\n t -= d[i][1]\nif r == 1:\n print('NO')\nelse:\n print('YES')", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\ntimes = defaultdict(lambda: 0)\r\n\r\nfor _ in range(n):\r\n start, end = map(int, input().split(' '))\r\n times[start] += 1\r\n times[end + 1] -= 1\r\n\r\n\r\ncur_time = 0\r\nfor time in sorted(times.keys()):\r\n cur_time += times[time]\r\n if cur_time > 2:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(0,n):\r\n a,b=input().split()\r\n a,b=int(a),int(b)\r\n l.append([a,0])\r\n l.append([b,1])\r\nl.sort(key=lambda x:(x[0],x[1]))\r\nTV=0\r\nr=0\r\nans=\"YES\"\r\nfor x in l:\r\n if(x[1]==0):\r\n TV+=1\r\n else:\r\n TV-=1\r\n if(TV>2):\r\n ans=\"NO\"\r\n break\r\nprint(ans)\r\n\r\n", "#coded by gautham on 29/5/2021\r\nn=int(input())\r\nl=[]\r\nk=0\r\nfor i in range(0,n):\r\n a,b=map(int,input().split())\r\n l.append((a,b))\r\nl.sort()\r\ntv1on=-1\r\ntv2on=-1\r\nfor i in range(0,n):\r\n if tv1on<l[i][0]:\r\n tv1on=l[i][1]\r\n elif tv2on<l[i][0]:\r\n tv2on=l[i][1]\r\n else:\r\n k=1\r\n break\r\nif k==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\n\r\nevents = []\r\n# -1 - start\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n events.append((l, -1))\r\n events.append((r, 1))\r\nevents = sorted(events)\r\nbal = 0\r\nresult = True\r\nfor item in events:\r\n #print(item)\r\n bal += item[1]*(-1)\r\n #print(bal)\r\n if bal > 2:\r\n result = False\r\n print(\"NO\")\r\n break\r\nif(result):\r\n print(\"YES\")\r\n", "s = [tuple(map(int, input().split())) for i in range(int(input()))]\r\ns.sort(key=lambda q: q[0])\r\na = b = -1\r\nq = 'YES'\r\nfor l, r in s:\r\n if a >= l:\r\n q = 'NO'\r\n break\r\n a = r\r\n if b < a: a, b = b, a\r\nprint(q)", "from __future__ import division, print_function\r\nimport sys\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\nimport os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\n#from functools import lru_cache #use @lru_cache(None)\r\nif os.path.exists('in.txt'): sys.stdin=open('in.txt','r')\r\nif os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')\r\n#\r\ndef input(): return sys.stdin.readline()\r\ndef mapi(arg=0): return map(int if arg==0 else str,input().split())\r\n#------------------------------------------------------------------\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n x,y = mapi()\r\n a.append([x,-1])\r\n a.append([y,1])\r\na.sort()\r\nf = 1\r\n\r\ncnt =0\r\nfor i,v in enumerate(a):\r\n if v[1]==-1:\r\n cnt+=1\r\n else:\r\n cnt-=1\r\n if cnt>2:\r\n f = 0\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nx=[]\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n x.append((l,1))\r\n x.append((r,-1))\r\nx.sort(key=lambda x: (x[0],-x[1]))\r\ns=0\r\nfor i in range(len(x)):\r\n s+=x[i][1]\r\n if s==3:\r\n print('NO');exit()\r\nprint('YES')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nlr = [tuple(map(int, input().split())) for _ in range(n)]\r\nlr.sort(key=lambda k: k[0])\r\nt1, t2 = -1, -1\r\n\r\nfor l, r in lr:\r\n if t1<l:\r\n t1 = r\r\n else:\r\n if t2<l:\r\n t2 = r\r\n else:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "n = int(input())\r\nline = list()\r\nfor i in range(n):\r\n line.append(list(map(int, input().split())))\r\nline.sort()\r\ntv_1 = [-1, -1]\r\ntv_2 = [-1, -1]\r\nb = True\r\nfor elem in line:\r\n if tv_1[1] < elem[0]:\r\n tv_1 = elem\r\n elif tv_2[1] < elem[0]:\r\n tv_2 = elem\r\n else:\r\n b = False\r\n break\r\nprint('YES' if b else 'NO')", "# region declaration\nfrom collections import *\nfrom functools import *\nfrom math import *\nfrom heapq import *\nfrom itertools import *\nfrom bisect import *\n\n# autopep8: off\ndef floatl(): return (list(map(float, input().split())))\ndef inlt(): return (list(map(int, input().split())))\ndef inp(): return int(input())\ndef ins(): return str(input())\ndef insr(): return list(input())\ndef yesno(predicate): print(\"Yes\" if predicate else \"No\")\n# MOD = 998244353\nMOD = 1_000_000_007 \nINF = int(1e18)\n# autopep8: on\n# endregion\n\n\ndef solve():\n n = inp()\n shows = [inlt() for _ in range(n)]\n shows.sort()\n # print(shows)\n tv1 = [-2, -1]\n tv2 = [-2, -1]\n\n def intersect(a, b):\n return b[0] <= a[1] and b[1] >= a[0]\n\n for show in shows:\n if intersect(tv1, show) and intersect(tv2, show):\n return False\n if intersect(tv1, show):\n tv2 = show\n else:\n tv1 = show\n\n return True\n\n\nt = 1\n# t = inp()\nfor _ in range(t):\n yesno(solve())\n", "n = int(input())\n\nshows = []\n\nfor i in range(n):\n shows.append(list(map(lambda s: int(s), input().split())))\n\nshows = sorted(shows)\n\nt = [-1,-1]\nviolate = False\n\nfor s in shows:\n if s[0] > t[0]:\n t[0] = s[1]\n elif s[0] > t[1]:\n t[1] = s[1]\n else:\n violate = True\n break\n\nif not violate:\n print('YES')\nelse:\n print('NO')\n\n", "n = int(input())\ntv1 = []\ntv2 = []\nshows = []\nfor i in range(n):\n temp = list(map(int, input().split()))\n shows.append(temp)\n\nshows.sort(key=lambda x: x[0])\n\nok = \"YES\"\nfor e in shows:\n if len(tv1) == 0:\n tv1.append(e)\n elif len(tv2) == 0:\n tv2.append(e)\n else:\n if tv1[-1][1] < e[0]:\n tv1.append(e)\n elif tv2[-1][1] < e[0]:\n tv2.append(e)\n else:\n ok = \"NO\"\n break\n \nprint(ok)\n\n", "num = int(input())\ninputt = []\n\nfor i in range(num):\n inputt.append(tuple(map(int, input().split())))\n\ninputt.sort()\n\nx = -1\ny = -1\nw = False\n\nfor l, r in inputt:\n if l > x:\n x = r\n\n elif l > y:\n y = r\n \n else:\n w = True\n print(\"NO\")\n break\n\nif not w:\n print(\"YES\") \n\t\t \t \t \t\t\t \t\t \t\t\t \t\t \t \t", "n=int(input())\na,b=[],[]\nfor i in range(n):\n t=[int(i) for i in input().split()]\n a.append(t[0])\n b.append(t[1])\na.sort()\nb.sort()\ni=j=0\nans=0\n\nwhile ans<=2 and i<n and j<n:\n \"\"\"\n print(a[i],b[j])\n print(i,j,'\\n')\n \"\"\"\n if a[i]<=b[j]:\n ans+=1\n i+=1\n else:\n ans-=1\n j+=1\n\nif ans>2: print(\"NO\")\nelse: print(\"YES\")\n", "n = int(input())\r\narr = [] # making an array wohooo\r\nfor i in range(n):\r\n a,b = map(int , input().split())\r\n arr.append((a,1))\r\n arr.append((b+1,-1))\r\n\r\narr.sort()\r\nsum =0\r\nfor a,b in arr:\r\n #print(a , b)\r\n sum += b\r\n if sum > 2:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")", "import sys\r\nn=int(input())\r\nx=[]\r\nz=[]\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n x.append(a)\r\n z.append(b+1)\r\nx.sort()\r\nz.sort()\r\ns=''\r\nsc=0\r\nk=0\r\nj=0\r\nwhile (len(x)!=k and len(z)!=j):\r\n if x[k]>z[j]:\r\n s+=')'\r\n j+=1\r\n elif x[k]<z[j]:\r\n s+='('\r\n k+=1\r\n else:\r\n k+=1\r\n j+=1\r\nif len(z)-j>0:\r\n s+=(')'*(len(z)-j))\r\n#print(s)\r\nfor i in range(len(s)):\r\n if sc>2:\r\n print('NO')\r\n sys.exit()\r\n if s[i]=='(':\r\n sc+=1\r\n else:\r\n sc-=1\r\n \r\nprint('YES')", "li = []\nn = int(input())\nfor _ in range(n):\n\tl, r = map(int, input().split())\n\tli.append((l, r))\nli.sort()\na, b = -1, -1\nf = True\nfor i in range(n):\n\tif a < li[i][0]:\n\t\ta = li[i][1]\n\telif b < li[i][0]:\n\t\tb = li[i][1]\n\telse:\n\t\tf = False\nif f:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n \t\t\t \t \t\t \t \t\t\t\t\t \t\t\t \t\t\t\t", "n=int(input())\na=-1\nb=-1\nc=[]\n\nfor _ in range(n):\n c.append(list(map(int,input().split())))\n \nc.sort()\n\nfor i in range(n):\n if a<c[i][0]:\n a=c[i][1]\n elif b<c[i][0]:\n b=c[i][1]\n else:\n print(\"NO\")\n exit(0)\n\nprint(\"YES\")\n\n\n \t \t\t\t \t\t \t \t \t\t\t \t\t\t \t", "h = int(input())\nprogramas = []\ntvs = [-1,-1]\nfor i in range(h):\n programas.append(list(map(int, input().split())))\n \nprogramas.sort()\n \nteste = True\nfor i in programas:\n horario = min(tvs)\n if(i[0] <= horario):\n print(\"NO\")\n teste = False\n break\n else:\n tvs[tvs.index(horario)] = i[1]\n \nif(teste):\n print(\"YES\")\n \n \t \t\t \t\t \t \t\t\t\t \t \t\t \t \t\t", "def column_sorter(column,listt):\r\n if len(listt)<=1:\r\n return listt\r\n else:\r\n mid=len(listt)//2\r\n return merge(column_sorter(0,listt[:mid]),column_sorter(0,listt[mid:]))\r\ndef merge(listt1,listt2):\r\n listt=[]\r\n i=0\r\n j=0\r\n while i<len(listt1) and j<len(listt2):\r\n if listt1[i][0]<=listt2[j][0]:\r\n listt.append(listt1[i])\r\n i+=1\r\n else:\r\n listt.append(listt2[j])\r\n j+=1\r\n while i<len(listt1):\r\n listt.append(listt1[i])\r\n i+=1\r\n while j <len(listt2):\r\n listt.append(listt2[j])\r\n j+=1\r\n return listt\r\n \r\n \r\n \r\n \r\nn=int(input())\r\n \r\narray=[]\r\n \r\nfor i in range(n):\r\n a=list(map(int, input().split()))\r\n array.append(a)\r\narray=column_sorter(0,array)\r\nif len(array)<=2:\r\n print(\"YES\")\r\nelse:\r\n pre_i=array[0]\r\n pre_j=array[1]\r\n k=2\r\n flag=1\r\n while k!=n:\r\n c=array[k]\r\n if c[0]>pre_i[1]:\r\n pre_i=c\r\n elif c[0]>pre_j[1]:\r\n pre_j=c\r\n else:\r\n print(\"NO\")\r\n flag=0\r\n break\r\n k+=1\r\n if flag:\r\n print(\"YES\")\r\n ", "n = int(input())\r\ntv1 = (-5, -5)\r\ntv2 = (-5, -5)\r\nflag = True\r\na = []\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split()])\r\na.sort()\r\nfor l, r in a:\r\n if tv1[1] < l:\r\n tv1 = (l, r)\r\n elif tv2[1] < l:\r\n tv2 = (l, r)\r\n else:\r\n flag = False\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\n\ncount = 0\nlesson_list = []\nfor line in sys.stdin:\n if count == 0:\n num = int(line.strip())\n count += 1\n continue\n\n start = int(line.strip().split(' ')[0])\n end = int(line.strip().split(' ')[1])\n\n lesson_list.append((start, end))\n\n\nlesson_list.sort()\n\na_status = True\nb_status = True\n\na_time = 0\nb_time = 0\n\nflag = 0\n\nfor tmp in lesson_list:\n start = tmp[0]\n end = tmp[1]\n\n if start < a_time and start < b_time:\n flag = -1\n break\n\n if start >= a_time:\n a_time = end + 1\n continue\n\n b_time = end + 1\n\nif flag < 0:\n print('NO')\nelse:\n print('YES')\n\t\t\t \t\t \t\t \t\t\t \t\t\t\t\t\t\t \t \t", "n=int(input())\r\nq=[]\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n q+=[[l,r]]\r\nq.sort(key= lambda x:x[0])\r\nt=0\r\nw=[[q[0][0],q[0][1]],[-1,-1]]\r\nfor i in range(1,n):\r\n if q[i][0]<=w[0][1]:\r\n if q[i][0]<=w[1][1]:\r\n t=1\r\n else:\r\n w[1]=[q[i][0],q[i][1]]\r\n else:\r\n w[0]=[q[i][0],q[i][1]]\r\nprint(\"YNEOS\"[t::2])", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n segs = []\n for i in range(n):\n x, y = map(int, input().split(' '))\n segs.append((x, y))\n segs.sort()\n\n tv1 = tv2 = -1\n for i in range(n):\n l, r = segs[i][0], segs[i][1]\n if l > tv1: tv1 = r\n elif l > tv2: tv2 = r\n else:\n print(\"NO\")\n return\n print(\"YES\")\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n \t \t\t\t\t \t \t \t \t\t \t \t\t \t", "n = int(input())\r\nshows = []\r\nfor i in range(n):\r\n show = list(map(int, input().split()))\r\n shows.append(show)\r\n\r\nshows = sorted(shows)\r\n\r\nt = [-1, -1]\r\nok = True\r\n\r\nfor show in shows:\r\n if show[0] > t[0]:\r\n t[0] = show[1]\r\n \r\n elif show[0] > t[1]:\r\n t[1] = show[1]\r\n else:\r\n ok = False \r\n break\r\n\r\nif ok:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\npair = list()\npair1 = list()\npair2= list()\nfor i in range(n):\n x,y = map(int,input().split())\n pair.append((x,y))\npair.sort()\nf = True\nfor i in range (n):\n x = pair[i][0]\n y = pair[i][1]\n len1 = len(pair1)\n len2 = len(pair2)\n if(len1==0 or x>pair1[len1-1][1]):\n pair1.append((x,y))\n elif(len2==0 or x>pair2[len2-1][1]):\n pair2.append((x,y))\n else:\n f=False\n break\nif(f):\n print('YES')\nelse:\n print('NO')\n\n\t\t\t\t \t \t \t\t\t \t\t\t\t\t", "def main(d,t):\r\n for i in d:\r\n t += i[1]\r\n if t < -2:\r\n return(\"NO\")\r\n return (\"YES\")\r\nd = []\r\nn = int(input())\r\nfor i in range(n):\r\n a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n d.append([a,-1])\r\n d.append([b,1])\r\n \r\nd.sort()\r\nt = 0\r\nans=main(d,t)\r\nprint (ans)", "n = int(input())\r\n\r\n\r\ntv1 = []\r\ntv2 = []\r\n\r\nsentinela = False\r\n\r\npares = []\r\nfor i in range(n):\r\n par = list(map(int, input().split(\" \")))\r\n pares.append(par)\r\n\r\npares = sorted(pares)\r\nfor i in range(n):\r\n if(not tv1):\r\n tv1.append(pares[i])\r\n else:\r\n ultimo = tv1[len(tv1) - 1]\r\n if(pares[i][0] > ultimo[1]):\r\n tv1.append(pares[i])\r\n else:\r\n if(not tv2):\r\n tv2.append(pares[i])\r\n else:\r\n ultimo = tv2[len(tv2) - 1]\r\n if(pares[i][0] > ultimo[1]):\r\n tv2.append(pares[i])\r\n else:\r\n sentinela = True\r\n \r\n\r\n \r\nif(sentinela):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "# region declaration\nfrom collections import *\nfrom functools import *\nfrom math import *\nfrom heapq import *\nfrom itertools import *\nfrom bisect import *\n\n# autopep8: off\ndef floatl(): return (list(map(float, input().split())))\ndef inlt(): return (list(map(int, input().split())))\ndef inp(): return int(input())\ndef ins(): return str(input())\ndef insr(): return list(input())\ndef yesno(predicate): print(\"Yes\" if predicate else \"No\")\n# MOD = 998244353\nMOD = 1_000_000_007 \nINF = int(1e18)\n# autopep8: on\n# endregion\n\n\ndef solve():\n n = inp()\n shows = [inlt() for _ in range(n)]\n shows.sort()\n # print(shows)\n end1 = end2 = -INF\n\n for (l, r) in shows:\n if l > end1:\n end1 = r\n elif l > end2:\n end2 = r\n else:\n return False\n\n return True\n\n\nt = 1\n# t = inp()\nfor _ in range(t):\n yesno(solve())\n", "n = int(input())\r\nshow = [list(map(int, input().split())) for _ in range(n)]\r\nshow.sort(key=lambda x:x[0])\r\ntv1 = tv2 = -1\r\nans = True\r\nfor i in range(n):\r\n if show[i][0] > tv1:\r\n tv1 = show[i][1]\r\n elif show[i][0] > tv2:\r\n tv2 = show[i][1]\r\n else:\r\n ans = False\r\n break\r\nprint(\"YES\" if ans else \"NO\")\r\n \r\n \r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append((x,y))\r\na.sort()\r\ntv1=-1\r\ntv2=-1\r\nf=1\r\nfor i in range(n):\r\n if tv1<a[i][0]:\r\n tv1=a[i][1]\r\n elif tv2<a[i][0]:\r\n tv2=a[i][1]\r\n else:\r\n f=0\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nm = []\r\nfor i in range(0, n):\r\n a, b = map(int, input().split())\r\n m.append((a, b))\r\nm.sort()\r\na1 = -1\r\na2 = -1\r\nflag = 'YES'\r\nfor i in range(n):\r\n if m[i][0] > a1:\r\n a1 = m[i][1]\r\n elif m[i][0] > a2:\r\n a2 = m[i][1]\r\n else:\r\n flag = 'NO'\r\nprint(flag)", "from sys import stdin\r\ninput=stdin.readline\r\nfrom collections import defaultdict\r\ndef f(q:list):\r\n q.sort(key=lambda s:s[1])\r\n q.sort(key=lambda s:s[0])\r\n d=dict()\r\n res=0\r\n for l,r in q:\r\n res+=r\r\n if res>2:\r\n return \"NO\"\r\n return \"YES\"\r\nq=[]\r\nfor i in range(int(input())):\r\n x,y=map(int,input().strip().split())\r\n q.append((x,1))\r\n q.append((y+1,-1))\r\nprint(f(q))", "# https://vjudge.net/contest/321560#problem/E\n\nn = int(input())\n\nshows = []\n\nMAX_TVS = 2\n\nfor i in range(n):\n show_info = [ int(x) for x in input().split() ]\n shows.append(show_info)\n\nshows.sort(key=lambda x : x[0])\n\ntvs = []\ni = 0\n\nwhile len(tvs) <= MAX_TVS and i < n:\n if len(tvs) == MAX_TVS:\n if shows[i][0] > tvs[0][1]:\n tvs.pop(0)\n elif shows[i][0] > tvs[1][1]:\n tvs.pop(1)\n tvs.append(shows[i])\n i += 1\n\nresult = 'YES'\nif len(tvs) > MAX_TVS:\n result = 'NO'\n\nprint(result)", "from sys import stdin\r\nn=int(stdin.readline().strip())\r\ns=[tuple(map(int,stdin.readline().strip().split())) for i in range(n)]\r\ns.sort()\r\nt1=-1,-1\r\nt2=-1,-1\r\nfor i in s:\r\n if i[0]>t1[1]:\r\n t1=i\r\n elif i[0]>t2[1]:\r\n t2=i\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "n = int(input().strip())\n\nschedule = []\nfor i in range(n):\n l, r = list(map(int, input().strip().split()))\n schedule.append( (l, -1) )\n schedule.append( (r, 1) )\n\nschedule.sort()\nlayer = 0\nis_possible = True\nfor _, dx in schedule:\n layer += dx\n if layer < -2:\n is_possible = False\n break\n\nif is_possible:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = []\r\nfor _ in range(N):\r\n l,r = map(int, input().split())\r\n A.append((l,r))\r\nA.sort()\r\n\r\nd1,d2 = [],[]\r\npre = -1\r\nfor a,b in A:\r\n if a<=pre:\r\n d2.append((a,b))\r\n else:\r\n d1.append((a,b))\r\n pre=b\r\n \r\nfor i in range(len(d2)-1):\r\n if d2[i][1]>=d2[i+1][0]:\r\n exit(print('NO'))\r\nprint('YES')\r\n ", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append((x,y))\r\nf=True\r\na.sort()\r\nt1,t2=-1,-1\r\nfor i in range(n):\r\n x,y=a[i]\r\n if x>t1:\r\n t1=y\r\n elif x>t2:\r\n t2=y\r\n else:\r\n f=False\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nw, z=[], []\r\nfor j in range(n):\r\n c=[int(k) for k in input().split()]\r\n w.append(c[0])\r\n z.append(c[1])\r\nw.sort(reverse=True)\r\nz.sort(reverse=True)\r\nres=0\r\ncheck=1\r\nwhile w and z:\r\n if w[-1]<=z[-1]:\r\n w.pop()\r\n res+=1\r\n if res>2:\r\n print(\"NO\")\r\n check=0\r\n break\r\n else:\r\n z.pop()\r\n res-=1\r\nelse:\r\n print(\"YES\")", "n = int( input() )\r\narr = list()\r\nfor i in range(n):\r\n l , r = map( int , input().split() )\r\n arr.append( (l,r) )\r\ne1 , e2 = -1 , -1\r\narr.sort()\r\nans = 'YES'\r\nfor i in arr:\r\n if i[0] > e1:\r\n e1 = i[1]\r\n elif i[0] > e2:\r\n e2 = i[1]\r\n else:\r\n ans = 'NO'\r\nprint(ans)", "shows = int(input())\r\n\r\narray = []\r\nfor _ in range(shows):\r\n start, end = input().split()\r\n start, end = int(start), int(end)\r\n array.append((start, 1))\r\n array.append((end + 1, -1))\r\narray.sort()\r\n\r\ncount = 0\r\nposs = True\r\n\r\nfor item in array:\r\n count += item[1]\r\n if count >= 3:\r\n poss = False\r\n break\r\n \r\nif poss:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n" ]

[ "#!/usr/bin/env python3\nfrom sys import stdin,stdout\nfrom bisect import *\nfrom heapq import *\n\ndef ri():\n return map(int, input().split())\n\nn = int(input())\n\nabw = [list(ri()) for i in range(n)]\n\na1 = abw[0][0]\na = [abw[i][0] for i in range(1,n)]\na.sort()\nabw = abw[1:]\nabw.sort(key=lambda e: e[0])\nfor j in range(len(abw)):\n if abw[j][0] > a1:\n break\nelse:\n j += 1\nf = 0\nmins = n - j\npq = [abw[i][1]-abw[i][0] for i in range(j, n-1)]\nheapify(pq)\niiprv = j\nwhile len(pq) and a1 > 0:\n g = heappop(pq)\n if a1 > g:\n f += 1\n a1 -= g+1\n ii = bisect(a,a1)\n for k in range(ii, iiprv):\n heappush(pq, abw[k][1]-abw[k][0])\n\n iiprv = ii\n mins = min(mins, n-ii-f)\n\nprint(mins)\n\n\n", "from bisect import bisect_right\nimport heapq\n\nn = int(input())\nl = []\n\nti, wi = map(int, input().split())\nbal = ti\npos = 1\nfor _ in range(n - 1):\n ti, wi = map(int, input().split())\n if ti > bal:\n pos += 1\n l.append((ti, wi - ti + 1))\nl.sort()\n\nbest_pos = pos\n\nop = bisect_right(l, (bal, float('inf')))\n#print(l)\n\nw = []\nfor i, v in l[op:]:\n heapq.heappush(w, v)\nop -= 1\n\nwhile w:\n head = heapq.heappop(w)\n if bal < head:\n break\n bal -= head\n pos -= 1\n\n #print(w, op)\n while op >= 0 and l[op][0] > bal:\n heapq.heappush(w, l[op][1])\n op -= 1\n pos += 1\n best_pos = min(best_pos, pos)\n\nprint(best_pos)\n", "'''input\n8\n20 1000\n32 37\n40 1000\n45 50\n16 16\n16 16\n14 1000\n2 1000\n'''\nimport heapq\nfrom bisect import bisect\n\ninf = 10**18 + 2\n\ndef rints():\n return list(map(int, input().split()))\n\ndef ri():\n return int(input())\n\ndef bin_search(arr, pred, lo=0, hi = None):\n if hi is None:\n hi = len(arr)\n while lo < hi :\n mid = (lo+hi) // 2\n if pred(arr[mid]):\n hi = mid\n else:\n lo = mid + 1\n return lo\n\nn = ri()\nscore, _ = rints()\n\nteams = []\nfor _ in range(n-1):\n t, w = rints()\n teams.append((w-t + 1, t, w))\n\nteams.sort(key = lambda x : x[1])\n# print(teams)\n\ndef solve(score):\n idx = bin_search(teams, lambda x : x[1] > score)\n best = pos = len(teams) - idx + 1\n # print(teams[idx:], pos)\n\n ahead = teams[idx:]\n behind = teams[:idx]\n heapq.heapify(ahead)\n # print(ahead)\n\n while ahead and score >= ahead[0][0]:\n score -= heapq.heappop(ahead)[0]\n pos -= 1\n while behind and behind[-1][1] > score:\n heapq.heappush(ahead, behind.pop())\n pos += 1\n # print(score, pos)\n best = min(best, pos)\n\n return best\n\nprint(solve(score))\n\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom heapq import heappop, heappush, heapify\r\n\r\nn = int(input())\r\nb, _ = map(int, input().split())\r\nheap = []\r\nheap2 = []\r\nfor _ in range(n-1):\r\n t, w = map(int, input().split())\r\n if t > b:\r\n heap.append(w + 1 - t)\r\n else:\r\n heap2.append((-t, -w))\r\nheapify(heap)\r\nheapify(heap2)\r\nans = len(heap) + 1\r\nwhile heap:\r\n need = heap[0]\r\n if need > b:\r\n break\r\n b -= need\r\n heappop(heap)\r\n while heap2 and -heap2[0][0] > b:\r\n t, w = heappop(heap2)\r\n t, w = -t, -w\r\n heappush(heap, w + 1 - t)\r\n cur = len(heap) + 1\r\n ans = min(ans, cur)\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nlimak = list(map(int, input().split()))\r\n\r\nimport heapq\r\npq = []\r\narr = []\r\nfor i in range(1, n):\r\n ti, wi = map(int, input().split())\r\n if ti > limak[0]:\r\n heapq.heappush(pq, wi - ti + 1)\r\n else:\r\n arr.append((ti, wi - ti + 1))\r\n\r\narr.sort(reverse=True)\r\nrem = limak[0]\r\nbest = len(pq) + 1\r\ncur = len(pq) + 1\r\nidx = 0\r\nwhile rem and pq:\r\n nxt = pq[0]\r\n heapq.heappop(pq)\r\n if rem < nxt:\r\n break\r\n rem -= nxt\r\n cur -= 1\r\n while idx < len(arr) and arr[idx][0] > rem:\r\n heapq.heappush(pq, arr[idx][1])\r\n idx += 1\r\n cur += 1\r\n best = min(best, cur)\r\nprint(best)\r\n \r\n" ]

[ "import copy\r\nimport random\r\nimport heapq\r\nimport math\r\nimport sys\r\nimport bisect\r\nimport datetime\r\nfrom functools import lru_cache\r\nfrom collections import deque\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nfrom itertools import combinations\r\nfrom itertools import permutations\r\nfrom types import GeneratorType\r\nfrom functools import cmp_to_key\r\nfrom decimal import Decimal\r\nfrom heapq import nlargest\r\ninf = float(\"inf\")\r\nsys.setrecursionlimit(10000000)\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n\r\ndef main(ac=FastIO()):\r\n n, k, p = ac.read_ints()\r\n person = sorted(ac.read_list_ints())\r\n keys = sorted(ac.read_list_ints())\r\n\r\n def check(x):\r\n lst = []\r\n for y in keys:\r\n if abs(y - p) <= x:\r\n z = x - abs(y - p)\r\n lst.append([y - z, y + z])\r\n lst.sort(key=lambda it: [it[1], it[0]])\r\n m = len(lst)\r\n i = 0\r\n for j in range(n):\r\n y = person[j]\r\n while i < m and not (lst[i][0] <= y <= lst[i][1]):\r\n i += 1\r\n if i == m:\r\n return False\r\n i += 1\r\n return True\r\n\r\n low = 0\r\n high = 10**15\r\n while low < high - 1:\r\n mid = low + (high - low) // 2\r\n if check(mid):\r\n high = mid\r\n else:\r\n low = mid\r\n ans = low if check(low) else high\r\n ac.st(ans)\r\n return\r\n\r\n\r\nmain()\r\n", "n, k, p = (int(x) for x in input().split())\r\na = sorted([int(x) for x in input().split()])\r\nb = sorted([int(x) for x in input().split()])\r\n\r\ntime = min([max([abs(a[j] - b[i + j]) + abs(b[i + j] - p) for j in range(n)]) for i in range(k-n+1)])\r\n\r\nprint(time) ", "import math\r\nimport sys\r\nfrom bisect import bisect_right, bisect_left\r\nfrom collections import Counter, defaultdict\r\nfrom heapq import heappop, heappush\r\nfrom itertools import accumulate\r\nfrom sys import stdout\r\n\r\nR = lambda: map(int, input().split())\r\nnp, nk, z = R()\r\nps = sorted(R())\r\nks = sorted(R())\r\nres = math.inf\r\nfor ki in range(nk - np + 1):\r\n res = min(res, max(abs(x - y) + abs(y - z) for x, y in zip(ps, ks[ki:ki + np + 1])))\r\nprint(res)", "\nn,k,p=map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\na.sort()\nb.sort()\nans = 1000000000000000\nans = int(ans)\nfor i in range(k-n+1):\n tmp = 0\n for j in range(n):\n tmp = max(tmp,abs(a[j]-b[i+j])+abs(b[i+j]-p))\n ans = min(ans,tmp)\nprint(ans)", "n, k, p = [int(_) for _ in input().split()]\na = [int(_) for _ in input().split()]\nb = [int(_) for _ in input().split()]\na.sort()\nb.sort()\n\nres = 2147483647\nfor i in range(k-n+1):\n m = 0\n for j in range(n):\n k = j + i\n dis = abs(a[j] - b[k]) + abs(b[k] - p)\n m = max(m, dis)\n res = min(res, m)\nprint(res)\n \t \t \t \t \t\t\t \t \t \t \t\t", "filler = [0] * 10000\n\nnumbers = list(map(int, input().split()))\n\nn = numbers[0]\nk = numbers[1]\np = numbers[2]\n\nrezultat = 9999999999999999\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.sort()\nb.sort()\n\n#a = a + filler\n#b = b + filler\n\nfor i in range(k - n + 1):\n temp_max = -999999999\n for j in range(n):\n temp_max = max(abs(b[i + j] - a[j]) + abs(b[i + j] - p), temp_max)\n \n rezultat = min(temp_max, rezultat)\n \nprint(rezultat)\n\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k, p = map(int, input().split())\r\nA = sorted(map(int, input().split()))\r\nB = [0] + sorted(map(int, input().split()))\r\ndp = [[0] * (k + 1) for _ in range(n + 1)]\r\nfor i, a in enumerate(A, 1):\r\n for j in range(k - n + i, i - 1, -1):\r\n dp[i][j] = max(dp[i - 1][j - 1], abs(a - B[j]) + abs(B[j] - p))\r\nprint(min(dp[-1][n:]))\r\n", "read = lambda: map(int, input().split())\r\nn, k, p = read()\r\na, b = sorted(read()), sorted(read())\r\nprint(min(max(abs(b[i + d] - a[i]) + abs(b[i + d] - p) for i in range(n)) for d in range(k - n + 1)))", "o=lambda:[int(f)for f in input().split()]\r\nn,k,p=o()\r\na=sorted(o())\r\nb=sorted(o())\r\nprint(min(max(abs(b[i + d] - a[i]) + abs(b[i + d] - p) for i in range(n)) for d in range(k - n + 1)))\r\n", "n, k, p = (map(int, input().split()))\r\na = sorted(map(int, input().split()))\r\nb = sorted(map(int, input().split()))\r\n\r\ntime = min([max([abs(a[j] - b[i + j]) + abs(b[i + j] - p) for j in range(n)]) for i in range(k-n+1)])\r\n\r\nprint(time)", "na,nb,o=list(map(int, input().split()))\r\na=sorted(list(map(int, input().split())))\r\nb=sorted(list(map(int, input().split())))\r\ndp=[[float('inf') for _ in range(nb+1)] for _ in range(na+1)]\r\nfor i in range(nb+1):\r\n dp[0][i]=0\r\nfor i in range(1,na+1):\r\n for j in range(1,nb+1):\r\n dp[i][j] = min(dp[i][j-1], max(dp[i-1][j-1] ,abs(a[i-1]-b[j-1])+abs(o-b[j-1])))\r\nprint(dp[na][nb])", "#!/usr/bin/env python3\n# http://codeforces.com/contest/830/problem/A\nimport sys\nfrom operator import itemgetter\n\nread = lambda: map(int, input().split())\nn, k, p = read() # n people, k keys, office location \npeople, keys = sorted(read()), sorted(read())\n\nres = []\nfor i in range(k - n + 1):\n\tinner_res = []\n\tfor j in range(n):\n\t\tinner_res.append(abs(keys[i + j] - people[j]) + abs(keys[i + j] - p))\n\tres.append(max(inner_res))\n\nprint(min(res))\n", "n,k,l=map(int,input().split())\r\npeople=sorted(list(map(int,input().split())))\r\nkey=sorted(list(map(int,input().split())))\r\ndp=[[999999999999999 for i in range(n+1)] for j in range(k+1)]\r\nfor i in range(k+1):\r\n dp[i][0]=0\r\nfor i in range(1,k+1):\r\n for j in range(1,n+1):\r\n dp[i][j]=max(dp[i-1][j-1],min(dp[i-1][j],abs(key[i-1]-people[j-1])+abs(key[i-1]-l)))\r\nprint((dp[k][n]))", "n, k, p = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nb = sorted(list(map(int, input().split())))\r\n\r\nres = 1e15\r\nfor i in range(k - n + 1):\r\n ma = 0\r\n for j in range(n):\r\n te = abs(a[j] - b[i+j]) + abs(b[i+j] - p)\r\n ma = max(ma, te)\r\n res = min(res, ma)\r\nprint(res)\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb,prod\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nN,M,K = map(int,input().split())\nA = sorted(map(int,input().split()))\nB = sorted(map(int,input().split()))\nans = float(\"inf\")\n\nfor i in range(M-N+1):\n t,num = 0,i\n for j in range(N):\n t = max(t,abs(A[j]-B[num])+abs(B[num]-K))\n num+=1\n ans = min(ans,t)\nprint(ans)", "n,k,p=map(int,input().split())\r\nans=float(\"inf\")\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nfor i in range(k-n+1):\r\n t=0\r\n o=i\r\n for j in range(n):\r\n \r\n t=max(t,abs(a[j]-b[o])+abs(b[o]-p))\r\n o+=1\r\n ans=min(ans,t)\r\nprint(ans)", "def read():\r\n return [int(x) for x in input().split()]\r\n\r\nn,k,p = read()\r\na = read()\r\nb = read()\r\na.sort()\r\nb.sort()\r\nans = 2e9+1\r\nans = int(ans)\r\nfor i in range(k-n+1):\r\n tmp = 0\r\n for j in range(n):\r\n tmp = max(tmp,abs(a[j]-b[i+j])+abs(b[i+j]-p))\r\n ans = min(ans,tmp)\r\nprint(ans)", "import sys\r\ninput=sys.stdin.readline\r\nn,k,p=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nans=10**18\r\nfor i in range(k-n+1):\r\n sc=0\r\n for j in range(n):\r\n sc=max(sc,abs(a[j]-b[i+j])+abs(b[i+j]-p))\r\n ans=min(ans,sc)\r\nprint(ans)", "def dp(k,a,t):\r\n a=sorted(a)\r\n t=sorted(t)\r\n dp=[[float(\"inf\")]*(len(a)+1) for i in range(len(t)+1)]\r\n dp[0][0]=0\r\n for i in range(len(t)):\r\n for j in range(len(a)+1):\r\n dp[i+1][j]=min(dp[i+1][j],dp[i][j])\r\n if j<len(a):\r\n dp[i+1][j+1]=min(dp[i+1][j+1],max(dp[i][j],abs(a[j]-t[i])+abs(t[i]-k)))\r\n return (dp[len(t)][len(a)])\r\n \r\n \r\na,b,c=map(int,input().strip().split())\r\nlst=list(map(int,input().strip().split()))\r\nlst2=list(map(int,input().strip().split()))\r\nprint(dp(c,lst,lst2))", "\"\"\"\r\nhttp://codeforces.com/problemset/problem/830/A\r\n2 4 50\r\n20 100\r\n60 10 40 80 should output 50\r\n\"\"\"\r\n_, _, office = [int(i) for i in input().split()]\r\npeople = sorted(int(i) for i in input().split())\r\nkeys = sorted(int(i) for i in input().split())\r\nassert len(people) <= len(keys)\r\n\r\nmin_time = min(max(abs(p - keys[ki + v]) + abs(keys[ki + v] - office)\r\n for v, p in enumerate(people))\r\n for ki in range(len(keys) - len(people) + 1))\r\nprint(min_time)\r\n", "n,m,p = map(int,input().split())\r\npeople = [int(x) for x in input().split()]\r\nkey = [int(x) for x in input().split()]\r\n\r\npeople.sort()\r\nkey.sort()\r\n\r\nans = float(\"Inf\")\r\nfor i in range(m-n+1):\r\n temp = 0 \r\n for j in range(n):\r\n temp = max(temp,abs(people[j]-key[j+i])+abs(key[j+i]-p))\r\n ans = min(ans,temp)\r\nprint(ans)\r\n ", "# self.author = Fuad Ashraful Mehmet ,CSE-UAP\n\nread=lambda:map(int,input().split())\n\nn,k,p=read()\nA=sorted(read())\nB=sorted(read())\n\nres=1e18\ndef fun(x,y):\n return abs(x-y)+abs(y-p)\n\nfor i in range(k-n+1):\n now=0\n for j in range(n):\n c=fun(A[j],B[i+j])\n if c>now:\n now=c\n\n if now<res:\n res=now\n\nprint(res)\n\n'''\nInput:\n2 4 50\n20 100\n60 10 40 80\nOutput:\n50\n\n'''", "import sys\n\npeople, keys, office = map(int, input().split())\np_pos = list(map(int, input().split()))\nk_pos = list(map(int, input().split()))\n\np_pos = sorted(p_pos)\nk_pos = sorted(k_pos)\n\nres = sys.maxsize\n\nfor i in range(keys - people + 1):\n maxT = -1\n for j in range(people):\n key_index = i + j\n maxT = max(maxT, abs(office - k_pos[key_index]) + abs(p_pos[j] - k_pos[key_index]))\n res = min(res, maxT)\n\nprint(res)", "read = lambda: map(int, input().split())\nn, k, p = read()\na = list(read())\nb = list(read())\na.sort()\nb.sort()\n\n\ndef cal(a, b):\n return abs(a - b) + abs(b - p)\n\nmi = 1e15\nfor _ in range(k - n + 1):\n ma = 0\n for __ in range(n):\n te = cal(a[__], b[_ + __])\n if te > ma:\n ma = te\n if ma < mi:\n mi = ma\nprint(mi)\n", "def read():\r\n def get_numbers():\r\n try:\r\n read.s = input().split()\r\n read.s_len = len(read.s)\r\n if read.s_len == 0:\r\n get_numbers()\r\n read.cnt = 0\r\n return 1\r\n except:\r\n return 0\r\n if not hasattr(read, 'cnt'):\r\n if not get_numbers(): return 0\r\n if read.cnt==read.s_len:\r\n if not get_numbers(): return 0\r\n read.cnt += 1\r\n # return eval(read.s[read.cnt-1]) \r\n return int(read.s[read.cnt-1]) \r\n \r\n \r\ndef solve():\r\n n, k, p = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n a.sort()\r\n b.sort()\r\n dp = [[0] * (k + 1) for _ in range(n + 1)]\r\n for i in range(1, n + 1):\r\n for j in range(i, k + 1):\r\n d = abs(a[i - 1] - b[j - 1]) + abs(p - b[j - 1])\r\n dp[i][j] = max(d, dp[i - 1][j - 1])\r\n if j > i:\r\n dp[i][j] = min(dp[i][j], dp[i][j - 1])\r\n print(dp[n][k])\r\n\r\n\r\nif __name__ == '__main__':\r\n T = 1\r\n for _ in range(T):\r\n solve();" ]

[ "from collections import Counter\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nBUFSIZ = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"n\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZ))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZ))\r\n self.newlines = b.count(b\"\\n\")+(not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\n\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef solve():\r\n s = input()\r\n n = len(s)\r\n if n < 4:\r\n print(\"YES\")\r\n print(s)\r\n return\r\n\r\n # Getting the primes till N\r\n\r\n ps = [_ & 1 if _ != 1 else 0 for _ in range(n+1)]\r\n ps[2] = 1\r\n primes = []\r\n for i in range(2, n+1):\r\n if i == 1:\r\n continue\r\n cnt = i\r\n while i * cnt < n:\r\n ps[i * cnt] = 0\r\n cnt += 2\r\n if ps[i]:\r\n primes.append(i)\r\n\r\n count = Counter(s)\r\n com = count.most_common()[0][0]\r\n\r\n # every symbol except first until n // 2 should have to be the same.\r\n # imagine we have prime P, then next prime for that number will be 2 * P.\r\n # if 2 * P <= N, then this should be the same number as 2\r\n\r\n ans = [\"\" for _ in range(n)]\r\n for prime in primes:\r\n if prime > n:\r\n break\r\n if prime <= n >> 1:\r\n for i in range(prime - 1, n, prime):\r\n if not ans[i]:\r\n ans[i] = com\r\n count[com] -= 1\r\n if count[com] < 0:\r\n print(\"NO\")\r\n return\r\n\r\n # Deal with leftovers\r\n\r\n for i in range(n):\r\n if not ans[i]:\r\n while not count[next(iter(count))[0]]:\r\n del count[next(iter(count))[0]]\r\n k = next(iter(count))[0]\r\n ans[i] = k\r\n count[k] -= 1\r\n\r\n print(\"YES\", \"\".join(ans), sep=\"\\n\")\r\n\r\n\r\nsolve()\r\n", "def prime(n):\r\n if n < 2: return False\r\n i = 2\r\n\r\n while i * i <= n:\r\n if n % i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nprimes = []\r\n\r\ni = 0\r\nfor i in range(n + 1):\r\n if prime(i):\r\n primes.append(i)\r\n\r\nfreq = {}\r\n\r\nfor i in range(n):\r\n freq[s[i]] = freq.get(s[i], 0) + 1\r\n\r\nans = [1]*n\r\n\r\nfor p in primes:\r\n cur = p\r\n if p * 2 <= n:\r\n cur = 2\r\n\r\n for j in range(p, n + 1, p):\r\n ans[j - 1] = cur\r\n\r\ncnts = {}\r\nfor i in range(n):\r\n cnts[ans[i]] = cnts.get(ans[i], 0) + 1\r\n\r\nxs = list(freq.items())\r\nxs.sort(key= lambda x: -x[1])\r\n\r\ncs = list(cnts.items())\r\ncs.sort(key= lambda x: -x[1])\r\n\r\ngood = True\r\nfor c in xs:\r\n cnt = c[1]\r\n\r\n pop = []\r\n i = 0\r\n while cnt and i < len(cs):\r\n if cs[i][1] <= cnt:\r\n cnt -= cs[i][1]\r\n for j in range(n):\r\n if ans[j] == cs[i][0]:\r\n ans[j] = c[0]\r\n pop.append(i)\r\n\r\n i += 1\r\n \r\n for rem in pop[::-1]:\r\n cs.pop(rem)\r\n if cnt:\r\n good = False\r\n break\r\n\r\nif good:\r\n print(\"YES\")\r\n print(*ans, sep=\"\")\r\nelse:\r\n print(\"NO\")", "# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nfrom bisect import bisect_right\r\nfrom sys import stdin, stdout\r\n\r\n# -------------- INPUT FUNCTIONS ------------------\r\n\r\n\r\ndef get_ints_in_variables(): return map(\r\n int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline())\r\n\r\n\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n# -------- SOME CUSTOMIZED FUNCTIONS-----------\r\n\r\n\r\ndef myceil(x, y): return (x + y - 1) // y\r\n\r\n# -------------- SOLUTION FUNCTION ------------------\r\n\r\n\r\ndef getPrime():\r\n p = [1]*1001\r\n for i in range(2, 1001):\r\n if p[i]:\r\n for j in range(i, 1001, i):\r\n p[j] = 0\r\n p[i] = 1\r\n return p\r\n\r\n\r\ndef Solution():\r\n # Write Your Code Here\r\n s = get_string()\r\n n = len(s)\r\n primes = getPrime()\r\n cntArr = [0]*26\r\n for i in range(n):\r\n cntArr[ord(s[i])-97] += 1\r\n p = 0\r\n for i in range((n//2)+1, n+1):\r\n if primes[i]:\r\n p += 1\r\n if max(cntArr) < n-1-p:\r\n print(\"NO\")\r\n return\r\n ans = [\"\"]*(n+1)\r\n id = cntArr.index(max(cntArr))\r\n for i in range(2, (n//2)+1):\r\n ans[i] = chr(97+id)\r\n cntArr[id] -= 1\r\n for i in range((n//2)+1, n+1):\r\n if not primes[i]:\r\n ans[i] = chr(97+id)\r\n cntArr[id] -= 1\r\n j = 0\r\n for i in range(1, n+1):\r\n if ans[i] == \"\":\r\n while cntArr[j] <= 0:\r\n j += 1\r\n ans[i] = chr(97+j)\r\n cntArr[j] -= 1\r\n print(\"YES\")\r\n print(\"\".join(ans[1::]))\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n Solution()\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import Counter\r\n \r\n \r\n \r\nd, t = 'NO', input()\r\n \r\nc, n = Counter(t), len(t)\r\n \r\np = [0] * (n + 1)\r\n \r\nfor i in range(2, n // 2 + 1):\r\n \r\n if 1 - p[i]: p[i::i] = [1] * (n // i)\r\n \r\ns = sum(p)\r\n \r\nu = v = ''\r\n \r\nfor q, k in c.items():\r\n \r\n if v or k < s:\r\n \r\n u += q * k\r\n \r\n else:\r\n \r\n u += q * (k - s)\r\n \r\n v = q\r\n \r\nif v:\r\n \r\n d, j = 'YES\\n', 0\r\n \r\n for i in range(1, n + 1):\r\n \r\n if p[i]:\r\n \r\n d += v\r\n \r\n else:\r\n \r\n d += u[j]\r\n \r\n j += 1\r\n \r\nprint(d)", "# ---------------------------------------------------------------------------------------\r\n# URL : https://codeforces.com/contest/123/problem/A\r\n# Title : Prime Permutation\r\n# Tags : tag-codeforces, tag-problem-A, tag-div-1, tag-difficulty-1300\r\n# Notes : implementation, number theory, strings\r\n# ---------------------------------------------------------------------------------------\r\n\r\n# region --------------------------------------------Shared part--------------------------------------------------------\r\nimport math\r\nimport os\r\nimport sys\r\nimport time\r\nfrom collections import defaultdict, Counter\r\nfrom io import IOBase, BytesIO\r\n\r\ninp = lambda: sys.stdin.readline().strip().rstrip(\"\\r\\n\")\r\niinp = lambda: int(inp())\r\nintl = lambda: list(map(int, inp().split()))\r\nstrl = lambda: list(inp().split())\r\nlist_to_string = lambda _a: \"\".join(map(str, _a))\r\nlist_to_string_list = lambda _a: \" \".join(map(str, _a))\r\n_dp = lambda default_value: defaultdict(lambda: default_value)\r\nflush = lambda: sys.stdout.flush()\r\nprint_flush = lambda _text: (print(_text), flush())\r\nfact = lambda number: math.factorial(number)\r\ncnt = lambda _a: Counter(_a)\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b // math.gcd(a, b)\r\n\r\n\r\ndef print_dp(_dict):\r\n for item in _dict.items():\r\n print(f\"{item[0]} = {item[1]}\")\r\n\r\n\r\ndef memodict(f):\r\n \"\"\"memoization decorator for a function taking a single argument\"\"\"\r\n\r\n class memodict(dict):\r\n def __missing__(self, key):\r\n ret = self[key] = f(key)\r\n return ret\r\n\r\n return memodict().__getitem__\r\n\r\n\r\nMOD = 10 ** 9 + 7\r\nINF = sys.maxsize\r\nA = 911382323\r\nM = 9999999999879998\r\nyes = \"YES\"\r\nno = \"NO\"\r\n\r\n# region -------------------------------------------Fast IO Region------------------------------------------------------\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\n# endregion\r\n# endregion\r\n\r\n# -------------------------------------------------------Solution-------------------------------------------------------\r\n\r\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107,\r\n 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229,\r\n 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359,\r\n 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491,\r\n 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641,\r\n 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787,\r\n 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941,\r\n 947, 953, 967, 971, 977, 983, 991, 997]\r\n\r\n\r\ndef solve():\r\n s = inp()\r\n n = len(s)\r\n\r\n if n < 4:\r\n print(\"YES\")\r\n print(s)\r\n return\r\n\r\n _cnt = cnt(list(s))\r\n _max = max(_cnt.items(), key=lambda x: x[1])[0][0]\r\n\r\n # every symbol except first until n // 2 should have to be the same.\r\n # imagine we have prime P, then next prime for that number will be 2 * P.\r\n # if 2 * P <= N, then this should be the same number as 2\r\n ans = [0 for i in range(n)]\r\n\r\n for prime in primes:\r\n if prime > n:\r\n break\r\n\r\n if 2 * prime <= n:\r\n for i in range(prime - 1, n, prime):\r\n if ans[i] == 0:\r\n ans[i] = _max\r\n _cnt[_max] -= 1\r\n\r\n if _cnt[_max] < 0:\r\n print(\"NO\")\r\n return\r\n\r\n for i in range(n):\r\n if ans[i] == 0:\r\n while _cnt[list(_cnt)[0]] == 0:\r\n del _cnt[list(_cnt)[0]]\r\n\r\n _key = list(_cnt)[0]\r\n ans[i] = _key\r\n _cnt[_key] -= 1\r\n\r\n print(\"YES\")\r\n print(list_to_string(ans))\r\n\r\n\r\ndef run():\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n if os.environ.get(\"DEBUG_CODEFORCES\"):\r\n sys.stdin = open(\"../../input.txt\", \"r\")\r\n start_time = time.time()\r\n run()\r\n print(\"\\n--- %s seconds ---\\n\" % (time.time() - start_time))\r\n else:\r\n run()\r\n", "from collections import Counter\r\n\r\nis_prime = lambda x: all(x % d for d in range(2, int(x **.5) + 1))\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nK = {1} | {x for x in range(n // 2 + 1, n + 1) if is_prime(x)}\r\nk = len(K)\r\n\r\nch, m = max(Counter(s).items(), key=lambda x: x[1])\r\n\r\nif m + k < n:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n s = list(s.replace(ch, '', n - k))\r\n A = [0] * n\r\n \r\n for i in range(n):\r\n A[i] = s.pop() if (i + 1) in K else ch\r\n \r\n print(''.join(A))", "def primes(n):\r\n prime = [True]*(n+1)\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n r = []\r\n for p in range(2, n+1):\r\n if prime[p]:\r\n r.append(p)\r\n return r\r\n\r\n\r\ndef delCharN(s, c, n):\r\n # print(f\"n = {n}\")\r\n # print(\"while entering\", s)\r\n # print(f\"len(s) = {len(s)}\")\r\n i = 0\r\n while i<len(s) and n:\r\n if s[i] == c:\r\n n-= 1\r\n s.pop(i)\r\n else:\r\n i += 1\r\n # print(\"while leaving\", s)\r\n # print(f\"len(s) = {len(s)}\")\r\n # print(f\"n = {n}\") \r\n return s\r\n \r\ns = input()\r\nsmod = len(s)\r\nst = set(s)\r\n# print(st)\r\n\r\ncounts = {}\r\n\r\nfor c in st:\r\n counts[c] = s.count(c)\r\n\r\nimp = []\r\npr = primes(int(smod/2))\r\nfor p in pr:\r\n\tfor i in range(int(smod/p)):\r\n\t\tadd = p*(i+1)\r\n\t\tif add not in imp:\r\n\t\t\timp.append(add)\r\nimp.sort()\r\n\r\n# print(counts)\r\n# print(imp)\r\n\r\nimp_len = len(imp)\r\n# print(f\"imp_len = {imp_len}\")\r\niit_c = None\r\n\r\ndo = False\r\n\r\nfor key, value in counts.items():\r\n if value >= imp_len:\r\n do = True\r\n iit_c = key\r\n break\r\n\r\nif do:\r\n print(\"YES\")\r\n sl = list(s)\r\n ans = [None]*smod\r\n for pos in imp:\r\n ans[pos-1] = iit_c\r\n # print(\"ans =\", ans)\r\n sl = delCharN(sl, iit_c, imp_len)\r\n i = 0\r\n while i<len(ans):\r\n if not ans[i]:\r\n ans[i] = sl[0]\r\n sl.pop(0)\r\n # print(\"ans =\", ans)\r\n # print(sl)\r\n i += 1\r\n print(\"\".join(ans))\r\n \r\nelse:\r\n print(\"NO\")", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: Jalpaiguri Govt Enggineering College\r\n\r\n'''\r\nfrom os import path\r\nfrom io import BytesIO, IOBase\r\nimport sys\r\nfrom heapq import heappush,heappop\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,Counter,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input().rstrip()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nmod=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef bo(i):\r\n return ord(i)-ord('0')\r\n\r\nfile = 1\r\ndef ceil(a,b):\r\n return (a+b-1)//b\r\n\r\n\r\n\r\n\r\ndef solve():\r\n\r\n \r\n # for _ in range(1,ii()+1):\r\n s = si()\r\n n = len(s)\r\n par = [i for i in range(n+1)]\r\n def find(u):\r\n if par[u]==u:\r\n return u\r\n par[u] = find(par[u])\r\n return par[u]\r\n \r\n def merge(u,v):\r\n u = find(u)\r\n v = find(v)\r\n if u != v:\r\n if u < v:\r\n u,v = v,u\r\n par[u] = v\r\n\r\n ok = [0]*(n+1)\r\n for i in range(2,n+1):\r\n if ok[i]==0:\r\n for j in range(2*i,n+1,i):\r\n ok[j] = 1\r\n merge(i,j)\r\n m = {}\r\n mx = 0\r\n idx = 0\r\n for i in range(1,n+1):\r\n if par[i] not in m:\r\n m[par[i]] = 0\r\n m[par[i]] += 1\r\n if mx < m[par[i]]:\r\n mx = m[par[i]]\r\n idx = par[i]\r\n # mx = max(mx,m[par[i]])\r\n m1 = {}\r\n mx1 = 0\r\n c = 'a'\r\n for i in s:\r\n if i not in m1:\r\n m1[i] = 0\r\n m1[i] += 1\r\n if mx1 < m1[i]:\r\n mx1 = m1[i]\r\n c = i\r\n if mx > mx1:\r\n print('NO')\r\n return\r\n res = ['0']*n\r\n for i in range(1,n+1):\r\n if par[i] == idx:\r\n res[i-1] = c\r\n x = []\r\n for i in m1:\r\n if i==c:\r\n rem = m1[i] - m[idx]\r\n for j in range(rem):\r\n x.append(i)\r\n else:\r\n for j in range(m1[i]):\r\n x.append(i)\r\n for i in range(n):\r\n if res[i]=='0':\r\n res[i] = x[-1]\r\n x.pop()\r\n print('YES')\r\n print(\"\".join(res))\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\nif __name__ ==\"__main__\":\r\n\r\n if(file):\r\n \r\n if path.exists('input.txt'):\r\n sys.stdin=open('input.txt', 'r')\r\n sys.stdout=open('output.txt','w')\r\n else:\r\n input=sys.stdin.readline\r\n solve()\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\nn = len(s)\r\ncnt = [0] * 26\r\nfor i in s:\r\n cnt[i - 97] += 1\r\nx = [0] * (n + 1)\r\nfor i in range(2, n + 1):\r\n if not x[i] and 2 * i <= n:\r\n for j in range(i, n + 1, i):\r\n x[j] = 1\r\nans = \"YES\" if sum(x) <= max(cnt) else \"NO\"\r\nprint(ans)\r\nif ans == \"YES\":\r\n ans = []\r\n i, j = 0, cnt.index(max(cnt))\r\n cnt[j] -= sum(x)\r\n for k in x[1:]:\r\n if k:\r\n ans.append(chr(j + 97))\r\n else:\r\n while not cnt[i]:\r\n i += 1\r\n ans.append(chr(i + 97))\r\n cnt[i] -= 1\r\n sys.stdout.write(\"\".join(ans))", "k=[1]*1001\nfor i in range(2,1001):\n if k[i]==1:\n z=i\n for j in range(z,1001,z):k[j]=0\n k[i]=1\nk[0]=k[1]=0\nz=input()\nlo=len(z)\n\nw=[0]*26\nfor i in z:w[ord(i)-97]+=1\np=0\nfor i in range(lo//2+1,lo+1):p+=k[i]\nif max(w)<lo-p-1:print(\"NO\")\nelse:\n print(\"YES\")\n s=[1]*(lo+1)\n k1=w.index(max(w))\n for i in range(2,lo//2+1):s[i]=chr(k1+97);w[k1]-=1\n for i in range(lo//2+1,lo+1):\n if k[i]==0 and w[k1]!=0:s[i]=chr(k1+97);w[k1]-=1\n j=0\n for i in range(1,1+lo):\n if s[i]==1:\n while w[j]<1:j+=1\n s[i]=chr(97+j);w[j]-=1\n print(*s[1:],sep='')# 1697831784.1703203", "p=[1]*1001\r\nfor i in range(2,1001):\r\n if p[i]:\r\n for j in range(i,1001,i):p[j]=0\r\n p[i]=1\r\na=input()\r\nz=len(a)\r\nl=[0]*26\r\nfor i in a:l[ord(i)-97]+=1\r\ngh=0\r\nfor i in range(z//2+1,z+1):gh+=p[i]\r\nif max(l)<z-1-gh:exit(print(\"NO\"))\r\nans=['']*(z+1)\r\nt=l.index(max(l))\r\nfor i in range(2,1+(z//2)):ans[i]=chr(t+97);l[t]-=1\r\nfor i in range(1+(z//2),z+1):\r\n if p[i]==0:ans[i]=chr(t+97);l[t]-=1\r\nj=0\r\nfor i in range(1,z+1):\r\n if ans[i]=='':\r\n while l[j]<=0:j+=1\r\n ans[i]=chr(j+97);l[j]-=1\r\nprint(\"YES\")\r\nprint(''.join(ans[1::]))", "from collections import Counter\r\ns = input()\r\nlns = len(s)\r\nans = [0]*(lns)\r\nfreq = Counter(s)\r\nnums = [0]*(lns)\r\na = [0]*(1000+5)\r\nflag = False\r\nif lns>=4:\r\n nums[1]={2}\r\nz = 4\r\nwhile z<=lns:\r\n nums[1].add(z)\r\n z+=2\r\nfor i in range(3,lns+1,2):\r\n if a[i]==0:\r\n if i*2>lns:\r\n break\r\n nums[i-1]=set()\r\n for j in range(i,lns+1,i):\r\n a[j]=1\r\n nums[i-1].add(j)\r\nfor i in range(lns-1,-1,-1):\r\n for j in range(i-1,-1,-1):\r\n if i==j:\r\n continue\r\n if nums[i] and nums[j] and nums[i]&nums[j]:\r\n nums[j]|=nums[i]\r\n nums[i]=0\r\n break\r\nfor i in range(lns):\r\n if nums[i]:\r\n for j in freq:\r\n if nums[i] and freq[j]>=len(nums[i]):\r\n for u in nums[i]:\r\n ans[u-1]=j\r\n freq[j]-=1\r\n nums[i]=0\r\n if nums[i]:\r\n flag = True\r\nif flag:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(lns):\r\n if ans[i]==0:\r\n for j in freq:\r\n if freq[j]<1:\r\n continue\r\n ans[i]=j\r\n freq[j]-=1\r\n break\r\n print(''.join(ans))", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nw = Counter()\r\ns = input()[:-1]\r\nfor i in s:\r\n w[i] += 1\r\nn = len(s)\r\nd = [0]*n\r\nfor i in range(n, n//2, -1):\r\n for j in range(2, i//2+1):\r\n if d[i-1] == 0 and i % j == 0:\r\n d[i-1] = 1\r\n if d[j-1] == 0 and i % j == 0:\r\n d[j-1] = 1\r\nc = d.count(0)\r\nw = w.most_common()\r\n\r\nif w[0][1] < n-c:\r\n print('NO')\r\nelse:\r\n w[0] = (w[0][0], w[0][1] - (n-c))\r\n q = []\r\n for i in w:\r\n q.extend(i[0]*i[1])\r\n j = 0\r\n for i in range(n):\r\n if d[i] == 1:\r\n d[i] = w[0][0]\r\n else:\r\n d[i] = q[j]\r\n j += 1\r\n print('YES')\r\n print(''.join(d))\r\n", "from collections import Counter\r\nfrom sys import stdin\r\n\r\ns = stdin.readline()[:-1]\r\nn,c = len(s),Counter(s)\r\ncnt,b = max(((c[k],k) for k in c))\r\n\r\n\r\nisPrime = [True]*(n+1)\r\nisPrime[0],isPrime[1] = False,False\r\nfor i in range(2,n+1):\r\n if isPrime[i]:\r\n for j in range(2*i,n+1,i):\r\n isPrime[j] = False\r\n\r\nfree = 1 + sum(isPrime[n//2+1:])\r\nif n <= 3:\r\n print('YES')\r\n print(s)\r\nelif cnt < n - free:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ans = [b]*(n+1)\r\n ans[0] = ''\r\n c[b] = 0\r\n\r\n m = False\r\n j = n//2 + 1\r\n for key in c.elements():\r\n while j <= n:\r\n if isPrime[j]:\r\n break\r\n j += 1\r\n else:\r\n m = True\r\n break\r\n ans[j] = key\r\n j += 1\r\n\r\n if m:\r\n ans[1] = key\r\n print(''.join(ans))\r\n" ]

[ "n = int(input())\r\na = list(map(int,input().split()))\r\nm = max(a)\r\ncnt = [0]*5010\r\n\r\nright = []\r\nleft = []\r\n\r\nfor i in range(n):\r\n cnt[a[i]]+=1\r\n\r\ns = set(a)\r\nn = len(s)\r\n\r\nfor i in s:\r\n if cnt[i]>0 and i<m:\r\n right.append(i)\r\n cnt[i]-=1\r\n\r\nfor i in s:\r\n if cnt[i]>0 and i<m:\r\n left.append(i)\r\n\r\nprint(1+len(left)+len(right))\r\n\r\nleft.sort()\r\nfor i in range(len(left)):\r\n print(left[i], end=' ')\r\n\r\nprint(m,end=' ')\r\n\r\nright.sort(reverse=True)\r\nfor i in range(len(right)):\r\n print(right[i], end=' ')\r\n ", "number = int(input())\r\ncards = sorted([int(x) for x in input().split(\" \")])\r\nnew_cards = list()\r\nused = [0 for i in range(number)]\r\nlast = -1\r\nfor i in range(number):\r\n if cards[i] > last:\r\n new_cards.append(cards[i])\r\n last = cards[i]\r\n used[i] = 1\r\nfor i in range(number - 1, -1, -1):\r\n if ((not used[i]) and (cards[i] < last)):\r\n new_cards.append(cards[i])\r\n last = cards[i]\r\n used[i] = 1\r\nlength = len(new_cards)\r\nprint(length)\r\nprint(\" \".join([str(new_cards[i]) for i in range(length)]))", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nk = max(l)\r\nd = {}\r\nc = 0\r\nz = []\r\nfor i in l:\r\n # if i!=k:\r\n d[i] = d.get(i,0)+1\r\nfor i,v in d.items():\r\n if i==k:\r\n c+=1\r\n elif i!=k and v>=2:\r\n c+=2\r\n # z.append(i)\r\n elif i!=k and v==1:\r\n c+=1\r\nss = sorted(d)\r\nkk = sorted(d,reverse=True)\r\nll = []\r\nfor i in ss:\r\n ll.append(i)\r\nfor j in kk[1:]:\r\n if d[j]>=2:\r\n ll.append(j)\r\nprint(c)\r\nfor i in ll:\r\n print(i,end=\" \")", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n maxN = 5000\r\n b = [0] * maxN\r\n\r\n for i in range(n):\r\n b[a[i] - 1] += 1\r\n\r\n maxA = 0\r\n\r\n for i in range(n):\r\n if a[i] > maxA:\r\n maxA = a[i]\r\n\r\n count = 0\r\n\r\n b[maxA-1] = 1\r\n\r\n for i in range(maxA):\r\n if b[i] >= 2:\r\n count += 2\r\n elif b[i] == 1:\r\n count += 1\r\n\r\n print(count)\r\n for i in range(maxA):\r\n if b[i] != 0:\r\n print(i+1, end=' ')\r\n b[i] -= 1\r\n\r\n for i in range(maxA-1, 0, -1):\r\n if b[i-1] != 0:\r\n print(i, end=' ')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "m = int(input())\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nl = [b[0]]\r\nk = 1\r\nls = []\r\nfor i in range(1, m):\r\n if b[i] != b[i - 1]:\r\n l.append(b[i])\r\n k = 1\r\n elif k < 2:\r\n ls.append(b[i])\r\n k += 1\r\nl.reverse()\r\nif len(ls) !=0:\r\n if ls[-1] == l[0]:\r\n ls.pop()\r\nl = ls + l\r\nprint(len(l))\r\n\r\nprint(*l)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\n\r\ncount={}\r\n\r\nfor i in range(5005):\r\n\tcount[i]=0\r\n\r\nfor i in range(n):\r\n\tcount[arr[i]]=count.get(arr[i], 0) + 1\r\n\r\n\r\n\r\nb=[]\r\nmaxi=0\r\nfor i in range(5005):\r\n\tif count[i]>=1:\r\n\t\tmaxi=i\r\n\t\tcount[i]-=1\r\n\t\tb.append(i)\r\ni=maxi-1\r\nwhile(i>=1):\r\n\tif count[i]>=1:\r\n\t\tb.append(i)\r\n\ti-=1\t\r\nprint(len(b))\r\nfor i in b:\r\n\tprint(i)\t\t\r\n\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\nn=int(input());a=list(map(int,input().split()));s=Counter(a);ans=[];c=0\r\nmx=max(a)\r\nt1=sorted(s)\r\nt2=sorted(s,reverse=True)\r\nt2.pop(0)\r\nfor i in t1+t2:\r\n if s[i]>0:\r\n ans.append(i)\r\n c+=1\r\n s[i]-=1\r\n if s[i]==0:del s[i]\r\n else:continue\r\nprint(c);print(*ans)", "from collections import Counter\r\nn=int(input());a=list(map(int,input().split()));s=Counter(a);ans=[];c=0\r\ns[max(a)]=1\r\nfor i in sorted(s):\r\n ans.append(i)\r\n s[i]-=1\r\n if s[i]==0:del s[i]\r\n c+=1\r\nfor i in sorted(s,reverse=True):\r\n ans.append(i)\r\n c+=1\r\nprint(c);print(*ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nq={}\r\nfor i in a:\r\n if i in q:\r\n q[i]+=1\r\n else:\r\n q[i]=1\r\ns=sorted(list(q))\r\nm=len(s)\r\nd=[]\r\nfor i in q:\r\n if q[i]>1:\r\n d.append(i)\r\nd.sort()\r\nif d>[] and s[-1]==d[-1]:\r\n d.pop()\r\nprint(m+len(d))\r\nprint(*(d+s[::-1]))", "m = int(input())\r\nb=[int(b) for b in input().split()]\r\nb.sort()\r\nl = [b[0]]\r\nk = 1\r\nlist = []\r\nfor i in range(1, m):\r\n if b[i] != b[i - 1]:\r\n l.append(b[i])\r\n k = 1\r\n elif k < 2:\r\n list.append(b[i])\r\n k += 1\r\nl.reverse()\r\nif len(list) !=0:\r\n if list[-1] == l[0]:\r\n list.pop()\r\nl = list + l\r\nprint(len(l))\r\nprint(*l)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort(reverse=True)\r\ns = []\r\nj = len(a)-1\r\nwhile j != 0:\r\n if a[j] == a[j-1]:\r\n if a[j] != a[0] and (s == [] or s[-1] != a[j]):\r\n s.append(a[j])\r\n a.pop(j)\r\n j -= 1\r\nprint(len(s)+len(a))\r\nprint(*s,*a)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nk = 1\r\nt = [a[0]]\r\nfor i in range(1, n):\r\n if a[i] != a[i-1]:\r\n k = 1\r\n t.append(a[i])\r\n elif k < 2:\r\n k += 1\r\n t.append(a[i])\r\nif len(t) >= 2 and t[-1] == t[-2]:\r\n t.pop()\r\nm1, m2 = [t[0]], []\r\nfor i in range(1, len(t)):\r\n if t[i] == t[i-1]:\r\n m2.append(t[i])\r\n else:\r\n m1.append(t[i])\r\nm2.sort(reverse=True)\r\nprint(len(t))\r\nprint(*m1, *m2)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nm=max(a)\r\n\r\nright=[]\r\nleft=[]\r\n\r\ncnt=[0]*5010\r\nfor i in range(n):\r\n cnt[a[i]]+=1\r\n\r\ns=set(a)\r\nn=len(s)\r\n\r\nfor i in s:\r\n if cnt[i]>0 and i<m:\r\n right.append(i)\r\n cnt[i]-=1\r\n\r\nfor i in s:\r\n if cnt[i]>0 and i<m:\r\n left.append(i)\r\n\r\nprint(1+len(left)+len(right))\r\n\r\nleft.sort()\r\nfor i in range(len(left)):\r\n print(left[i],end=' ')\r\n\r\nprint(m,end=' ')\r\n\r\nright.sort(reverse=True)\r\nfor i in range(len(right)):\r\n print(right[i],end=' ')" ]

[ "n = int(input())\r\nprint(n-n//2-n//3-n//5-n//7+n//6+n//10+n//14+n//15+n//21+n//35-n//30-n//42-n//70-n//105+n//210)", "import math\r\nn = int(input())\r\nm = n - n//2 - n//3 - n//5 - n//7 + n//6 + n//10 + n//14 + n//15 + n //21 + n//35 - n//30 - n//42 - n//70 -n//105 + n//210\r\nprint(m)", "n=int(input())\r\nres=n-(n//2+n//3+n//5+n//7)\r\nres+=n//10+n//6+n//14+n//15+n//21+n//35\r\nres-=n//42+n//30+n//70+n//105\r\nres+=n//210\r\nprint(res)\r\n\r\n# c=0\r\n# for i in range(1,1000):\r\n# pasa=True\r\n# if i%2==0 or i%3==0 or i%5==0 or i%7==0:\r\n# pasa=False\r\n# if pasa:\r\n# print(i, end=\" \")\r\n# c+=1\r\n# print()\r\n# print(c)", "n = int(input())\r\nans = n - (n//2 + n//3 + n//5 + n//7 + n//30 + n//70 + n//42 + n//105) + (n//6 + n//15 + n//14 + n//10 + n//21 + n//35 + n//210)\r\nprint(ans)", "n = int(input())\n\ndef gcd(a, b):\n if a == 0 or b == 0:\n return max(a, b, 1)\n else:\n return gcd(b, a%b)\n \ndef mcd(a, b):\n return a*b // gcd(a, b)\n\nr = 0\n\ndef binary(k):\n res = []\n while k != 0:\n res.insert(0, k % 2)\n k //= 2\n\n return [0]*(9-len(res)) + res\n\nfor i in range(2**9):\n dig = binary(i)\n # print(dig)\n s = sum(dig)\n t = 1\n for i in range(9):\n if dig[i] == 1:\n t = mcd(t, i+2)\n\n r += (-1)**s * (n // t)\n\nprint(r)\n\n \t \t\t \t\t\t \t\t \t \t \t \t\t\t", "# import math\r\n\r\n\r\nn = int(input())\r\n\r\ndef find_num_of_divisors(num):\r\n\r\n return n // num\r\n\r\n\r\ntwo , three , five , seven = find_num_of_divisors(2) , find_num_of_divisors(3) , find_num_of_divisors(5) , find_num_of_divisors(7)\r\nminus = 0 \r\n\r\nloop = [2, 3, 5, 7]\r\n\r\nfor i in range(4):\r\n for j in range(i + 1 , 4):\r\n\r\n # print(loop[i] , loop[j])\r\n \r\n minus += find_num_of_divisors(loop[i] * loop[j])\r\n\r\n# P (A U B U C U D) = P(A) + P(B) + P(C) +P(D) - P(A ∩ B) - P(A ∩ C) - P(A ∩ D)- P(B ∩ C) - P(B ∩ D) - P(C ∩ D) + P(A ∩ B ∩ C) + P(A ∩ B ∩ D) + P(A ∩ C ∩ D) + P(B ∩ C ∩ D) - P(A ∩ B ∩ C ∩ D)\r\n\r\nplus = find_num_of_divisors(2 * 3 * 5) + find_num_of_divisors(2 * 3 * 7) + find_num_of_divisors(2 * 5 * 7) + find_num_of_divisors(3 * 5 * 7)\r\nplus -= find_num_of_divisors(2 * 3 * 5 * 7)\r\nplus += two + three + five + seven\r\nplus -= minus\r\n\r\nprint(n-plus)\r\n\r\n\r\n\r\n", "n=int(input())\r\nprint(n-(n//2+n//3+n//5+n//7)+(n//6+n//10+n//14+n//15+n//21+n//35)-(n//30+n//42+n//70+n//105)+(n//210))", "n=int(input())\r\np=[2,3,5,7]\r\ns=0\r\nfor i in range(2**len(p)):\r\n P=1\r\n for j in range(len(p)):\r\n if i&(1<<j):\r\n P*=-p[j]\r\n if P>0:\r\n s+=n//P\r\n else:\r\n s-=n//(-P)\r\nprint(s)", "import math;\r\n\r\ndef C(u, d) -> int:\r\n\tret, i, j = 1, u, 1\r\n\twhile j <= d:\r\n\t\tret = ret * i // j\r\n\t\ti -= 1; j += 1\r\n\treturn ret\r\n\r\na = [2, 3, 5, 7]\r\n\r\nn = int(input())\r\n\r\nret, i = n, 1 \r\nwhile i < (1 << len(a)):\r\n base, cnt, j = 1, 0, 0\r\n while j < len(a):\r\n tmp = (i >> j) & 1\r\n if tmp == 1:\r\n base *= a[j]\r\n cnt += 1\r\n j += 1\r\n i += 1\r\n if cnt % 2:\r\n ret -= n // base\r\n else:\r\n ret += n // base\r\n \r\nprint(ret)\r\n" ]

[ "n, m = int(input()), 150001\r\np = [m] + list(map(int, input().split())) + [m * (n & 1)]\r\nf = lambda i: p[i] >= p[i + 1] if i & 1 else p[i] <= p[i + 1]\r\nh = lambda i, j: sum(f(k) for k in {i, i - 1, j, j - 1})\r\nt = [f(i) for i in range(n + 1)]\r\ns = sum(t)\r\nif s > 4: exit(print(0))\r\ne = {i + 1 for i in range(n) if t[i] or t[i + 1]}\r\n\r\ndef g(i, j):\r\n p[i], p[j] = p[j], p[i]\r\n t = h(i, j)\r\n p[i], p[j] = p[j], p[i]\r\n return (i < j or (i > j and j not in e)) and h(i, j) - t == s\r\n\r\nprint(sum(g(i, j + 1) for i in e for j in range(n)))", "# [https://codeforces.com/contest/653/submission/16856909]\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nif (n & 1) == 0:\r\n l.append(0)\r\nl.append(150001)\r\na = 0\r\nb = 150001\r\nfails = []\r\nres = 0\r\nfor i, c in enumerate(l, -1):\r\n if (i & 1) != 0:\r\n if a >= b or b <= c:\r\n if len(fails) > 5:\r\n print(0)\r\n break\r\n fails.append(i)\r\n else:\r\n if a <= b or b >= c:\r\n if len(fails) > 5:\r\n print(0)\r\n break\r\n fails.append(i)\r\n a, b = b, c\r\nelse:\r\n ff = fails + [0]\r\n for i in fails:\r\n a = l[i]\r\n for j in range(n):\r\n (l[i], l[j], ff[-1]) = (l[j], a, j)\r\n if (all((l[b - 1] < l[b] > l[b + 1]) if b & 1 else\r\n (l[b - 1] > l[b] < l[b + 1]) for b in ff)):\r\n res += 1 if j in fails else 2\r\n l[j] = l[i]\r\n l[i] = a\r\n print(res // 2)", "def main():\n n, l = int(input()), list(map(int, input().split()))\n if not (n & 1):\n l.append(0)\n l.append(150001)\n i, b, c, fails0, fails1 = 0, 0, 150001, [], []\n try:\n while True:\n a, b, c = b, c, l[i]\n if a >= b or b <= c:\n if len(fails0) + len(fails1) > 5:\n print(0)\n return\n fails1.append(i - 1)\n i += 1\n a, b, c = b, c, l[i]\n if a <= b or b >= c:\n if len(fails0) + len(fails1) > 5:\n print(0)\n return\n fails0.append(i - 1)\n i += 1\n except IndexError:\n fails, res = fails0 + fails1, 0\n for i in fails:\n a = l[i]\n for j in range(n):\n f = fails1 if j & 1 else fails0\n f.append(j)\n l[i], l[j] = l[j], a\n if (all(l[b - 1] > l[b] < l[b + 1] for b in fails0) and\n all(l[b - 1] < l[b] > l[b + 1] for b in fails1)):\n res += 1 if j in fails else 2\n l[j] = l[i]\n del f[-1]\n l[i] = a\n print(res // 2)\n\n\nif __name__ == '__main__':\n main()\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ninf = pow(10, 9) + 1\r\nt = [inf] + list(map(int, input().split())) + [inf if n % 2 else -inf]\r\ns = set()\r\nfor i in range(n):\r\n if i % 2:\r\n if not t[i] < t[i + 1]:\r\n s.add(i)\r\n s.add(i + 1)\r\n else:\r\n if not t[i] > t[i + 1]:\r\n s.add(i)\r\n s.add(i + 1)\r\nans = 0\r\nif len(s) < 4:\r\n for i in s:\r\n for j in range(1, n + 1):\r\n if j in s and i > j:\r\n continue\r\n t[i], t[j] = t[j], t[i]\r\n ok = 1\r\n for k in [i, j]:\r\n if not k % 2:\r\n if not t[k - 1] < t[k] > t[k + 1]:\r\n ok = 0\r\n else:\r\n if not t[k - 1] > t[k] < t[k + 1]:\r\n ok = 0\r\n for k in s:\r\n if not k % 2:\r\n if not t[k - 1] < t[k] > t[k + 1]:\r\n ok = 0\r\n else:\r\n if not t[k - 1] > t[k] < t[k + 1]:\r\n ok = 0\r\n if ok:\r\n ans += 1\r\n t[i], t[j] = t[j], t[i]\r\nelif len(s) < 7:\r\n for i in s:\r\n for j in s:\r\n if i >= j:\r\n continue\r\n t[i], t[j] = t[j], t[i]\r\n ok = 1\r\n for k in s:\r\n if not k % 2:\r\n if not t[k - 1] < t[k] > t[k + 1]:\r\n ok = 0\r\n else:\r\n if not t[k - 1] > t[k] < t[k + 1]:\r\n ok = 0\r\n if ok:\r\n ans += 1\r\n t[i], t[j] = t[j], t[i]\r\nprint(ans)", "#!/usr/bin/python3\n\n\ndef needs_rep(t, i):\n\tif i % 2 == 0:\n\t\treturn t[i] >= t[i+1]\n\telse:\n\t\treturn t[i] <= t[i+1]\n\ndef would_need_rep(t, i, j1, j2):\n\tn = len(t)\n\tif i < 0:\n\t\treturn False\n\tif i >= n-1:\n\t\treturn False\n\n\ttj1 = t[j2]\n\ttj2 = t[j1]\n\n\tti = t[i]\n\tif i == j1:\n\t\tti = tj1\n\tif i == j2:\n\t\tti = tj2\n\n\tti1 = t[i+1]\n\tif i+1 == j1:\n\t\tti1 = tj1\n\tif i+1 == j2:\n\t\tti1 = tj2\n\n\tif i % 2 == 0:\n\t\treturn ti >= ti1\n\telse:\n\t\treturn ti <= ti1\n\n\ndef main():\n\tn = int(input())\n\tt = [int(i) for i in input().split()]\n\n\t# rep = [False]*(n-1)\n\trep = []\n\tfor i in range(n-1):\n\t\tif needs_rep(t, i):\n\t\t\trep.append(i)\n\n\tif(len(rep) > 4):\n\t\tprint(0)\n\t\treturn\n\n\t# print(rep)\n\n\t# to_try = [rep[0]]\n\t# if rep[0] < n-1:\n\t# \tto_try.append(rep[0] + 1)\n\tto_try = [rep[0], rep[0] + 1]\n\n\ts = set()\n\n\tfor i in to_try:\n\t\tfor j in range(n):\n\t\t\tif i == j: continue\n\n\t\t\tif would_need_rep(t, i, i, j):\n\t\t\t\tcontinue\n\t\t\tif would_need_rep(t, i-1, i, j):\n\t\t\t\tcontinue\n\t\t\tif would_need_rep(t, j, i, j):\n\t\t\t\tcontinue\n\t\t\tif would_need_rep(t, j-1, i, j):\n\t\t\t\tcontinue\n\n\t\t\tbad = False\n\t\t\tfor r in rep:\n\t\t\t\tif would_need_rep(t, r, i, j):\n\t\t\t\t\tbad = True\n\t\t\tif bad: continue\n\n\t\t\t# print(i, j)\n\t\t\t# print(would_need_rep(t, 2, i, j))\n\n\t\t\tif (i, j) not in s and (j, i) not in s:\n\t\t\t\t# print('Adding {}'.format((i, j)))\n\t\t\t\ts.add((i, j))\n\n\tprint(len(s))\n\n\nif __name__ == '__main__':\n\tmain()\n", "def get_bit(diff, i):\r\n return 1 if ((i%2==1 and diff<=0) or (i%2==0 and diff>=0)) else 0\r\n\r\ndef swap_(i, j, a):\r\n temp = a[i]\r\n a[i] = a[j]\r\n a[j] = temp\r\n \r\ndef swap(i, j, n, a, mask, S):\r\n change = 0\r\n swap_(i, j, a)\r\n set_index = set([i, j])\r\n \r\n if i<n-1:\r\n set_index.add(i+1)\r\n \r\n if j<n-1:\r\n set_index.add(j+1)\r\n \r\n for index in set_index:\r\n if index > 0:\r\n diff = a[index] - a[index-1] \r\n bit_ = get_bit(diff, index)\r\n change += bit_ - mask[index]\r\n \r\n swap_(i, j, a) \r\n if S + change == 0:\r\n return 1\r\n return 0 \r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndiff = [-1] + [x-y for x, y in zip(a[1:], a[:-1])]\r\nmask = [get_bit(diff[i], i) for i in range(n)] \r\n\r\nS = sum(mask)\r\nfirst = -1\r\nfor i, x in enumerate(mask):\r\n if x == 1:\r\n first = i\r\n break\r\n \r\ncnt = 0\r\nfor second in range(n):\r\n if swap(first, second, n, a, mask, S) == 1:\r\n cnt += 1\r\n \r\n if first != 0 and swap(first-1, second, n, a, mask, S) == 1:\r\n cnt += 1\r\n \r\nif first!=0 and swap(first-1, first, n, a, mask, S) == 1:\r\n cnt-=1\r\n \r\nprint(cnt) \r\n\r\n#9\r\n#1 2 3 4 5 6 7 8 9\r\n\r\n#10\r\n#3 2 1 4 1 4 1 4 1 4\r\n\r\n#4\r\n#200 150 100 50\r\n\r\n#5\r\n#2 8 4 7 7", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\n \r\ndef is_fail(A, i):\r\n n = len(A)\r\n if i > 0:\r\n if i % 2==0 and A[i] >= A[i-1]:\r\n return True \r\n if i % 2==1 and A[i] <= A[i-1]:\r\n return True \r\n if i < n-1:\r\n if i % 2==0 and A[i] >= A[i+1]:\r\n return True \r\n if i % 2==1 and A[i] <= A[i+1]:\r\n return True \r\n return False \r\n \r\ndef process(A):\r\n n = len(A)\r\n failures = []\r\n for i in range(n):\r\n if is_fail(A, i):\r\n failures.append(i)\r\n answer = 0\r\n if len(failures) <=6:\r\n m = len(failures)\r\n for a in failures:\r\n for b in range(n):\r\n old_count = 0\r\n for x in set([a-1, a, a+1, b-1, b, b+1]):\r\n if 0 <= x <= n-1 and is_fail(A, x):\r\n old_count+=1 \r\n new_count = 0 \r\n A[a], A[b] = A[b], A[a]\r\n for x in set([a-1, a, a+1, b-1, b, b+1]):\r\n if 0 <= x <= n-1 and is_fail(A, x):\r\n new_count+=1 \r\n if old_count==m and new_count==0:\r\n if a not in failures or b not in failures or a < b:\r\n answer+=1\r\n A[a], A[b] = A[b], A[a]\r\n \r\n \r\n \r\n sys.stdout.write(f'{answer}\\n')\r\n \r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprocess(A)" ]

[ "t = list(input())\r\nd, p = [], set(range(len(t)))\r\nfor j, q in enumerate(t):\r\n if q in '([': d.append((q, j))\r\n elif d:\r\n x, i = d.pop()\r\n if x + q in '(][)': d = []\r\n else: p -= {i, j}\r\nfor i in p: t[i] = ' '\r\nn, s = 0, ''\r\nfor q in ''.join(t).split():\r\n k = q.count('[')\r\n if k > n: n, s = k, q\r\nprint(n, s)", "s = input()\r\nst, v, vi, vj, vc = [], [], 0, 0, 0\r\nfor i, c in enumerate(s):\r\n if c in '[(':\r\n st.append(i)\r\n continue\r\n if st and s[st[-1]] + c in ('()', '[]'):\r\n b = (st[-1], i+1)\r\n if v and v[-1][1] == i: v[-1] = b\r\n else: v.append(b)\r\n if len(v) >= 2 and v[-2][1] == v[-1][0]:\r\n v[-2:] = [(v[-2][0], v[-1][1])]\r\n st.pop()\r\n else:\r\n st = []\r\nfor b in v:\r\n c = s.count('[', b[0], b[1])\r\n if c > vc:\r\n vi, vj, vc = b[0], b[1], c\r\nprint(vc)\r\nprint(s[vi:vj])\r\n", "'''input\n((()))([]\n'''\nfrom sys import stdin\n\n\ndef check_valid(string):\n\tstack = []\n\tfor i in string:\n\t\tif i in ['(', '[']:\n\t\t\tstack.append(i)\n\t\telif i == ')':\n\t\t\tif len(stack) > 0:\n\t\t\t\tif stack[-1] == '(':\n\t\t\t\t\tstack.pop()\n\t\t\t\t\tcontinue\n\t\t\treturn False\n\t\telif i == ']':\n\t\t\tif len(stack) > 0:\n\t\t\t\tif stack[-1] == '[':\n\t\t\t\t\tstack.pop()\n\t\t\t\t\tcontinue\n\t\t\treturn False\n \n\treturn len(stack) == 0\n \n\ndef merge(index):\n\t# refining\n\taux = []\n\tif len(index) > 0:\n\t\tstart = index[0][0]\n\t\tend = index[0][1]\n\t\tfor i in range(1, len(index)):\n\t\t\ts, e = index[i]\n\t\t\tif e <= end:\n\t\t\t\tpass\n\t\t\telif s >= end:\n\t\t\t\taux.append([start, end])\n\t\t\t\tstart, end = s, e\n\t\taux.append([start, end])\n\tindex = aux\n\n\n\n\n\t# acutal merging\n\taux = []\n\tif len(index) > 0:\n\t\taux = [index[0]]\n\t\tfor i in range(1, len(index)):\n\t\t\tif index[i][0] == aux[-1][1] + 1:\n\t\t\t\taux[-1][1] = index[i][1]\n\t\t\telse:\n\t\t\t\tif check_valid(string[aux[-1][1] + 1: index[i][0]]):\n\t\t\t\t\taux[-1][1] = index[i][1]\n\t\t\t\telse:\n\t\t\t\t\taux.append(index[i])\n\treturn aux\n \n\n# main starts\nstring = stdin.readline().strip()\nstack = []\nindex = []\nstart = -1\nend = -1\nfor i in range(len(string)):\n\tif string[i] == '(':\n\t\tstack.append(i)\n\telif string[i] == '[':\n\t\tstack.append(i)\n\n\telif string[i] == ')':\n\t\tif len(stack) > 0 and string[stack[-1]] == '(':\n\t\t\tindex.append([stack[-1], i])\n\t\t\tstack.pop()\n\t\telse:\n\t\t\tstack = []\n\telif string[i] == ']':\n\t\tif len(stack) > 0 and string[stack[-1]] == '[':\n\t\t\tindex.append([stack[-1], i])\n\t\t\tstack.pop()\t\n\t\telse:\n\t\t\tstack = []\n\nindex.sort(key = lambda x:(x[0], x[1]))\n\n\nindex = merge(index)\ndiff = 0\nans = [-1, -1]\nfor i in index:\n\tstart, end = i\n\tc = string[start: end + 1].count('[')\n\tif diff < c :\n\t\tans = [start, end + 1]\n\t\tdiff = c\n\n\nprint(diff)\nprint(string[ans[0]: ans[1]])\n ", "import sys\nimport math\nimport string\nimport operator\nimport functools\nimport fractions\nimport collections\nsys.setrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\ns=RS()[0]\nst=[]\ncloseInd=[0]*len(s)\ndef rev(c):\n return \"([\"[c==']']\nfor i in range(len(s)):\n if len(st) and s[i] in \")]\" and st[-1][0]==rev(s[i]):\n temp=st[-1]\n st.pop()\n closeInd[temp[1]]=i\n else:\n st.append((s[i],i))\nmaxSq=0\nmaxX,maxY=0,0\ni=0\nwhile i<len(s):\n sq=0\n start=i\n while i<len(s) and closeInd[i]:\n j=i\n while i<=closeInd[j]:\n if s[i]=='[':\n sq+=1\n i+=1\n else:\n i+=1\n if sq>maxSq:\n maxSq=sq\n maxX=start\n maxY=i-1\nprint(maxSq, s[maxX:maxY], sep='\\n')\n", "s = input()\na = []\nfor i in range(len(s)):\n if len(a) != 0 and ((s[a[-1]] == '(' and s[i] == ')') or (s[a[-1]] == '[' and s[i] == ']')):\n a.pop()\n else:\n a.append(i)\nif len(a) == 0:\n print(s.count('['))\n print(s)\nelse:\n s1 = s[0: a[0]]\n le = s[0: a[0]].count('[')\n for i in range(len(a) - 1):\n le1 = s[a[i] + 1: a[i + 1]].count('[')\n if le1 > le:\n s1 = s[a[i] + 1: a[i + 1]]\n le = le1\n le1 = s[a[-1] + 1:].count('[')\n if le1 > le:\n s1 = s[a[-1] + 1:]\n le = le1\n print(le)\n print(s1)", "s, st, v, vi, vj, vc = input(), [], [], 0, 0, 0\nfor i, ch in enumerate(s):\n if ch in '[(':\n st.append(i)\n else:\n if st and s[st[-1]] + ch in ('()', '[]'):\n b = (st[-1], i + 1)\n if v and v[-1][1] == i:\n v[-1] = b\n else:\n v.append(b)\n if len(v) >= 2 and v[-2][1] == v[-1][0]:\n v[-2:] = [(v[-2][0], v[-1][1])]\n st.pop()\n else:\n st = []\nfor b in v:\n c = s.count('[', b[0], b[1])\n if c > vc:\n vi, vj, vc = b[0], b[1], c\nprint(vc)\nprint(s[vi:vj])\n", "from _collections import deque\r\ns,z,d=[*input()],deque(\"?\"),deque()\r\nfor i in range(len(s)):\r\n if(z[-1]==\"(\"and s[i]==\")\")or(z[-1]==\"[\"and s[i]==\"]\"):\r\n z.pop()\r\n d.pop()\r\n else:\r\n z.append(s[i])\r\n d.append(i)\r\nfor i in d:s[i]=\"?\"\r\ns=\"\".join(s).split(\"?\")\r\na=max(i.count(\"[\")for i in s)\r\nfor i in s:\r\n if i.count(\"[\")==a:\r\n print(a,\"\\n\",i)\r\n break", "string = list(input()) \nd, p = [], set(range(len(string)))\n\nfor j, q in enumerate(string):\n if q in '([': d.append((j,q))\n elif d:\n i, x = d.pop()\n if x+q in '(][)': d = []\n else: p -= {i, j}\n\nn, s = 0, ''\nfor i in p: string[i] = ' '\nfor k in \"\".join(string).split():\n if k.count(\"[\") > n:\n n = k.count(\"[\")\n s = k\n\nprint(n, s)\n" ]

[ "n, m = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nt = 0\r\nans = []\r\ni = 0\r\np = 1\r\nwhile m > 0:\r\n if i < n and a[i] == p:\r\n i += 1\r\n else:\r\n if m >= p:\r\n m -= p\r\n t += 1\r\n ans.append(p)\r\n else:\r\n break\r\n p += 1\r\n\r\nprint(t)\r\nfor i in ans:\r\n print(i, end=' ')", "def solve():\n buy = []\n N, M = map(int, input().split())\n A = set(list(map(int, input().split())))\n for i in range(1, 10 ** 9 + 1):\n if i in A:\n continue\n if M >= i:\n M -= i\n buy.append(i)\n else:\n break\n print(len(buy))\n print(*buy\n )\n\nsolve()\n\t \t\t \t \t \t \t\t \t \t \t\t \t \t", "f1 = lambda : list(map(int,input().split()))\r\nf2 = lambda : map(int,input().split())\r\n\r\n\r\nn , k = f2()\r\narr = set(map(int,input().split()))\r\nans = []\r\n\r\ni = 1\r\nwhile k >= i :\r\n if i not in arr:\r\n ans.append(i)\r\n arr.add(i)\r\n k -= i\r\n i +=1\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nd = {}\r\nfor x in input().split():\r\n d[int(x)] = 1\r\nnum = 1\r\ncount = 0\r\ntoys = []\r\nwhile(m>0):\r\n if m>=num and not d.get(num):\r\n toys.append(num)\r\n m -= num\r\n count += 1\r\n elif m<num:\r\n break\r\n num += 1\r\nprint(count)\r\nfor x in toys:\r\n print(x, end = \" \")\r\n", "n, m = map( int, input().split() )\r\njoy_types = set( map( int, input().split() ) )\r\n\r\n\r\nans = []\r\n\r\n\r\nfor i in range(1, 10**9 + 1):\r\n if i not in joy_types:\r\n if m >= i:\r\n m -= i\r\n ans.append(i)\r\n else:\r\n break\r\n\r\nprint(len(ans))\r\nprint(*ans) ", "string = input()\r\nnumbers = string.split()\r\na = int(numbers[1])\r\nstring = input()\r\nnumbers = list(map(int, string.split()))\r\nl = len(numbers)\r\nnumbers.sort()\r\ntoys = []\r\nb = 0\r\nc = 0\r\nn = 0\r\nwhile c < len(numbers):\r\n b += 1\r\n d = numbers[c]\r\n if b < d:\r\n n += b\r\n if n > a:\r\n n -= b\r\n break\r\n toys.append(b)\r\n else:\r\n c += 1\r\nb = d\r\nwhile n < a:\r\n b += 1\r\n n += b\r\n toys.append(b)\r\nif n > a:\r\n del toys[-1]\r\nprint(len(toys))\r\nprint(\" \".join(map(str, toys)))", "n,m=map(int,input().split())\r\ntoys=set(map(int,input().split()))\r\ni=1\r\nres=[]\r\nwhile m-i>=0:\r\n if i not in toys:\r\n m-=i\r\n res.append(i)\r\n i+=1\r\nprint(len(res))\r\nprint(*res)", "n, m = map(int, input().split(' '))\r\nl = list(map(int, input().split(' ')))\r\nused = set(l)\r\nk = 0\r\nt = []\r\nprice = 1\r\nwhile m >= price:\r\n if price not in used:\r\n used.add(price)\r\n t.append(str(price))\r\n k += 1\r\n m -= price\r\n price += 1\r\nprint(k)\r\nprint(' '.join(t))", "# t=int(input())\n\n# while(t>0):\nn,m=[int(x)for x in input().split()]\nb=[int(x)for x in input().split()]\nsn=set(b)\nsumm=0\ncount=0\na=[]\ni=1\nwhile(i>0):\n\t# print(\"hi\",i)\n\tif summ+i<=m and i not in sn:\n\t\tsumm+=i\n\t\tcount+=1\n\t\ta.append(i)\n\t\n\tif summ==m or summ+i>m:\n\t\tbreak\n\t# else:\n\t# \tbreak\n\ti+=1\n\nprint(count)\nfor i in range(count):\n\tprint(a[i],end=' ')\n\n\n\n\t# t-=1\n\n\n", "n,k=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\np.sort()\r\nx={}\r\nda=[]\r\ns=1\r\nl=0\r\nfor item in p:\r\n x[item]=1\r\nwhile l<k:\r\n if s not in x:\r\n da.append(s)\r\n l+=s\r\n s+=1\r\n else:\r\n s+=1\r\nif sum(da)>k:\r\n da.pop()\r\nelse:\r\n pass\r\nprint(len(da))\r\nprint(*da)\r\n", "n, m = map(int, input().split())\ntoys = set(map(int, input().split()))\nres = []\ncur = 1\nwhile m > 0:\n if cur not in toys:\n m -= cur\n if m >= 0: \n res.append(str(cur))\n cur += 1\nprint(len(res))\nprint(' '.join(res))\n\t\t\t \t \t \t\t\t\t \t \t\t\t \t \t \t\t \t\t", "n, m = map(int, input().split())\r\na = set(map(int, input().split()))\r\ni = 1\r\ncnt = 0\r\nb = []\r\nwhile i <= m:\r\n if i not in a:\r\n m -= i\r\n b.append(str(i))\r\n cnt += 1\r\n i += 1\r\nprint(cnt)\r\nprint(' '.join(b))", "r = lambda: map(int,input().split())\r\nn, cash = r()\r\nt = set(r())\r\nc = 1\r\nout = ''\r\nwhile cash > 0:\r\n if c not in t: \r\n cash-=c\r\n out += str(c) + ' '\r\n c+=1\r\nsize = len(out.strip().split()) - int(cash != 0)\r\nprint (size)\r\nprint (' '.join(out.strip().split()[:size]))\r\n", "n, m = map(int, input().split())\r\na = set(map(int, input().split()))\r\nb = set()\r\n\r\ni = 1\r\nwhile m >= i:\r\n if i not in a:\r\n b.add(i)\r\n m -= i\r\n i += 1\r\n \r\nprint(len(b))\r\nprint(\" \".join(str(x) for x in b))", "I = lambda: map(int, input().split())\r\nn, m = I()\r\nt = set(I())\r\n\r\nb = []\r\nfor i in range(1, 10**6):\r\n if i in t:\r\n continue\r\n if i>m:\r\n break\r\n b.append(str(i))\r\n m -= i\r\nprint(len(b))\r\nprint(\" \".join(b))", "x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb={}\r\nc=0\r\nans=[]\r\na.sort()\r\nfor i in a:\r\n b[i]=1\r\nj=1\r\nwhile c<=y:\r\n try:\r\n if b[j]:\r\n j+=1\r\n except:\r\n ans.append(j)\r\n c+=j\r\n j+=1\r\nprint(len(ans)-1)\r\nans.pop()\r\nfor item in ans:\r\n print(item,end=\" \")", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.append(10**9)\r\na.sort()\r\ni=0\r\nj=0\r\nl=[]\r\nwhile(i<10**9 and j<n+1 and m>=i+1):\r\n if i==a[j]-1:\r\n i+=1\r\n j+=1\r\n elif i<a[j]-1: \r\n l.append(i+1)\r\n m-=(1+i)\r\n i+=1\r\nprint(len(l))\r\nprint(*l)", "I=lambda:map(int,input().split())\r\nn,m=I()\r\na=set(I())\r\nb=[]\r\ni=1\r\nwhile i<=m:\r\n if i not in a:b.append(str(i));m-=i\r\n i+=1\r\nprint(len(b),'\\n'+' '.join(b))", "from sys import stdin\r\nn,m=map(int,stdin.readline().split())\r\narr=list(map(int,stdin.readline().split()))\r\nd={} \r\nfor a in arr:\r\n d[a]=0 \r\ni=1\r\na=0 \r\nans=[]\r\nwhile m>0:\r\n if d.get(i)==None:\r\n if m-i<0:\r\n break\r\n m-=i\r\n a+=1 \r\n ans.append(i)\r\n i+=1\r\nprint(a)\r\nprint(* ans)", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set()\r\nfor i in l:\r\n s.add(i)\r\nsm=0 \r\ni=1 \r\nm=[]\r\nwhile(True):\r\n if(not(i in s)):\r\n if(sm+i>k):\r\n break \r\n else:\r\n sm=sm+i \r\n m.append(i)\r\n i+=1 \r\nprint(len(m))\r\nprint(*m)\r\n \r\n \r\n", "n, m = [int(j) for j in input().split()]\r\na = [int(j) for j in input().split()]\r\ns = set()\r\nfor i in range(n):\r\n s.add(a[i])\r\ni = 1\r\nk = []\r\nwhile True:\r\n if m >= i:\r\n if i not in s:\r\n k.append(i)\r\n m -= i\r\n else:\r\n break\r\n i += 1\r\nprint(len(k))\r\nprint(*k)\r\n", "def main():\r\n I = lambda:map(int, input().split())\r\n n, m = I()\r\n already = set(I())\r\n newlist = []\r\n i=1\r\n while(i<=m):\r\n if i not in already:\r\n newlist.append(str(i))\r\n m-=i\r\n i+=1\r\n print(len(newlist),'\\n'+' '.join(newlist))\r\n\r\n \r\nif __name__==\"__main__\":main()\r\n \r\n", "def getbest(stoys,sntoys,m):\r\n c=m\r\n while c>=1:\r\n if c not in stoys and c not in sntoys:\r\n return c\r\n c-=1\r\n return 0\r\n\r\nn,m=map(int,input().split(' '))\r\ntoys=list(map(int,input().split(' ')))\r\nstoys=set(toys)\r\nntoys=[]\r\nc=0\r\nwhile 1:\r\n c+=1\r\n if c in stoys:\r\n continue\r\n if m/c>2:\r\n m-=c\r\n ntoys.append(c)\r\n else:\r\n break\r\nsntoys=set(ntoys)\r\nnt=getbest(stoys,sntoys,m)\r\nif nt!=0:\r\n ntoys.append(nt)\r\nprint(len(ntoys))\r\nfor c in ntoys:\r\n print(c,end=' ')\r\n", "n,m=list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nd = {}\r\nfor i in l:\r\n d[i]=d.get(i,0)+1\r\nres = []\r\nfor i in range(1,pow(10,9)+1):\r\n if i>m:\r\n break\r\n else:\r\n if d.get(i,0)==0:\r\n d[i]=1\r\n m-=i\r\n res.append(i)\r\n else:\r\n continue\r\nprint(len(res))\r\nprint(*res)\r\n \r\n", "def toys(n, m, A):\n A = set(A)\n L = []\n for i in range(1, 10**9 + 1):\n if i > m:\n break\n if i in A:\n continue\n m -= i\n L.append(i)\n return L\n\n\ndef main():\n n, m = readinti()\n A = readintl()\n L = toys(n, m, A)\n print(len(L))\n print(' '.join(map(str, L)))\n\n##########\n\nimport sys\n\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\nif __name__ == '__main__':\n main()\n", "n, money = map(int, input().strip().split())\ntaken = set(map(int, input().strip().split()))\n\ncount = 0\nnew_toys = []\nfor i in range(1, 10**9+1):\n\tif i > money:\n\t\tbreak\n\tif i not in taken:\n\t\tcount += 1\n\t\tmoney -= i\n\t\tnew_toys.append(i)\n\nprint(count)\nprint(*new_toys)", "n, m = [int(s) for s in input().split(' ')]\na = [int(s) for s in input().split(' ')]\na.sort()\ni = 0\ncur = 1\nres = []\nwhile m >= cur:\n while i<n and a[i]<cur:\n i += 1\n if i>=n or cur<a[i]:\n res.append(cur)\n m -= cur\n cur += 1\nprint(len(res))\nif len(res) > 0:\n print(' '.join(map(str, res)))\n", "n,m=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nl=set(l)\r\nsum=0\r\ntemp=[]\r\nc=0\r\nfor i in range(1,10000000000000000):\r\n if i not in l:\r\n sum+=i\r\n if sum>m:\r\n break\r\n else:\r\n c+=1\r\n temp.append(i)\r\nprint(c)\r\nfor i in temp:\r\n print(i,end=\" \")", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nd = {}\r\nfor i in a:\r\n d[i] = True\r\n\r\nc = 0; i = 1; ans = []\r\nwhile c < m:\r\n if i not in d:\r\n if c + i <= m:\r\n c += i\r\n ans.append(i)\r\n else:\r\n break\r\n i += 1\r\nprint(len(ans))\r\nprint(*ans)", "n, m = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\np = 0\r\nb = []\r\nfor i in range(1, 1000000000):\r\n if p < n and i == a[p]:\r\n p += 1\r\n continue\r\n if i > m:\r\n break\r\n m -= i\r\n b.append(i)\r\nprint(len(b))\r\nfor x in b:\r\n print(x, end=' ')", "import math\r\nfrom collections import defaultdict\r\ndef r():\r\n return int(input())\r\ndef rm():\r\n return map(int,input().split())\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\nn,m=rm()\r\na=defaultdict(int)\r\nb=rl()\r\nfor i in b:\r\n a[i]=1\r\nres=0\r\nresa=[]\r\nfor j in range(1,10**9+1):\r\n if m<=0 or m<j:\r\n break\r\n if a[j]!=1:\r\n if m>=j:\r\n res+=1\r\n resa.append(j)\r\n m-=j\r\nprint(res)\r\nprint(*resa)", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\n \n #n,m = map(int, input().split())\n #arr = list(map(int, input().split()))\ndef solution():\n _,m = map(int, input().split())\n arr = [0] + list(map(int, input().split()))\n arr.sort()\n res = [] \n for i in range(1, len(arr)):\n if m <= 0:\n break\n for toy in range(arr[i-1]+1, arr[i]):\n if m - toy < 0: break\n res.append(str(toy))\n m -= toy\n\n toy = arr[-1] + 1\n while m - toy >= 0:\n m -= toy\n res.append(str(toy))\n toy += 1\n\n print(len(res))\n print(\" \".join(res))\n\n\n\n\n \n\n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=solution)\n#thread.start(); thread.join()\nsolution()\n", "#!/usr/bin/python3\n\nimport sys\nfrom collections import Counter\n\n\n\n\n\n\n\nhas = []\nmoney = 0\nfor i, line in enumerate(sys.stdin.readlines()):\n\tif i == 0:\n\t\tmoney = int(line.strip().split()[1])\n\telse:\n\t\thas = line.strip().split()\n\ndef thing(has,money):\n\thas2 = Counter(has)\n\tneed = []\n\tidx = 1\n\twhile money >= idx:\n\t\tif has2[str(idx)] == 0:\n\t\t\tmoney -= idx\n\t\t\tneed.append(idx)\n\t\tidx += 1\n\treturn str(len(need)) + \"\\n\" + \" \".join([str(x) for x in need])\n\n\n#for c in cases:\nprint(thing(has,money))\n\t \t \t \t \t\t \t\t\t \t \t \t\t \t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = set(sorted(a))\r\nt = []\r\nfor i in range(1, pow(10, 6)):\r\n if i > m:\r\n break\r\n if not i in s:\r\n t.append(i)\r\n m -= i\r\nk = len(t)\r\nprint(k)\r\nsys.stdout.write(\" \".join(map(str, t)))", "n,m=map(int,input().split())\r\nt=set(int(x)for x in input().split())\r\ni=1\r\nans=list()\r\nwhile m>=i:\r\n if i in t:i+=1;continue\r\n ans.append(i)\r\n m-=i\r\n i+=1\r\nprint(len(ans))\r\nprint(*ans)\r\n \r\n ", "n,m = map(int,input().split())\r\nalready = list(map(int,input().strip().split()))\r\nalready_ = [0]*200001\r\nfor i in already:\r\n\tif i < 200001:\r\n\t\talready_[i] = 1\r\n\r\nres = []\r\ncnt = 0\r\nfor i in range(1,len(already_)):\r\n\tif already_[i] == 0:\r\n\t\tm -= i\r\n\t\tif m >= 0:\r\n\t\t\tres.append(i)\r\n\t\t\tcnt += 1\r\n\t\telse:\r\n\t\t\tbreak\r\nprint(cnt)\r\nfor i in res:\r\n\tprint(i,end = ' ')", "n,m=map(int,input().split())\r\nl=set(list(map(int,input().split())))\r\ncost=0\r\nans=[]\r\nfor i in range(1,500000):\r\n if i not in l:\r\n cost+=i\r\n if(cost>m):\r\n break\r\n else:\r\n ans.append(i)\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i,end=\" \")", "n,m = map(int,input().split())\r\na = set(map(int,input().split()))\r\nb = []\r\ni = 1\r\nwhile i <= m:\r\n if i not in a: b.append(i); m-=i\r\n i +=1\r\nprint(len(b))\r\nprint(*b)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/659/C\r\n\r\nn, m = map(int, input().split())\r\ns_t = set(map(int, input().split()))\r\ns_b = set()\r\n\r\ni = 1\r\nwhile m >= i:\r\n if i not in s_t:\r\n s_b.add(i)\r\n m -= i\r\n i += 1\r\n \r\nprint(len(s_b))\r\nprint(\" \".join(str(x) for x in s_b))", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().strip().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().strip().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().strip().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\n#for _ in range(int_inp()):\nn, m = map(int, input().split())\ns = set(map(int, input().split()))\nres = []\ni = 1\nwhile m >= i:\n if i not in s:\n m -= i\n s.add(i)\n res.append(i)\n i += 1\n\nprint(len(res))\nprint(\" \".join(map(str, res)))\n", "n, m = map(int, input().split())\ns = set(map(int, input().split()))\nres = []\ni = 1\nwhile m >= i:\n if i not in s:\n m -= i\n s.add(i)\n res.append(i)\n i += 1\n\nprint(len(res))\nprint(\" \".join(map(str, res)))", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\ndef solve(a, n, m):\n ans = []\n tot = 0\n a.sort()\n i = 1\n a_idx = 0\n while i <= m:\n if a_idx >= n:\n tot += 1\n ans.append(i)\n m -= i\n else:\n if a[a_idx] == i:\n a_idx += 1\n else:\n tot += 1\n ans.append(i)\n m -= i\n i += 1\n return tot, ans\n\ntot, ans = solve(a, n, m)\nprint(tot)\nprint(\" \".join(map(str, ans)))\n\t \t\t \t \t \t \t\t \t\t \t \t\t \t\t \t\t", "n,k = map(int,input().split())\r\ns = {int(i) for i in input().split()}\r\na = []\r\nfor i in range(1,10**9+1):\r\n\tif i not in s and i<=k:\r\n\t\ta.append(i)\r\n\t\tk-=i\r\n\telif i>=k:\r\n\t\tbreak\r\nprint(len(a),\"\\n\",*a)\r\n", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n hash_a = {}\r\n for i in a:\r\n hash_a[i] = 1\r\n b = []\r\n x = 1\r\n while True:\r\n if x > m:\r\n break\r\n elif x not in hash_a:\r\n b.append(str(x))\r\n m -= x\r\n x += 1\r\n print(len(b))\r\n print(\" \".join(b))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n", "n,m = map(int,input().split()) \r\na = list(map(int,input().split())) \r\na = set(a)\r\nlst=[ ]\r\n\r\nfor i in range(1,3*(10**5)):\r\n if (i not in a):\r\n if ((m-i)<0):\r\n break \r\n # print(i,end=' ') \r\n lst.append(i)\r\n m-=i \r\n\r\nprint(len(lst))\r\nprint(*lst)", "n, m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nmm = {}\r\nbagged = []\r\nbag = 0\r\nfor i in l:\r\n mm[i]=1\r\n\r\ni = 1\r\nwhile(bag+i <= m):\r\n try:\r\n mm[i]+=1\r\n except:\r\n bag+=i\r\n bagged.append(i)\r\n i+=1\r\n\r\nprint(len(bagged))\r\nprint(*bagged)", "import os\r\nline_number = 1\r\ncurrent_working_dir = os.getcwd()\r\nmy_local_machine = current_working_dir.find('rachel')\r\n# print(my_local_machine)\r\n\r\ndef myinput():\r\n global line_number, lines, my_local_machine\r\n if line_number == 1:\r\n lines = lines.split('\\n')\r\n\r\n # print(len(lines))\r\n if my_local_machine > 0:\r\n line = lines[line_number]\r\n else:\r\n line = input()\r\n \r\n line_number += 1\r\n return(line)\r\n\r\nlines = '''\r\n4 14\r\n4 6 12 8\r\n'''\r\n\r\nn, m = map(int, myinput().split())\r\na = list(map(int, myinput().split())) \r\ntoys = dict()\r\nnew_toys = [] \r\nstop = False \r\n\r\nfor i in range(n): \r\n toys[a[i]] = 1\r\n\r\ni = 1 \r\nwhile stop == False: \r\n if toys.get(i, 0) == 1: \r\n i += 1 \r\n else: \r\n new_toys.append(i) \r\n m -= i \r\n i += 1\r\n if m < 0: \r\n new_toys.pop(-1) \r\n stop = True \r\n elif m == 0: \r\n stop = True\r\nprint(len(new_toys))\r\nprint(*new_toys)", "n,m=map(int,input().split())\r\nalreadys=set(map(int,input().split()))\r\n\r\nsum=0\r\nbuys=[]\r\nmax_alreadys=max(alreadys)\r\nfor i in range(m):\r\n\tcur=i+1\r\n\tif cur<=max_alreadys:\r\n\t\tif cur in alreadys:\r\n\t\t\tcontinue\r\n\tif sum+cur<=m:\r\n\t\tsum+=cur\r\n\t\tbuys.append(cur)\r\n\telse:\r\n\t\tbreak\r\nprint(len(buys))\r\nprint(' '.join(map(str,buys)))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\no = {x: 1 for x in a}\r\ni = 1\r\ncost = 0;things = []\r\n\r\n\r\nwhile cost < m:\r\n\tif cost+i <= m and o.get(i) == None:things.append(i);cost += i;\r\n\tif cost+i > m:break\r\n\ti += 1\r\n\r\n\r\n\r\nprint(len(things))\r\nprint(*things)", "n, m = map(int, input().split())\r\ns = set(list(map(int, input().split())))\r\nans = []\r\nfor i in range(1, 10 ** 9 + 1):\r\n if(m < i):\r\n break\r\n if(i not in s):\r\n ans.append(i)\r\n m -= i\r\nprint(len(ans))\r\nprint(*ans)", "from sys import stdin,stdout\r\n#n=int(stdin.readline().strip())\r\nn,m=map(int,stdin.readline().strip().split())\r\ns=list(map(int,stdin.readline().strip().split()))\r\ns.sort()\r\ns.append(10**9+1)\r\nl=1\r\nans=[]\r\nflag=False\r\nfor i in s:\r\n for j in range(l,i):\r\n if m-j>=0:\r\n m-=j\r\n ans.append(j)\r\n else:\r\n flag=True\r\n break\r\n l=i+1\r\n if flag:\r\n break\r\nprint(len(ans))\r\nprint(*ans)\r\n \r\n \r\n", "n,m=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\nans=[]\r\nfrom collections import Counter \r\nc=Counter(l)\r\nfor x in range(1,10**9):\r\n if m<x:\r\n break \r\n if not c[x]:\r\n ans.append(x) \r\n m-=x \r\nprint(len(ans))\r\nprint(*ans)", "n,w=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\nx=0\r\ni=0\r\nm=[]\r\na=len(c)-1\r\nwhile w>=0:\r\n i+=1\r\n if c[x]==i:\r\n if x!=a:\r\n x+=1\r\n continue\r\n w-=i\r\n m.append(i)\r\nprint(len(m)-1)\r\nprint(' '.join(map(str,m[:-1])))", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import add\r\n\r\ninf = float('inf')\r\n# input = sys.stdin.readline\r\nflush = lambda : sys.stdout.flush\r\ncomb = lambda x , y : (factorial(x) // factorial(y)) // factorial(x - y) \r\n\r\n\r\n#inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda : input()\r\nii = lambda : int(input())\r\nr = lambda : map(int, input().split())\r\nrr = lambda : list(r())\r\n\r\n\r\nn , k = r()\r\narr = rr()\r\nx = Counter(arr)\r\nans = []\r\n# print(x)\r\nfor i in range(1, 10**9):\r\n if x[i] == 0:\r\n if i > k:\r\n break\r\n k -= i\r\n ans.append(i) \r\nprint(len(ans))\r\nprint(*ans)\r\n \r\n \r\n", "import sys\r\n\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\na = set(map(int, input().split()))\r\n\r\nans = []\r\n\r\nfor i in range(1, 10**9+1):\r\n if i in a:\r\n continue\r\n\r\n if m-i >= 0:\r\n ans.append(i)\r\n m -= i\r\n else:\r\n break\r\nprint(len(ans))\r\nprint(*ans)\r\n \r\n\r\n \r\n\r\n", "def process(A, m):\r\n A = set(A)\r\n answer = []\r\n for i in range(1, m+len(A)+1):\r\n if i not in A and m >= i:\r\n answer.append(i)\r\n m-=i\r\n if i > m:\r\n break\r\n return answer\r\n \r\nn, m = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nanswer = process(A, m)\r\nprint(len(answer))\r\nprint(' '.join(map(str, answer)))", "n,m=map(int,input().split())\r\ncount=0\r\nb=[]\r\nc=m\r\na=set((map(int,input().split())))\r\nfor i in range(1,c+1):\r\n if i not in a and m>=i:\r\n count=count+1\r\n b.append(i)\r\n m=m-i\r\n if i>m:\r\n break\r\nprint(count)\r\nprint(*b)", "n,m=map(int,input().split())\r\nalr=sorted(map(int,input().split()))\r\ni=0; toy=1; cnt=0; ans=\"\"\r\nwhile m>0:\r\n if i<n and alr[i]!=toy:\r\n if toy<=m:\r\n cnt+=1\r\n ans+=f\"{toy} \"\r\n m-=toy\r\n toy+=1\r\n else: break\r\n elif i>=n:\r\n if toy<=m:\r\n cnt+=1\r\n ans+=f\"{toy} \"\r\n m-=toy\r\n toy+=1\r\n else: break\r\n else: toy+=1; i+=1\r\nprint(cnt)\r\nprint(ans)", "n_m = input().split()\nN = int(n_m[0])\nmoney = int(n_m[1])\n\ntanya_toys = sorted(int(toy) for toy in input().split())\n\nnew_toys = []\n\ntoy_index = 1\ntanya_toy_index = 0\nwhile True:\n if money >= toy_index:\n if tanya_toy_index < len(tanya_toys) and tanya_toys[tanya_toy_index] == toy_index:\n tanya_toy_index += 1\n toy_index += 1\n else:\n money -= toy_index\n new_toys.append(toy_index)\n toy_index += 1\n else:\n break\n\nprint(len(new_toys))\nfor toy in new_toys:\n print(toy, end=\" \")\nprint()\n", "temparr = input()\r\ntemparr = temparr.split()\r\nn = int(temparr[0])\r\nm = int(temparr[1])\r\ntemparr = input()\r\ntemparr = temparr.split()\r\ndicts = {}\r\nfor i in temparr:\r\n i = int(i)\r\n if i not in dicts:\r\n dicts[i] = 1 \r\nnewtoy = 0 \r\nmoneyleft = m\r\nans = []\r\nfor i in range(1, m + 1):\r\n if moneyleft < i :\r\n break\r\n if i not in dicts:\r\n newtoy += 1 \r\n moneyleft -= i \r\n ans.append(str(i))\r\n continue \r\n \r\nprint(newtoy)\r\nprint(\" \".join(ans))\r\n\r\n\r\n\r\n ", "import sys \r\ninput=sys.stdin.readline\r\n\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nidx,x=0,1\r\nb=[]\r\na.sort()\r\nwhile m>=0:\r\n if m-x>=0 and x!=a[idx]:\r\n m-=x\r\n b.append(x)\r\n x+=1\r\n elif x==a[idx]:\r\n idx=(idx+1)%n\r\n x+=1\r\n else:\r\n break\r\nprint(len(b))\r\nfor i in b:\r\n print(i,end=' ')\r\n ", "n,k=map(int,input().split())\r\nl=set(list(map(int,input().split())))\r\ni=1\r\nd=[]\r\nc=0\r\nwhile(i<=k):\r\n if(i not in l):\r\n d.append(i)\r\n c=c+1\r\n k=k-i\r\n i=i+1\r\nprint(c)\r\nprint(*d)\r\n", "\r\nn, m = map(int, input().split())\r\nset1 = set(map(int, input().split()))\r\n\r\nans = set()\r\nans_sum = 0\r\nfor i in range(1, 10 ** 9 + 1):\r\n\tif i not in set1:\r\n\t\tif ans_sum + i <= m:\r\n\t\t\tans.add(i)\r\n\t\t\tans_sum += i\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nif a[-1] != 10 ** 9:\r\n a.append(10 ** 9)\r\nk = 0\r\ns = 0\r\nj = 0\r\nans = []\r\nfor i in range(1, 150000):\r\n if i < a[j]:\r\n if s + i <= m:\r\n ans.append(i)\r\n s += i\r\n elif i == a[j]:\r\n j += 1\r\n if s >= m:\r\n break\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n", "#!/usr/bin/python3\n\nn, m = map(int, input().split())\n\na = set(map(int, input().split()))\n\ni = 1\nans = []\nwhile m > 0 and i <= m:\n if i not in a:\n a.add(i)\n ans.append(i)\n m -= i\n i += 1\n\nprint(len(ans))\nprint(*ans)\n", "n,m=map(int,input().split())\r\nA=[int(j) for j in input().split()]\r\nans=[]\r\nA.sort()\r\nj=0\r\nfor i in range(1,10**9+1):\r\n if j<n and i==A[j]:\r\n j+=1\r\n else:\r\n m-=i\r\n if m<0:\r\n break\r\n ans.append(i)\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i,end=\" \")\r\n \r\n", "I=lambda:map(int,input().split())\nn,m=I()\na=set(I())\nb=[]\ni=1\nwhile i<=m:\n if i not in a:b.append(str(i));m-=i\n i+=1\nprint(len(b),'\\n'+' '.join(b))\n\n\t\t\t \t\t\t \t\t\t\t \t \t \t\t\t\t\t\t\t", "n,m=list(map(int,input().split()))\r\na=set(map(int,input().split()))\r\ns=m\r\nal=len(a)\r\nb=[]\r\nfor i in range(1,m+1):\r\n\tif i not in a:\r\n\t\tif i<=s:\r\n\t\t\tb.append(i)\r\n\t\t\ts-=i\r\n\tif i>s:break\r\n\t\r\nprint(len(b))\r\nprint(*b)", "n, k = map(int, input().split())\nh = set(map(int, input().split()))\n\nbought = []\ni = 1\n\nfor i in range(1, 10**9 + 1):\n if k < i:\n break\n if i not in h:\n bought.append(i)\n k -= i\n\nprint(len(bought))\nprint(\" \".join(map(str, bought)))\n", "from bisect import bisect_left\r\ndef binary_search(a,x):\r\n i=bisect_left(a,x)\r\n if i<len(a) and a[i]==x: return i\r\n else: return -1\r\nn,m=map(int,input().split())\r\nalr=sorted(map(int,input().split()))\r\ntoy=1; cnt=0; ans=\"\"\r\nwhile m>0:\r\n if binary_search(alr,toy)==-1:\r\n if toy<=m:\r\n m-=toy; cnt+=1\r\n ans+=f\"{toy} \"\r\n else: break\r\n toy+=1\r\nprint(cnt)\r\nprint(ans)", "n, m = list(map(int, input().split()))\r\nl = set(list(map(int, input().split())))\r\ni = 1\r\ns = []\r\nwhile i <= m:\r\n\tif i not in l:\r\n\t\ts.append(i)\r\n\t\tm -= i\r\n\ti += 1\r\nprint(len(s))\r\nprint(*s)", "n, m = [int(i) for i in input().split()]\r\ns = {int(i) for i in input().split()}\r\nres = []\r\n\r\ni = 1\r\nwhile i <= m:\r\n if i not in s:\r\n m -= i\r\n res.append(str(i))\r\n i += 1\r\nprint(len(res))\r\nprint(\" \".join(res))", "n,m = map(int,input().split())\r\narr = sorted(list(map(int,input().split())))+[0]\r\nj = summ = count = 0\r\ni = 1\r\nlst = []\r\nwhile i<=10**9:\r\n if i != arr[j]:\r\n if summ+i<=m:\r\n lst.append(i)\r\n summ += i\r\n count += 1\r\n else:\r\n break\r\n else:\r\n j += 1\r\n i += 1\r\nprint(count)\r\nprint(*lst)", "n,k=map(int,input().split())\r\na=set(list(map(int,input().split())))\r\nl=[]\r\nfor i in range(1,20000000):\r\n if i not in a and i<=k:\r\n l.append(i)\r\n k-=i\r\n if(i>k):\r\n break\r\nprint(len(l))\r\nprint(*l)\r\n", "n,m=map(int,input().split())\r\nl=[int(q) for q in input().split()]\r\nl=set(map(int,l))\r\nc=1\r\nans=[]\r\ni=0\r\nwhile(m-c>=0):\r\n if c not in l:\r\n m-=c\r\n ans.append(c)\r\n c+=1\r\n else:\r\n c+=1\r\nprint(len(ans))\r\nprint(*ans)", "def main():\r\n n, k = map(int, input().split())\r\n arr = set(map(int, input().split()))\r\n\r\n i = 1\r\n s = 0\r\n answer_arr = []\r\n while True:\r\n if i not in arr:\r\n if s + i > k:\r\n break\r\n else:\r\n s += i\r\n answer_arr.append(i)\r\n i += 1\r\n else:\r\n i += 1\r\n print(len(answer_arr))\r\n print(*answer_arr)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# https://codeforces.com/problemset/problem/659/C\r\nn,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nd = {}\r\nfor i in arr:\r\n d[i] = 0\r\nans = []\r\ni= 1\r\nsumm = sum(ans)\r\nwhile summ<m:\r\n # print(ans)\r\n if i not in d:\r\n if i+summ<=m:\r\n ans.append(i)\r\n summ+=i\r\n else:\r\n break\r\n i+=1\r\nprint(len(ans))\r\nprint(*ans)", "t,m=map(int,input().split())\r\nx=sorted(list(map(int,input().split())))\r\n\r\npos=0\r\nbuys=[]\r\n\r\ni=1\r\nwhile True:\r\n if pos<t and i==x[pos]:\r\n pos+=1\r\n else:\r\n if i>m:break\r\n else:\r\n m-=i\r\n buys.append(i)\r\n i+=1\r\n\r\n\r\nprint(len(buys))\r\nprint(' '.join(list(map(str,buys))))\r\n", "from math import sqrt\n\ndef sn(awal, akhir):\n n = akhir - awal + 1\n return n * (2*awal + (n - 1)) // 2\n\ndef binary_search(a, start, end, search):\n if start == end:\n if sn(a, start) <= search:\n return start\n else:\n return -1\n\n mid = start + (end - start) // 2\n\n if search < sn(a, mid):\n return binary_search(a, start, mid, search)\n \n ret = binary_search(a, mid + 1, end, search)\n\n if ret == -1:\n return mid\n else:\n return ret\n\nn, m = map(int, input().split())\n\nt = [0] + sorted(list(map(int, input().split()))) + [10**9]\n\nans = []\nfor i in range(1, len(t)):\n mulai = t[i - 1] + 1\n akhir = t[i] - 1\n if mulai <= akhir:\n #print(f'Sisa uang adalah {m}, berapa paling banyak yang bisa kita beli dari {mulai} sampai {akhir}')\n x = binary_search(mulai, mulai, akhir, m) - mulai# beli dari awal ... awal + x\n #print(f'Beli {x + 1}, dari {mulai} sampai {akhir}')\n m -= sn(mulai, mulai + x)\n \n ans.extend([j for j in range(mulai, mulai + x + 1)])\n if mulai + x != akhir:\n break\n\nprint(len(ans))\nprint(*ans)\n\n \t\t\t \t \t\t \t\t\t\t\t\t\t\t\t \t \t\t\t\t \t", "'''I=lambda:map(int,input().split())\r\nn,m=I()\r\na=set(I())\r\nb=[]\r\ni=1\r\nwhile i<=m:\r\n if i not in a:b.append(str(i));m-=i\r\n i+=1\r\nprint(len(b),'\\n'+' '.join(b))'''\r\n\r\nn,m=map(int,input().split())\r\nl=set(map(int,input().split()))\r\ni = 1\r\nd = []\r\nwhile i <= m:\r\n if i not in l:\r\n d.append(i)\r\n m -= i\r\n i += 1\r\nprint(len(d))\r\nprint(*d)\r\n", "n, m = map(int, input().split())\r\na = set(map(int, input().split()))\r\ntypes = set()\r\ncurr_type= 1\r\nwhile m > 0 and curr_type < 10 ** 9:\r\n if curr_type not in a:\r\n if m - curr_type >= 0:\r\n m = m - curr_type\r\n types.add(curr_type)\r\n else:\r\n break\r\n curr_type += 1\r\nprint(len(types))\r\nprint(*types)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = []\r\ntoys = (10**6) * [0]\r\nfor i in range(len(a)):\r\n if a[i] < 10**6:\r\n toys[a[i]] = 1\r\nfor i in range(1, 10**6):\r\n if toys[i] == 0:\r\n if m < i:\r\n break\r\n t.append(str(i))\r\n m -= i\r\nprint(len(t))\r\nprint(' '.join(t))", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,m=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nc=0\r\nd={}\r\nfor i in range(n):\r\n d[l[i]]=1\r\ns=0\r\nl1=[]\r\nfor i in range(1,200001):\r\n if(i not in d):\r\n if(s+i<=m):\r\n s+=i\r\n c+=1\r\n l1.append(i)\r\n else:\r\n break\r\nprint(c)\r\nprint(*l1)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nx=[0]*(2*(100000))\r\nfor i in range(n):\r\n if l[i]>=len(x):\r\n pass\r\n else:\r\n x[l[i]] =1 \r\n#print(x)\r\na=[]\r\nfor i in range(1,len(x)):\r\n if x[i]==0:\r\n m-=i\r\n if m>=0:\r\n a.append(i)\r\n else:\r\n break\r\nprint(len(a))\r\nprint(*a)\r\n ", "n,m=[int(x) for x in input().split()]\r\n\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\ni=1\r\nc=0\r\nj=0\r\na=[]\r\nwhile(c+i<=m):\r\n if i!=l[j]:\r\n c+=i\r\n #print(i,c)\r\n a.append(i)\r\n elif j+1<len(l):\r\n j+=1\r\n i+=1\r\nprint(len(a))\r\nfor x in a:\r\n print(x,end=\" \")\r\n \r\n \r\n \r\n\r\n", "def inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn,m = invr()\r\narr = inlt()\r\n\r\nused = set()\r\nfor num in arr:\r\n used.add(num)\r\n\r\ncur = 1\r\nres = []\r\nwhile m > 0:\r\n if cur in used:\r\n cur+=1\r\n continue\r\n \r\n if m < cur:break\r\n m-=cur\r\n res.append(cur)\r\n cur += 1\r\n\r\nprint(len(res))\r\ns = \"\"\r\nfor num in res:\r\n s += str(num)\r\n s+= \" \"\r\nprint(s)", "n , m = map(int,input().split())\r\nl = set(map(int,input().split()))\r\nans = []\r\n\r\ni = 1\r\nwhile m >= i :\r\n if i not in l :\r\n ans.append(i)\r\n m-=i\r\n l.add(i)\r\n i +=1\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n\r\n", "n, m = map(int, input().split())\r\na = set(map(int, input().split()))\r\nans = []\r\nfor i in range(1, 10**9):\r\n if i not in a:\r\n if m < i:\r\n break\r\n m -= i\r\n ans.append(i)\r\nprint(len(ans))\r\nprint(*ans)", "n,m=[int(x) for x in input().split()]\r\ntoys=set([int(x) for x in input().split()])\r\nnewtoy=[]\r\nfor i in range(1,m+1):\r\n if i not in toys and m>=i:\r\n m-=i\r\n newtoy.append(str(i))\r\n if m<i:\r\n break\r\nprint(len(newtoy))\r\nprint(' '.join(newtoy))\r\n", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\ni, j, an = 0, 1, []\r\nwhile m>0:\r\n if i<n and a[i]==j:\r\n i+=1\r\n j+=1\r\n continue\r\n an.append(j)\r\n m-=j\r\n j+=1\r\n if m<0:\r\n an.pop()\r\n break\r\nprint(len(an))\r\nprint(*an)", "[n, m] = [int(x) for x in input().split(' ')]\r\na = set([int(x) for x in input().split(' ')])\r\n\r\nt = []\r\ncurrent = 0\r\n\r\nfor i in range(1, 1000000001):\r\n if i + current > m:\r\n break\r\n if i not in a:\r\n current += i\r\n t.append(str(i))\r\n\r\nprint(len(t))\r\nprint(' '.join(t))", "from math import *\r\nfrom collections import *\r\nfrom random import *\r\nfrom bisect import *\r\nimport sys\r\ninput=sys.stdin.readline\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n a=set(a)\r\n r=[]\r\n for i in range(1,1000000000+1):\r\n if i in a:\r\n continue\r\n if(m-i>=0):\r\n r.append(i)\r\n m-=i\r\n else:\r\n break\r\n print(len(r))\r\n print(*r)\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "inp = input().split()\nnumToys = int(inp[0])\nbudget =int(inp[1])\n\ncurToys = set([int(i) for i in input().split()])\n\ncurNum = 1\nnewToys = []\nwhile budget >= curNum:\n if curNum not in curToys:\n newToys.append(curNum)\n budget -= curNum\n\n curNum += 1\n \nprint(len(newToys))\nprint(\" \".join([str(i) for i in newToys]))\n\n\n \t\t \t \t\t \t \t\t \t \t" ]

[ "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nfor i in range(1, len(a)):\r\n f, s = a[i-1], a[i]\r\n\r\n if f == s:\r\n continue\r\n if f != 1:\r\n f *= 2\r\n if f > s:\r\n print(\"YES\")\r\n exit()\r\n \r\nprint(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na = set(a)\r\na = sorted(a)\r\n\r\nfor i in range(len(a) - 1):\r\n if a[i] + a[i] > a[i + 1]:\r\n print('YES')\r\n exit(0)\r\n\r\nprint('NO')", "n = int(input())\r\nlis = sorted(map(int,input().split()))\r\nc=0\r\n#print(lis)\r\nfor i in range(n-1,0,-1):\r\n if lis[i]<lis[i-1]*2 and lis[i]!=lis[i-1]:\r\n c=1\r\n break\r\nif c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\nok = True\r\nfor i in range(1, len(a)):\r\n if a[i] != a[i-1] and a[i-1] * 2 > a[i]:\r\n ok = False\r\n break\r\n\r\nprint(\"NO\" if ok else \"YES\")\r\n", "I=input\r\nR=range(int(I())-1)\r\na=sorted(map(int,I().split()))\r\ns='NO'\r\nfor i in R:\r\n\tif a[i]<a[i+1]and a[i]*2>a[i+1]:s='YES'\r\nprint(s)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ndone=0\r\nfor i in range(n-1):\r\n if l[i]<l[i+1] and 2*l[i]>l[i+1]:\r\n done=1\r\n break\r\n\r\nif done==1:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n ", "input()\nb={int(x)for x in input().split()}\nb=sorted(list(b))\nfor i in range(1,len(b)):\n if 2*b[i-1]>b[i]:\n print(\"YES\")\n break\nelse:print(\"NO\")\n\n\n\n", "n=int(input())-1\na=sorted(map(int,input().split()))\nans='NO'\nfor i in range(n):\n\tif a[i]<a[i+1]and a[i]*2>a[i+1]:\n\t\tans='YES'\nprint(ans)\n", "n=int(input())\r\nlst=[*set(map(int,input().split()))]\r\nlst.sort()\r\nfor i,x in enumerate(lst[:-1]):\r\n if x*2>lst[i+1]:\r\n from sys import exit\r\n print('YES');exit()\r\nprint('NO')", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nfor i in range(n-1):\r\n if a[i]<a[i+1] and a[i]*2>a[i+1]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "n, t = int(input()) - 1, sorted(list(map(int, input().split())))\n\nprint('YNEOS'[all(2 * t[i] <= t[i + 1] for i in range(n) if t[i] < t[i + 1]) :: 2])\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\nls = list(map(int,input().split()))\r\nls.sort()\r\nfor i in range(n-1) :\r\n if ls[i] != 1 and (ls[i+1] > ls[i] and ls[i+1] < 2*ls[i]) :\r\n print(\"YES\")\r\n break\r\nelse :\r\n print(\"NO\")", "def s():\r\n\tinput()\r\n\ta = list(map(int,input().split()))\r\n\ta.sort()\r\n\tfor i in range(1,len(a)):\r\n\t\tif a[i]!=a[i-1] and a[i]<a[i-1]*2:\r\n\t\t\treturn 'YES'\r\n\treturn 'NO'\r\nprint(s())", "n = int(input())\r\na = sorted(map(int, input().split()))\r\nans = 'NO'\r\nfor i in range(1, n):\r\n if a[i-1] * 2 > a[i] and a[i-1] != a[i]:\r\n ans = 'YES'\r\n\r\nprint(ans)", "n = (int)(input())\r\nflag = True\r\na = list(map(int,input().split()))\r\na.sort()\r\nfor x in range(1,len(a)):\r\n if a[x] < 2 *a[x-1] and a[x] != a[x-1]:\r\n print('YES')\r\n flag = False\r\n break\r\nif flag:\r\n print('NO')", "n = int(input())\r\nnums = list(set(map(int, input().split())))\r\nnums.sort()\r\n\r\njava_is_weird = False\r\nfor i in range(len(nums)-1):\r\n if nums[i] > nums[i+1] // 2:\r\n java_is_weird = True\r\n break\r\n\r\nprint(\"YES\") if java_is_weird else print(\"NO\")\r\n", "def nik(rud,ans):\r\n for i in range(1,n):\r\n if rud[i]<2*rud[i-1] and rud[i]!=rud[i-1]:\r\n ans=\"YES\"\r\n break\r\n print(ans)\r\n \r\nn=int(input())\r\nrud = list(map(int,input().split()))\r\nrud.sort()\r\nans=\"NO\"\r\nnik(rud,ans)\r\n", "\r\n\r\nn = int(input())\r\n\r\nA = sorted(list(set(map(int, input().split()))))\r\n\r\ngood = True\r\n\r\nfor i in range(1, len(A)):\r\n if A[i - 1] * 2 > A[i]:\r\n good = False\r\n\r\nif not good:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def datatypes(x,answer):\r\n for i in range(1,n):\r\n if x[i]<2*x[i-1] and x[i]!=x[i-1]:\r\n answer=\"YES\"\r\n break\r\n print(answer)\r\n \r\nn=int(input())\r\nx = list(map(int,input().split()))\r\nx.sort()\r\nanswer=\"NO\"\r\ndatatypes(x,answer)\r\n\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nf=False\r\nfor i in range(1,n):\r\n if(l[i]<2*l[i-1] and l[i]!=l[i-1]):\r\n print(\"YES\")\r\n f=True\r\n break\r\nif(f==False):\r\n print(\"NO\")\r\n " ]

[ "n,m,s,d=map(int,input().split())\r\nx=sorted(map(int,input().split()))+[m+s+1]\r\ncur=l=0\r\nans=[]\r\nwhile l<m:\r\n r=min(x[cur]-1,m)\r\n ans+=['RUN '+str(r-l)]\r\n if r==m: break\r\n if r-l<s: ans=['IMPOSSIBLE']; break\r\n t=x[cur]+1\r\n while x[cur+1]-1-t<s: cur+=1; t=x[cur]+1\r\n if t-r>d: ans=['IMPOSSIBLE']; break\r\n ans+=['JUMP '+str(t-r)]\r\n l=t;cur+=1\r\nprint('\\n'.join(ans))", "import sys\n\ndef solve():\n n, m, s, d = [int(x) for x in input().split()]\n obstacles = [int(x) for x in input().split()]\n obstacles.sort()\n if obstacles[0] <= s: return False\n pieces = [[obstacles[0], obstacles[0]]]\n for x in obstacles:\n if pieces[-1][1] + s + 2 > x:\n pieces[-1][1] = x\n else:\n if pieces[-1][1] - pieces[-1][0] + 2 > d: return False\n pieces.append([x, x])\n if pieces[-1][1] - pieces[-1][0] + 2 > d: return False\n pos = 0\n for piece in pieces:\n sys.stdout.write('RUN ' + str(piece[0] - pos - 1) + '\\n')\n sys.stdout.write('JUMP ' + str(piece[1] - piece[0] + 2) + '\\n')\n pos = piece[1] + 1\n if pos < m:\n sys.stdout.write('RUN ' + str(m - pos) + '\\n')\n return True\n\nif not solve():\n print('IMPOSSIBLE')\n", "for _ in range(1):\r\n n,m,s,jump=map(int,input().split())\r\n arr=[0]+sorted(list(map(int,input().split())))\r\n if s>=arr[1]:\r\n print(\"IMPOSSIBLE\")\r\n continue\r\n max_indx=arr[1]-1\r\n flag=0\r\n travel=[0]\r\n for i in range(1,n+1):\r\n if arr[i] - arr[i - 1] - 2 >= s:\r\n max_indx = arr[i] - 1\r\n if arr[i]+1 <= max_indx+jump:\r\n travel.append(max_indx)\r\n continue\r\n flag=-1\r\n break\r\n if flag==-1:\r\n print(\"IMPOSSIBLE\")\r\n continue\r\n arr[0]=-1\r\n travel.append(1000000000)\r\n ans=[]\r\n count=0\r\n for i in range(1,n+1):\r\n if travel[i]!=travel[i-1]:\r\n ans.append([\"RUN\",arr[i]-arr[i-1]-2])\r\n if travel[i]==travel[i+1]:\r\n count+=arr[i+1]-arr[i]\r\n else:\r\n ans.append([\"JUMP\",count+2])\r\n count=0\r\n if m-arr[-1] >1:\r\n ans.append([\"RUN\",m-arr[-1]-1])\r\n for i in ans:\r\n print(i[0],i[1])", "n, m ,s, d = [int(i) for i in input().split()] # m is the end point\n# s is length of run, d is the max jump distance\nA = [-1] + sorted([int(i) for i in input().split()]) + [m+1]\nans_size = 2 * 10**5\nans = [0 for i in range(4*ans_size)]\n\n# use 0 to indicate run an 1 to indicate jump\n\ndef obstacle():\n run = -1\n jump = -1\n top = 0 # flag where are we at the dp\n for i in range(1,n+1):\n if s + 2 <= A[i] - A[i-1]:\n if jump != -1:\n if A[i-1] + 1 - jump <= d and top > 0 and ans[top-1][0] == 0 and ans[top-1][1] >= s:\n ans[top] = (1, A[i-1]+1-jump)\n top += 1\n else:\n print(\"IMPOSSIBLE\")\n return\n ans[top] = (0, A[i] - A[i-1]-2) # run\n top += 1\n jump = A[i] - 1 # jumping point\n if A[n] + 1 - jump <= d and top > 0 and ans[top-1][0] == 0 and ans[top-1][1] >= s:\n ans[top] = (1, A[n]+1 - jump)\n top += 1\n else:\n print(\"IMPOSSIBLE\")\n return\n if m != A[n] + 1:\n ans[top] = (0, m-A[n]-1)\n top += 1\n for i in range(top):\n if ans[i][0]:\n print(\"JUMP\", ans[i][1])\n else:\n print(\"RUN\", ans[i][1])\nobstacle()\n \t \t \t \t \t \t \t \t\t\t \t\t\t \t \t\t", "n, m, s, d=map(int, input().split())\nx = sorted(map(int, input().split())) + [m + s + 1]\ncur = l = 0\nans = []\nwhile l < m:\n r = min(x[cur] - 1, m)\n ans += ['RUN ' + str(r - l)]\n if r == m: break\n if r - l < s: ans = ['IMPOSSIBLE']; break\n t = x[cur] + 1\n while x[cur + 1] - 1 - t < s: cur += 1; t = x[cur] + 1\n if t - r > d: ans = ['IMPOSSIBLE']; break\n ans += ['JUMP ' + str(t - r)]\n l = t;cur += 1\nprint('\\n'.join(ans))" ]

[ "import sys\r\n\r\ndef read(T):\r\n\treturn [T(i) for i in sys.stdin.readline().split()]\r\n\r\nlsp,pr=[],[]\r\ndef sieve(n=int(1e7)):\r\n\tglobal lsp\r\n\tlsp=[i for i in range(n+1)]\r\n\tfor i in range(2,n+1):\r\n\t\tif lsp[i]!=i:\r\n\t\t\tcontinue\r\n\t\tfor j in range(i*i,n+1,i):\r\n\t\t\tlsp[j]=i\r\n\tfor i in range(2,n+1):\r\n\t\tif lsp[i]==i:\r\n\t\t\tpr.append(i)\r\n\r\ndef solve():\r\n\t[[n,m],a,b]=read(int),read(int),read(int)\r\n\tnax=int(1e7+5)\r\n\td=[0 for i in range(nax)]\r\n\tfor i in range(n):\r\n\t\tcur=a[i]\r\n\t\twhile lsp[cur]!=1:\r\n\t\t\tp,c=lsp[cur],0\r\n\t\t\twhile cur%p==0:\r\n\t\t\t\tcur//=p\r\n\t\t\t\tc+=1\r\n\t\t\td[p]+=c\r\n\r\n\tfor i in range(m):\r\n\t\tcur=b[i]\r\n\t\twhile lsp[cur]!=1:\r\n\t\t\tp,c=lsp[cur],0\r\n\t\t\twhile cur%p==0:\r\n\t\t\t\tcur//=p\r\n\t\t\t\tc+=1\r\n\t\t\td[p]-=c\r\n\r\n\tnum,den=[],[]\r\n\t\r\n\tprint(n,m)\r\n\tfor i in range(n):\r\n\t\tcur=a[i]\r\n\t\tres=1\r\n\t\twhile lsp[cur]!=1:\r\n\t\t\tp,c=lsp[cur],0\r\n\t\t\twhile cur%p==0:\r\n\t\t\t\tcur//=p\r\n\t\t\t\tc+=1\r\n\t\t\tif d[p]<=0:\r\n\t\t\t\tcontinue\r\n\t\t\tc=min(c,d[p])\r\n\t\t\td[p]-=c\r\n\t\t\tres*=p**c\r\n\t\tprint(res,end=\" \")\r\n\tprint()\r\n\tfor i in range(m):\r\n\t\tcur=b[i]\r\n\t\tres=1\r\n\t\twhile lsp[cur]!=1:\r\n\t\t\tp,c=lsp[cur],0\r\n\t\t\twhile cur%p==0:\r\n\t\t\t\tcur//=p\r\n\t\t\t\tc+=1\r\n\t\t\tif d[p]>=0:\r\n\t\t\t\tcontinue\r\n\t\t\tc=min(c,abs(d[p]))\r\n\t\t\td[p]+=c\r\n\t\t\tres*=p**c\r\n\t\tprint(res,end=\" \")\r\n\r\ndef main():\r\n\tsieve()\r\n\tsolve()\r\n\r\nmain()", "import math as mt \r\nfrom sys import stdin,stdout\r\n \r\nMAXN = 10000001\r\nspf = [0]*(MAXN) \r\n\r\ndef sieve(): \r\n\tspf[1] = 1\r\n\tfor i in range(2, MAXN):\r\n\t\tspf[i] = i\r\n\tfor i in range(4, MAXN, 2): \r\n\t\tspf[i] = 2\r\n\tfor i in range(3, mt.ceil(mt.sqrt(MAXN))): \r\n\t\tif (spf[i] == i):\r\n\t\t\tfor j in range(i * i, MAXN, i):\r\n\t\t\t\tif (spf[j] == j): \r\n\t\t\t\t\tspf[j] = i \r\n \r\ndef getFactorization(x): \r\n\tret = list() \r\n\twhile (x != 1): \r\n\t\tret.append(spf[x]) \r\n\t\tx = x // spf[x] \r\n\treturn ret \r\nsieve() \r\n\r\n\r\ndef help():\r\n\ta,b = map(int,stdin.readline().split(\" \"))\r\n\r\n\tnum = list(map(int,stdin.readline().split(\" \")))\r\n\tden = list(map(int,stdin.readline().split(\" \")))\r\n\tspfn = [0]*(MAXN) \r\n\t\r\n\tfor i in range(b):\r\n\t\ttemp = getFactorization(den[i])\r\n\t\tfor j in temp:\r\n\t\t\tspfn[j]-=1\r\n\r\n\tspfn_den = [0]*(MAXN)\r\n\r\n\tfor i in range(a):\r\n\t\ttemp = getFactorization(num[i])\r\n\t\tfor j in temp:\r\n\t\t\tif(spfn[j]<0):\r\n\t\t\t\tspfn[j]+=1\r\n\t\t\t\tspfn_den[j] -= 1\r\n\t\t\t\tnum[i] = num[i]//j\r\n\r\n\tfor i in range(b):\r\n\t\ttemp = getFactorization(den[i])\r\n\t\tfor j in temp:\r\n\t\t\tif(spfn_den[j]<0):\r\n\t\t\t\tspfn_den[j] += 1\r\n\t\t\t\tden[i] = den[i]//j\r\n\r\n\tstdout.write(str(a)+\" \"+str(b)+\"\\n\")\r\n\tfor i in range(a):\r\n\t\tstdout.write(str(num[i])+\" \")\r\n\tstdout.write(\"\\n\")\r\n\tfor i in range(b):\r\n\t\tstdout.write(str(den[i])+\" \")\r\n\tstdout.write(\"\\n\")\r\n\r\n\t\r\nhelp()", "# Legends Always Come Up with Solution\r\n# Author: Manvir Singh\r\n\r\nimport os\r\nfrom io import BytesIO, IOBase\r\nimport sys\r\nfrom collections import Counter\r\nfrom math import sqrt, pi, ceil, log, inf, gcd, floor\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n z = ceil(sqrt(max(max(a), max(b))))\r\n p = [1] * (z + 1)\r\n i = 2\r\n while i * i <= z:\r\n if p[i] == 1:\r\n j = i * i\r\n while j <= z:\r\n p[j] = 0\r\n j += i\r\n i += 1\r\n pr = []\r\n for i in range(2, z + 1):\r\n if p[i]:\r\n pr.append(i)\r\n f = Counter()\r\n f1 = Counter()\r\n c = [[] for i in range(n)]\r\n d = [[] for i in range(m)]\r\n for i, v in enumerate(a):\r\n y, z = ceil(sqrt(v)), v\r\n for j in pr:\r\n if j > y:\r\n break\r\n x=0\r\n while z % j == 0:\r\n f[j] += 1\r\n x+=1\r\n z = z // j\r\n if x:\r\n c[i].append([j,x])\r\n if z > 1:\r\n c[i].append([z,1])\r\n f[z] += 1\r\n for i, v in enumerate(b):\r\n y, z = ceil(sqrt(v)), v\r\n for j in pr:\r\n if j > y:\r\n break\r\n x=0\r\n while z % j == 0:\r\n f1[j] += 1\r\n x+=1\r\n z = z // j\r\n if x:\r\n d[i].append([j,x])\r\n if z > 1:\r\n d[i].append([z,1])\r\n f1[z] += 1\r\n e = []\r\n for i in f:\r\n f[i], f1[i] = max(f[i] - f1[i], 0), max(f1[i] - f[i], 0)\r\n if f[i] == 0:\r\n e.append(i)\r\n if f1[i] == 0:\r\n del f1[i]\r\n for i in e:\r\n del f[i]\r\n e.clear()\r\n a = [1] * n\r\n b = [1] * m\r\n for i in range(n):\r\n z, f2 = 1, 0\r\n for j in range(len(c[i])):\r\n xx=c[i][j][0]\r\n y = min(c[i][j][1], f[xx])\r\n z = z * pow(xx,y)\r\n f[xx] -= y\r\n if f[xx] == 0:\r\n del f[xx]\r\n if len(f) == 0:\r\n f2 = 1\r\n break\r\n a[i] = z\r\n if f2:\r\n break\r\n for i in range(m):\r\n z, f2 = 1, 0\r\n for j in range(len(d[i])):\r\n xx=d[i][j][0]\r\n y = min(d[i][j][1], f1[xx])\r\n z = z * pow(xx, y)\r\n f1[xx] -= y\r\n if f1[xx] == 0:\r\n del f1[xx]\r\n if len(f1) == 0:\r\n f2 = 1\r\n break\r\n b[i] = z\r\n if f2:\r\n break\r\n print(n, m)\r\n print(*a)\r\n print(*b)\r\n\r\n\r\n# region fastio\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from functools import reduce\nfrom itertools import accumulate\nimport operator\nfrom collections import defaultdict as dd\n\ninput()\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nn = int(1e7) + 3\n\neratoshe = [i for i in range(n)]\ni = 2\nwhile i * i < n:\n if eratoshe[i] != i:\n i += 1\n continue\n for j in range(i * 2, n, i):\n eratoshe[j] = i\n i += 1\n\n\ndef factorize(f):\n factors = []\n while f > 1:\n factors.append(eratoshe[f])\n f //= eratoshe[f]\n # i = 2\n # while f % i != 0:\n # i += 1\n # while i * i <= f:\n # while f % i == 0:\n # f //= i\n # factors.append(i)\n # i += 1\n # if f > 1:\n # factors.append(f)\n return factors\n\n\ndef list_to_factors(l):\n d = dd(int)\n fs = []\n for i in l:\n factors = factorize(i)\n fs.append(factors)\n for f in factors:\n d[f] += 1\n return d, fs\n\n\ndef find_and_remove(el, m):\n if el in m:\n m[el] -= 1\n if m[el] == 0:\n del m[el]\n return True\n return False\n\n\nremoved = dd(int)\nlb, fb = list_to_factors(b)\nres1, res2 = [], []\nfor i, val in enumerate(a):\n factors = factorize(val)\n r = []\n for f in factors:\n if find_and_remove(f, lb):\n removed[f] += 1\n else:\n r.append(f)\n res1.append(reduce(lambda a, b: a * b, r, 1))\n\nfor factors in fb:\n r = []\n for f in factors:\n if not find_and_remove(f, removed):\n r.append(f)\n res2.append(reduce(lambda a, b: a * b, r, 1))\n\nprint(len(res1), len(res2))\nprint(*res1)\nprint(*res2)\n" ]

[ "#!/usr/bin/env python\n'''\n' Author: Cheng-Shih Wong\n' Email: [email protected]\n' Date: 2017-09-22\n'''\n\ndef main():\n\n def num(left, right, dp, rev, revI):\n if left > right:\n return 1\n\n key = left, rev, revI\n if key in dp:\n return dp[key]\n nonlocal ans\n\n acc = 0\n\n for x in ('01' if ans[left]=='#' else ans[left]):\n \n temp = None\n if left == right:\n tmp = x\n elif ans[right]=='#':\n tmp = '01'\n else:\n tmp = ans[right]\n\n for y in tmp:\n if not ((rev and x>y) or (revI and x==y=='1')):\n acc += num(\n left+1,\n right-1,\n dp,\n rev and x==y,\n revI and x!=y\n )\n dp[key] = acc\n return acc\n\n n, k = map(int, input().split())\n k += 1\n\n ans = ['#'] * n\n\n for i in range(n):\n ans[i] = '0'\n tmp = num(0, n-1, {}, True, True)\n\n if k > tmp:\n k -= tmp\n ans[i] = '1'\n\n if ans[0] == '0':\n print(''.join(ans))\n else:\n print(-1)\n\nif __name__ == '__main__':\n import sys, os\n from time import time\n if len(sys.argv)>1 and os.path.exists(sys.argv[1]):\n sys.stdin = open(sys.argv[1], 'rb')\n st = time()\n main()\n print('----- Run {:.6f} seconds. -----'.format(time()-st), file=sys.stderr)\n", "n, m = map(int, input().split())\r\nm += 1\r\n \r\n \r\ndef calc(l, r, eq, eq_i):\r\n if l > r:\r\n return 1\r\n key = l, eq, eq_i\r\n if key in f:\r\n return f[key]\r\n \r\n t = 0\r\n for x in (['0', '1'] if s[l] == '?' else [s[l]]):\r\n if l == r:\r\n a = [x]\r\n else:\r\n a = ['0', '1'] if s[r] == '?' else [s[r]]\r\n for y in a:\r\n if not((eq and x > y) or (eq_i and x == y == '1')):\r\n t += calc(l + 1, r - 1, eq and x == y, eq_i and x != y)\r\n f[key] = t\r\n return t\r\n \r\n \r\ns = ['?'] * n\r\nfor i in range(n):\r\n s[i] = '0'\r\n f = {}\r\n p = calc(0, n - 1, True, True)\r\n if m > p:\r\n m -= p\r\n s[i] = '1'\r\n \r\nif s[0] == '0':\r\n print(''.join(s))\r\nelse:\r\n print(-1)", "def raschot(d, e, g, h):\r\n if d > e:\r\n return 1\r\n key = d, g, h\r\n if key in b:\r\n return b[key]\r\n f = 0\r\n for x in (['0', '1'] if a0[d] == '?' else [a0[d]]):\r\n if d == e:\r\n a = [x]\r\n else:\r\n a = ['0', '1'] if a0[e] == '?' else [a0[e]]\r\n for y in a:\r\n if not ((g and x > y) or (h and x == y == '1')):\r\n f += raschot(d + 1, e - 1, g and x == y, h and x != y)\r\n b[key] = f\r\n return f\r\n\r\n\r\nn, m = map(int, input().split())\r\nm += 1\r\na0 = ['?'] * n\r\nfor i in range(n):\r\n a0[i] = '0'\r\n b = {}\r\n c = raschot(0, n - 1, True, True)\r\n if m > c:\r\n m -= c\r\n a0[i] = '1'\r\nif a0[0] == '0':\r\n print(''.join(a0))\r\nelse:\r\n print(-1)\r\n", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n\r\n def calc(lower, upper, record, eq, eq_i):\r\n if lower > upper:\r\n return 1\r\n key = lower, eq, eq_i\r\n if key in record:\r\n return record[key]\r\n\r\n t = 0\r\n for x in (['0', '1'] if result[lower] == '?' else [result[lower]]):\r\n temp = None\r\n if lower == upper:\r\n temp = [x]\r\n elif result[upper] == '?':\r\n temp = ['0', '1']\r\n else:\r\n temp = [result[upper]]\r\n for y in temp:\r\n if not ((eq and x > y) or (eq_i and x == y == '1')):\r\n t += calc(lower+1, upper-1, record, eq and x == y,\r\n eq_i and x != y)\r\n record[key] = t\r\n return t\r\n\r\n\r\n n, k = map(int, input().split())\r\n k += 1 # Suppose 00...0 is also valid\r\n result = ['?'] * n\r\n for i in range(n):\r\n result[i] = '0'\r\n passed = calc(0, n-1, {}, True, True)\r\n if k > passed:\r\n k -= passed\r\n result[i] = '1'\r\n if result[0] == '0':\r\n print(''.join(result))\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n" ]

[ "from collections import defaultdict\nn=int(input())\na=list(map(int,input().split()))\ndef top(mp=defaultdict(int),x=1,n=1):\n if n==1 and mp[x]==1 or n==0:\n return [x]\n if mp[x]==0:\n return -1\n mp[x]-=1\n k=top(mp,2*x,n-1)\n mp[x]+=1\n if k!=-1:\n return k+[x]\n if x%3==0:\n mp[x]-=1\n k=top(mp,x//3,n-1)\n mp[x]+=1\n return k if k==-1 else k+[x]\n return -1\nmp=defaultdict(int)\nfor i in a:\n mp[i]+=1\n\nfor i in a:\n arr=top(mp,i,n)\n # print(arr)\n if arr!=-1:\n print(*arr[::-1])\n break\n# print(mp)", "n = int(input())\r\na = input().split()\r\nfor i in range(len(a)): a[i] = int(a[i])\r\nmax_3_pow = 0\r\nfor num in a:\r\n temp = 0\r\n a_copy = num\r\n while a_copy % 3 == 0:\r\n a_copy //= 3\r\n temp += 1\r\n max_3_pow = max(max_3_pow, temp)\r\n\r\na_sorted_by_pow_3 = []\r\nfor _ in range(max_3_pow + 1): a_sorted_by_pow_3.append([])\r\nfor num in a:\r\n temp = 0\r\n a_copy = num\r\n while a_copy % 3 == 0:\r\n a_copy //= 3\r\n temp += 1\r\n a_sorted_by_pow_3[temp].append(num)\r\n\r\n#print(a_sorted_by_pow_3)\r\nfor i in range(max_3_pow + 1):\r\n a_sorted_by_pow_3[i].sort()\r\n\r\nfor i in range(max_3_pow, -1, -1):\r\n for num in a_sorted_by_pow_3[i]:\r\n print(num, end = ' ')", "\r\n\r\nclass Solution:\r\n\r\n def __init__(self, n, nums) -> None:\r\n\r\n self.state = []\r\n self.n = n\r\n self.nums = nums\r\n self.found = False\r\n self.answer = \"\"\r\n\r\n self.table = {}\r\n for x in self.nums:\r\n if x not in self.table:\r\n self.table[x] = 0\r\n self.table[x] += 1\r\n\r\n def isAvailable(self, x):\r\n\r\n return x in self.table and self.table[x] > 0\r\n \r\n def dropElement(self, x):\r\n\r\n self.table[x] += 1\r\n self.state.pop()\r\n\r\n def useElement(self, x):\r\n\r\n self.table[x] -= 1\r\n self.state.append(x)\r\n\r\n def explore(self, i, x):\r\n\r\n if self.found or not self.isAvailable(x):\r\n return\r\n\r\n self.useElement(x)\r\n\r\n if i == self.n:\r\n self.saveAnswer()\r\n\r\n if self.found:\r\n return\r\n \r\n self.explore(i+1, x * 2)\r\n if x % 3 == 0:\r\n self.explore(i+1, x//3)\r\n\r\n self.dropElement(x)\r\n\r\n def saveAnswer(self):\r\n \r\n build = \"\"\r\n for x in self.state:\r\n build += f\"{x} \"\r\n\r\n self.answer = build[:-1]\r\n self.found = True\r\n\r\n def solve(self):\r\n\r\n for x in self.nums:\r\n self.explore(1, x)\r\n \r\n return self.answer\r\n\r\nn = int(input())\r\nnums = [int(x) for x in input().split(\" \")]\r\n \r\nsolver = Solution(n, nums)\r\nans = solver.solve()\r\nprint(ans)", "n = int(input())\narr = list(map(int, input().split()))\n\ndef sort_conversion(n):\n i = 0\n while n % 2 == 0:\n i += 1\n n /= 2\n return (-n, i)\n \narr.sort(key=sort_conversion)\nprint(*arr)", "l=list(map(int,[*open(0)][1].split()))\r\ndef conv(n):\r\n\ti=0\r\n\twhile n%2==0:i+=1;n/=2\r\n\treturn(-n, i)\r\nl.sort(key=conv);print(*l)", "def recurse(arr, n, prev=0):\r\n if n == 1:\r\n if prev * 2 == arr[0] or arr[0] * 3 == prev:\r\n return arr\r\n else:\r\n return []\r\n \r\n li = []\r\n \r\n for i in range(n):\r\n to_pick = arr[:i] + arr[i+1:]\r\n if prev*2 == arr[i] or arr[i]*3 == prev or prev == 0:\r\n jj = recurse(to_pick, n-1, arr[i])\r\n if len(jj) == n-1:\r\n return [arr[i]] + jj\r\n\r\n return li\r\n \r\n\r\n\r\n \r\n\r\nn = int(input())\r\nnums = [int(x) for x in input().split()]\r\n\r\nprint(' '.join(str(x) for x in recurse(nums, n)))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndef make_tuple(x):\r\n tup = sum(1 for i in range(60) if x % (3 ** i) == 0)\r\n return (tup, -x)\r\n\r\nstart = max(a, key=make_tuple)\r\n\r\nanswer = [start]\r\na.remove(start)\r\n\r\nwhile len(answer) < n:\r\n if answer[-1] % 3 == 0 and answer[-1] // 3 in a:\r\n answer.append(answer[-1] // 3)\r\n a.remove(answer[-1])\r\n else:\r\n answer.append(answer[-1] * 2)\r\n a.remove(answer[-1])\r\n\r\nprint(*answer)", "n=int(input())\r\narr=set([int(x) for x in input().split()]) \r\ntop=0\r\nfor x in arr:\r\n if x*3 not in arr and ((x%2==1) or (x%2==0 and x//2 not in arr)):\r\n top=x \r\n break \r\nvisited=set()\r\nvisited.add(top)\r\nl=[top]\r\narr.discard(top)\r\nwhile l:\r\n x=l.pop()\r\n print(x,end=\" \")\r\n p1=x*2 \r\n p2=x//3 \r\n if p1 in arr:\r\n l.append(p1)\r\n elif p2 in arr and x%3==0:\r\n l.append(p2)", "from collections import Counter, defaultdict,deque\r\n_ = input()\r\nnums = [int(x) for x in input().split()]\r\n\r\nc = Counter(nums)\r\nn = len(nums)\r\nafter = [-1]*n\r\nd = defaultdict(deque)\r\n\r\n\r\nfor i in range(n):\r\n if nums[i] % 3 == 0 and c[nums[i]//3] > 0:\r\n c[nums[i]//3]-=1\r\n after[i] = nums[i]//3\r\n d[nums[i]//3].append(i)\r\n elif c[nums[i]*2] > 0:\r\n c[nums[i]*2]-=1\r\n after[i] = nums[i]*2\r\n d[nums[i]*2].append(i)\r\n\r\nout = []\r\nstart = -1\r\nfor i in range(n):\r\n if after[i] == -1:\r\n start = nums[i] \r\n break\r\n\r\n\r\nout.append(start)\r\nwhile len(d) > 0:\r\n nxt_idx = d[start].popleft()\r\n if len(d[start]) == 0:\r\n del d[start]\r\n start = nums[nxt_idx]\r\n out.append(start)\r\n\r\nprint(*out[::-1])", "def getTuple(x):\n count_power_of_three = sum(1 for i in range(60) if x % (3**i) == 0)\n return (count_power_of_three, -x)\n\nn = int(input())\na = list(map(int, input().split()))\nstart = max(a, key=getTuple)\n\nans = [start]\na.remove(start)\n\nwhile len(ans) < n:\n if ans[-1] % 3 == 0 and ans[-1] // 3 in a:\n ans.append(ans[-1] // 3)\n a.remove(ans[-1])\n else:\n ans.append(ans[-1] * 2)\n a.remove(ans[-1])\n\nprint(*ans)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=[]\r\nfor i in l:\r\n j=i\r\n c2=0\r\n c3=0\r\n while i%2==0:\r\n c2+=1\r\n i=i//2\r\n while i%3==0:\r\n c3+=1\r\n i=i//3\r\n d.append((j,c2,c3))\r\nd.sort(key=lambda x:[-x[2],x[1]])\r\nx=[i[0] for i in d]\r\nprint(*x)", "n = int(input())\r\nnrs = [int(i) for i in input().split()]\r\nnewlist = [nrs[0],]\r\nx = nrs[0]\r\nfirst = nrs[0]\r\nnrs = nrs[1:]\r\nfor i in range(n):\r\n for index, j in enumerate(nrs):\r\n if j == x*2 or (j==x//3 and x%3==0):\r\n x = j\r\n newlist.append(j)\r\n nrs.pop(index)\r\n break\r\n if (j==first//2 and first%2==0) or j==first*3:\r\n first = j\r\n newlist.insert(0, j)\r\n nrs.pop(index)\r\nprint(*newlist, sep = \" \")", "def make_seq(cur: int, cur_nums: set):\r\n if len(cur_nums) == 0:\r\n return []\r\n nums_1 = cur_nums.copy()\r\n if cur * 2 in nums_1:\r\n nums_1.remove(cur * 2)\r\n res1 = make_seq(cur*2, cur_nums=nums_1)\r\n if res1 is not None:\r\n return [cur*2] + res1\r\n\r\n nums_2 = cur_nums.copy()\r\n if cur % 3 == 0 and cur // 3 in nums_2:\r\n nums_2.remove(cur // 3)\r\n res2 = make_seq(cur // 3, cur_nums=nums_2)\r\n if res2 is not None:\r\n return [cur // 3] + res2\r\n return None\r\n \r\n\r\n\r\n\r\ndef solution():\r\n N = input()\r\n N = int(N)\r\n\r\n if N == 0:\r\n return None\r\n \r\n nums = set(map(int, input().split(' ')))\r\n\r\n for i in nums:\r\n res = make_seq(i, nums - {i})\r\n if res is not None:\r\n return [i] + res\r\n \r\n\r\n \r\n\r\nprint(' '.join(str(item) for item in solution()))", "import sys\r\n\r\n\r\n# sys.setrecursionlimit(10**8)设置最大递归次数\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n ac.read_int()\r\n\r\n def check(x):\r\n res = 0\r\n while x % 3 == 0:\r\n x //= 3\r\n res += 1\r\n return [-res, x]\r\n\r\n nums = ac.read_list_ints()\r\n nums.sort(key=check)\r\n ac.lst(nums)\r\n return\r\n\r\n\r\nSolution().main()\r\n" ]

[ "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn,x=map(int,input().split())\r\n\r\ndef mult(a,b):\r\n # compute a*b\r\n c=[0]*128\r\n for i in range(128):\r\n for j in range(128):\r\n c[i^j]+=a[i]*b[j]\r\n return c\r\n\r\ndef quickpow(a,b):\r\n # compute a**b\r\n if b==1:\r\n return a\r\n if b&1:\r\n return mult(quickpow(mult(a,a),b//2),a)\r\n return quickpow(mult(a,a),b//2)\r\n\r\nprob=list(map(float,input().split()))\r\nprob+=[0.0]*(128-len(prob))\r\n\r\nprint(\"%.9f\"%(1-quickpow(prob,n)[0]))", "import os\r\nfrom io import BytesIO\r\n#input = BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef main():\r\n\r\n def mult(m1,m2):\r\n ans = [0] * 128\r\n\r\n for i in range(128):\r\n for j in range(128):\r\n ans[i^j] += m1[i] * m2[j]\r\n return ans\r\n \r\n def power(number, n):\r\n res = number\r\n while(n):\r\n if n & 1:\r\n res = mult(res,number)\r\n \r\n number = mult(number,number)\r\n n >>= 1\r\n \r\n return res\r\n \r\n n,x = map(int,input().split())\r\n\r\n ai = list(map(float,input().split()))\r\n ai += [0]*(128-len(ai))\r\n if n == 1:\r\n print(1 - ai[0])\r\n return\r\n ansm = power(ai,n-1)\r\n print(1 - ansm[0])\r\nmain()\r\n" ]

[ "n = int(input())\r\ni = 1\r\nwords = []\r\nwords2 = []\r\nres = set()\r\nwhile i <= n:\r\n words.append(input())\r\n i += 1\r\nfor i in range(n):\r\n words2 = words[i]\r\n while 'u' in words2:\r\n words2 = words2.replace('u', 'oo')\r\n while 'kh' in words2:\r\n words2 = words2.replace('kh', 'h')\r\n res.add(words2)\r\nprint(len(res))", "t=int(input())\r\nl=[]\r\np=['kkkkkkkkkkkkkkkkkkkh', 'kkkkkkkkkkkkkkkkkkh', 'kkkkkkkkkkkkkkkkkh', 'kkkkkkkkkkkkkkkkh', 'kkkkkkkkkkkkkkkh', 'kkkkkkkkkkkkkkh', 'kkkkkkkkkkkkkh', 'kkkkkkkkkkkkh', 'kkkkkkkkkkkh', 'kkkkkkkkkkh', 'kkkkkkkkkh', 'kkkkkkkkh', 'kkkkkkkh', 'kkkkkkh', 'kkkkkh', 'kkkkh', 'kkkh', 'kkh', 'kh']\r\nfor i in range(0,t):\r\n s=str(input())\r\n a=s.replace(\"u\",\"oo\")\r\n for j in p:\r\n if j in s:\r\n a=a.replace(j,\"h\")\r\n if a not in l:\r\n l.append(a)\r\nprint(len(l))", "n=eval(input())\r\nans=set()\r\nfor i in range(n):\r\n s=input()\r\n # print(s)\r\n t=0\r\n while t<=100:\r\n s=s.replace(\"u\",\"oo\")\r\n s=s.replace(\"kh\",\"h\")\r\n t+=1\r\n\r\n # print(s)\r\n ans.add(s)\r\n\r\nprint(len(ans))", "import re\nprint(len(set(map(lambda v:re.sub(\"k*h\",\"h\",input()).replace(\"u\",\"oo\"),range(int(input()))))))\n", "n=int(input())\r\ne=set()\r\nfor i in range(n):\r\n s=input()\r\n while 1:\r\n s1=s\r\n s=s.replace('u','oo').replace('kh','h')\r\n if s==s1:\r\n break\r\n e.add(s)\r\n\r\nprint(len(e))\r\n", "n = int(input())\r\ns = list()\r\nfor i in range(0, n):\r\n st = input()\r\n s.append(st)\r\n\r\nfor i in range(0, len(s)):\r\n st = s[i]\r\n while 'u' in st:\r\n st = st.replace(\"u\", \"oo\")\r\n while \"kh\" in st:\r\n st = st.replace(\"kh\", \"h\")\r\n s[i] = st\r\n\r\nwds = set(s)\r\nprint(len(wds))\r\n", "n=int(input())\r\nwords=[None]*n\r\nfor i in range(n):\r\n\tcur=input()\r\n\tif 'u' in cur:\r\n\t\tcur=cur.replace('u','oo')\r\n\tif 'kh' in cur:\r\n\t\twhile 'kh' in cur:\r\n\t\t\tcur=cur.replace('kh','h')\r\n\twords[i]=cur\r\n\r\nprint(len(set(words)))", "n = int(input())\r\na = set()\r\nfor i in range(n):\r\n s = input().rstrip()\r\n while s.find(\"kh\") != -1:\r\n s = s.replace(\"kh\", \"h\")\r\n while s.find(\"u\") != -1:\r\n s = s.replace(\"u\", \"oo\")\r\n a.add(s)\r\n#print(a)\r\nprint(len(list(a)))", "from sys import *\r\nn = int(next(stdin))\r\nwords = []\r\nfor i in range(n):\r\n word = next(stdin).strip()\r\n word = word.replace(\"u\", \"oo\")\r\n while \"kh\" in word:\r\n word = word.replace(\"kh\", \"h\")\r\n if word not in words:\r\n words.append(word)\r\nprint(len(words))", "def f(_):\r\n s = input()\r\n s = s.replace('u', 'oo').replace('oo', 'u')\r\n for _ in range(len(s)):\r\n s = s.replace('kh', 'h')\r\n return s\r\n \r\nprint(len(set(map(f, range(int(input()))))))", "s=set()\r\nfor i in range(int(input())):\r\n x=input()\r\n while 'kh' in x:\r\n x=x.replace('kh','h')\r\n x=x.replace('u','oo')\r\n s.add(x)\r\nprint(len(s))\r\n", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n import re\r\n\r\n n = int(input())\r\n print(\r\n len({re.sub(r\"(k+h)|u\", lambda m: 'h' if m.group(1) else \"oo\", input()) for i in range(n)}))\r\n\r\ntry:\r\n while True:\r\n main()\r\nexcept EOFError:\r\n pass\r\n", "#coding: utf-8\r\n\r\nn=int(input())\r\nse=set()\r\nfor i in range(n):\r\n\ts=input()\r\n\twhile s.find(\"u\")!=-1:s=s.replace(\"u\",\"oo\")\r\n\twhile s.find(\"kh\")!=-1:s=s.replace(\"kh\",\"h\")\r\n\tse.add(s)\r\n\t\r\nprint(len(se))\r\n", "n = int(input())\r\ngroups = {}\r\nfor i in range(0,n):\r\n words = []\r\n word = input()\r\n tword = word\r\n word = word.replace(\"u\", \"oo\")\r\n while word.find(\"kh\") != -1:\r\n word = word.replace(\"kh\", \"h\")\r\n if groups.get(word, 0) is 0:\r\n groups.update({word: [tword]})\r\n else:\r\n words = groups.get(word)\r\n words.append(tword)\r\n groups.update({word: words})\r\n\r\nprint(len(groups.keys()))\r\n", "import re\r\n\r\ns = input()\r\nw = ['']\r\nc = 0\r\nfor n in range( int(s) ):\r\n _str = input()\r\n _str = re.sub('u','oo',_str)\r\n _str = re.sub('k+h','h',_str)\r\n\r\n found = False\r\n \r\n for sl in w:\r\n if sl == _str:\r\n found = True\r\n break\r\n \r\n if found == False:\r\n w.append(_str)\r\n c=c+1\r\n\r\nprint(c)\r\n\r\n\r\n", "n = int(input())\r\nans = []\r\nfor i in range(0,n):\r\n s = input()\r\n s = s.replace(\"u\",\"oo\")\r\n while s.count(\"kh\") != 0:\r\n s = s.replace(\"kh\",\"h\")\r\n if not s in ans:\r\n ans.append(s)\r\nprint (len(ans))", "d=dict()\r\nfor _ in \" \"*int(input()):\r\n z=input()\r\n while 'kh' in z:z=z.replace('kh','h')\r\n while 'u' in z:z=z.replace('u','oo')\r\n d[z]=d.get(z,0)+1\r\nprint(len(d))", "n = int(input())\r\n\r\nresult = set()\r\n\r\nfor i in range(n):\r\n s = str(input())\r\n for it in range(20):\r\n s = s.replace('u', 'oo')\r\n s = s.replace('kh', 'h')\r\n s = [s]\r\n result.update(s)\r\n\r\nprint(len(result))\r\n\r\n", "str=set()\r\nfor i in range(int(input())):\r\n s=input()\r\n t=s.replace('kh','h')\r\n while t!=s: s=t; t=s.replace('kh','h')\r\n str.add(t.replace('u','oo'))\r\nprint(len(str))", "n = int(input())\nd = {}\nfor _ in range(n):\n\ts = input()\n\twhile (True):\n\t\tif s.find(\"kh\") != -1:\n\t\t\ts = s.replace(\"kh\", \"h\")\n\t\telif s.find(\"u\") != -1:\n\t\t\ts = s.replace(\"u\", \"oo\")\n\t\telse:\n\t\t\tbreak\n\td[s] = d.get(s,0) + 1\nprint(len(d))\n", "c, m = 0, []\r\nimya = int(input())\r\nwhile c != imya:\r\n m.append(input())\r\n c += 1\r\nfor i in range(len(m)):\r\n while 'kh' in m[i] or 'u' in m[i]:\r\n m[i] = m[i].replace('kh', 'h')\r\n m[i] = m[i].replace('u', 'oo')\r\nprint(str(len(set(m))))\r\n", "import re \r\n\r\nn = int(input())\r\nst = set()\r\n\r\nfor _ in range(n):\r\n s = input()\r\n s = re.sub(\"k*h\",\"h\", s)\r\n s = s.replace(\"u\",\"oo\")\r\n st.add(s)\r\nprint(len(st))\r\n ", "n = int(input())\nwords = {}\nfor i in range(n):\n w = input()\n while 'kh' in w or 'u' in w:\n w = w.replace('u','oo').replace('kh','h')\n try:\n words[w] += 1\n except KeyError:\n words[w] = 1\nprint(len(words.keys()))\n", "def normalize(w):\r\n w1 = w.replace(\"u\", \"oo\").replace(\"kh\", \"h\")\r\n while w != w1:\r\n t = w1\r\n w1 = w1.replace(\"u\", \"oo\").replace(\"kh\", \"h\")\r\n w = t\r\n return w1\r\n\r\nn = int(input())\r\nres = set()\r\nfor i in range(n):\r\n w = normalize(input())\r\n res.add(w)\r\nprint(len(res))", "n = int(input())\r\na = {}\r\ncount = 0\r\nwhile n:\r\n n-=1\r\n s = input()\r\n while 'u' in s:\r\n s = s.replace('u','oo')\r\n while 'kh' in s:\r\n s = s.replace('kh','h')\r\n try:\r\n a[s] += 1\r\n except KeyError:\r\n a[s] = 1\r\n count += 1\r\nprint(count)", "import math\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\twhile(\"kh\" in s):\r\n\t\ts=s.replace(\"kh\",\"h\")\r\n\twhile(\"u\" in s):\r\n\t\ts=s.replace(\"u\",\"oo\")\r\n\tl.append(s)\r\nprint(len(set(l)))", "st = set()\r\nfor i in range(int(input())):\r\n s = input().replace('u', 'oo')\r\n while 'kh' in s:s = s.replace('kh', 'h')\r\n st.add(s)\r\nprint(len(st))", "def rev(s):\r\n s = s[::-1]\r\n news = []\r\n for i in range(len(s)):\r\n letter = s[i]\r\n if(letter == 'u'):\r\n news.append('o')\r\n news.append('o')\r\n continue\r\n if(i == 0):\r\n news.append(letter)\r\n continue\r\n if(letter == 'k'):\r\n if(news[-1] == 'h'):\r\n continue\r\n news.append(letter)\r\n continue\r\n news.append(letter)\r\n return ''.join(news[::-1])\r\n\r\nn = int(input())\r\ng = set()\r\n\r\nfor i in range(n):\r\n s = input()\r\n s = rev(s)\r\n g.add(s)\r\n\r\nprint(len(g))\r\n", "# https://codeforces.com/contest/883/problem/F\r\n\r\nimport sys\r\nread = sys.stdin.readline\r\nwrite = sys.stdout.write\r\n\r\nSET = set()\r\nfor _ in range(int(read())):\r\n\ts = read()\r\n\ts = s.replace(\"u\", \"oo\")\r\n\twhile s.count(\"kh\") != 0:\r\n\t\ts = s.replace(\"kh\", \"h\")\r\n\tSET.add(s)\r\nwrite(str(len(SET)) + '\\n')", "def expand(x):\n x = x.replace('u', 'oo')\n x = x.replace('h', 'kh')\n return x\n\ndef reduce(x):\n nx = ''\n while True:\n nx = x.replace('oo', 'u')\n if nx == x: break\n x = nx\n while True:\n nx = x.replace('kh', 'h')\n if nx == x: break\n x = nx\n if 'oo' in x or 'kh' in x:\n x = reduce(x)\n return x\n\nn = int(input())\nl = []\nfor _ in range(n):\n l.append(input())\n\ns = set()\nfor x in l:\n s.add(reduce(expand(x)))\n\nprint(len(s))\n\n", "n = int(input())\r\n\r\nans = set()\r\n\r\nfor i in range(n):\r\n \r\n s = str(input())\r\n s = s.replace(\"u\", \"oo\")\r\n # print(s)\r\n \r\n while \"kh\" in s:\r\n s = s.replace(\"kh\", \"h\")\r\n # print(s)\r\n \r\n ans.add(s)\r\n \r\nprint(len(ans))\r\n# print(ans)", "import sys\r\nimport math\r\nfrom collections import defaultdict, deque, Counter\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\n\r\n\r\ndef readInt():\r\n x = int(sys.stdin.readline().rstrip())\r\n return x\r\n\r\n\r\ndef readList(type=int):\r\n x = sys.stdin.readline()\r\n x = list(map(type, x.rstrip('\\n\\r').split()))\r\n return x\r\n\r\n\r\nwrite = sys.stdout.write\r\nread = sys.stdin.readline\r\n\r\ndef simple(s):\r\n if s.count('kh') or s.count('u'):\r\n return False\r\n return True\r\n\r\ndef solve():\r\n n = readInt()\r\n mp = dict()\r\n ans = set()\r\n nm = [read().rstrip('\\n') for _ in range(n)]\r\n for name in nm:\r\n while not simple(name):\r\n name = name.replace('kh', 'h')\r\n name = name.replace('u', 'oo')\r\n ans.add(name)\r\n print(len(ans))\r\n\r\n\r\n\r\n\r\ndef main():\r\n t = 1\r\n # t = readInt()\r\n for _ in range(t):\r\n solve()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\nwords = [input() for _ in range(n)]\ns = set()\nfor w in words:\n while 'kh' in w or 'u' in w:\n if 'kh' in w:\n for i in range(len(w) - 1):\n if 'kh' == w[i:i+2]:\n w = w[:i] + 'h' + w[i+2:]\n else:\n for i in range(len(w)):\n if 'u' == w[i:i+1]:\n w = w[:i] + 'oo' + w[i+1:]\n \n s.add(w)\nprint(len(s))\n", "import sys\r\n\r\nn = int(input())\r\ns = set()\r\nfor line in sys.stdin:\r\n prev = line\r\n while True:\r\n word = prev.strip().replace(\"oo\", \"u\").replace(\"kh\", \"h\").replace(\"uo\", \"ou\")\r\n if prev == word:\r\n break\r\n else:\r\n prev = word\r\n s.add(prev)\r\n\r\nprint(len(s))\r\n", "def main():\r\n\tn = int(input())\r\n\tl = list()\r\n\tfor i in range(n):\r\n\t\ttmp = input()\r\n\t\ttmp = kh(tmp)\r\n\t\ttmp = tmp.replace(\"u\",\"oo\")\r\n\t\ttmp = tmp.replace(\"oo\",\"u\")\r\n\t\tif tmp not in l:\r\n\t\t\tl.append(tmp)\r\n\tprint(len(l))\r\n\r\ndef kh(tmp):\r\n\tif \"kh\" not in tmp:\r\n\t\treturn tmp\r\n\telse:\r\n\t\treturn kh(tmp.replace(\"kh\",\"h\"))\r\n\t\t\r\n\t\t\r\nmain()", "def solve():\r\n n = int(input())\r\n s = set()\r\n for _ in range(n):\r\n w = input()\r\n w = w.replace('u', 'oo')\r\n for i in range(21):\r\n w = w.replace('kh', 'h')\r\n s.add(w)\r\n print(len(s))\r\nsolve()", "\nimport sys\n\n\"\"\"\nsys.stdin = open('input.txt', 'r') \nsys.stdout = open('output.txt', 'w')\n\"\"\"\n\nn = int(input())\n\nnames = []\n\nfor _ in range(n):\n\tnames.append(input())\n\nother = []\n\nfor name in names:\n\n\twhile 'u' in name:\n\t\tname = name.replace('u', 'oo')\n\n\twhile 'kh' in name:\n\t\tname = name.replace('kh', 'h')\n\n\tother.append(name)\n\n\nprint(len(set(other)))", "t=int(input())\r\narr=[]\r\nfor i in range(t):\r\n s=input()\r\n s=s.replace('u','oo')\r\n f=0\r\n while f!=-1:\r\n s=s.replace('kh','h')\r\n f=s.find('kh')\r\n arr.append(s)\r\narr=set(arr)\r\nprint(len(arr))\r\n", "c = set()\r\nfor _ in range(int(input())):\r\n a = input()\r\n # print(a)\r\n a = a.replace('u', 'oo')\r\n while 'oo' in a:\r\n a = a.replace('oo', 'u')\r\n while 'kh' in a:\r\n a = a.replace('kh', 'h')\r\n # print(a)\r\n c.add(a)\r\nprint(len(c))\r\n", "itr = int(input())\nl =[]\nfor i in range(itr):\n m = input()\n l.append(m)\nd = []\nfor i in l:\n while(i.count(\"kh\")>0 or i.count(\"oo\")>0):\n i = i.replace(\"kh\",\"h\")\n i = i.replace(\"oo\",\"u\")\n d.append(i)\nd = set(d)\nl = []\nfor i in d:\n i = i.replace(\"h\",\"kh\")\n i = i.replace(\"u\",\"oo\")\n l.append(i)\nprint(len(set(l)))\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nd = Counter()\r\nfor _ in range(n):\r\n s = input()[:-1].replace('u', 'oo')\r\n while 'kh' in s:\r\n s = s.replace('kh', 'h')\r\n d[s] += 1\r\nprint(len(d))", "n = int(input())\r\nwords = [input() for i in range(n)]\r\n\r\nans = set()\r\nfor i in range(n):\r\n temp = words[i]\r\n while 'u' in temp:\r\n temp = temp.replace('u', 'oo')\r\n\r\n while 'kh' in temp:\r\n temp = temp.replace('kh', 'h')\r\n\r\n ans.add(temp)\r\n\r\nprint(len(ans))\r\n", "m = int(input())\r\nst = list()\r\nfor i in range (0, m):\r\n\ts = input()\r\n\tst.append(s)\r\n\r\nfor i in range (0, len(st)):\r\n\ts=st[i]\r\n\twhile 'u' in s:\r\n\t\ts = s.replace(\"u\",\"oo\")\r\n\twhile \"kh\" in s:\r\n\t\ts = s.replace(\"kh\",\"h\")\r\n\tst[i] = s\r\n\t\t\r\nwds = set(st)\r\n\r\nprint (len(wds))", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n lst.append(list(input()))\r\ncnt = 0\r\nans = []\r\nfor i in range(n):\r\n if lst[i] != -1:\r\n cnt = 1\r\n for j in range(n):\r\n if i != j and lst[j] != -1:\r\n s1 = \"\".join(lst[i])\r\n s2 = \"\".join(lst[j])\r\n f = 0\r\n while \"u\" in s1 or \"u\" in s2 or \"kh\" in s1 or \"kh\" in s2:\r\n s1=s1.replace(\"kh\",\"h\")\r\n s2=s2.replace(\"kh\",\"h\")\r\n s1=s1.replace(\"u\",\"oo\")\r\n s2=s2.replace(\"u\",\"oo\")\r\n if s1 == s2:\r\n cnt+=1\r\n lst[j] = -1\r\n ans.append(cnt)\r\n lst[i] = -1\r\nprint(len(ans))", "n = int(input())\r\nm = set()\r\nfor i in range(n):\r\n s = input()\r\n\r\n while s.count('u') > 0:\r\n s = s.replace('u', 'oo')\r\n\r\n while s.count('kh') > 0:\r\n s = s.replace('kh', 'h')\r\n m.add(s)\r\n\r\nprint(len(m))\r\n", "n = int(input())\nwords = []\nfor _ in range(n):\n\treplace = True\n\tword = input()\n\twhile replace:\n\t\tnewWord = word.replace(\"u\",\"oo\").replace(\"kh\",\"h\")\n\t\tif word==newWord:\n\t\t\treplace = False\n\t\tword = newWord\n\tif word not in words:\n\t\twords.append(word)\nprint(len(words))", "d=[]\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n s=s.replace(\"u\", \"oo\")\r\n while s.count(\"kh\") != 0:\r\n s=s.replace(\"kh\", \"h\")\r\n \r\n if not s in d:\r\n d.append(s)\r\n\r\nprint(len(d))", "n = int(input())\r\nnames = []\r\nfor i in range(n):\r\n prvs_name = input()\r\n new_name = ''\r\n while prvs_name != new_name:\r\n new_name = prvs_name\r\n prvs_name = prvs_name.replace('oo', 'u')\r\n prvs_name = prvs_name.replace('kh', 'h')\r\n prvs_name = prvs_name.replace('ou', 'uo')\r\n if new_name not in names:\r\n names.append(new_name)\r\nprint(len(names))", "n = int(input())\n\ns = set()\n\nfor i in range(n):\n cur = input()\n ref = ''\n for c in cur:\n if c == 'u':\n ref = ref + 'oo'\n else:\n ref = ref + c\n while True == True:\n check = True\n tmp = ''\n for c in range(0, len(ref)):\n if c != len(ref) - 1 and ref[c] == 'k' and ref[c + 1] == 'h':\n check = False\n else:\n tmp = tmp + ref[c]\n ref = tmp\n if check == True:\n break\n s.add(ref)\nprint(len(s))", "n = int(input())\ndict_ch={}\nfor i in range(n):\n ch = input()\n if 'u' in ch:\n ch = ch.replace('u','oo')\n while 'kh' in ch:\n ch = ch.replace('kh','h')\n if ch not in dict_ch:\n dict_ch.update({ch:1})\nprint(len(dict_ch))", "n = int(input())\nwords = set()\nfor _ in range(n):\n word = input().strip()\n word = word.replace('u', 'oo')\n for i in range(20):\n word = word.replace('kh', 'h')\n words.add(word)\nprint(len(words))", "st = set()\r\nfor i in range(int(input())):\r\n s = input().replace('u', 'oo').replace('oo', 'u')\r\n while s.count('kh') > 0:\r\n s = s.replace('kh', 'h')\r\n st.add(s)\r\nprint(len(st))", "n=int(input())\narr=[]\ncount=0\nfor i in range(n):\n x=input()\n while \"kh\" in x:\n x=x.replace(\"kh\",\"h\")\n while \"u\" in x:\n x=x.replace(\"u\",\"oo\")\n if x not in arr:\n count+=1\n arr.append(x)\n\nprint(count)", "n = int(input())\n\nv = [input() for _ in range(n)]\n\nvis = set()\n\ndef min(s):\n if s in vis:\n return 0\n vis.add(s)\n if s.find(\"kh\") != -1:\n ind = s.find(\"kh\")\n nstr = s[:ind]+\"h\"+s[ind+2:]\n return min(nstr)\n if s.find(\"u\") != -1:\n ind = s.find(\"u\")\n nstr = s[:ind]+\"oo\"+s[ind+1:]\n return min(nstr)\n #print(s)\n return 1\n\nans = 0\nfor s_ in v:\n ans += min(s_)\n\nprint(ans)\n", "def replacement(str):\r\n\tstr2 = str.replace(\"oo\",\"u\")\r\n\tstr3 = str2.replace(\"kh\",\"h\")\r\n\tif str3 == str:\r\n\t\treturn str3\r\n\telse :\r\n\t\tstr3 = replacement(str3)\r\n\t\treturn str3\r\n\t\r\n\t\r\n\r\n\r\nn = int(input())\r\nmyList = []\r\nmyList2 = []\r\nfor i in range(n):\r\n\tmyList.append(input())\r\nfor x in myList:\r\n\t\r\n\tstr4 = replacement(x)\r\n\tstr4 = str4.replace(\"u\",\"oo\")\r\n\tstr4 = str4.replace(\"h\",\"kh\")\r\n\t\r\n\texist = False\r\n\tfor str in myList2:\r\n\t\tif str4 == str:\r\n\t\t\texist = True\r\n\tif exist == False:\r\n\t\tmyList2.append(str4)\r\n\r\nprint(len(myList2))", "n = int(input())\r\n\r\ng = set()\r\n\r\nfor _ in range(n):\r\n s = input()\r\n while (True):\r\n new_s = s.replace('oo', 'u').replace('kh', 'h').replace('ou', 'uo')\r\n if new_s == s:\r\n break\r\n s = new_s\r\n\r\n if s not in g:\r\n g.add(s)\r\n \r\nprint(len(g))\r\n", "import re\r\nn = int(input())\r\nst = set()\r\nfor i in range(n):\r\n\ts = input()\r\n\ts = s.replace(\"u\", \"oo\")\r\n\ts = re.sub(\"k*h\", \"h\", s)\r\n\t#print(\"dbg: \" + s)\r\n\tst.add(s)\r\n\r\nprint(len(st))", "from sys import stdin\r\n\r\nwords = set()\r\n\r\n\r\ndef ko(w):\r\n while 'kh' in w:\r\n w = w.replace('kh', 'h', 1)\r\n\r\n return w.replace('u', 'oo')\r\n\r\ndef solve():\r\n inp = stdin.read().strip().split()[1:]\r\n for w in inp:\r\n words.add(ko(w))\r\n\r\n print(len(words))\r\n\r\nsolve()\r\n", "c=[]\r\nn=int(input())\r\nfor uygf in range(n):\r\n s=list(input())\r\n l=len(s)\r\n i=0\r\n p=[]\r\n d=['u','o','k','h']\r\n while(i<l):\r\n if(s[i] not in d):\r\n p.append(s[i])\r\n i+=1\r\n elif(s[i]=='o'):\r\n if(i+1<l and s[i+1]=='o'):\r\n p.append('u')\r\n i+=2\r\n elif(i+1<l and s[i+1]=='u'):\r\n p.append('u')\r\n s[i+1]='o'\r\n i+=1\r\n else:\r\n p.append('o')\r\n i+=1\r\n elif(s[i]=='k'):\r\n y=i+1\r\n while(y<l and s[y]=='k'):\r\n y+=1\r\n if(y!=l):\r\n if(s[y]=='h'):\r\n\r\n p.append('h')\r\n i=y+1\r\n else:\r\n for pp in range(i,y):\r\n p.append('k')\r\n i=y\r\n else:\r\n for pp in range(i,y):\r\n p.append('k')\r\n i=y\r\n else:\r\n p.append(s[i])\r\n i+=1\r\n\r\n c.append(p)\r\nd=[]\r\nfor i in range(n):\r\n if(i in d):\r\n continue\r\n for j in range(i+1,n):\r\n if(c[i]==c[j]):\r\n d.append(j)\r\nprint(n-len(d))\r\n\r\n\r\n", "import math\r\nimport re\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef ri():\r\n return int(input())\r\n\r\n\r\ndef rfa():\r\n return [float(i) for i in input().split()]\r\n\r\n\r\neps = 1e-9\r\n\r\n\r\ndef is_equal(a, b):\r\n return abs(a - b) <= eps\r\n\r\n\r\ndef distance(p0, p1):\r\n return math.sqrt((p0[0] - p1[0]) ** 2 + (p0[1] - p1[1]) ** 2)\r\n\r\n\r\nn = ri()\r\nmp = {}\r\nar=[]\r\nfor i in range(401,-1,-1):\r\n ar.append(('k'*i+'h'))\r\n\r\nfor i in range(n):\r\n st = input()\r\n st = st.replace('u', 'oo')\r\n\r\n for j in range(1,len(ar)):\r\n st=st.replace(ar[j-1],ar[j])\r\n\r\n mp[st] = 1\r\nprint(len(mp))\r\n", "n = int(input())\r\ns = set()\r\n\r\n\r\nfor a in range(n):\r\n name = input()\r\n\r\n name = name.replace('u', 'oo')\r\n\r\n while (name.count('kh') > 0):\r\n name = name.replace('kh', 'h')\r\n s.add(name)\r\n\r\nprint(len(s))\r\n", "n = int(input())\nd=[]\nfor i in range(n):\n s= input();\n s=s.replace(\"u\",\"oo\");\n while s.count(\"kh\")!= 0:\n s=s.replace(\"kh\",\"h\")\n if s not in d:\n d.append(s);\n\n# print(d)\nprint(len(d))", "mapp={}\r\nfor _ in range(int(input())):\r\n data = input()\r\n new = [] \r\n data=data.replace('u','oo')\r\n i=len(data)-1\r\n while i>=0:\r\n new.append(data[i])\r\n if data[i]=='h':\r\n i-=1\r\n while data[i]=='k':\r\n i-=1\r\n else:\r\n i-=1\r\n new=new[::-1]\r\n temp=''.join(new)\r\n if temp in mapp:\r\n mapp[temp]+=1\r\n else:\r\n mapp[temp]=1\r\nprint(len(mapp))\r\n", "n = int(input())\r\nnames = set()\r\nfor rd in range(n):\r\n prev_name = input()\r\n name = prev_name.replace('u','oo').replace('kh', 'h')\r\n while name != prev_name:\r\n prev_name = name\r\n name = name.replace('kh', 'h')\r\n names.add(name)\r\nprint(len(names))", "import re\r\n \r\ndef fix(s):\r\n s = s.replace('u', 'oo')\r\n s = s.replace('oo', 'u')\r\n s = re.sub('k+h', 'h', s)\r\n return s\r\n \r\nwords = set()\r\nfor i in range(int(input())):\r\n words.add(fix(input()))\r\nprint(len(words))", "import re\r\nn = int(input())\r\nst = set()\r\nfor i in range(n):\r\n\tst.add(re.sub(\"k*h\", \"h\", input().replace(\"u\", \"oo\")))\r\nprint(len(st))", "n = int(input())\r\nset1 = set()\r\nfor i in range(n):\r\n\tinp = input()\r\n\twhile 'oo' in inp:\r\n\t\tinp = inp.replace('oo', 'u')\r\n\twhile 'kh' in inp:\r\n\t\tinp = inp.replace('kh', 'h')\r\n\tset1.add(inp)\r\n\r\nset2 = set()\r\nfor st in set1:\r\n\tset2.add(st.replace('u', 'oo').replace('h', 'kh'))\r\n#print(set2)\r\nprint(len(set2))", "import re\r\nprint(len(set(re.sub(\"k*h\",\"h\",input()).replace(\"u\",\"oo\") for i in range(int(input())))))", "n=int(input())\r\nd=[] \r\nfor i in range(0,n): \r\n s=input() \r\n s=s.replace(\"u\",\"oo\") \r\n while s.count(\"kh\")!=0: \r\n s=s.replace(\"kh\",\"h\") \r\n if not s in d: \r\n d.append(s) \r\nprint (len(d))\r\n", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n tmp = str(input())\r\n for j in range(20):\r\n tmp = tmp.replace(\"u\",\"oo\")\r\n tmp = tmp.replace(\"kh\",\"h\")\r\n s.append(tmp)\r\nprint(len(set(s)))", "n = int(input())\r\nst = set()\r\nfor i in range(n):\r\n word = input()\r\n word = word.replace('u', 'oo')\r\n while word.replace('kh', 'h') != word:\r\n word = word.replace('kh', 'h')\r\n st.add(word)\r\nprint(len(st))", "n = int(input())\r\nst=set()\r\nfor i in range(n):\r\n s=input()\r\n t=s.replace('kh','h')\r\n while t!=s:\r\n s=t\r\n t=s.replace('kh','h')\r\n st.add(t.replace('u','oo'))\r\nprint(len(st))", "def check(result, s, i):\r\n while True:\r\n if s == result[i]:\r\n return True\r\n else:\r\n if s.count('h') > 0 and result[i].count('kh') > 0 and len(s) < len(result[i]):\r\n s.replace('h', 'kh')\r\n elif s.count('kh') > 0 and result[i].count('h') > 0 and len(s) > len(result[i]):\r\n result[i].replace('h', 'kh')\r\n else:\r\n return False\r\n\r\n\r\nn = int(input(''))\r\n\r\ns = list()\r\n\r\nfor _ in range(n):\r\n temp = input('').replace('u', 'oo')\r\n while temp.count('kh') > 0:\r\n temp = temp.replace('kh', 'h')\r\n s.append(temp)\r\n\r\nresult = list()\r\n\r\nfor temp in s:\r\n flag = False\r\n for i in result:\r\n if temp == i:\r\n flag = True\r\n break\r\n if not flag:\r\n result.append(temp)\r\n\r\nprint(len(result))", "import re\n\nt = int(input())\ndd = {}\nfor i in range(0, t):\n s = input()\n s = re.sub(r'[k]+h', 'h', s.rstrip())\n s = re.sub(r'u', 'oo', s.rstrip())\n dd[s] = 1\n\nprint(len(dd))\n", "#!/usr/bin/env python3\n\nnames = int(input())\n\ndef simplify_name(s):\n s_orig = s[:]\n s = s.replace('u', 'oo')\n s = s.replace('kh', 'h')\n if s == s_orig:\n return s\n else:\n return simplify_name(s)\n\nname_set = set()\n\nfor idx in range(names):\n name_set.add(simplify_name(input()))\n\nprint(len(name_set))\n", "n = int(input())\ns = set()\nfor i in range(n):\n\tx = input()\n\tx = x.replace(\"u\", \"oo\")\n\tfor i in range(25):\n\t\tx = x.replace(\"kh\", \"h\")\n\ts.add(x)\nprint(len(s))", "# Main maut ko takiya, aur kafan ko chaadar banakar audhta hoon!\r\n\r\nn=int(input())\r\n\r\nnames={}\r\n\r\nfor i in range(n):\r\n\ts=input()\r\n\t\r\n\twhile(s.find('kh')!=-1):\r\n\t\ts=s.replace('kh','h')\r\n\t\r\n\twhile(s.find('u')!=-1):\r\n\t\ts=s.replace('u','oo')\r\n\t\r\n\tnames[s]=1\r\n\r\nprint(len(names))\r\n\r\n\r\n\r\n", "n = input()\n\n#print(n)\n\nnames = set()\n\nfor i in range(0, int(n)):\n s = input()\n\n while \"kh\" in s:\n s = s.replace(\"kh\", \"h\")\n\n while \"u\" in s:\n s = s.replace(\"u\", \"oo\")\n\n #print(\"->\", s)\n #print(i)\n names.add(s)\n\nprint(len(names))\n", "import re\r\nprint(len(set(re.sub('k+h', 'h', input().replace('u', 'oo')) for i in range(int(input())))))", "def conv(s):\r\n\ts = s.replace('u','oo')\r\n\twhile 'kh' in s:\r\n\t\ts = s.replace('kh','h')\r\n\t#print(s)\r\n\treturn s\r\n\r\nn = int(input())\r\narr = set()\r\nfor i in range(n):\r\n\ts = input()\r\n\tarr.add(conv(s))\r\nprint(len(arr))", "def amb1(s):\r\n l=list(s)\r\n s1=s\r\n l1=list(s1)\r\n while \"kh\" in s1:\r\n l1=list(s1)\r\n for i in range(len(l1)-1):\r\n if l1[i]=='k' and l1[i+1]=='h':\r\n l1=l1[:i]+l1[i+1:]\r\n s1=''.join(l1)\r\n break\r\n return ''.join(l1)\r\ndef amb2(s):\r\n l=list(s)\r\n s1=s\r\n l1=list(s1)\r\n while \"u\" in s1:\r\n l1=list(s1)\r\n for i in range(len(l1)):\r\n if l1[i]=='u':\r\n l1=l1[0:i]+['o','o']+l1[i+1:]\r\n s1=''.join(l1)\r\n #print(s1)\r\n break\r\n return ''.join(l1)\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=str(input())\r\n while \"kh\" in s or \"u\" in s:\r\n if \"kh\" in s:\r\n s=amb1(s)\r\n if \"u\" in s:\r\n s=amb2(s)\r\n l.append(s)\r\nll=set(l)\r\nprint(len(ll))", "n = int(input())\nres = set()\nfor _ in range(n):\n s = input().replace('u', 'oo')\n while True:\n ns = s.replace('kh', 'h')\n if ns == s:\n s = ns\n break\n s = ns\n\n res.add(s)\n \n\nprint(len(res))", "n = int(input())\r\n\r\ndef get_final_str(s):\r\n\ts = s.replace('u', 'oo')\r\n\twhile 1:\r\n\t\ts1 = s.replace(\"kh\", \"h\")\r\n\t\tif (s1 == s):\r\n\t\t\tbreak\r\n\t\ts = s1\r\n\treturn s\r\n\r\nd = set()\r\nfor i in range(n):\r\n\ts = get_final_str(input())\r\n\td.add(s)\r\n\r\nprint(len(d))", "n = int(input().strip())\r\nA = []\r\nfor i in range(n):\r\n A.append(input().strip())\r\nA = list(map(lambda x: x.replace('u','oo'), A))\r\nfor i in range(n):\r\n tem = A[i]\r\n toRem = []\r\n for j in range(len(tem)):\r\n if tem[j] == 'h':\r\n lo = None\r\n for k in range(j-1,-1,-1):\r\n if tem[k] == 'k':\r\n lo = k\r\n else:\r\n break\r\n if not lo is None:\r\n toRem.append([lo,j])\r\n # print(tem,toRem)\r\n if toRem:\r\n for j in range(len(toRem)-1,-1,-1):\r\n tem = tem[:toRem[j][0]]+tem[toRem[j][1]:]\r\n A[i] = tem\r\nA.sort()\r\nif A:\r\n out = 1\r\nfor i in range(1,len(A)):\r\n if A[i] != A[i-1]:\r\n out+=1\r\nprint(out)", "import re\r\n\r\nn = int(input())\r\n\r\nl = {}\r\n\r\nfor i in range(n):\r\n s = input()\r\n s = re.sub('u', 'oo', s)\r\n s = re.sub('k*h', 'h', s)\r\n l[s] = 1\r\n\r\nprint(len(l))", "name_number = int(input())\r\nnames = []\r\nfor name in range(name_number):\r\n entered_name = input()\r\n while 'kh' in entered_name:\r\n entered_name = entered_name.replace('kh', 'h')\r\n\r\n while 'u' in entered_name:\r\n entered_name = entered_name.replace('u', 'oo')\r\n names.append(entered_name)\r\nprint(len(set(names)))", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n s = input()\r\n while 'u' in s or 'kh' in s:\r\n s = s.replace('u', 'oo')\r\n s = s.replace('kh', 'h')\r\n if not s in arr:\r\n arr.append(s)\r\n#print(arr)\r\nprint(len(arr))", "import re\r\n\r\nn = int(input())\r\n\r\ns = set()\r\n\r\nr1 = re.compile(r'u')\r\nr2 = re.compile(r'k+h')\r\n\r\nfor _ in range(n):\r\n tmp = input().strip()\r\n \r\n tmp = r1.sub('oo', tmp)\r\n tmp = r2.sub('h', tmp)\r\n \r\n s.add(tmp)\r\n\r\nprint(len(s))\r\n " ]

[ "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\n\r\nif n == 2:\r\n print('0 1\\n1 0')\r\n exit()\r\n\r\nmatrix = [[0] * n for _ in range(n)]\r\n\r\nfor i in range(n - 1):\r\n for j in range(n - 1):\r\n matrix[i][j] = (i + j) % (n - 1)\r\n\r\nfor i in range(n - 1):\r\n matrix[i][n - i - 1] = matrix[n - i - 1][i] = n - 1\r\n matrix[i][i] = 0\r\n if i > 0:\r\n matrix[i][-1] = matrix[-1][i] = (matrix[i - 1][i] + 1) % (n - 1)\r\n\r\nans = '\\n'.join(' '.join(map(str, matrix[i])) for i in range(n))\r\nsys.stdout.buffer.write(ans.encode('utf-8'))\r\n", "# http://www.cut-the-knot.org/arithmetic/latin2.shtml\r\n# is helpful\r\n\r\nn=int(input())\r\n\r\nANS=[[-1]*n for i in range(n)]\r\n\r\nfor i in range(n):\r\n ANS[i][i]=0\r\n\r\nstart=1\r\nlast=n-1\r\nfor i in range(n):\r\n x=start\r\n for j in range(i+1,n-1):\r\n ANS[i][j]=ANS[j][i]=x\r\n x+=1\r\n if x==n:\r\n x=1\r\n\r\n if i!=n-1:\r\n ANS[i][n-1]=ANS[n-1][i]=last\r\n last+=2\r\n if last==n+1:\r\n last=2\r\n elif last==n:\r\n last=1\r\n \r\n start+=2\r\n if start==n+1:\r\n start=2\r\n \r\nfor i in range(n):\r\n print(*ANS[i])\r\n\r\n assert len(set(ANS[i]))==n\r\n\r\n\r\n", "n = int(input())\r\na = [[0]*n for _ in range(n)]\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n a[i][j] = 1+(i+j-1)%(n-1)\r\nfor i in range(n-1):\r\n a[i][-1] = a[-1][i] = a[i][i]\r\n a[i][i] = 0\r\nfor r in a: print(*r)", "def main():\r\n n = int(input())\r\n\r\n matrix = [[0 for _ in range(n)] for _ in range(n)]\r\n for i in range(n):\r\n for j in range(i + 1):\r\n if j != i - j:\r\n matrix[j][i - j] = i\r\n\r\n for i in range(n, 3 * n // 2 - 1):\r\n for j in range(i - n + 1, n):\r\n if j != i - j:\r\n if j == i - n + 1 or j == n - 1:\r\n matrix[j][i - j] = (i - n + 1) * 2\r\n else:\r\n matrix[j][i - j] = i - n + 1\r\n\r\n for i in range(3 * n // 2 - 1, n * 2 - 1):\r\n for j in range(i - n + 1, n):\r\n if j != i - j:\r\n if j == i - n + 1 or j == n - 1:\r\n matrix[j][i - j] = (i - 3 * n // 2 + 2) * 2 - 1\r\n else:\r\n matrix[j][i - j] = i - n + 1\r\n\r\n for row in matrix:\r\n print(' '.join(map(str, row)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n matrix = [[0] * n for _i in range(n)]\r\n # for i in range(n-1):\r\n # matrix[0][i] = i + 1\r\n # for i in range(1, n-1):\r\n # for j in range(n-1):\r\n # matrix[i][j] = matrix[i-1][(j+1) % (n-1)]\r\n for i in range(n-1):\r\n for j in range(n-1):\r\n matrix[i][j] = (i + j) % (n - 1) + 1\r\n for i in range(n-1):\r\n matrix[n-1][i] = matrix[i][n-1] = matrix[i][i]\r\n matrix[i][i] = 0\r\n for row in matrix:\r\n print(' '.join(map(str, row)))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n = int(input())\r\na = [n-1] + [k for k in range(1,n)] * 2\r\nfor x in range(n-1):\r\n row = a[x:x+x] + [0] + a[x+x+1:n+x-1] + [a[x+x]]\r\n print(*row)\r\nprint(n-1, *[a[k*2] for k in range(1,n-1)], 0)\r\n" ]

[ "num_nodes = int(input())\ntime_array = [0] * (num_nodes + 1)\n\nforward_edges, backward_edges = [[] for _ in range(num_nodes + 1)], [[] for _ in range(num_nodes + 1)]\n\nfor _ in range(num_nodes - 1):\n x, y = map(int, input().split())\n time_array[y] = 1\n forward_edges[x].append(y)\n backward_edges[y].append(x)\n\ntraversal_queue, leaf_count = forward_edges[1] + backward_edges[1], len(backward_edges[1])\n\nfor i in forward_edges[1]:\n time_array[i] = 1\n backward_edges[i].remove(1)\n\nfor i in backward_edges[1]:\n time_array[i] = -1\n forward_edges[i].remove(1)\n\nwhile traversal_queue:\n current_node = traversal_queue.pop()\n for i in forward_edges[current_node]:\n time_array[i] = time_array[current_node] + 1\n backward_edges[i].remove(current_node)\n for i in backward_edges[current_node]:\n time_array[i] = time_array[current_node] - 1\n forward_edges[i].remove(current_node)\n traversal_queue += forward_edges[current_node] + backward_edges[current_node]\n leaf_count += len(backward_edges[current_node])\n\nmin_time = min(time_array)\nprint(leaf_count + min_time)\nprint(' '.join(map(str, [i for i in range(1, num_nodes + 1) if time_array[i] == min_time])))\n\n\t \t\t \t \t \t\t\t\t \t\t\t \t \t\t\t\t", "\r\nn = int(input())\r\ngraph = [[] for i in range(n + 1)]\r\nfor _ in range(n - 1):\r\n c1, c2 = map(int, input().split())\r\n graph[c1].append((c2, 0))\r\n graph[c2].append((c1, 1))\r\n\r\nstack = []\r\nstack.append(1)\r\ndp = [0] * (n + 1)\r\nvisited = [0] * (n + 1)\r\nvisited[1] = 1\r\nk = 0\r\ncost = 0\r\nwhile(len(stack) ^ k):\r\n temp = stack[k]\r\n dpi = dp[temp]\r\n for edge, price in graph[temp]:\r\n if(not visited[edge]):\r\n stack.append(edge)\r\n visited[edge] = 1\r\n if(price):\r\n dp[edge] = dpi-1\r\n cost += 1\r\n else:\r\n dp[edge] = dpi+1\r\n\r\n k += 1\r\n\r\nmin_price = min(dp)\r\nprint(min_price+cost)\r\nfor i in range(1, n + 1):\r\n if dp[i] == min_price:\r\n print(i, end=\" \")\r\n", "import os, io\r\n\r\nfrom collections import deque\r\n\r\n# 选择输入流\r\nif os.access(\"./test.txt\", os.F_OK):\r\n file = io.open(\"./test.txt\")\r\nelse:\r\n file = io.open(0)\r\n\r\nn = int(file.readline())\r\n\r\ng = [[] for _ in range(n + 1)]\r\nfor _ in range(n-1):\r\n a, b = map(int, file.readline().split())\r\n g[a].append((b, 1))\r\n g[b].append((a, -1))\r\n\r\nans = [0] * (n + 1)\r\nans[0] = float('inf')\r\nq = deque([1])\r\nvis = [False] * (n + 1)\r\nvis[1] = True\r\nwhile q:\r\n x = q.popleft()\r\n for y, penalty in g[x]:\r\n if not vis[y]:\r\n vis[y] = True\r\n ans[1] += penalty\r\n q.append(y)\r\n\r\n# print(ans)\r\nans[1] = (n - 1 - ans[1]) // 2\r\n# print(ans)\r\n\r\nq = deque([1])\r\nvis = [False] * (n + 1)\r\nvis[1] = True\r\nwhile q:\r\n x = q.popleft()\r\n for y, penalty in g[x]:\r\n if not vis[y]:\r\n vis[y] = True\r\n ans[y] = ans[x] + penalty\r\n q.append(y)\r\n\r\n# print(ans)\r\nminAns = min(ans)\r\nprint(minAns)\r\nprint(*[x for x, penalty in enumerate(ans) if penalty == minAns])\r\n\r\n\r\nfile.close()", "import sys\r\nimport threading\r\ninput=sys.stdin.readline\r\nfrom collections import Counter,defaultdict,deque\r\nfrom heapq import heappush,heappop,heapify\r\nthreading.stack_size(10**8)\r\nsys.setrecursionlimit(10**8)\r\n\r\ndef main():\r\n\tn=int(input())\r\n\tg=defaultdict(list)\t\t\r\n\tfor x in range(n-1):\r\n\t\tu,v=map(int,input().split())\r\n\t\tg[u].append((v,0))\r\n\t\tg[v].append((u,1))\r\n\tglobal prec\r\n\tprec=0\r\n\tdef pre(cn,p):\r\n\t\tglobal prec\r\n\t\tfor nn,nw in g[cn]:\r\n\t\t\tif nn!=p:\r\n\t\t\t\tprec+=nw\r\n\t\t\t\tpre(nn,cn)\r\n\tpre(1,-1)\r\n\tcost=[float('inf')]*(n+1)\r\n\tcost[1]=prec\r\n\t#print(prec)\r\n\tdef re(cn,p):\r\n\t\tfor nn,orientation in g[cn]:\r\n\t\t\tif nn!=p:\r\n\t\t\t\tcost[nn]=(1 if orientation!=1 else -1)+cost[cn]\r\n\t\t\t\tre(nn,cn)\r\n\tre(1,-1)\r\n\tres=min(cost)\r\n\topt=[]\r\n\tfor idx,i in enumerate(cost):\r\n\t\tif i==res:\r\n\t\t\topt.append(idx)\r\n\tprint(res)\r\n\tprint(*opt)\r\n\r\nthreading.Thread(target=main).start() ", "import re\r\nimport functools\r\nimport random\r\nimport sys\r\nimport os\r\nimport math\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache, reduce, cmp_to_key\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush\r\nfrom io import BytesIO, IOBase\r\nfrom copy import deepcopy\r\nimport threading\r\nfrom typing import *\r\nfrom operator import add, xor, mul, ior, iand, itemgetter\r\nimport bisect\r\nBUFSIZE = 4096\r\ninf = float('inf')\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef I():\r\n return input()\r\n\r\ndef II():\r\n return int(input())\r\n\r\ndef MII():\r\n return map(int, input().split())\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\ndef solve():\r\n n = II()\r\n g = [[] for _ in range(n)]\r\n cnt = Counter()\r\n for _ in range(n-1):\r\n u, v = GMI()\r\n g[u].append(v)\r\n g[v].append(u)\r\n cnt[(u, v)] += 1\r\n q = deque([(0, -1)])\r\n res1 = 0\r\n while q:\r\n u, pa = q.popleft()\r\n for v in g[u]:\r\n if v != pa:\r\n res1 += cnt[(v, u)]\r\n q.append((v, u))\r\n res = defaultdict(list)\r\n res[res1].append(1)\r\n mn = res1\r\n q = deque([(0, -1, res1)])\r\n while q:\r\n u, pa, resu = q.popleft()\r\n for v in g[u]:\r\n if v != pa:\r\n resv = resu+cnt[(u, v)]-cnt[(v, u)]\r\n if resv<mn:\r\n mn = resv\r\n res[resv].append(v+1)\r\n q.append((v, u, resv))\r\n print(mn)\r\n print(*sorted(res[mn]))\r\n\r\nsolve()", "import sys\r\ninput = sys.stdin.readline \r\n\r\nn = int(input()) \r\nd = [[] for i in range(n + 1)] \r\n\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split()) \r\n d[u].append((v, 0)) \r\n d[v].append((u, 1)) \r\n\r\ndp = [[0, 0] for i in range(n + 1)] \r\nr = 0\r\nv = [0] * (n + 1) \r\nq = [1] \r\nv[1] = 1 \r\np = 0 \r\nwhile(p < n):\r\n x = q[p] \r\n p += 1 \r\n for i, w in d[x]:\r\n if(not v[i]):\r\n q.append(i) \r\n v[i] = 1 \r\n dp[i][0] = dp[x][0] + 1 \r\n dp[i][1] = dp[x][1] \r\n if(w):\r\n r += 1 \r\n dp[i][1] += 1\r\nmn = 10 ** 10 \r\nfor i in range(1, n + 1):\r\n mn = min(mn, r - 2 * dp[i][1] + dp[i][0]) \r\nprint(mn) \r\nl = []\r\nfor i in range(1, n + 1):\r\n if(mn == r - 2 * dp[i][1] + dp[i][0]):\r\n l.append(i) \r\nprint(*l)", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nfrom collections import deque\r\nn = int(input())\r\nnums = [[] for _ in range(n+1)]\r\nhas = set()\r\nfor _ in range(n-1):\r\n a,b = map(int,input().split())\r\n has.add((a,b))\r\n nums[a].append(b)\r\n nums[b].append(a)\r\nans = [0]*(n+1)\r\nres = deque([1])\r\nrep = [0]*(n+1)\r\nrep[1] = 1\r\nwhile res:\r\n p = res.popleft()\r\n for i in nums[p]:\r\n if rep[i]:continue\r\n rep[i] = 1\r\n if (p,i) in has:\r\n ans[1] += 1\r\n res.append(i)\r\nres = deque([1])\r\nrep = [0]*(n+1)\r\nrep[1] = 1\r\nwhile res:\r\n p = res.popleft()\r\n for i in nums[p]:\r\n if rep[i]:continue\r\n rep[i] = 1\r\n ans[i] = ans[p]\r\n if (i,p) in has:\r\n ans[i] += 1\r\n else:\r\n ans[i] -= 1\r\n res.append(i)\r\nmx = max(ans)\r\nprint(n-1-mx)\r\nfor i,x in enumerate(ans):\r\n if x == mx:\r\n print(i,end=' ')\r\n", "# Problem: D. Choosing Capital for Treeland\r\n# Contest: Codeforces - Codeforces Round 135 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/219/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 3000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"\r\nhttps://codeforces.com/problemset/problem/219/D\r\n\r\n输入 n(2≤n≤2e5) 和 n-1 条边 v w，表示一条 v->w 的有向边。（节点编号从 1 开始）\r\n保证输入构成一棵树。\r\n\r\n定义 f(x) 表示以 x 为根时，要让 x 能够到达任意点，需要反向的边的数量。\r\n输出 min(f(x))，以及所有等于 min(f(x)) 的节点编号（按升序输出）。\r\n输入\r\n3\r\n2 1\r\n2 3\r\n输出\r\n0\r\n2 \r\n\r\n输入\r\n4\r\n1 4\r\n2 4\r\n3 4\r\n输出\r\n2\r\n1 2 3 \r\n\"\"\"\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, = RI()\r\n g = [[] for _ in range(n)]\r\n s = set()\r\n for _ in range(n - 1):\r\n u, v = RI()\r\n u -= 1\r\n v -= 1\r\n g[u].append(v)\r\n g[v].append(u)\r\n s.add((u, v))\r\n f = [0] * n\r\n\r\n @bootstrap\r\n def dfs(u, fa):\r\n for v in g[u]:\r\n if v == fa: continue\r\n if (v, u) in s:\r\n f[0] += 1\r\n yield dfs(v, u)\r\n yield\r\n\r\n @bootstrap\r\n def reroot(u, fa):\r\n for v in g[u]:\r\n if v == fa: continue\r\n f[v] = f[u] - int((v, u) in s) + int((u, v) in s)\r\n yield reroot(v, u)\r\n yield\r\n\r\n dfs(0, -1)\r\n reroot(0, -1)\r\n mn = min(f)\r\n ans = [i + 1 for i, v in enumerate(f) if v == mn]\r\n print(mn)\r\n print(*ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef bfs(s):\r\n q, k = [s], 0\r\n visit = [0] * (n + 1)\r\n visit[s] = 1\r\n dp = [0] * (n + 1)\r\n u = 0\r\n while len(q) ^ k:\r\n i = q[k]\r\n dpi = dp[i]\r\n for j, c in G[i]:\r\n if not visit[j]:\r\n q.append(j)\r\n visit[j] = 1\r\n dp[j] = dpi + 1 if not c else dpi - 1\r\n u += c\r\n k += 1\r\n return u, dp\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n s, t = map(int, input().split())\r\n G[s].append((t, 0))\r\n G[t].append((s, 1))\r\nu, dp = bfs(1)\r\nmi = min(dp)\r\nm = u + mi\r\nans = []\r\nfor i in range(1, n + 1):\r\n if dp[i] == mi:\r\n ans.append(i)\r\nprint(m)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [[] for i in range(n+1)]\r\nfor i in range(n-1):\r\n a, b = map(int, input().split())\r\n d[a].append(b)\r\n d[b].append(-a)\r\nq = [(0, 1, 10**9)]\r\nx = [0]*(n+1)\r\nwhile q:\r\n a, b, c = q.pop()\r\n if a == 0:\r\n q.append((1, b, c))\r\n for i in d[abs(b)]:\r\n if abs(i) != abs(c):\r\n q.append((0, i, b))\r\n elif c != 10**9:\r\n x[abs(c)] += x[abs(b)] + (1 if b < 0 else 0)\r\nq = [(1, 10**9)]\r\nwhile q:\r\n a, b = q.pop()\r\n for i in d[abs(a)]:\r\n if abs(i) != abs(b):\r\n q.append((i, a))\r\n\r\n if b == 10**9:\r\n t = x[1]\r\n v = [1]\r\n else:\r\n x[abs(a)] = x[abs(b)] + (1 if a > 0 else -1)\r\n if x[abs(a)] < t:\r\n t = x[abs(a)]\r\n v = [abs(a)]\r\n elif x[abs(a)] == t:\r\n v.append((abs(a)))\r\nprint(t)\r\nprint(' '.join(map(str, sorted(v))))", "# 只有路径上的需要反过来\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\nfrom collections import defaultdict\r\nn = int(input())\r\ng = defaultdict(list)\r\nd = defaultdict(int)\r\nfor _ in range(n - 1):\r\n x,y = list(map(int,input().split()))\r\n g[x].append(y)\r\n g[y].append(x)\r\n d[(x, y)] += 1\r\n# 扫一遍 算总共多少是算对的\r\ntotal = 0\r\n@bootstrap\r\ndef cal_p(son, fa):\r\n global total\r\n for x in g[son]:\r\n if x != fa:\r\n total += d[(son, x)]\r\n yield cal_p(x, son)\r\n yield\r\ncal_p(1, -1)\r\n\r\nans = defaultdict(list)\r\n@bootstrap\r\ndef dfs(son, fa):\r\n global total\r\n ans[total].append(son)\r\n for x in g[son]:\r\n if x != fa:\r\n total += d[(x, son)] - d[(son, x)]\r\n yield dfs(x, son)\r\n total += d[(son, x)] - d[(x, son)]\r\n yield\r\ndfs(1, -1)\r\nk = max(ans.keys())\r\nprint(n - 1 - k)\r\nprint(*sorted(ans[k]))", "import os, io\r\nfrom collections import Counter\r\n\r\n# 防止递归爆栈，改为生成器模式\r\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n\r\n# 选择输入流\r\nif os.access(\"./test.txt\", os.F_OK):\r\n file = io.open(\"./test.txt\")\r\nelse:\r\n file = io.open(0)\r\n\r\nn = int(file.readline())\r\n\r\ng = [[] for _ in range(n + 1)]\r\nfor _ in range(n-1):\r\n a, b = map(int, file.readline().split())\r\n g[a].append((b, 1))\r\n g[b].append((a, -1))\r\n\r\ncnt = 0 # 记录当前节点为根需要反转多少条边 \r\n@bootstrap\r\ndef dfs(x: int, fa: int):\r\n global cnt\r\n for y, penalty in g[x]:\r\n if y != fa:\r\n cnt += penalty\r\n yield dfs(y, x)\r\n yield\r\ndfs(1, -1)\r\n# 需要校准cnt，设从节点1出发，正向、逆向的边数分别为a、b，\r\n# 则有：a + b = n - 1，a - b = cnt，解得b = (n - 1 - cnt) // 2\r\n# 也即cnt的初始值应该为b = (n - 1 - cnt) // 2\r\ncnt = (n - 1 - cnt) // 2\r\n\r\n# minCnt = cnt # 记录历史最低值\r\n# ans = [] # 记录答案节点\r\n\r\ncnts = [0] * (n + 1)\r\ncnts[0] = float('inf')\r\n# print(cnts)\r\n\r\n# 换根DP，沿着原边(a, b)将根节点从a换到b，需要反向的边数比根节点为a时多加一条(a, b)边，\r\n# 而从b节点换到a节点时，需要反向的边数减少一，以此在O(1)时间内更新需要换边的数目\r\n@bootstrap\r\ndef reroot(x: int, fa: int, penalty: int):\r\n # global minCnt\r\n # global ans\r\n # if penalty == minCnt:\r\n # ans.append(x)\r\n # elif penalty < minCnt:\r\n # minCnt = penalty\r\n # ans = [x]\r\n cnts[x] = penalty\r\n for y, pen in g[x]:\r\n if y != fa:\r\n yield reroot(y, x, penalty + pen)\r\n yield\r\nreroot(1, -1, cnt)\r\n\r\n# print(cnts)\r\nminCnt = min(cnts)\r\n\r\n# for x in ans:\r\n# print(x, end = ' ')\r\n# print()\r\n\r\nprint(minCnt)\r\nprint(*[i for i, c in enumerate(cnts) if c == minCnt]) \r\n\r\n\r\nfile.close()", "from collections import deque, defaultdict\nimport sys\nfrom types import GeneratorType\ninput = sys.stdin.readline\n\ndef bootstrap(f, stack=[]):\n \n def wrappedfunc(*args, **kwargs):\n if stack:\n return f(*args, **kwargs)\n else:\n to = f(*args, **kwargs)\n while True:\n if type(to) is GeneratorType:\n stack.append(to)\n to = next(to)\n else:\n stack.pop()\n if not stack:\n break\n to = stack[-1].send(to)\n return to\n return wrappedfunc\n\ndef compute_adj_list(edges):\n adj_list = defaultdict(list)\n # 0 correct direction, 1 not correct direction\n for src, dst in edges:\n adj_list[src].append((dst, 0))\n adj_list[dst].append((src, 1))\n return adj_list\n\n@bootstrap\ndef dfs(current, parent, adj_list, num_reversed_roads):\n \n for child, cost in adj_list[current]:\n if child != parent:\n yield dfs(child, current, adj_list, num_reversed_roads) \n num_reversed_roads[current] += num_reversed_roads[child] + cost\n yield None\n\ndef solution(edges, n):\n \n adj_list = compute_adj_list(edges)\n \n num_reversed_roads = [0] * n\n \n root = 0\n \n # Fill num_reversed_roads in subtree\n dfs(root, -1, adj_list, num_reversed_roads)\n\n \n visited = [False] * n\n queue = deque()\n queue.append(root)\n visited[root] = True\n \n while queue:\n parent = queue.popleft()\n for child, cost in adj_list[parent]:\n reversed_cost = 1 if cost == 0 else -1\n if not visited[child]:\n visited[child] = True\n num_reversed_roads[child] = num_reversed_roads[parent] + reversed_cost\n queue.append(child)\n \n \n min_reversed_roads = min(num_reversed_roads)\n capitals = [str(i+1) for i, num_roads in enumerate(num_reversed_roads) if num_roads == min_reversed_roads]\n print(min_reversed_roads)\n sys.stdout.write(' '.join(capitals) + '\\n')\n \n \n\nif __name__ == \"__main__\":\n n = [int(val) for val in input().split()][0]\n edges = []\n for _ in range(n-1):\n src, dst = [int(val)-1 for val in input().split()]\n edges.append([src, dst])\n solution(edges, n)\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nseen = set()\r\nP = [[] for _ in range(N)]\r\nfor _ in range(N-1):\r\n u,v = map(int, input().split())\r\n u-=1;v-=1\r\n P[u].append(v)\r\n P[v].append(u)\r\n seen.add((u,v))\r\n\r\nv = [(0,-1,0),(0,-1,1)]\r\ncnt = [0]*N\r\nwhile v:\r\n i,p,t = v.pop()\r\n if t==1:\r\n for j in P[i]:\r\n if j==p:continue\r\n v.append((j,i,0))\r\n v.append((j,i,1))\r\n else:\r\n cur = 0\r\n for j in P[i]:\r\n if j==p:continue\r\n if not (i,j) in seen:\r\n cur+=1\r\n cur+=cnt[j]\r\n cnt[i] = cur\r\n#print(cnt)\r\nlib = defaultdict(list)\r\nv = [(0,-1,cnt[0])]\r\nwhile v:\r\n i,p,d = v.pop()\r\n lib[d].append(i+1)\r\n for j in P[i]:\r\n if j==p:continue\r\n if (i,j) in seen:\r\n v.append((j,i,d+1))\r\n else:\r\n v.append((j,i,d-1))\r\n \r\nk = min(lib.keys())\r\nprint(k)\r\nlib[k].sort()\r\nprint(*lib[k])", "# Problem: D. Choosing Capital for Treeland\r\n# Contest: Codeforces - Codeforces Round 135 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/219/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 3000 ms\r\n\r\nimport sys\r\nfrom collections import *\r\nfrom types import GeneratorType\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"\r\nhttps://codeforces.com/problemset/problem/219/D\r\n\r\n输入 n(2≤n≤2e5) 和 n-1 条边 v w，表示一条 v->w 的有向边。（节点编号从 1 开始）\r\n保证输入构成一棵树。\r\n\r\n定义 f(x) 表示以 x 为根时，要让 x 能够到达任意点，需要反向的边的数量。\r\n输出 min(f(x))，以及所有等于 min(f(x)) 的节点编号（按升序输出）。\r\n输入\r\n3\r\n2 1\r\n2 3\r\n输出\r\n0\r\n2 \r\n\r\n输入\r\n4\r\n1 4\r\n2 4\r\n3 4\r\n输出\r\n2\r\n1 2 3 \r\n\"\"\"\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n\r\n# 2526 ms\r\ndef solve1():\r\n n, = RI()\r\n g = [[] for _ in range(n)]\r\n s = set()\r\n for _ in range(n - 1):\r\n u, v = RI()\r\n u -= 1\r\n v -= 1\r\n g[u].append(v)\r\n g[v].append(u)\r\n s.add((u, v))\r\n f = [0] * n\r\n\r\n @bootstrap\r\n def dfs(u, fa):\r\n for v in g[u]:\r\n if v == fa: continue\r\n if (v, u) in s:\r\n f[0] += 1\r\n yield dfs(v, u)\r\n yield\r\n\r\n @bootstrap\r\n def reroot(u, fa):\r\n for v in g[u]:\r\n if v == fa: continue\r\n f[v] = f[u] - int((v, u) in s) + int((u, v) in s)\r\n yield reroot(v, u)\r\n yield\r\n\r\n dfs(0, -1)\r\n reroot(0, -1)\r\n mn = min(f)\r\n ans = [i + 1 for i, v in enumerate(f) if v == mn]\r\n print(mn)\r\n print(*ans)\r\n\r\n\r\n# 1526 ms\r\ndef solve2():\r\n n, = RI()\r\n g = [[] for _ in range(n)]\r\n s = set()\r\n for _ in range(n - 1):\r\n u, v = RI()\r\n u -= 1\r\n v -= 1\r\n g[u].append(v)\r\n g[v].append(u)\r\n s.add((u, v))\r\n f = [0] * n\r\n fas = [-1] * n\r\n order = []\r\n q = deque([0])\r\n while q:\r\n u = q.popleft()\r\n order.append(u)\r\n for v in g[u]:\r\n if v == fas[u]: continue\r\n fas[v] = u\r\n q.append(v)\r\n\r\n for u in order[::-1]:\r\n for v in g[u]:\r\n if v == fas[u]: continue\r\n f[u] += f[v] + int((v, u) in s)\r\n for u in order:\r\n for v in g[u]:\r\n if v == fas[u]: continue\r\n f[v] = f[u] + int((u, v) in s) - int((v, u) in s)\r\n # print(f)\r\n mn = min(f)\r\n ans = [i + 1 for i, v in enumerate(f) if v == mn]\r\n print(mn)\r\n print(*ans)\r\n\r\n\r\n# 1402 ms\r\ndef solve3():\r\n n, = RI()\r\n g = [[] for _ in range(n)]\r\n for _ in range(n - 1):\r\n u, v = RI()\r\n u -= 1\r\n v -= 1\r\n g[u].append((v, 1)) # 邻居和方向\r\n g[v].append((u, -1)) # 反边\r\n f = [0] * n\r\n fas = [-1] * n\r\n order = []\r\n q = deque([0])\r\n while q:\r\n u = q.popleft()\r\n order.append(u)\r\n for v, _ in g[u]:\r\n if v == fas[u]: continue\r\n fas[v] = u\r\n q.append(v)\r\n\r\n for u in order[::-1]:\r\n for v, d in g[u]:\r\n if v == fas[u]: continue\r\n # f[u] += f[v] + (d < 0) # 如果是反边则+1\r\n f[u] += f[v] + ((-d + 1) >> 1) # 如果是反边则+1 1402\r\n for u in order:\r\n for v, d in g[u]:\r\n if v == fas[u]: continue\r\n # f[v] = f[u] + (d > 0) - (d < 0) # uv是正边的话，根从u->v则数量+1，反边则-1\r\n f[v] = f[u] + d # uv是正边的话，根从u->v则数量+1，反边则-1\r\n # print(f)\r\n mn = min(f)\r\n ans = [i + 1 for i, v in enumerate(f) if v == mn]\r\n print(mn)\r\n print(*ans)\r\n\r\n\r\n# ms\r\ndef solve():\r\n from typing import Callable, Generic, List, TypeVar\r\n\r\n T = TypeVar(\"T\")\r\n E = Callable[[int], T]\r\n \"\"\"identify element of op, and answer of leaf\"\"\"\r\n Op = Callable[[T, T], T]\r\n \"\"\"merge value of child node\"\"\"\r\n Composition = Callable[[T, int, int, int], T]\r\n \"\"\"return value from child node to parent node\"\"\"\r\n\r\n class Rerooting(Generic[T]):\r\n __slots__ = (\"g\", \"_n\", \"_decrement\", \"_root\", \"_parent\", \"_order\")\r\n\r\n def __init__(self, n: int, decrement: int = 0, edges=None):\r\n \"\"\"\r\n n: 节点个数\r\n decrement: 节点id可能需要偏移 (1-indexed则-1, 0-indexed则0)\r\n \"\"\"\r\n self.g = g = [[] for _ in range(n)]\r\n self._n = n\r\n self._decrement = decrement\r\n self._root = None # 一开始的根\r\n if edges:\r\n for u, v in edges:\r\n u -= decrement\r\n v -= decrement\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\n def add_edge(self, u: int, v: int):\r\n \"\"\"\r\n 无向树加边\r\n \"\"\"\r\n u -= self._decrement\r\n v -= self._decrement\r\n self.g[u].append(v)\r\n self.g[v].append(u)\r\n\r\n def rerooting(\r\n self, e: E[\"T\"], op: Op[\"T\"], composition: Composition[\"T\"], root=0\r\n ) -> List[\"T\"]:\r\n \"\"\"\r\n - e: 初始化每个节点的价值\r\n (root) -> res\r\n mergeの単位元\r\n 例:求最长路径 e=0\r\n\r\n - op: 两个子树答案如何组合或取舍\r\n (childRes1,childRes2) -> newRes\r\n 例:求最长路径 return max(childRes1,childRes2)\r\n\r\n - composition: 知道子子树答案和节点值，如何更新子树答案\r\n (from_res,fa,u,use_fa) -> new_res\r\n use_fa: 0表示用u更新fa的dp1,1表示用fa更新u的dp2\r\n 例:最长路径return from_res+1\r\n\r\n - root: 可能要设置初始根，默认是0\r\n <概要> 换根DP模板,用线性时间获取以每个节点为根整颗树的情况。\r\n 注意最终返回的dp[u]代表以u为根时，u的所有子树的最优情况(不包括u节点本身),因此如果要整颗子树情况，还要再额外计算。\r\n 1. 记录dp1,dp2。其中:\r\n dp1[u] 代表 以u为根的子树，它的孩子子树的最优值,即u节点本身不参与计算。注意，和我们一般定义的f[u]代表以u为根的子树2情况不同。\r\n dp2[v] 代表 除了v以外，它的兄弟子树的最优值。依然注意，v不参与，同时u也不参与(u是v的父节点)。\r\n 建议画图理解。\r\n 2. dp2[v]的含义后边将进行一次变动,变更为v的兄弟、u的父过来的路径,merge上u节点本身最后得出来的值。即v以父亲为邻居向外延伸的最优值(不含v，但含父)。\r\n 3. 同时dp1[u]的含义更新为目标的含义:以u为根，u的子节点们所在子树的最优情况。\r\n 4. 这样dp1,dp2将分别代表u的向下子树的最优,u除了向下子树以外的最优(一定从父节点来，但父节点可能从兄弟来或祖宗来)\r\n <步骤>\r\n 1. 先从任意root出发(一般是0),获取bfs层序。这里是为了方便dp，或者直接dfs树形DP其实也是可以的，但可能会爆栈。\r\n 2. 自底向上dp,用自身子树情况更新dp1,除自己外的兄弟子树情况更新dp2。\r\n 3. 自顶向下dp,变更dp2和dp1的含义。这时对于u来说存在三种子树(强烈建议画图观察):\r\n ① u本身的子树，它们的最优解已经存在于之前的dp1[u]。\r\n ② u的兄弟子树+fa,它们的最优解=composition(dp2[u],fa,u,use_fa=1)。\r\n ③ 连接到fa的最优子树+fa,最优解=composition(dp2[fa],fa,u,use_fa=1)。\r\n 注意这里的dp2含义已变更，由于我们是自顶向下计算，因此dp2[fa]已更新。\r\n ②和③可以写一起来更新dp2[u]\r\n\r\n 計算量 O(|V|) (Vは頂点数)\r\n 参照 https://qiita.com/keymoon/items/2a52f1b0fb7ef67fb89e\r\n \"\"\"\r\n # step1\r\n root -= self._decrement\r\n assert 0 <= root < self._n\r\n self._root = root\r\n g = self.g\r\n _fas = self._parent = [-1] * self._n # 记录每个节点的父节点\r\n _order = self._order = [root] # bfs记录遍历层序，便于后续dp\r\n q = deque([root])\r\n while q:\r\n u = q.popleft()\r\n for v in g[u]:\r\n if v == _fas[u]:\r\n continue\r\n _fas[v] = u\r\n _order.append(v)\r\n q.append(v)\r\n\r\n # step2\r\n dp1 = [e(i) for i in range(self._n)] # !子树部分的dp值,假设u是当前子树的根，vs是第一层儿子(它的非父邻居)，则dp1[u]=op(dp1(vs))\r\n dp2 = [e(i) for i in\r\n range(\r\n self._n)] # !非子树部分的dp值,假设u是当前子树的根，vs={v1,v2..vi..}是第一层儿子(它的非父邻居),则dp2[vi]=op(dp1(vs-vi)),即他的兄弟们\r\n\r\n for u in _order[::-1]: # 从下往上拓扑序dp\r\n res = e(u)\r\n for v in g[u]:\r\n if _fas[u] == v:\r\n continue\r\n dp2[v] = res\r\n res = op(res, composition(dp1[v], u, v, 0)) # op从下往上更新dp1\r\n # 由于最大可能在后边，因此还得倒序来一遍\r\n res = e(u)\r\n for v in g[u][::-1]:\r\n if _fas[u] == v:\r\n continue\r\n dp2[v] = op(res, dp2[v])\r\n res = op(res, composition(dp1[v], u, v, 0))\r\n dp1[u] = res\r\n\r\n # step3 自顶向下计算每个节点作为根时的dp1，dp2的含义变更为:dp2[u]为u的兄弟+父。这样对v来说dp1[u] = op(dp1[fa],dp1[u])\r\n\r\n for u in _order[1:]:\r\n fa = _fas[u]\r\n dp2[u] = composition(\r\n op(dp2[u], dp2[fa]), fa, u, 1\r\n ) # op从上往下更新dp2\r\n dp1[u] = op(dp1[u], dp2[u])\r\n\r\n return dp1\r\n\r\n n, = RI()\r\n r = Rerooting(n)\r\n s = set()\r\n for _ in range(n - 1):\r\n u, v = RI()\r\n u -= 1\r\n v -= 1\r\n s.add((u, v))\r\n r.add_edge(u, v)\r\n\r\n def e(root: int) -> int:\r\n # 转移时单个点不管相邻子树的贡献\r\n # 例:最も遠い点までの距離を求める場合 e=0\r\n return 0\r\n\r\n def op(child_res1: int, child_res2: int) -> int:\r\n # 如何组合/取舍两个子树的答案\r\n # 例：求最长路径 return max(childRes1,childRes2)\r\n return child_res1 + child_res2\r\n\r\n def composition(from_res: int, fa: int, u: int, use_fa: int = 0) -> int:\r\n # 知道子树的每个子树和节点值，如何更新子树答案;\r\n # 例子:求最长路径 return from_res+1\r\n if use_fa == 0: # cur -> parent\r\n return from_res + int((u, fa) in s)\r\n return from_res + int((fa, u) in s)\r\n\r\n f = r.rerooting(e, op, composition)\r\n\r\n # print(f)\r\n mn = min(f)\r\n ans = [i + 1 for i, v in enumerate(f) if v == mn]\r\n print(mn)\r\n print(*ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n" ]

[ "s=input().strip()\r\nn=len(s)\r\n\r\ni=0\r\nk=0\r\nwhile i<n:\r\n\tj=i;\r\n\ti+=1\r\n\twhile i<n and s[i]=='0':\r\n\t\ti+=1;\r\n\tif j>(i-j) or (j==i-j and s[:j]>=s[j:i]):\r\n\t\tk+=1\r\n\telse:\r\n\t\tk=1\r\nprint(k)", "a = input()\ni = 0; ans = 1\nwhile i < len(a):\n i += 1\n c = i-1\n while i < len(a) and a[i] == '0':\n i += 1\n if (c > i-c) or (c == i-c and a[:c] >= a[c:i]):\n ans += 1\n else:\n ans = 1\nprint(ans)\n", "s=input().strip()\r\nn=len(s)\r\ni=0\r\nk=1\r\nj=0\r\nwhile i<n:\r\n #print(i,j)\r\n j=i\r\n i+=1\r\n while i<n and s[i]=='0':\r\n i+=1\r\n if j>i-j:\r\n k+=1\r\n elif j==i-j:\r\n if s[:j]>=s[j:i]:\r\n k+=1\r\n else:\r\n k=1\r\n else:\r\n k=1\r\nprint(k)", "def compare(a,b):\r\n fl = True\r\n\r\n if len(a) > len(b):\r\n return True\r\n elif len(a) < len(b):\r\n return False\r\n elif len(a) == len(b):\r\n fl = None\r\n for i in range(len(a)):\r\n if int(b[i]) > int(a[i]) and fl == None:\r\n fl = False\r\n break\r\n elif int(a[i]) > int(b[i]) and fl == None:\r\n fl = True\r\n break\r\n \r\n if fl == None:\r\n fl = True\r\n \r\n return fl\r\n\r\nn = input()\r\n\r\nl = []\r\na = \"\"\r\ni = 0\r\n\r\nwhile i < len(n):\r\n a += n[i]\r\n\r\n fl = False\r\n \r\n while i < len(n) and n[i] == '0':\r\n l[-1] += '0'\r\n i += 1\r\n fl = True\r\n\r\n if fl:\r\n a = \"\"\r\n continue\r\n\r\n l.append(a)\r\n\r\n i += 1\r\n a = \"\"\r\n\r\ns = 1\r\nfor i in (range(1,len(l))):\r\n if compare(l[i-1],l[i]):\r\n s = s + 1\r\n else:\r\n s = 1\r\n \r\n l[i] = l[i-1] + l[i]\r\n l[i-1] = ''\r\n\r\nprint(s)\r\n", "s = input().strip()\r\nn = len(s)\r\ni = j = k = 0\r\nwhile i < n:\r\n j = i\r\n i += 1\r\n while i < n and s[i] == '0': i += 1\r\n if j > i - j: k += 1\r\n elif j == i - j:\r\n if s[: j] >= s[j: i]: k += 1\r\n else: k = 0\r\n else: k = 0\r\nprint(k + 1)", "def cmp(x, y):\r\n for i in range(min(len(x), len(y))):\r\n if x[i] < y[i]:\r\n return True\r\n return len(x) < len(y)\r\n\r\ns = input()\r\nr, c = len(s), 1\r\nfor i in range(len(s)-1, 0, -1):\r\n if s[i] != '0':\r\n if i > r-i:\r\n c += 1\r\n r = i\r\n elif i == r-i:\r\n if not cmp(s[:i], s[i:r]):\r\n c += 1\r\n r = i\r\n else:\r\n break\r\nprint(c)\r\n", "s = input()\r\n\r\nr = len(s)\r\nc = 1\r\nfor i in range(len(s)-1, 0, -1):\r\n if s[i] != '0':\r\n if i > r-i:\r\n c += 1\r\n r = i\r\n elif i == r-i:\r\n if s[:i] >= s[i:r]:\r\n c += 1\r\n r = i\r\n else:\r\n break\r\n\r\nprint(c)\r\n", "x=input()\r\ni=j=len(x)-1\r\ncount=0\r\nwhile i>0 and j>0:\r\n if x[j]=='0':\r\n j-=1\r\n elif i-j+1<j or (i-j+1==j and x[j:i+1]<=x[:j]):\r\n count+=1\r\n j-=1\r\n i=j\r\n else:\r\n break\r\nprint(count+1)\r\n", "import sys\nfrom math import *\nfrom collections import *\nreadints=lambda:map(int, input().strip('\\n').split())\n\ns = input()\nn = len(s)\n\narr = deque()\n\ni=n-1\nwhile i>=0:\n j=i\n while j>=0 and s[j]=='0': j-=1\n arr.appendleft(((j,i), 1))\n i=j-1\n\n#print(arr)\n\ndef gte(x,y):\n \n if x[1]-x[0]>y[1]-y[0]: return True\n if x[1]-x[0]<y[1]-y[0]: return False\n n = x[1]-x[0]+1\n for i in range(n):\n if s[i+x[0]]>s[i+y[0]]: return True\n if s[i+x[0]]<s[i+y[0]]: return False\n \n return True\n\nwhile len(arr) > 1:\n\n x = arr.popleft()\n y = arr.popleft()\n if gte(x[0],y[0]):\n arr.appendleft(((x[0][0],y[0][1]),x[1]+y[1]))\n else:\n arr.appendleft(((x[0][0],y[0][1]),1))\n #print(arr)\n\nprint(arr[0][1])\n \n", "p = input().strip()\r\n\r\nn = len(p)\r\nj = n - 1\r\nans = 0\r\n\r\nwhile(j >= 0):\r\n k = j\r\n while p[k] == '0':\r\n k -= 1\r\n \r\n ln = j - k + 1\r\n\r\n if ln > k:\r\n ans += 1\r\n j = -1\r\n\r\n elif ln == k:\r\n if (p[0] >= p[k]):\r\n j = k - 1\r\n else:\r\n j = -1\r\n ans += 1\r\n\r\n else:\r\n ans += 1\r\n j = k - 1\r\n\r\nprint(ans)\r\n" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter\r\n\r\nS = input()\r\nN = len(S)\r\nP = input()\r\nM = len(P)\r\nC = Counter(P)\r\n\r\nlib = [[0]*26 for _ in range(N+1)]\r\nfor i in range(N):\r\n a = S[i]\r\n for j in range(26):\r\n lib[i+1][j] = lib[i][j]\r\n if a!='?':\r\n idx = ord(a)-ord('a')\r\n lib[i+1][idx]+=1\r\n \r\nans = 0\r\nfor i in range(0,N-M+1):\r\n find = 1\r\n for j in range(26):\r\n t = lib[i+M][j]-lib[i][j]\r\n #print(chr(ord('a')+j), t)\r\n if t and t>C[chr(ord('a')+j)]:\r\n find = 0\r\n break\r\n #print(S[i:i+M],find)\r\n ans += find\r\n \r\nprint(ans)\r\n ", "from collections import defaultdict as dt\r\nimport sys\r\ninput = sys.stdin.readline\r\ns = input().strip()\r\nt = input().strip()\r\ndc1, dc2 = dt(int), dt(int)\r\nfor elem in t :\r\n dc2[elem] += 1\r\ni, j, ext, ans = 0, 0, 0, 0\r\nwhile i < len(s) :\r\n while i<len(s) and i-j < len(t) :\r\n if s[i] == '?' :\r\n ext += 1\r\n else :\r\n dc1[s[i]] += 1\r\n i += 1\r\n if i-j == len(t) :\r\n cost = 0\r\n for alpha in \"abcdefghijklmnopqrstuvwxyz\" :\r\n cost += abs(dc1[alpha] - dc2[alpha])\r\n if cost == ext :\r\n ans += 1\r\n if s[j] == '?' :\r\n ext -= 1\r\n else :\r\n dc1[s[j]] -= 1\r\n j += 1\r\nprint(ans)", "from collections import Counter\r\n\r\ns = input()\r\n\r\np = input()\r\n\r\nn = len(s)\r\nk = len(p)\r\n\r\nif n < k:\r\n print(0)\r\n exit(0)\r\n\r\nctr = Counter()\r\npctr = Counter(p)\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n ctr[s[i]] += 1\r\n if i >= k:\r\n ctr[s[i - k]] -= 1\r\n if i >= k - 1:\r\n extra = 0\r\n pos = True\r\n for cc in range(26):\r\n c = chr(ord('a') + cc)\r\n if pctr[c] >= ctr[c]:\r\n extra += pctr[c] - ctr[c]\r\n else:\r\n pos = False\r\n break\r\n if pos and extra == ctr['?']:\r\n res += 1\r\n\r\nprint(res)" ]

[ "import sys\n\nsys.setrecursionlimit(2 * 10 ** 6)\n\n\ndef test():\n # print(solve([1, 4, 5], [0, 1, 5, 10]))\n pass\n\n\ndef main():\n ops = []\n n = int(input())\n for _ in range(n):\n t = input()\n if t == '2':\n ops.append([2, 0])\n else:\n ops.append(list(map(int, t.split())))\n da = []\n arr = []\n acc = [0]\n k = 0\n\n def f(i):\n return arr[-1] - (acc[i] + arr[-1]) / (i + 1)\n\n for a, b in ops:\n if a == 2:\n while k < len(arr) - 1 and f(k) < f(k + 1):\n k += 1\n print('{:.8f}'.format(f(k)))\n else:\n arr.append(b)\n acc.append(arr[-1] + acc[-1])\n if not da or da[-1] != b:\n da.append(b)\n\n\ndef init():\n import sys\n import os\n if 'DOCKER_HOST' in os.environ:\n test()\n sys.stdin = open('test.txt')\n\n\nif __name__ == '__main__':\n init()\n main()\n", "Q = int(input())\r\nvalues = []\r\nindex = 0\r\ncumulative_sum = 0\r\nresult = 0\r\n\r\nfor _ in range(Q):\r\n command = input().rstrip().split()\r\n if command[0] == \"1\":\r\n x = int(command[1])\r\n values.append(x)\r\n while index != len(values) - 1:\r\n if (cumulative_sum + x + values[index]) * (index + 1) < (cumulative_sum + x) * (index + 2):\r\n cumulative_sum += values[index]\r\n index += 1\r\n else:\r\n break\r\n result = max(result, values[-1] - (cumulative_sum + x) / (index + 1))\r\n else:\r\n print(result)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nQ=int(input())\r\ns=[]\r\nidx=0\r\ncum_s=0\r\nans=0\r\nfor _ in range(Q):\r\n p=input().rstrip().split()\r\n if p[0]==\"1\":\r\n x=int(p[1])\r\n s.append(x)\r\n while idx!=len(s)-1:\r\n if (cum_s+x+s[idx])*(idx+1)<(cum_s+x)*(idx+2):\r\n cum_s+=s[idx]\r\n idx+=1\r\n else:\r\n break\r\n ans=max(ans,s[-1]-(cum_s+x)/(idx+1))\r\n else:\r\n print(ans)", "import sys,os,io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nq = int(input())\r\ns = []\r\nl = 0\r\nsl = 0\r\nfor _ in range (q):\r\n a = [int(i) for i in input().split()]\r\n if len(a)==2:\r\n s.append(a[1])\r\n res = (sl + s[-1])/(l+1)\r\n while(l<len(s) and (sl+s[l]+s[-1])/(l+2)< res):\r\n sl += s[l]\r\n l+=1\r\n res = (sl + s[-1])/(l+1)\r\n if len(a)==1:\r\n print(\"{0:.8f}\". format(s[-1]-res))", "import sys\r\n\r\nfrom math import inf\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().strip().split()\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n\r\nclass TriPartSearch:\r\n # 三分查找\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def find_ceil_point_int(fun, left, right, error=1):\r\n # 求解上凸函数函数取得最大值时的点\r\n while left < right - error:\r\n diff = (right - left) // 3\r\n mid1 = left + diff\r\n mid2 = left + 2 * diff\r\n dist1 = fun(mid1)\r\n dist2 = fun(mid2)\r\n if dist1 > dist2:\r\n right = mid2\r\n elif dist1 < dist2:\r\n left = mid1\r\n else:\r\n left = mid1\r\n right = mid2\r\n return left\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n nums = []\r\n pre = [0]\r\n\r\n def check(xx):\r\n return nums[-1] - (pre[xx] + nums[-1]) / (xx + 1)\r\n\r\n for _ in range(ac.read_int()):\r\n lst = ac.read_list_ints()\r\n if len(lst) == 2:\r\n nums.append(lst[1])\r\n pre.append(pre[-1] + nums[-1])\r\n else:\r\n n = len(nums)\r\n x = TriPartSearch().find_ceil_point_int(check, 0, n - 1)\r\n ans = -inf\r\n for y in [x - 1, x, x + 1, x + 2]:\r\n if 0 <= y <= n - 1:\r\n ans = ac.max(ans, check(y))\r\n ac.st(ans)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "def main():\r\n n = int(input())\r\n values = []\r\n previous_value, index = 0, 0\r\n \r\n for _ in range(n):\r\n command = list(map(int, input().split(\" \")))\r\n \r\n if command[0] == 1:\r\n values.append(command[1])\r\n else:\r\n sum_val = values[-1] + previous_value\r\n \r\n while values[index] < (sum_val / (index + 1)):\r\n sum_val += values[index]\r\n previous_value += values[index]\r\n index += 1\r\n \r\n print(values[-1] - sum_val / (index + 1))\r\n\r\nmain()\r\n", "import heapq\r\nimport sys\r\nfrom types import GeneratorType\r\nfrom collections import defaultdict, Counter\r\nimport math\r\n\r\ninf = float(\"inf\")\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n\r\ndef find_ceil_point(fun, left, right, error=1):\r\n # 求解上凸函数函数取得最大值时的点\r\n while left < right - error:\r\n diff = (right - left) // 3\r\n mid1 = left + diff\r\n mid2 = left + 2 * diff\r\n dist1 = fun(mid1)\r\n dist2 = fun(mid2)\r\n if dist1 > dist2:\r\n right = mid2\r\n elif dist1 < dist2:\r\n left = mid1\r\n else:\r\n left = mid1\r\n right = mid2\r\n return left\r\n\r\n\r\ndef main(ac=FastIO()):\r\n nums = []\r\n pre = [0]\r\n\r\n def check(x):\r\n return nums[-1] - (pre[x] + nums[-1])/(x+1)\r\n\r\n for _ in range(ac.read_int()):\r\n lst = ac.read_list_ints()\r\n if len(lst) == 2:\r\n nums.append(lst[1])\r\n pre.append(pre[-1]+nums[-1])\r\n else:\r\n n = len(nums)\r\n x = find_ceil_point(check, 0, n-1)\r\n ans = -inf\r\n for y in [x-1, x, x+1, x+2]:\r\n if 0<=y<=n-1:\r\n ans = ac.max(ans, check(y))\r\n ac.st(ans)\r\n return\r\n\r\n\r\nmain()\r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef f(i, A, my_max):\r\n return ((i-1)*my_max/i-A[i-1])\r\n\r\ndef process(Q):\r\n A = [0]\r\n my_max = None\r\n q = len(Q)\r\n for i in range(q):\r\n row = Q[i]\r\n if row[0]==1:\r\n x = A[-1]\r\n l = len(A)\r\n A.append((x*l+row[1])/(l+1))\r\n my_max = row[1]\r\n else:\r\n s = 2\r\n e = len(A)\r\n entry = max(f(s, A, my_max), f(e, A, my_max))\r\n while s+1 < e:\r\n m = (s+e)//2\r\n m1 = m-1\r\n m2 = m+1\r\n v = f(m, A, my_max)\r\n v1 = f(m1, A, my_max)\r\n v2 = f(m2, A, my_max)\r\n entry = max(entry, v1, v2, v)\r\n if v1 <= v >= v2:\r\n entry = max(entry, v)\r\n break\r\n elif v1 <= v <= v2:\r\n s, e = m+1, e\r\n else:\r\n s, e = s, m-1\r\n print(entry)\r\n\r\nq = int(input())\r\nQ = []\r\nfor i in range(q):\r\n row = [int(x) for x in input().split()]\r\n Q.append(row)\r\nprocess(Q)" ]

[ "n, L = [ int (x) for x in input().split()]\r\nt = [int (x) for x in input().split()]\r\nd = [int (x) for x in input().split()]\r\np = \"\"\r\nq = \"\"\r\nfor x in range(n-1):\r\n p += str(t[x+1]-t[x])\r\np += str(t[0] + L - t[n-1])\r\nfor x in range(n-1):\r\n q += str(d[x+1]-d[x])\r\nq += str(d[0]+L-d[n-1])\r\na = p+p\r\nif q in a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, l = [int(x) for x in input().split(' ')]\r\nk = [int(x) for x in input().split(' ')]\r\ns = [int(x) for x in input().split(' ')]\r\n\r\nkd = [(k[i%n] - k[i-1])%l for i in range(1, n+1)]\r\nsd = [(s[i%n] - s[i-1])%l for i in range(1, n+1)]\r\n\r\nans = False\r\nfor i in range(n):\r\n if kd == sd[i:] + sd[:i]:\r\n ans = True\r\n break\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')", "def Main():\r\n result = False\r\n \r\n l1 = list(map(int,input().split()))\r\n obstacles = l1[0]\r\n A = list(map(int,input().split()))\r\n B = list(map(int,input().split()))\r\n #first reduce the graph\r\n for i in reversed(range(0, obstacles)):\r\n A[i] = A[i] - A[0]\r\n for i in reversed(range(0, obstacles)):\r\n B[i] = B[i] - B[0]\r\n strA = \"\".join(str(x) for x in A)\r\n strB = \"\".join(str(x) for x in B)\r\n #print(\"strA: \" +strA)\r\n #print(\"strB: \" + strB)\r\n newStrB = strB + strB\r\n if strA in newStrB:\r\n result = True\r\n else:\r\n for i in range(1, obstacles):\r\n diff = B[i] - B[i-1]\r\n for j in range(0, obstacles):\r\n A[j] = (A[j] + diff) % l1[1]\r\n strA = \"\".join(str(x) for x in A)\r\n if strA in newStrB:\r\n result = True\r\n break\r\n \r\n if result == True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n\r\nif __name__ == \"__main__\":\r\n Main();", "n = input().split()\r\n[n, l] = list(map(int, n))\r\n\r\nl1 = input().split()\r\nl1 = list(map(int, l1))\r\n\r\nl2 = input().split()\r\nl2 = list(map(int, l2))\r\n\r\n\r\ndef generator(l, f):\r\n for i in range(len(l)-1):\r\n l[i] = l[i+1]-l[i]\r\n f -= l[i]\r\n l[-1] = f\r\n return l;\r\n\r\nl1 = generator(l1, l)\r\nl2 = generator(l2, l)\r\nb = True\r\nfor i in range(n):\r\n temp = l2[0]\r\n for j in range(n-1):\r\n l2[j] = l2[j+1]\r\n l2[n-1] = temp\r\n if l1 == l2 :\r\n print(\"YES\")\r\n b = False\r\n break\r\nif b :\r\n print(\"NO\")", "n,l = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = []\r\nd=[]\r\nc+=[l-a[-1]+a[0]]\r\nd+=[l-b[-1]+b[0]]\r\nfor i in range(1,len(a)):\r\n c+=[a[i]-a[i-1]]\r\nfor i in range(1,len(b)):\r\n d+=[b[i]-b[i-1]]\r\nflag = 0\r\nfor i in range(n):\r\n d=d[1:]+d[0:1]\r\n if(str(c)==str(d)):\r\n flag = 1\r\nif(flag):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n, L = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nfor b in range(L):\n C = []\n for x in A:\n C.append((x - b) % L)\n if sorted(C) == B:\n print('YES')\n exit(0)\nprint('NO')", "def shift(seq, n):\n return seq[n:]+seq[:n]\nn,l = [int(x) for x in input().split(\" \")];\ntemp = 0;\ntemp = [int(x) for x in input().split(\" \")];\nprev = temp[0];\na = [];\nfor i in temp[1:]:\n a.append(i-prev);\n prev = i;\na.append((l - temp[n-1]) + temp[0]);\nb = [];\ntemp = [int(x) for x in input().split(\" \")];\nprev = temp[0];\nfor i in temp[1:]:\n b.append(i-prev);\n prev = i;\nb.append((l - temp[n-1]) + temp[0]);\nflag = 0;\nfor i in range(n):\n if a == b:\n print(\"YES\");\n flag = 1;\n break;\n a = shift(a,1);\nif flag == 0:\n print(\"NO\");\n", "n, l = list(map(int, input().split()))\r\n\r\ns1 = list(map(int, input().split()))\r\ns2 = list(map(int, input().split()))\r\n\r\nflag = 0\r\nfor i in range(0, l):\r\n\ts3 = []\r\n\tfor j in range(0, n):\r\n\t\ts3.append((s2[j] + i) % l)\r\n\ts3 = sorted(s3)\r\n\tif s1 == s3:\r\n\t\tflag = 1\r\n\t\tbreak\r\n\r\nif flag == 1:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\r\n\r\n", "b , l = map(int,input().split())\r\nk = list(map(int,input().split()))\r\ns = list(map(int,input().split()))\r\nc = 0\r\ni = -1\r\nwhile s != k and c == 0:\r\n i = i + 1\r\n for j in range(len(s)):\r\n s[j] = s[j] - 1\r\n if s[j] < 0 :\r\n s[j] = l - 1\r\n s.sort()\r\n if i == l:\r\n c = 1\r\nif s != k and c == 1:\r\n print('NO')\r\nif s == k and c == 0:\r\n print('YES')\r\n \r\n", "def reverse(i, j, A):\r\n\twhile i < j:\r\n\t\tA[i], A[j] = A[j], A[i]\r\n\t\ti += 1\r\n\t\tj -= 1\r\n\r\nN, L = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nsame = False\r\ntrack = []\r\n\r\nfor l in range(L):\r\n\tfor n in range(N):\r\n\t\tA[n] = (A[n] + 1)%L\r\n\tp = N - 1\r\n\tfor n in range(N - 1):\r\n\t\tif A[n] > A[n + 1]:\r\n\t\t\tp = n\r\n\treverse(0, p, A)\r\n\treverse(0, N - 1, A)\r\n\r\n\tif A == B:\r\n\t\tsame = True\r\n\r\n\r\nif same:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def Main():\r\n n, l = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n B = list(map(int, input().split()))\r\n L = []\r\n ans = False\r\n cnt = 0\r\n for i in range(l):\r\n # L.append((A[i] - B[i]))\r\n c = sorted(list(map(lambda x: (x + i)%l , B)))\r\n # print(c)\r\n if c == A:\r\n ans = True\r\n cnt += 1\r\n if ans:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n # print(L)\r\n # print(cnt)\r\n # print([ans])\r\n # print( ('NO', 'YES')[ans] )\r\n\r\n # if len(set(L)) == 1:\r\n # print(\"YES\")\r\n # else:\r\n # print(\"NO\")\r\n'''\r\n3 8\r\n2 4 6\r\n1 5 7\r\n'''\r\n\r\nif __name__ == '__main__':\r\n Main()", "[n,l]=[int(i) for i in str(input()).split(' ')]\r\n\r\nr1=[int(i) for i in str(input()).split(' ')]\r\nr2=[int(i) for i in str(input()).split(' ')]\r\n\r\nfor k in range(l):\r\n tmp=[(k+i)%l for i in r1]\r\n if all(i in r2 for i in tmp):\r\n tmp=False\r\n break;\r\nif tmp==False:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#n = int(input())\r\nn, m = map(int, input().split())\r\n#s = input()\r\nc = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\na = []\r\nb = []\r\n\r\nfor i in range(n - 1):\r\n a.append(c[i + 1] - c[i])\r\n b.append(d[i + 1] - d[i])\r\na.append(m - c[-1] + c[0])\r\nb.append(m - d[-1] + d[0])\r\nfor i in range(n):\r\n if a == b:\r\n print('YES')\r\n break\r\n else:\r\n b.append(b.pop(0))\r\nelse:\r\n print('NO')", "n, L = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nfor i in range(len(b)):\r\n c = b[i:] + b[:i]\r\n \r\n d = map(lambda x, y: abs(x - y), a, c)\r\n s = set(d)\r\n \r\n if len(s) == 2 and sum(s) == L or len(s) == 1:\r\n print(\"YES\")\r\n exit(0)\r\n\r\nprint(\"NO\")\r\n", "a, n = map(int, input().split())\r\nx =list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\ndist1 = []\r\ndist2 = []\r\nfor i in range(1, a):\r\n dist1.append(x[i] - x[i - 1])\r\n dist2.append(y[i] - y[i - 1])\r\n\r\ndist1.append(n - sum(dist1))\r\ndist2.append(n - sum(dist2))\r\nfor start in range(len(dist1)):\r\n bool = True\r\n for i in range(start,len(dist1)):\r\n if(dist1[i] != dist2[i - start]):\r\n bool = False\r\n dist1.append(dist1[start])\r\n if bool:\r\n break\r\nif bool:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,l=map(int,input().split())\r\nx=[int(q) for q in input().split()]\r\ny=[int(w) for w in input().split()]\r\na=0\r\nfor i in range(l):\r\n r=[]\r\n for j in range(len(x)):\r\n r.append((i+x[j])%l)\r\n if sorted(r)==y:\r\n a+=1\r\nif a==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\r\nn,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nc=[]\r\nd=[]\r\nc.append( l - a[n-1] + a[0] )\r\nd.append( l - b[n-1] + b[0] )\r\n\r\nfor i in range(1,n):\r\n c.append(a[i]-a[i-1])\r\nfor j in range(1,n):\r\n d.append(b[j]-b[j-1])\r\ncnt=0\r\np=0\r\ndef match():\r\n count=0\r\n for i in range(n):\r\n if(c[i]== d[i]):\r\n count += 1\r\n if(count<n):\r\n p=0\r\n else:\r\n p=1\r\n return (p)\r\ndef rotate():\r\n temp=d[n-1]\r\n for j in range(n-1,0,-1):\r\n d[j]=d[j-1]\r\n d[0]=temp\r\n\r\n return (d)\r\nr=0\r\nm=2\r\nwhile(r < n):\r\n r += 1\r\n m=match()\r\n if(m == 0):\r\n rotate()\r\n else:\r\n break\r\n\r\nif(m==0):\r\n print (\"No \")\r\nelif(m==1):\r\n print (\"Yes\")\r\n", "def list_from_input():\n return list(map(int, input().split()))\n\n\n# simulateonus run\n# Sasha tries to follow kefa and match their times\ndef solve(kefa, sasha, n, l):\n\n sasha_distance = 0\n while sasha_distance < l:\n # Sasha tries to follow kefa\n for i in range(n):\n sasha[i] -= 1\n\n if sasha[0] == -1: # move barrier to end\n del sasha[0]\n sasha.append(l - 1)\n\n # match kefa position by sasha position\n if sasha == kefa:\n return True\n\n sasha_distance += 1\n return False\n\ndef main():\n n, l = list_from_input()\n kefa = list_from_input()\n sasha = list_from_input()\n\n if solve(kefa, sasha, n, l):\n print(\"YES\")\n else:\n print(\"NO\")\n\ndef test():\n print(solve([2, 5, 6, 7, 8], [1, 2, 3, 4, 8], 5, 10))\n\n#test()\n\nmain()", "import sys\r\n\r\ndef debug(x, table):\r\n for name, val in table.items():\r\n if x is val:\r\n print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)\r\n return None\r\n\r\ndef solve():\r\n n, L = map(int, input().split())\r\n A = [int(i) for i in input().split()]\r\n B = [int(i) for i in input().split()]\r\n\r\n for i in range(L):\r\n B = [(b + 1) % L for b in B]\r\n if B[-1] == 0:\r\n B = [B[-1]] + B[:-1]\r\n if A == B:\r\n print('YES')\r\n return None\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nk1=[]\r\nk2=[]\r\nfor i in range(n-1) :\r\n k1.append(l[i+1]-l[i])\r\n k2.append(l1[i+1]-l1[i])\r\nk1.append(m-l[n-1]+l[0])\r\nk2.append(m-l1[n-1]+l1[0])\r\ng=[1,2,3,4]\r\nfor i in range(n) :\r\n p=k1[(i+1):n]+k1[:(i+1)]\r\n if p==k2 :\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n \r\n", "n, L = tuple([int(x) for x in input().split()])\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nfor i in range(L):\n\tif a == b:\n\t\tprint(\"YES\")\n\t\tbreak\n\tif b[n - 1] + 1 >= L:\n\t\tb = [0] + [x + 1 for x in b[0:-1]]\n\telse:\n\t\tb = [x + 1 for x in b[:]]\nelse:\n\tprint(\"NO\")\n", "n, l = map(int, input().split())\r\ntmp = list(map(int, input().split()))\r\nansw = \"NO\"\r\none = [0,]\r\none.extend(tmp)\r\none.append(l)\r\n\r\ntmp2 = list(map(int, input().split()))\r\ntwo = [0,]\r\ntwo.extend(tmp2)\r\ntwo.append(l)\r\n\r\nkek = []\r\nkek2 = []\r\n\r\nfor i in range(n + 1):\r\n\ttmp = one[i+1] - one[i]\r\n\tkek.append(tmp)\r\nfor i in range(n + 1):\r\n\ttmp = two[i+1] - two[i]\r\n\tkek2.append(tmp)\r\n\t\r\nkek[0] += kek.pop()\r\nkek2[0] += kek2.pop()\r\n\r\nfor i in range(n):\r\n\tif kek == kek2:\r\n\t\tansw = \"YES\"\r\n\t\tbreak\r\n\telse:\r\n\t\tkek2.append(kek2.pop(0))\r\nprint(answ)\r\n", "n, L = [int(item) for item in input().split()]\r\nk = [int(item) for item in input().split()]\r\ns = [int(item) for item in input().split()]\r\n \r\n\r\nk0 = []\r\nfor i in range(n - 1):\r\n k0.append(k[i + 1] - k[i])\r\nk0.append(L - sum(k0))\r\n\r\ns0 = []\r\nfor i in range(n - 1):\r\n s0.append(s[i + 1] - s[i])\r\ns0.append(L - sum(s0))\r\n\r\n\r\nfor i in range(n):\r\n if s0[i:] + s0[:i] == k0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "# 761B\r\n# O(n^2) time\r\n# θ(n) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef find_dist(n, l):\r\n a = read(3)\r\n d = [0] * n\r\n for i in range(n - 1):\r\n d[i] = a[i + 1] - a[i]\r\n d[n - 1] = l - a[n - 1] + a[0]\r\n return d\r\n\r\ndef main():\r\n n, l = read(3)\r\n x = find_dist(n, l)\r\n y = find_dist(n, l)\r\n for i in range(n):\r\n if y[i] == x[0]:\r\n for j in range(1, n - i):\r\n if y[i + j] != x[j]:\r\n break\r\n else:\r\n for j in range(i):\r\n if y[j] != x[n - i + j]:\r\n break\r\n else:\r\n return 1\r\n return 0\r\n\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s='\\n'):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s)\r\n\r\n\r\nwrite(['NO', 'YES'][main()])", "import sys\r\n\r\na = input().split()\r\nn=int(a[0])\r\nL=int(a[1])\r\nkefa=input().split()\r\nsasha=input().split()\r\nkefa[0]=int(kefa[0])\r\nsasha[0]=int(sasha[0])\r\ns=sasha\r\nk=kefa\r\ns1 = s[0]\r\nk1 = k[0]\r\nfor i in range (1,n):\r\n kefa[i]=int(kefa[i])\r\n sasha[i]=int(sasha[i])\r\n k[i-1]=kefa[i]-kefa[i-1]\r\n s[i-1]=sasha[i]-sasha[i-1]\r\nk[n-1]=L-kefa[n-1]+k1\r\ns[n-1]=L-sasha[n-1]+s1\r\n\r\nfor i in range (1,n):\r\n if k==s:\r\n print('YES')\r\n sys.exit()\r\n else:\r\n ch=s[0]\r\n s.pop(0)\r\n s.append(ch)\r\nprint('YES') if k==s else print('NO')\r\n", "nl = list(map(int, input().split()))\r\nn = nl[0]\r\nl = nl[1]\r\n\r\na = list(map(int, input().split()))\r\ndist1 = [0 for i in range(0, len(a))]\r\ndist1[0] = l - a[len(a) - 1] + a[0]\r\nfor i in range(1, n):\r\n dist1[i] = a[i] - a[i - 1]\r\n\r\na = list(map(int, input().split()))\r\ndist2 = [0 for i in range(0, len(a))]\r\ndist2[0] = l - a[len(a) - 1] + a[0]\r\nfor i in range(1, n):\r\n dist2[i] = a[i] - a[i - 1]\r\n\r\nres = 'NO'\r\nif dist1 == dist2 and sum(dist1) == l:\r\n res = 'YES'\r\nelse:\r\n for j in range(1, n):\r\n k = dist1[len(dist1) - 1]\r\n for i in range(1, n + 1):\r\n dist1[n - i] = dist1[n - i - 1]\r\n dist1[0] = k\r\n if dist1 == dist2 and sum(dist1) == l:\r\n res = 'YES'\r\n\r\n\r\nprint(res)\r\n ", "arr=list(map(int, input().rstrip().split()))\r\nbrr=list(map(int, input().rstrip().split()))\r\ncrr=list(map(int, input().rstrip().split()))\r\nn=arr[0]\r\nl=arr[1]\r\ndb=[]\r\ndc=[]\r\nfor i in range(1,n):\r\n db.append(brr[i]-brr[i-1])\r\n dc.append(crr[i]-crr[i-1])\r\ndb.append((l-1-brr[n-1])+brr[0]+1)\r\ndc.append((l-1-crr[n-1])+crr[0]+1)\r\n\r\nflag=0\r\nfor i in range(n):\r\n \r\n if(db==dc):\r\n \r\n flag=1\r\n break\r\n cc=db[0]\r\n db.pop(0)\r\n db.append(cc)\r\nif(flag==1):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,L = map(int,input().split())\r\nkefa = list(map(int,input().split()))\r\nsasha = list(map(int,input().split()))\r\ndef check(kefa,sasha):\r\n X = [(kefa[i]-sasha[i] + L)%L for i in range(n)]\r\n if len(set(X)) == 1:\r\n return True\r\n else:\r\n return False\r\ndef rotate(arr, n): \r\n x = arr[n - 1] \r\n \r\n for i in range(n - 1, 0, -1): \r\n arr[i] = arr[i - 1]\r\n \r\n arr[0] = x\r\n return arr\r\nok = False\r\nfor l in range(n+1):\r\n \r\n sasha = rotate(sasha,n)\r\n if check(kefa,sasha) == True:\r\n ok = True\r\nif ok == True:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import copy\r\na,b=map(int,input().split())\r\nl1=input().split()\r\nj=0\r\nfor i in l1:\r\n l1[j]=int(i)\r\n j+=1\r\nl2=input().split()\r\nj=0\r\nfor i in l2:\r\n l2[j]=int(i)\r\n j+=1\r\nl3=copy.copy(l1)\r\nj=0\r\nwhile j<=b:\r\n i=0\r\n while i<=a-1:\r\n l3[i]=(l1[i]+j)%b\r\n i+=1\r\n l3.sort()\r\n if l3==l2:\r\n print('YES')\r\n break\r\n j+=1\r\nelse:\r\n print('NO')", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, L] = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nfor i in range(L):\r\n a2 = list(a)\r\n for j in range(n):\r\n a2[j] = (a2[j]+i)%L\r\n a2.sort()\r\n if a2 == b:\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n", "from collections import deque\n\ni, j = map(int, input().split())\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nA = []\nfor k in range(len(a)):\n if not k:\n A.append(a[k] + (j - a[-1]))\n else:\n A.append(a[k] - a[k - 1])\n\nB = []\nfor k in range(len(b)):\n if not k:\n B.append(b[k] + (j - b[-1]))\n else:\n B.append(b[k] - b[k - 1])\n\nB = deque(B)\nS = False\nfor i in a:\n B.rotate(-1)\n if A == list(B):\n S = True\n\nprint('YES' if S else 'NO')\n", "n,l=map(int,input().split())\r\nf1=[0]*l\r\nf2=[0]*l\r\nfor x in list(map(int,input().split())):\r\n f1[x]=1\r\nfor x in list(map(int,input().split())):\r\n f2[x]=1\r\nfor _ in range(l+1):\r\n f1=f1[1:]+[f1[0]]\r\n if f1==f2: print('YES'); break\r\nelse: print('NO')", "n, L = map(int, input().split())\r\nk = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nfor i in range(L):\r\n s = sorted((si + 1) % L for si in s)\r\n if s == k:\r\n print('YES')\r\n exit()\r\nprint('NO')", "k, l = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\ndef solve():\n for i in range(l):\n if a == sorted((x + i) % l for x in b):\n return \"YES\"\n return \"NO\"\n\nprint(solve())\n", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nfor i in range(l):\r\n for j in range(n):\r\n a[j] = (a[j] + 1) % l\r\n\r\n a.sort()\r\n\r\n if a == b:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "from sys import stdin\n\ndef computeDist(kefa):\n distance = [0] * post\n for i in range(post):\n distance[i] = kefa[i]-kefa[i-1]\n if distance[i]<0:\n distance[i] += length\n return distance\n\ndef rotate(i,distance):\n return distance[i:] + distance[:i]\n\npost, length = map(int,stdin.readline().split())\nkefa = list(map(int,stdin.readline().split()))\nsasha = list(map(int, stdin.readline().split()))\ndistance1 = computeDist(kefa)\ndistance2 = computeDist(sasha)\nfor i in range(0,len(sasha)):\n if distance2[i] == distance1[0] and rotate(i,distance2)==distance1:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n", "n,L=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nda=[]\r\ndb=[]\r\nfor i in range(n-1):\r\n\tda.append(abs(a[i]-a[i+1]))\r\n\tdb.append(abs(b[i]-b[i+1]))\r\nda.append(a[0]+L-a[-1])\r\ndb.append(b[0]+L-b[-1])\r\nfor i in range(n):\r\n\tif da==db:\r\n\t\tprint(\"YES\")\r\n\t\tquit()\r\n\tdb=[db[-1]]+db[:-1]\r\n\t# print(db)\r\nprint(\"NO\")\r\n", "def get_diff(arr, n, l):\n diff_arr = \"\"\n for i in range(n - 1):\n diff = arr[i+1] - arr[i]\n diff = min(diff, l - diff)\n diff_arr += str(diff)\n diff = arr[n-1] - arr[0]\n diff = min(diff, l - diff)\n diff_arr += str(diff)\n return diff_arr\n\ndef is_rotation(diff1, diff2):\n diff2 += diff2\n return diff1 in diff2\n\nn, l = map(int, input().split())\narr1 = [int(inp) for inp in input().split()]\narr2 = [int(inp) for inp in input().split()]\n\ndiff1 = get_diff(arr1, n, l)\ndiff2 = get_diff(arr2, n, l)\n\nif is_rotation(diff1, diff2):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "pocty = list(map(int, input().split()))\nn = pocty[0]\nL = pocty[1]\nk = list(map(int, input().split()))\ns = list(map(int, input().split()))\nfor i in range(n):\n bazmek = (k[0] - s[i])%L\n for j in range(n):\n pomocna = (i+j)%n\n if (k[j] - s[pomocna])%L != bazmek:\n break\n if j==(n-1):\n print(\"YES\")\n exit()\nprint(\"NO\")", "n, l = map(int, input().split())\r\nd1 = list(map(int, input().split()))\r\nd2 = list(map(int, input().split()))\r\nflag = False\r\nfor i in range(l):\r\n for j in range(n):\r\n d1[j] -= 1\r\n if d1[j] == -1:\r\n d1[j] = l - 1\r\n d1.sort()\r\n if d1 == d2:\r\n flag = True\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na = a + a\r\nu = [(a[i + 1] - a[i]) % l for i in range(2 * n - 1)]\r\nv = [(b[i + 1] - b[i]) % l for i in range(n - 1)]\r\nans = \"NO\"\r\nfor i in range(n):\r\n ok = 1\r\n for j in range(n - 1):\r\n if u[i + j] ^ v[j]:\r\n ok = 0\r\n break\r\n if ok:\r\n ans = \"YES\"\r\n break\r\nprint(ans)", "def solution(n,l,a,y):\r\n for i in range(l):\r\n r=[]\r\n for j in range(len(a)):\r\n r.append((i+a[j])%l)\r\n if sorted(r)==y:\r\n return \"yes\"\r\n return \"No\" \r\n \r\nif __name__ == \"__main__\":\r\n n, l = map(int,input().split())\r\n k = list(map(int,input().split()))\r\n s= list(map(int,input().split()))\r\n print(solution(n,l,s,k))", "n, L = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na0, b0 = a[0], b[0]\nfor i in range(n - 1):\n a[i] = a[i + 1] - a[i]\n b[i] = b[i + 1] - b[i]\na[-1] = a0 - a[-1] + L\nb[-1] = b0 - b[-1] + L\n\nt = False\nfor start in range(n):\n if a == b[start:] + b[:start]:\n t = True\nif t:\n print(\"YES\")\nelse:\n print(\"NO\")", "n,L=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx=L-a[n-1]+a[0]\r\nfor i in range(1,n):\r\n a[i-1]=a[i]-a[i-1]\r\na[n-1]=x\r\nx=L-b[n-1]+b[0]\r\nfor i in range(1,n):\r\n b[i-1]=b[i]-b[i-1]\r\nb[n-1]=x\r\nfor i in range(n):\r\n if a==b[i:]+b[:i]:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "f=lambda :map(int,input().split())\r\nn,l=f()\r\na=list(f())\r\nb=list(f())\r\nok=0\r\nfor i in range(l):\r\n for j in range(n):\r\n if a==b:\r\n ok=1\r\n print('YES')\r\n break\r\n t=b[0]\r\n for k in range(n-1):\r\n b[k]=b[k+1]\r\n b[n-1]=t\r\n if ok:\r\n break\r\n b=list(map(lambda x:(x+1)%l,b))\r\nif not ok:\r\n print('NO')", "import sys\r\nfrom collections import deque\r\nread=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(x+\"\\n\")\r\ndef compare(a, b, N):\r\n for i in range(N):\r\n if a[i] != b[i]:\r\n return False\r\n return True\r\n\r\nn,L = map(int, read().split())\r\nkefa = [int(k) for k in read().split()]\r\nsasha = [int(s) for s in read().split()]\r\nkis,sis = deque(),[]\r\nfor i in range(n):\r\n if i == n-1:\r\n kis.append(L - kefa[n-1] + kefa[0])\r\n sis.append(L - sasha[n-1] + sasha[0])\r\n else:\r\n kis.append(kefa[i+1] - kefa[i])\r\n sis.append(sasha[i+1] - sasha[i])\r\ncnt = 0\r\nwhile True:\r\n if cnt == n:\r\n ans = \"NO\"\r\n break\r\n if not compare(kis, sis, n):\r\n kis.append(kis.popleft())\r\n cnt += 1\r\n continue\r\n else:\r\n ans = \"YES\"\r\n break\r\n\r\nwrite(ans)", "n,l=map(int,input().split(\" \"))\r\na=list(map(int,input().split(\" \")))\r\nb=list(map(int,input().split(\" \")))\r\nans=\"NO\"\r\nt=a[0]\r\nv=b[0]\r\nfor i in range(n-1):\r\n a[i]=a[i+1]-a[i]\r\n b[i]=b[i+1]-b[i]\r\na[n-1]=t+l-a[n-1]\r\nb[n-1]=v+l-b[n-1]\r\nfor i in range(n):\r\n if b[i:]+b[:i]==a:\r\n ans='YES'\r\nprint(ans)", "class CodeforcesTask761BSolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n_l = []\r\n self.track1 = []\r\n self.track2 = []\r\n\r\n def read_input(self):\r\n self.n_l = [int(x) for x in input().split(\" \")]\r\n self.track1 = [int(x) for x in input().split(\" \")]\r\n self.track2 = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n dists1 = [self.track1[x] - self.track1[x - 1] for x in range(1, self.n_l[0])]\r\n dists2 = [self.track2[x] - self.track2[x - 1] for x in range(1, self.n_l[0])]\r\n can = False\r\n for x in range(self.n_l[0]):\r\n\r\n nd = self.track1[x:] + self.track1[:x]\r\n dists1 = [nd[x] - nd[x - 1] for x in range(1, self.n_l[0])]\r\n for x in range(1, self.n_l[0]):\r\n if dists1[x - 1] < 0:\r\n dists1[x - 1] += self.n_l[1]\r\n #print(nd, dists1, dists2)\r\n if dists1 == dists2:\r\n can = True\r\n break\r\n self.result = \"YES\" if can else \"NO\"\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask761BSolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n, l = (map(int, input().split(' ')))\nif n == 1:\n print(\"YES\")\nelse:\n a = list(map(int, input().split(' ')))\n b = list(map(int, input().split(' ')))\n a = a + a[:-1]\n found = False\n for i in range(n):\n flag = True\n for j in range(n-1): \n k = i+j\n diff_a = a[k+1]-a[k] if a[k+1] > a[k] else a[k+1]+l-a[k]\n if b[j+1] - b[j] != diff_a:\n flag = False\n break\n \n if flag:\n found = True\n break\n print(\"YES\" if found else \"NO\")\n", "a, L = map(int, input().split())\r\nK = list(map(int, input().split()))\r\nS = list(map(int, input().split()))\r\nfor x1 in range(0, L):\r\n # print('x1 =')\r\n # print(x1)\r\n res = True\r\n S1=[]\r\n for i in range(0, len(S)):\r\n if S[i]+x1<L:\r\n S1.append(S[i]+x1)\r\n else:\r\n S1.append(S[i]+x1-L)\r\n # S1 = [S[x]+x1 for x in range(0, len(S))]\r\n # S1 = [x-L for x in S1 if x>=L]\r\n S1.sort()\r\n # print(S1)\r\n for i in range(0, len(S1)):\r\n if S1[i] != K[i]:\r\n res = False\r\n break\r\n if res:\r\n break\r\nif res:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n, length = (int(i) for i in input().split())\r\nkef = tuple(int(i) for i in input().split())\r\nalex = tuple(int(i) for i in input().split())\r\n\r\ndef divs(a, length):\r\n res = []\r\n for i in range(len(a)):\r\n res.append((a[i] - a[i - 1]) % length ) \r\n return res\r\n\r\ndef check(kef, alex, length):\r\n\r\n kef = divs(kef, length)\r\n alex = divs(alex, length)\r\n \r\n #print(alex, kef)\r\n \r\n for i in range(len(kef)):\r\n flag = True\r\n for j in range(len(kef)):\r\n \r\n #print(kef[(i + j) % len(kef)], alex[j])\r\n \r\n if kef[(i + j) % len(kef)] != alex[j]:\r\n flag = False\r\n break\r\n \r\n #print('\\n')\r\n \r\n if flag == True:\r\n return True\r\n \r\n return False\r\n\r\nif check(kef, alex, length):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,l=list(map(int,input().strip().split()))\r\nA=list(map(int,input().strip().split()))\r\nB=list(map(int,input().strip().split()))\r\nf=0\r\nfor i in range(l):\r\n c=[]\r\n for j in range(n):\r\n c.append((i+B[j])%l)\r\n c.sort()\r\n if c==A:\r\n f=1\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, L = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\n\r\nb = k[:]\r\n\r\nwhile True:\r\n if k == s:\r\n print('YES')\r\n exit(0)\r\n\r\n if k[0] == 0:\r\n k = k[1:]\r\n k.append(L)\r\n\r\n for i in range(n):\r\n k[i] -= 1\r\n\r\n if k == b:\r\n print('NO')\r\n exit(0)\r\n", "n,l=map(int,input().split())\r\nk = list(map(int,input().split()))\r\ns = list(map(int,input().split()))\r\nflag = 0\r\nfor i in range(n):\r\n for j in range(l+1):\r\n count=0\r\n i1,i2 = i,0\r\n \"\"\"\r\n while i2<n:\r\n print((s[i1%n]+j)%l,end=\" \")\r\n i1+=1\r\n i2+=1\r\n i1,i2 = i,0\r\n \"\"\"\r\n while i2<n:\r\n if (s[i1%n]+j)%l==k[i2]:\r\n count+=1\r\n else:\r\n break\r\n #print(s[i1%n]+j,end=\" \")\r\n i1+=1\r\n i2+=1\r\n #print(\"****\",count)\r\n #print([i,j,count])\r\n if count==n:\r\n flag=1\r\n break\r\n if flag==1:\r\n break\r\n\r\n\r\nif flag==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "nl = [int(k) for k in input().split()]\nn = nl[0]\nL = nl[1]\na = [int(k) for k in input().split()]\nb = [int(k) for k in input().split()]\nfl = 0\nfor dL in range(0, L):\n flg = 0\n for i in range(0, n):\n b[i] = (b[i] + 1) % L\n for k in range(0, L):\n t = b[0]\n flag = 0\n for i in range(1, n):\n b[i-1] = b[i]\n b[n-1] = t\n\n #print(b)\n\n for i in range(0, n):\n if a[i] != b[i]:\n flag = 1\n break\n if not flag:\n flg = 1\n break\n if flg:\n fl = 1\n break\nif fl:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t\t\t \t \t\t\t\t \t\t \t\t\t\t \t\t\t \t \t\t\t", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\n\r\nfrom itertools import permutations\r\n\r\nn,l=R()\r\n\r\na=L()\r\nb=L()\r\n\r\na=set(a)\r\nb=set(b)\r\n\r\n\r\nfor i in range(l*2):\r\n \r\n A=set([(x+i)%l for x in a])\r\n if A==b:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n\r\n\r\n\r\n\r\n", "def sublistExists(list1, list2):\r\n return ''.join(map(str, list2)) in ''.join(map(str, list1))\r\n\r\nn, l = map(int, input().split())\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\na1, a2 = [], []\r\nfor i in range(1, n):\r\n a1.append(l1[i]-l1[i-1])\r\n a2.append(l2[i] - l2[i - 1])\r\na1.append(l - l1[n-1] + l1[0])\r\na2.append(l - l2[n-1] + l2[0])\r\n\r\na1+=a1\r\nif sublistExists(a1, a2)==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solution(n, L, k, s):\r\n # compute the differences between adjacent barriers in the sequences k and s\r\n dk = [(k[i] - k[i-1]) % L for i in range(n)]\r\n ds = [(s[i] - s[i-1]) % L for i in range(n)]\r\n\r\n # check if one sequence can be obtained from the other by shifting the elements\r\n for i in range(n):\r\n if dk == ds[i:] + ds[:i]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nif __name__ == \"__main__\":\r\n n, L = map(int, input().split())\r\n k = list(map(int, input().split()))\r\n s = list(map(int, input().split()))\r\n print(solution(n, L, k, s))", "n, l = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ndouble_break = False\r\nfor starta in range(l):\r\n track1 = [0] * l\r\n track2 = [0] * l\r\n for i in range(n):\r\n track1[(starta + a[i]) % l] = 1\r\n for startb in range(l):\r\n for j in range(n):\r\n track2[(startb + b[j]) % l] = 1\r\n if track1 == track2:\r\n print('YES')\r\n double_break = True\r\n break\r\n if double_break:\r\n break\r\nelse:\r\n print('NO')\r\n", "from collections import deque\n\nn, L = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\ndef diff_vec(x):\n y = deque([(x[i%n] - x[(i-1)%n])%L for i in range(n)])\n return y\n\ndef compare_two_deque(x,y):\n for i in range(n):\n if x[i] != y[i]:\n return False\n return True\n\na = diff_vec(a)\nb = diff_vec(b)\n\nfor i in range(n):\n tmp = a.popleft()\n a.append(tmp)\n if compare_two_deque(a,b):\n print(\"YES\")\n break\n if i == n-1:\n print(\"NO\")\n\n", "import sys;\r\ninp = list(map(int,input().split(' ')));\r\na = list(map(int,input().split(' ')));\r\nb = list(map(int,input().split(' ')));\r\nf = 0;\r\na = sorted(a);\r\n#print(a);\r\nfor i in range(inp[1]):\r\n #print(i);\r\n for j in range(inp[0]):\r\n b[j] = (b[j]+1)%inp[1];\r\n if sorted(b) == a:\r\n print(\"YES\");\r\n sys.exit();\r\nprint('NO');\r\n \r\n", "n,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nf=False\r\nfor i in range(l):\r\n temp=[]\r\n for el in a:\r\n temp.append((el-i+l)%l)\r\n if sorted(temp)==b:\r\n f=True\r\nif f:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n ", "N, L = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nfor i in range(L):\r\n tmp = []\r\n for j in range(N):\r\n if a[j] < i:\r\n tmp.append(L - (i - a[j]))\r\n else:\r\n tmp.append(a[j] - i)\r\n\r\n mi = min(tmp)\r\n while tmp[0] != mi:\r\n tmp = tmp[1:] + [tmp[0]]\r\n\r\n if tmp == b:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nans = False\r\nfor i in range(l):\r\n c = sorted(list(map(lambda x: (x + i) % l, b)))\r\n if(c == a):\r\n ans = True\r\n\r\nprint((\"NO\", \"YES\")[ans])", "n, l = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nfor move in range(n):\r\n a = a[1:] + [a[0]]\r\n for q in range(105):\r\n good = 1\r\n for i in range(n):\r\n if (a[i] + q) % l != b[i]:\r\n good = 0\r\n break\r\n if good:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "#!/bin/python3\r\n\r\nimport sys\r\nn,l=input().strip().split(' ')\r\nn,l=(int(n),int(l))\r\nl1= list(map(int, input().strip().split(' ')))\r\nl2= list(map(int, input().strip().split(' ')))\r\na1=[]\r\na2=[]\r\nfor i in range(1,n):\r\n a1.append(l1[i]-l1[i-1])\r\n a2.append(l2[i]-l2[i-1])\r\na1.append(l-l1[-1]+l1[0])\r\na2.append(l-l2[-1]+l2[0])\r\nfor i in range(n):\r\n lis=a1[i:]+a1[0:i]\r\n if lis==a2:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n \r\n", "n,l=map(int,input().split())\r\nif(n==1):\r\n\tprint(\"YES\")\r\n\texit()\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ni1=0\r\nfor i in range(1,n+1):\r\n\tif(i%n!=0):\r\n\t\tif(abs(a[i%n]-a[(i-1)%n])==b[1]-b[0]):\r\n\t\t\ti1=(i-1)%n+1\r\n\t\t\tfor j in range(1,n+1):\r\n\t\t\t\tif(i1%n!=0):\r\n\t\t\t\t\tif(j%n!=0):\r\n\t\t\t\t\t\tif(abs(a[i1%n]-a[(i1-1)%n])==abs(b[j%n]-b[(j-1)%n])):\r\n\t\t\t\t\t\t\ti1+=1\r\n\t\t\t\t\t\t\tif(j==n):\r\n\t\t\t\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\t\t\t\texit()\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tif(abs(a[i1%n]-a[(i1-1)%n])==abs(b[0]+l-b[(j-1)%n])):\r\n\t\t\t\t\t\t\ti1+=1\r\n\t\t\t\t\t\t\tif(j==n):\r\n\t\t\t\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\t\t\t\texit()\r\n\t\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\tif(j%n!=0):\r\n\t\t\t\t\t\tif(abs(a[i1%n]+l-a[(i1-1)%n])==abs(b[j%n]-b[(j-1)%n])):\r\n\t\t\t\t\t\t\ti1+=1\r\n\t\t\t\t\t\t\tif(j==n):\r\n\t\t\t\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\t\t\t\texit()\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tif(abs(a[i1%n]+l-a[(i1-1)%n])==abs(b[0]+l-b[(j-1)%n])):\r\n\t\t\t\t\t\t\ti1+=1\r\n\t\t\t\t\t\t\tif(j==n):\r\n\t\t\t\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\t\t\t\texit()\r\n\t\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\t\tbreak\r\n\telse:\r\n\t\tif(abs(a[i%n]+l-a[(i-1)%n])==b[1]-b[0]):\r\n\t\t\ti1=(i-1)%n+1\r\n\t\t\tfor j in range(1,n+1):\r\n\t\t\t\tif(i1%n!=0):\r\n\t\t\t\t\tif(j%n!=0):\r\n\t\t\t\t\t\tif(abs(a[i1%n]-a[(i1-1)%n])==abs(b[j%n]-b[(j-1)%n])):\r\n\t\t\t\t\t\t\ti1+=1\r\n\t\t\t\t\t\t\tif(j==n):\r\n\t\t\t\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\t\t\t\texit()\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tif(abs(a[i1%n]-a[(i1-1)%n])==abs(b[0]+l-b[(j-1)%n])):\r\n\t\t\t\t\t\t\ti1+=1\r\n\t\t\t\t\t\t\tif(j==n):\r\n\t\t\t\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\t\t\t\texit()\r\n\t\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\t\tbreak\r\n\t\t\t\telse:\r\n\t\t\t\t\tif(j%n!=0):\r\n\t\t\t\t\t\tif(abs(a[i1%n]+l-a[(i1-1)%n])==abs(b[j%n]-b[(j-1)%n])):\r\n\t\t\t\t\t\t\ti1+=1\r\n\t\t\t\t\t\t\tif(j==n):\r\n\t\t\t\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\t\t\t\texit()\r\n\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tif(abs(a[i1%n]+l-a[(i1-1)%n])==abs(b[0]+l-b[(j-1)%n])):\r\n\t\t\t\t\t\t\ti1+=1\r\n\t\t\t\t\t\t\tif(j==n):\r\n\t\t\t\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\t\t\t\texit()\r\n\t\t\t\t\t\t\telse:\r\n\t\t\t\t\t\t\t\tbreak\r\nprint(\"NO\")", "read = lambda: map(int, input().split())\r\nn, L = read()\r\na = list(read())\r\nb = list(read())\r\nfor j in range(n):\r\n dif = [(a[i] - b[(i + j) % n]) % L for i in range(n)]\r\n if len(set(dif)) == 1:\r\n print('YES')\r\n exit()\r\nprint('NO')", "inp = lambda : [*map(int, input().split())]\r\nn, m = inp()\r\ncal = lambda x: [m - x[-1] + x[0]] + [x[i] - x[i - 1] for i in range(1, n)]\r\na = cal(inp())\r\nb = cal(inp())\r\nfor i in range(n):\r\n if a == b[i + 1:] + b[:i + 1]:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "n, L = [int(x) for x in input().split()]\r\nl1 = [int(x) for x in input().split()]\r\nl2 = [int(x) for x in input().split()]\r\nd1 = [0] * n\r\nd2 = [0] * 2 *n\r\ns1, s2 = 0, 0\r\nst1, st2 = '', ''\r\nfor i in range(n-1):\r\n d1[i] = l1[i+1] - l1[i]\r\n d2[i] = l2[i+1] - l2[i]\r\n s1 += d1[i]\r\n s2 += d2[i]\r\nd1[n-1] = L - s1\r\nd2[n-1] = L - s2\r\n\r\nfor i in range(n):\r\n d2[i+n] = d2[i]\r\n st1 += str(d1[i])\r\nfor i in range(2 * n):\r\n st2 += str(d2[i])\r\n\r\nif st1 in st2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,l = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nf = True\r\nfor i in range(l):\r\n new = []\r\n for e in a:\r\n e1 = (e-i+l)%l \r\n new.append(e1)\r\n \r\n if sorted(new)==b:\r\n f=False\r\n break\r\n \r\nif not f:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "input1=(list(map(int,input().split())))\r\nK=(list(map(int,input().split())))\r\nS=(list(map(int,input().split())))\r\nn=input1[0]\r\nl=input1[1]\r\nKlist=[]\r\nfor i in range(1,len(K)):\r\n Klist.append(K[i]-K[i-1])\r\nmax=0\r\nfor i in range(0,len(Klist)):\r\n max+=Klist[i]\r\nKlist.append(l-max)\r\nSlist=[]\r\nfor i in range(1,len(S)):\r\n Slist.append(S[i]-S[i-1])\r\nmax=0\r\nfor i in range(0,len(Slist)):\r\n max+=Slist[i]\r\nSlist.append(l-max)\r\ncount=0\r\nT=False\r\nwhile count<len(Klist)+1:\r\n if Slist==Klist:\r\n T=True\r\n break\r\n else:\r\n count+=1\r\n vars=Klist.pop(0)\r\n Klist.append(int(vars))\r\nif T:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "n, L = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\nb = list(map(int, input().split(' ')))\r\nc = []\r\nd = []\r\nfor i in range(L):\r\n if a != b:\r\n for j in range(n):\r\n if a[j] > 0:\r\n a[j] -= 1\r\n else:\r\n a[j] = L-1\r\n else:\r\n break\r\n a.sort()\r\nif a == b:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "from sys import stdin, stdout\r\n\r\nn, l = map(int, stdin.readline().split())\r\nrang1 = list(map(int, stdin.readline().split()))\r\nrang2 = list(map(int, stdin.readline().split()))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if (rang2[(j + 1) % n] + l - rang2[j]) % l != (rang1[(j + 1 + i) % n] + l - rang1[(j + i) % n]) % l:\r\n break\r\n else:\r\n stdout.write(\"YES\")\r\n break\r\nelse:\r\n stdout.write(\"NO\")", "import re\nimport sys\n\nentrada = input()\nmatch = re.search('(\\d*) (\\d*)', entrada)\n\nn = int(match.group(1))\nL = int(match.group(2))\n\nkefa = list(map(int, input().split()))\nsasha = list(map(int, input().split()))\ncounter = 0\nwhile (len(set(kefa).intersection(sasha)) != len(kefa)) and counter<=L:\n\tcounter+=1\n\tfor i,v in enumerate(kefa):\n\t\tkefa[i] -= 1\n\t\tif kefa[i] < 0:\n\t\t\tkefa[i] = L-1\n\nif (len(set(kefa).intersection(sasha)) == len(kefa)):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "R= lambda: map(int,input().split())\r\nn,l= R()\r\na,b= list(R()), list(R())\r\nfor i in range(l):\r\n for j in range(l):\r\n ans=0\r\n for x in a:\r\n z=(i+x)%l\r\n if z>=j and z-j in b: ans+=1\r\n elif z<j and z-j+l in b: ans+=1\r\n if ans==n: \r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "n, l = map(int, input().split())\nx = list(map(int, input().split()))\ny = list(map(int, input().split()))\n\na = []\nfor i in range(n-1):\n\ta += [x[i+1]-x[i]]\na += [l-x[n-1]+x[0]]\n\n\nb = []\nfor i in range(n-1):\n\tb += [y[i+1]-y[i]]\nb += [l-y[n-1]+y[0]]\n\nans = 0\nfor i in range(n):\n\tt = b[i:]+b[:i]\n\tif(t==a):\n\t\tans = 1\n\t\tbreak\nif(ans==1):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nd = []\r\nfor t in range(1, n):\r\n d.append((b[t] - b[t-1]) % l)\r\nok = \"NO\"\r\nfor i in range(n):\r\n c = []\r\n for j in range(1, n):\r\n c.append((a[(i+j) % n] - a[(i+j-1) % n]) % l)\r\n if c == d:\r\n ok = \"YES\"\r\nprint(ok)\r\n", "def normalize(l, d):\r\n res = [l[i] - l[i - 1] for i in range(1, n)]\r\n res.append(d - l[-1] + l[0])\r\n return res\r\nn, l = map(int, input().split())\r\na = normalize([*map(int, input().split())], l)\r\nb = normalize([*map(int, input().split())], l)\r\nprint(\"YES\" if any(a[i:] + a[:i] == b for i in range(n)) else \"NO\")", "n,l = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nx = []\r\ny = []\r\nx.append(a[0]+l-a[n-1])\r\nfor i in range(1,n):\r\n x.append(a[i]-a[i-1])\r\ny.append(b[0]+l-b[n-1])\r\nfor i in range(1,n):\r\n y.append(b[i]-b[i-1])\r\n\r\nfor i in range(n):\r\n k = i\r\n c = True\r\n for j in range(n):\r\n if k==n:\r\n k = 0\r\n if x[k]!=y[j]:\r\n c = False\r\n break\r\n k += 1\r\n if c==True:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "n, l = map(int,input().split())\r\nk = list(map(int,input().split()))\r\ns = list(map(int,input().split()))\r\ncount = 0\r\ni = -1\r\nwhile s != k and count == 0:\r\n i = i + 1\r\n for j in range(len(s)):\r\n s[j] = s[j] - 1\r\n if s[j] < 0 :\r\n s[j] = l - 1\r\n s.sort()\r\n if i == l:\r\n count = 1\r\nif s != k and count == 1:\r\n print('NO')\r\nif s == k and count == 0:\r\n print('YES')", "n,l=input().split()\r\nn,l=int(n),int(l)\r\nl1=[int(x) for x in input().split()]\r\nl2=[int(y) for y in input().split()]\r\nl1=l1+[l]\r\nl2=l2+[l]\r\nbl1=[]\r\nbl2=[]\r\nfor i in range(len(l1)-1):\r\n d=l1[i+1]-l1[i]\r\n bl1.append(d)\r\nfor i in range(len(l2)-1):\r\n p=l2[i+1]-l2[i]\r\n bl2.append(p)\r\nbl1[n-1]=bl1[n-1]+l1[0]\r\nbl2[n-1]=bl2[n-1]+l2[0]\r\n\r\nfor i in range(n):\r\n \r\n bl1=[bl1[n-1]]+bl1[:n-1]\r\n \r\n if(bl1==bl2):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n,L = map(int,input().split())\r\nM = list(map(int,input().split()))\r\nN = list(map(int,input().split()))\r\nl = 0\r\nfor i in range(0,L):\r\n KK = []\r\n t = []\r\n for j in M:\r\n if j-i >= 0:\r\n KK.append(j-i)\r\n else:\r\n t.append(L+(j-i))\r\n KK = KK + t\r\n if KK == N:\r\n l = l + 1\r\n break\r\nprint('YES' if l != 0 else 'NO')\r\n", "n,l = map(int,input().split())\r\n\r\nkefa = list(map(int,input().split()))\r\n\r\nsasha = list(map(int,input().split()))\r\n\r\ndiff1 = [kefa[i+1] - kefa[i] if i != n - 1 else l - kefa[-1] + kefa[0] for i in range(n) ]\r\n\r\ndiff2 = [sasha[i+1] - sasha[i] if i != n - 1 else l - sasha[-1] + sasha[0] for i in range(n) ]\r\n\r\n\r\n\r\ndef rotation(pos):\r\n for i in range(n):\r\n if diff2[(i+pos)%n] != diff1[i]:\r\n return False\r\n return True\r\n \r\nfor i in range(n):\r\n if(rotation(i)):\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n \r\n ", "n , l = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nfor i in range(l+1):\r\n for j in range(n):\r\n l2[j]=l2[j]-1\r\n if l2[j]<0:\r\n l2[j]=l-1\r\n l2.sort() \r\n# print(l2) \r\n if l2==l1:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\") \r\n \r\n\r\n", "n,l = map(int,input().split())\r\n\r\nr1 = list(map(int,input().split()))\r\nr2 = list(map(int,input().split()))\r\n\r\nr = []\r\ns = []\r\nfor i in range(n-1):\r\n\t# print(i)\r\n\tr.append(r1[i+1]-r1[i])\r\nr.append(l-r1[n-1]+r1[0])\r\nfor i in range(n-1):\r\n\ts.append(r2[i+1]-r2[i])\r\ns.append(l-r2[n-1]+r2[0])\t\r\n# print(s,r)\r\nfor i in range(n+1):\r\n\r\n\t# print(s[:i])\r\n\tl1 = list(s[i:] + s[:i])\r\n\t# print(l1,r)\r\n\tif l1 == r:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\r\nprint(\"NO\")", "b,l=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nz1=list(map(int,input().split()))\r\nc,c1=[],[]\r\nfor i in range(b-1):c.append(z[i+1]-z[i]);c1.append(z1[i+1]-z1[i])\r\nc.append(l-z[-1]+z[0]);c1.append(l-z1[-1]+z1[0])\r\nc=2*c\r\nfor i in range(b):\r\n ok=True\r\n for j in range(b):\r\n if c[i+j]!=c1[j]:ok=False\r\n if ok:exit(print(\"YES\"))\r\nprint(\"NO\")\r\n", "inp = input().split()\r\nn = int(inp[0])\r\nl = int(inp[1])\r\ninp = input().split()\r\na = [int(i) for i in inp]\r\ninp = input().split()\r\nb = [int(i) for i in inp]\r\nans = \"NO\"\r\nflag = 0\r\n\r\n#print(a)\r\n#print(b)\r\n\r\nfor i in range(l):\r\n flag = 0\r\n for r in a:\r\n if (r + i) % l not in b:\r\n flag = 1\r\n break\r\n if not flag:\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, L = map(int, input().split())\r\nw1 = list(map(int, input().split()))\r\nw2 = list(map(int, input().split()))\r\nd1 = []\r\nd2 = []\r\nfor i in range(1, n):\r\n d1.append(w1[i]-w1[i-1])\r\n d2.append(w2[i]-w2[i-1])\r\nd1.append(L-w1[-1]+w1[0])\r\nd2.append(L-w2[-1]+w2[0])\r\n\r\nfor i in range(n):\r\n d1 = d1[1:] + [d1[0]]\r\n if d1 == d2:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nfor _ in range(n):\r\n a = a[1:] + [a[0]]\r\n for q in range(105):\r\n for i in range(n):\r\n if (a[i] + q) % k != b[i]:\r\n break\r\n else:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/761/B\n\nn, L = map(int, input().split())\nl_x = list(map(int, input().split()))\nl_x.sort()\nl_y = list(map(int, input().split()))\n\nfor i in range(L):\n for j in range(n):\n l_y[j] = (l_y[j] + 1) % L\n\n l_y = sorted(l_y)\n\n if sorted(l_y) == l_x:\n print(\"YES\")\n quit()\n\nprint(\"NO\")", "def main():\n n, l = map(int, input().split())\n aa = list(map(int, input().split()))\n bb = list(map(int, input().split()))\n for i, a in enumerate(aa, -n):\n a -= bb[0]\n if all(aa[j] == (a + b) % l for j, b in enumerate(bb, i)):\n print('YES')\n return\n print('NO')\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nf=1\r\nfor i in range(n):\r\n if(l[i]==i):\r\n c=c+1\r\n elif(f==1 and l[l[i]]==i):\r\n c=c+2\r\n f=0\r\nif(f==1 and c<n):\r\n c=c+1\r\nprint(c)", "s, k, n = 0, 0, int(input())\r\nt = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i == t[i]: s += 1\r\n elif k < 2:\r\n if t[t[i]] == i: k = 2\r\n else: k = 1\r\nprint(s + k)", "# LUOGU_RID: 94438576\nn = int(input())\narray = [int(x) for x in input().split()]\nanswer = 0\nflag = 0\nfor i in range(n):\n if array[i] == i:\n answer += 1\n elif array[array[i]] == i:\n flag = 1\nif answer != n and flag == 0:\n answer += 1\nelif flag == 1:\n answer += 2\nprint(answer)", "from sys import stdin\n\n\ndef max_nb_fixed_points(n, permutation):\n pos_for_val = {}\n init_nb_fixed_points = 0\n double_swap = False\n single_swap = False\n for i in range(n):\n if i == permutation[i]:\n init_nb_fixed_points += 1\n continue\n if not double_swap and i in pos_for_val:\n j = pos_for_val[i]\n if permutation[i] == j:\n double_swap = True\n else:\n single_swap = True\n pos_for_val[permutation[i]] = i\n\n if double_swap:\n return init_nb_fixed_points + 2\n if single_swap:\n return init_nb_fixed_points + 1\n return init_nb_fixed_points\n\n\nif __name__ == \"__main__\":\n n = int(stdin.readline())\n permutation = [int(c) for c in stdin.readline().split(\" \")]\n print(max_nb_fixed_points(n, permutation))\n", "n=int(input())\r\ns=input().split()\r\nfor i in range(n):\r\n\ts[i]=int(s[i])\r\nfix=0\r\nflag=[]\r\nfor i in range(n):\r\n\tif s[i]==i:\r\n\t\tfix+=1\r\n\t\tflag.append(1)\r\n\telse:\r\n\t\tflag.append(0)\r\nswap=False\r\nfor i in range(n):\r\n\tif flag[i]==1:\r\n\t\tcontinue\r\n\telse:\r\n\t\tt=s[i]\r\n\t\tif s[t]==i:\r\n\t\t\tfix+=2\r\n\t\t\tswap=True\r\n\t\t\tbreak\r\nif swap==False and (0 in flag):\r\n\tfix+=1\r\nprint(fix)", "n=int(input())\r\nc=0\r\ncc=0\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n if l[i]==i:\r\n c+=1\r\n elif i==l[l[i]]:\r\n cc=1\r\nprint(c+cc+int(c!=n))", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left, insort_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\nfrom random import shuffle\r\n\r\nnum = int(input())\r\narr = list(map ( abs, map(int, input().split())))\r\n\r\nmapping = {}\r\nans = 0\r\n\r\ntwo_added = False\r\nfor i, n in enumerate(arr):\r\n if i == n:\r\n ans += 1\r\n else:\r\n if n in mapping and mapping[n] == i and not two_added:\r\n ans += 2\r\n two_added = True\r\n mapping[i] = n\r\n# print(mapping)\r\nif ans == num or two_added:\r\n print(ans)\r\nelse:\r\n print(ans + 1)\r\n\r\n", "n=int(input())\r\ndex={}\r\ntot=0\r\nfor i,e in enumerate(map(int,input().split())):\r\n if i==e:\r\n tot+=1\r\n else:\r\n dex[i]=e\r\n#print(tot, dex)\r\n# 2 {2: 3, 3: 4, 4: 2}\r\nif tot==n:\r\n print(tot)\r\nelse:\r\n keys = dex.keys()\r\n for key in dex:\r\n if dex[key] in dex.keys():\r\n if key == dex[dex[key]]:\r\n print(tot + 2)\r\n exit()\r\n print(tot + 1)\r\n", "n = int(input())\r\ncount = 0\r\np = 0\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n\t# print(l[l[i]])\r\n\tif l[i] == i:\r\n\t\tcount += 1\r\n\telif p < 2:\r\n\t\tif l[l[i]] == i:\r\n\t\t\tp = 2\r\n\t\telse:\r\n\t\t\tp = 1\r\nprint(count + p)", "n=int(input())\r\nll=list(map(int,input().split()))\r\ncount=0\r\ndic={}\r\nfor i in range(n):\r\n if ll[i]==i:\r\n count+=1\r\n else:\r\n dic[i]=ll[i]\r\nflag=False\r\nfor x,y in dic.items():\r\n if dic[y]==x:\r\n flag=True\r\n break\r\nif flag:\r\n count+=2\r\nelif count!=n:\r\n count+=1\r\nprint(count)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nf=True\r\n\r\na=1\r\n\r\nc=0\r\nfor i in range(len(arr)):\r\n if arr[i]==i:\r\n c+=1\r\n elif f and arr[arr[i]]==i:\r\n f=False\r\n a=2\r\nif c==n:\r\n print(c)\r\nelse:\r\n print(c+a)\r\n\r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\ncount = 0\r\nadd = 0\r\nfor i in range(n):\r\n if (a[i] == i):\r\n count += 1\r\n else:\r\n if (a[a[i]] == i):\r\n add = 1\r\n\r\nif (count != n):\r\n add += 1\r\n\r\nprint (count + add)", "n = int(input())\r\nxs = [int(s) for s in input().split()]\r\n\r\nfixed_points = 0\r\nbonus = 0\r\nfor i, x in enumerate(xs):\r\n if x == i:\r\n fixed_points += 1\r\n elif xs[x] == i:\r\n bonus = 2\r\n else:\r\n bonus = max(bonus, 1)\r\n\r\nprint(fixed_points + bonus)\r\n", "n = int(input())\r\nperm = list(map(int, input().split()))\r\n\r\nfixed = 0\r\n\r\nswap = 0\r\n\r\nfor i in range(n):\r\n if i == perm[i]:\r\n fixed += 1\r\n\r\nfor i in range(n):\r\n if(perm[i] != i):\r\n if(perm[perm[i]] == i):\r\n fixed += 2\r\n swap = 1\r\n break\r\n\r\nif swap == 0 and fixed != n:\r\n fixed += 1\r\n\r\n\r\n\r\nprint(fixed)\r\n", "looping=int(input())\r\nsetofnum=list(map(int,input().split()))\r\ntotal=0\r\nmaxnum=0\r\nfor i in range(looping):\r\n if i==setofnum[i]:\r\n total+=1\r\n else:\r\n if maxnum<2 and i > setofnum[i]:\r\n if setofnum[setofnum[i]] == i:\r\n maxnum=2\r\n else:\r\n maxnum=1\r\n\r\nprint(total+maxnum)", "import sys \r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nc = 0 \r\nf = 1\r\nfor i in range(n):\r\n if(a[i] == i):\r\n c += 1 \r\n elif(a[a[i]] == i and f):\r\n c += 2 \r\n f = 0\r\n \r\nif(c != n and f):\r\n c += 1 \r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nans1 = 0\r\nfor i in range(len(a)):\r\n if a[i] == i:\r\n ans += 1\r\n ans1 += 1\r\n\r\nif ans != n:\r\n for i in range(len(a)):\r\n if a[i] != i:\r\n if a[a[i]] == i:\r\n ans += 2\r\n break\r\n if ans == ans1:\r\n ans += 1\r\nprint(ans)\r\n\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nintl=0\r\nfor i in range(n):\r\n if i==a[i]:\r\n intl+=1 \r\npzbl=0\r\nfor i in range(n):\r\n if i!=a[i]:\r\n if i==a[a[i]]:\r\n pzbl=2\r\n else:\r\n pzbl=max(pzbl,1)\r\nprint(intl+pzbl)\r\n", "n = int(input())\r\ns = input()\r\nA = list(map(int,s.split()))\r\n\r\nret,sw,c = 0,0,1\r\nfor i in range(len(A)):\r\n if A[i]==i:\r\n ret+=1\r\n continue\r\n sw+=1\r\n if A[A[i]]==i:\r\n c=2\r\nif sw >= 2:\r\n ret=ret+c\r\nprint(ret) \r\n", "n=int(input())\r\nb=[]\r\ncount=0\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]!=i:\r\n b.append(i)\r\nif len(b)>0: \r\n for i in b:\r\n x=a[a[i]]\r\n if x==i:\r\n count+=1\r\n break\r\n if count>0:\r\n print(n-len(b)+2)\r\n else:\r\n print(n-len(b)+1)\r\nelse:\r\n print(n)\r\n ", "z = int(input())\nout, swap = 0, [1]\nn = list(map(int, input().split()))\nfor i in range(z):\n if i == n[i]:\n out += 1\n elif n[n[i]] == i and n[i] == n.index(i):\n swap.append(2)\nprint(out + max(swap) if z-out >= 2 else out)\n\t\t\t\t\t \t\t \t \t \t \t\t \t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0;s=0;e=0\r\nfor i in range(n):\r\n if a[i]==i:\r\n ans+=1\r\n else:\r\n b=a[i]\r\n if a[b]==i:\r\n s=2\r\n else:\r\n e=1\r\nif s==2:\r\n ans+=2\r\nelse:\r\n if e==1:\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\ncnt=0\r\ndict={}\r\n\r\nfor i in range(n):\r\n if a[i]==i:\r\n cnt+=1\r\n\r\n else:\r\n dict[a[i]]=1\r\n\r\n#try +=2\r\nfor i in range(n):\r\n if a[i]!=i and a[i]<n:\r\n if a[a[i]]==i:\r\n print(cnt+2)\r\n exit(0)\r\n\r\n\r\n#try +=1\r\nfor i in range(n):\r\n if a[i]!=i:\r\n if dict[i]==1:\r\n print(cnt+1)\r\n exit(0)\r\n\r\nprint(cnt)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=0;\r\nc=0;\r\nfor i,j in enumerate(a):\r\n if i==j:\r\n b+=1\r\n elif a[j]==i:\r\n c=2\r\n elif c==0:\r\n c=1\r\nprint(b+c)\r\n", "n = int(input())\r\nl = list(map(int, input().split(' ')))\r\n\r\ncertos = 0\r\nachou_2 = False\r\nerrados = 0\r\n\r\nfor i in range(len(l)):\r\n\tif l[i] == i:\r\n\t\tcertos += 1\r\n\telse:\r\n\t\terrados += 1\r\n\r\n\t\tif l[l[i]] == i:\r\n\t\t\tachou_2 = True\r\n\r\nif errados > 1:\r\n\tif achou_2:\r\n\t\tcertos += 2\r\n\telse:\r\n\t\tcertos += 1\r\n\r\nprint(certos)", "from sys import stdin,stdout\r\nimport math\r\nn=int(stdin.readline())\r\nli=list(map(int,stdin.readline().split()))\r\nans=0\r\nf=0\r\nfor i in range(0,n):\r\n if li[i]==i:\r\n ans+=1 \r\n else:\r\n x=li[i]\r\n if li[x]==i:\r\n f=1\r\nif ans==n:\r\n print(ans)\r\nelif f==1:\r\n print(ans+2)\r\nelse:\r\n print(ans+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nf=0;k=0\r\nfor i in range(n):\r\n if a[i]==i:\r\n f+=1\r\n elif a[a[i]]==i:\r\n k+=1\r\nif f<n and k==0:\r\n print(f+1)\r\nelif f<n and k>0:\r\n print(f+2)\r\nelif f==n:\r\n print(f)", "import sys\r\nimport math as mt\r\nimport bisect as bi\r\nimport collections as cc\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\nn , = I()\r\nar = I()\r\nans = 0\r\nf = {}\r\nval = []\r\nfor i in range(n):\r\n if ar[i]==i:\r\n ans+=1\r\n else:\r\n f[i] = ar[i]\r\n val.append(i)\r\ntf = 0\r\nfor i in val:\r\n x = f[i]\r\n if f.get(x,-1)==i:\r\n ans+=2\r\n tf = 1\r\n break\r\nif not tf:\r\n ans+=1\r\nprint(min(ans,n))", "n=int(input())\r\nc=0\r\nt=0\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]==i:\r\n c+=1\r\n elif i==a[a[i]]:\r\n t=1\r\nprint(c+t+int(c!=n))", "n = int(input(''))\r\nlst = list(map(int, input().split()))\r\n#you only have to swap fixed numbs http://codeforces.com/problemset/problem/347/B\r\nmaximum = 0\r\nfirst = True\r\nsecond = True\r\nfor i in range(n):\r\n if lst[i] == i:\r\n maximum += 1\r\n elif first == True:\r\n if lst[i] < len(lst):\r\n if lst[lst[i]] == i :\r\n maximum += 2\r\n first = False\r\n if second == False:\r\n maximum -= 1\r\n elif lst[lst[i]] != lst[i] and second == True:\r\n maximum += 1\r\n second = False\r\nprint(maximum)\r\n\r\n\r\n", "def fixed_points(n, a):\n count = 0\n fixed = 0\n for i, j in enumerate(a):\n if i == j:\n fixed += 1\n elif a[j] == i:\n count = 2\n elif count == 0:\n count = 1\n\n return fixed + count\n\n\nif __name__ == \"__main__\":\n n = int(input())\n a = list(map(int, input().split()))\n result = fixed_points(n, a)\n print(result)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = 0\r\nc = 0\r\nfor i, j in enumerate(a):\r\n if i == j:\r\n b += 1\r\n elif a[j] == i:\r\n c = 2\r\n elif c == 0:\r\n c = 1\r\nprint(b + c)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = 0\r\nm = 0\r\nfor i in range(n):\r\n if i == a[i]:\r\n k+=1\r\n elif i == a[a[i]]:\r\n m = 1\r\nprint(min(k+1+m,n))", "n = int(input())\r\na = list(map(int, input().split()))\r\ne = sorted(a)\r\nc = 0\r\nx = 0\r\nif e != a:\r\n x = 1\r\nfor i in range(n):\r\n if a[i] == i:\r\n c+=1\r\n else:\r\n if a[a[i]] == i:\r\n x = 2\r\nprint(c+x)", "# coding: utf-8\nn = int(input())\na = [int(i) for i in input().split()]\nans = 0\nfor i in range(n):\n if a[i] == i:\n ans += 1\nif ans == n:\n print(ans)\n exit()\nfor i in range(n):\n if a[i] != i:\n if a[a[i]] == i:\n print(ans+2)\n break\nelse:\n print(ans+1)\n", "swap = False\r\nn = int(input())\r\nris = 0\r\npos = [n+1]*n\r\nperm = list(map(int, input().split()))\r\nfor cont in range(0,n):\r\n if perm[cont] == cont:\r\n ris += 1\r\n else:\r\n pos[perm[cont]] = cont\r\n if swap is False:\r\n if pos[cont] == perm[cont]:\r\n ris += 2\r\n swap = True\r\n\r\nif swap is False:\r\n if ris < n:\r\n ris += 1\r\nprint(ris)", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\n\r\ndef main() -> int:\r\n n = int(input())\r\n numbers = [int(word) for word in input().split()]\r\n count_fixed = 0\r\n has_swap = False\r\n\r\n for i in range(n):\r\n if i == numbers[i]:\r\n count_fixed += 1\r\n elif numbers[numbers[i]] == i:\r\n has_swap = True\r\n\r\n if count_fixed == n:\r\n print(count_fixed)\r\n elif has_swap:\r\n print(count_fixed + 2)\r\n else:\r\n print(count_fixed + 1)\r\n\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "n=int(input())\n\nA=list(map(int,input().split()))\nans=0\n\nE={}\nfor i in range(n):\n if(A[i]==i):\n ans+=1\n else:\n E[i]=A[i]\ndone=False\nfor item in E:\n if(E[E[item]]==item):\n ans+=2\n done=True\n break\nif(not done and len(E)>0):\n ans+=1\nprint(ans)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(len(a)):\r\n if i == a[i]:\r\n cnt +=1 \r\n\r\nok2 = False\r\nok1 = False\r\nfor i in range(len(a)):\r\n if (i == a[i]):\r\n continue\r\n ok1 = True\r\n if (i == a[a[i]]):\r\n ok2 = True\r\nif ok2 == True:\r\n cnt+= 2\r\nelif ok1 == True:\r\n cnt+= 1\r\n\r\nprint(cnt)\r\n", "n=int(input())\r\na=[*map(int,input().split())]\r\nx=sum(a[i]==i for i in range(n))\r\nx+=(x<n)\r\nx+=any(i!=a[i] and i==a[a[i]] for i in range(n))\r\nprint(x)", "def main():\r\n n = int(input())\r\n v = list(map(int,input().split()))\r\n a,c1,ok = 0,0,0\r\n for i in range(n):\r\n if (v[i] == i):\r\n c1 = c1 + 1\r\n elif (v[v[i]] == i):\r\n ok = 1\r\n if (c1 == n):\r\n print(c1)\r\n elif (ok):\r\n print(c1+2)\r\n else:\r\n print(c1+1)\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "n = int(input())\r\nmass = list(map(int, input().split()))\r\nnum = 0\r\nflag = True\r\nfor i in range(n):\r\n if mass[i] == i:\r\n num += 1\r\n elif flag and mass[mass[i]] == i:\r\n num += 2\r\n flag = False\r\nif flag and num != n:\r\n num += 1\r\nprint(num)", "n = int(input())\r\nlst = list(map(int,input().rstrip().split()))\r\ne,k=0,0\r\nfor i in range(n):\r\n if i==lst[i]:\r\n e += 1\r\n elif lst[lst[i]] == i:\r\n k=1\r\nif e==n:\r\n print(e)\r\nelif k==1:\r\n print(e+2)\r\nelse:\r\n print(e+1)", "t=int(input())\r\nz=list(map(int,input().split()))\r\nd=dict()\r\nfor i in range(t):\r\n\td[z[i]]=i\r\nans=0\r\nf=0\r\nfor i in range(t):\r\n\tp=z[i]\r\n\tif(d[p]==p):\r\n\t\tans+=1\r\n\t\tdel d[p]\r\n\telse:\r\n\t\tf=1\r\np=1\r\n# print(d)\r\nfor i in d:\r\n\thai=i\r\n\tind=d[i]\r\n\tif(d[i]!=i and d[d[i]]==i):\r\n\t\tp=2\r\n\t\tbreak\r\n\r\nif(f==1):\r\n\tprint(p+ans)\r\nelse:\r\n\tprint(ans)\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nb = True\r\nfor i in range(n):\r\n if a[i] == i:\r\n ans += 1\r\n elif a[a[i]] == i and b:\r\n ans += 2\r\n b = False\r\nif b and ans < n:\r\n ans += 1\r\nprint(ans)", "def main():\r\n\tn = map(int,input().split())\r\n\ta = list(map(int,input().split()))\r\n\tcnt = 0\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]==i:\r\n\t\t\tcnt+=1\r\n\tif cnt==len(a):\r\n\t\tprint(cnt)\r\n\t\treturn\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]!=i:\r\n\t\t\tif i==a[a[i]]:\r\n\t\t\t\tprint(cnt+2)\r\n\t\t\t\treturn\r\n\tprint(cnt+1)\r\n\treturn\r\n\r\n\r\n\r\n\r\nmain()", "import sys\r\nsys.setrecursionlimit(100000)\r\nn = int(input())\r\narr = [int(x) for x in sys.stdin.readline().strip().split()]\r\ncount=0\r\nflag = False\r\nfor i in range(0,n):\r\n\tif arr[i]==i:\r\n\t\tcount+= 1\r\n\telif arr[arr[i]]==i:\r\n\t\tflag = True\r\n\r\nif count!=n:\r\n\tprint(count+1 if not flag else count+2)\r\nelse:\r\n\tprint(count)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n if i==a[i]:\r\n b.append(0)\r\n else:\r\n if a[a[i]]==i:\r\n b.append(2)\r\n else:\r\n b.append(1)\r\nprint(b.count(0)+max(b))", "\"\"\"\nhttps://codeforces.com/problemset/problem/347/B\n\"\"\"\nn = int(input())\ndiff = [int(x) for x in input().split()]\n\n\npf = 0\nfp = 0\nfor i, x in enumerate(diff):\n if i == x:\n pf += 1\n elif fp == 0 and diff[x] == i:\n fp = 2\n\nif fp == 0 and pf < n:\n fp = 1\n\nprint(pf + fp)\n", "n = int(input())\r\na = list(map(int, input().rstrip().split()))\r\nt = 0\r\nflag = 0\r\nfor i in range(n):\r\n if i == a[i]:\r\n t += 1\r\n else:\r\n if a[i] < n and a[a[i]] == i:\r\n flag = 1\r\nif t < n and flag == 1:\r\n t += 2\r\nelif t < n:\r\n t += 1\r\nprint(t)\r\n", "input()\na = [int(x) for x in input().split()]\n\ncount = 0\nm = {}\nyes = False\nfor i, b in enumerate(a):\n if b == i:\n count += 1\n elif not yes:\n if b in m and i == m[b]:\n yes = True\n else:\n m[i] = b\ncount += 2 if yes else 1 if len(m) else 0\nprint(\"%d\" % count)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n if a[i] == i:\r\n res += 1\r\n\r\nfor i in range(n):\r\n if a[i] != i and a[a[i]] == i:\r\n res += 2\r\n print(res)\r\n exit(0)\r\n\r\nif res != n:\r\n res += 1\r\n\r\nprint(res)", "n=int(input())\r\nA=[int(x) for x in input().split()]\r\ncnt_fixed_points=0\r\nfor i in range(n):\r\n if A[i]==i:\r\n cnt_fixed_points+=1\r\nflag=0\r\nfor i in range(n):\r\n if A[i]!=i and A[A[i]]==i:\r\n cnt_fixed_points+=2\r\n flag=1\r\n break\r\nif flag==0 and cnt_fixed_points<n:\r\n print(cnt_fixed_points+1)\r\nelse:\r\n print(cnt_fixed_points)\r\n \r\n ", "n = int(input()) \r\na = [int(i) for i in input().split()] \r\nans = len([i for i in range(n) if i == a[i]]) \r\nd = {key : val for key, val in zip(a, [i for i in range(n)])}\r\nif ans == n : print(ans)\r\nelse :\r\n cond =False\r\n for i in range(n): \r\n if a[i] != i : \r\n if d[i] == a[i] : cond = True; break \r\n if cond : ans += 2\r\n else : ans += 1\r\n print(ans)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nans = 0\r\nflag = True\r\nfor i in range(n):\r\n if a[i] == i:\r\n ans += 1\r\n elif a[a[i]] == i and flag:\r\n ans += 2\r\n flag = False\r\nif flag and ans < n:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans,t = 0,0\r\nfor i in range(n):\r\n if i==a[i]: ans+=1\r\n elif i == a[a[i]]: t=1\r\nprint(min(n,ans+t+1))\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split(' ')))\r\nc = 0 \r\nfor i in range(n):\r\n if i == a[i] :\r\n c += 1\r\n \r\nif c == n :\r\n print(n)\r\nelse:\r\n for i in range(n):\r\n if i != a[i] and a[a[i]] == i:\r\n print(c+2)\r\n break\r\n else:\r\n print(c+1)", "n=int(input())\r\nli=list(map(int,input().split(\" \")))\r\n\r\nindexes=[0]*n\r\n\r\ni=0\r\nwhile i<len(li):\r\n indexes[li[i]]=i\r\n i+=1\r\n\r\nswapped=False\r\nallequal=True\r\ni=0\r\ncount=0\r\nwhile i<len(li):\r\n if li[i]==i:\r\n count+=1\r\n else:\r\n allequal=False\r\n if swapped==False:\r\n if indexes[i]==li[i]:\r\n \r\n count+=2\r\n swapped=True\r\n i+=1\r\nif swapped==False and allequal==False:\r\n count+=1\r\nprint(count)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\ncount, s = 0, 0\r\nfor i in range(n):\r\n if arr[i] == i:\r\n count += 1\r\n elif s < 2:\r\n if arr[arr[i]] == i:\r\n s = 2\r\n else:\r\n s = 1\r\nprint(count + s)\r\n", "n=int(input());a=list(map(int,input().split()));o,ot=0,0\r\nfor i in range(n):\r\n if(a[i]==i):o+=1\r\nfor i in range(n):\r\n if(a[i]!=i):\r\n if(i==a[a[i]]):ot=2\r\n else:ot=max(ot,1)\r\nprint(ot+o)", "i = int(input())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nche = {}\r\ng = 0\r\np = 0\r\nfor x in range(i):\r\n if l[x] == x: c+= 1\r\n else:\r\n p = 1\r\n if x in che:\r\n if che[x] == l[x]: g = 2\r\n else: che[l[x]] = x\r\n else: che[l[x]] = x\r\nif p == 0: print(c)\r\nelse: print(c+2 if g==2 else c+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=0\r\nfor i in range(n):\r\n if l[i]==i:\r\n x+=1\r\nflag=False\r\nfor i in range(n):\r\n if l[l[i]]==i and l[i]!=i:\r\n flag=True\r\nif flag:\r\n x+=2\r\nelse:\r\n x+=1\r\nprint(min(n,x))", "n = int(input())\na = [int(x) for x in input().split()]\nans = 0\nfor i, x in zip(range(n), a):\n\tif i == x:\n\t\tans += 1\nif ans + 2 >= n:\n\tprint(n)\n\texit(0)\nfor i, x in zip(range(n), a):\n\tif i != x and a[x] == i:\n\t\tprint(ans + 2)\n\t\texit(0)\nprint(ans + 1)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = False\r\nrs = 0\r\nfor i in range(n):\r\n if a[i] != i:\r\n if a[a[i]] == i:\r\n t = True\r\n else:\r\n rs+=1\r\nif rs == len(a):\r\n print(rs)\r\nelif t:\r\n print(rs+2)\r\nelse:\r\n print(rs+1)", "def fixed_points():\r\n list_length = int(input())\r\n points = list(map(int, input().split(\" \")))\r\n fix_points = 0\r\n swaps = True\r\n for i in range(list_length):\r\n if points[i] == i:\r\n fix_points += 1\r\n elif swaps is True and points[points[i]] == i:\r\n swaps = False\r\n fix_points += 2\r\n if swaps is True and fix_points != list_length:\r\n fix_points += 1\r\n print(fix_points)\r\n \r\n \r\nfixed_points()", "def max_fixed(lst):\n max_increase = 0\n fixed = 0\n for i, val in enumerate(lst):\n if i == val:\n fixed += 1\n continue\n if max_increase < 2:\n if lst[val] == i:\n max_increase = max(max_increase, 2)\n continue\n if lst[val] != val:\n max_increase = max(max_increase, 1)\n continue\n return max_increase + fixed\n\n\nif __name__ == '__main__':\n _ = input()\n print(max_fixed([int(x) for x in input().split()]))\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\ns=0\r\nk=False\r\nfor x in range(n):\r\n if ar[x]==x:\r\n s+=1\r\n elif ar[x]!=x and k==False:\r\n if ar[ar[x]]==x:\r\n s+=2\r\n k=True\r\nif k==False and s!=n:\r\n s+=1\r\nprint(s)", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\nan = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nres = 0\r\nk1 = 0\r\nk2 = 0\r\nfor i in range(n):\r\n if(i == an[i]):\r\n res += 1\r\n else:\r\n if(an[an[i]] == i and an[i] != an[an[i]]):\r\n k2 = 2\r\n else:\r\n k1 = 1\r\n \r\nprint(res + max(k1, k2))", "n = int(input())\na = list(map(int, input().split()))\nc = 0\nf = 1\nmp = 0\n\nif n > 1:\n\tfor i in range(n):\n\t\tif a[i] == i:\n\t\t\tc += 1\n\t\telse:\n\t\t\tif f:\n\t\t\t\tif a[a[i]] == i:\n\t\t\t\t\tmp = 2\n\t\t\t\t\tf = 0\n\t\t\t\telse:\n\t\t\t\t\tmp = 1\n\t\t\t\t\n\tprint(c + mp)\n\t \nelse:\n\tprint(1)", "input()\r\na=list(map(int,input().split()))\r\nb=0\r\nc=0\r\nfor i in a:\r\n if a[i]==i:b+=1\r\n elif a[a[i]]==i:c+=1\r\nprint(b+2 if c else min(b+1,len(a)))", "y=int(input())\r\na=[int(x) for x in input().split()]\r\nnum=0\r\nj=0\r\nfor i in range(y):\r\n if a[i]==i:\r\n num+=1\r\n elif a[a[i]]==i:\r\n j=1\r\nif(num!=y):\r\n print(num+j+1)\r\nelse:\r\n print(num)", "n = int(input())\narr = [int(x) for x in input().split(' ')]\npaired, fixpoints = 0, 0\nfor x in range(n):\n if arr[x] == x: fixpoints += 1\n else:\n if arr[arr[x]] == x: paired += 1\nif fixpoints == n:\n print(fixpoints)\nelif paired > 0:\n print(fixpoints+2)\nelse:\n print(fixpoints+1)\n", "input()\r\nx = y = 0\r\nd = {}\r\n\r\nfor i,a in enumerate(map(int, input().split())):\r\n if a == i:\r\n x += 1\r\n else:\r\n d[i] = a\r\n if a in d and d[a] == i:\r\n y = 1\r\n\r\nprint(x + y + bool(d))", "def main():\n n = int(input())\n list = [int(x) for x in input().split()]\n dic = {}\n count = 0\n two = False\n for index, value in enumerate(list):\n if index == value:\n count += 1\n if value in dic and dic[value] == index:\n two = True\n dic[index] = value\n\n if two:\n print(min(n, (count + 2)))\n else:\n print(min(n, count + 1))\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nc=0\r\nd={}\r\nfor i in range(n):\r\n if x[i]==i:\r\n c+=1\r\n continue\r\n d[x[i]]=i\r\nk=1\r\nfor i in d:\r\n a=d[i]\r\n if d[a]==i:\r\n k=2\r\nif c==n:\r\n print(n)\r\nelse:\r\n print(c+k)", "n = int(input())\nvalues = list(map(int, input().split()))\n\nans = 0\nto_add = 0\nfor x in range(n):\n if values[x] == x:\n ans += 1\n elif to_add == 2:\n continue\n else:\n if values[values[x]] == x:\n to_add = 2\n else:\n to_add = 1\n\nprint(ans + to_add)\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nst = set()\r\nc = 0\r\nfor i in range(n):\r\n if l[i] != i:\r\n c += 1\r\n st.add((i, l[i]))\r\n st.add((l[i], i))\r\nif c==0:\r\n print(n)\r\nelse:\r\n if c*2==len(st):\r\n print(len(l)+1-c)\r\n else:\r\n print(len(l)+2-c)", "#B. Fixed Points\r\nn = int(input())\r\np = list(map(int,input().split()))\r\nf = 0\r\nswap = False\r\nfor i in range(n):\r\n if p[i] == i:\r\n f += 1\r\nfor i in range(n):\r\n if p[i] != i:\r\n if i == p[p[i]]:\r\n swap = True\r\nif swap:\r\n f = f + 2\r\nelif f<n:\r\n f = f + 1\r\nprint(f) ", "n = int(input())\n\narr = [int(i) for i in input().split()]\n\nd = {}\n\nequal = 0\nswap = 1\nfor i in range(n):\n if i == arr[i]:\n equal += 1\n elif i == arr[arr[i]]:\n swap = 2\n\nif equal == n:\n print(n)\nelse:\n print(equal + swap)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfixed = extra = 0\r\nfor i in range(n):\r\n if a[i] == i:\r\n fixed += 1\r\n elif a[a[i]] == i:\r\n extra = 2\r\n elif not extra:\r\n extra = 1\r\nprint(fixed + extra)\r\n", "n = int(input())\n\nperm = list(map(int, input().split()))\n\n\ncorrect = 0\nyes = 0\nseen = set()\nfor i, val in enumerate(perm):\n if i == val: correct += 1\n else:\n if (val, i) in seen:\n yes = 1\n seen.add((i, val))\n\nprint(min(correct+1+yes, n))", "n = int(input())\r\nai = list(map(int,input().split()))\r\n\r\ncnt = 0\r\ncnt1 = 0\r\nfor i in range(0,len(ai)):\r\n if ai[i] == i:\r\n cnt1 += 1\r\n cnt += 1\r\n\r\n#print(cnt)\r\n\r\nif cnt != n:\r\n for i in range(n):\r\n if ai[i] != i:\r\n if ai[ai[i]] == i:\r\n cnt += 2\r\n break\r\n\r\n if cnt == cnt1:\r\n cnt += 1\r\n\r\nprint(cnt)", "n = int(input())\r\na = list(map(int, input().split()))\r\nnum = []\r\nidx = []\r\ncnt = 0\r\nadd = 1\r\nfor i in range(n):\r\n if a[i] == i:\r\n cnt += 1\r\n elif a[a[i]] == i:\r\n add = 2\r\nif (cnt == n):\r\n print(cnt)\r\nelse:\r\n print(cnt + add)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncount = 0\r\nd = {}\r\nfor i in range(len(l)):\r\n\tif l[i] == i:\r\n\t\tcount = count + 1\r\n\telse:\r\n\t\td[i] = l[i]\r\nfor i in d:\r\n\tif d[i] in d:\r\n\t\tif d[d[i]] == i:\r\n\t\t\tprint(count+2)\r\n\t\t\texit()\r\n\t\t\tbreak\r\nif len(d):\r\n\tprint(count+1)\r\nelse:\r\n\tprint(count)", "#digl=['0','1','2','3','4','5','6','7','8','9']\r\nmod = 10 ** 9 + 7\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn=ii()\r\nl=il()\r\nflg=0\r\nc=0\r\nfor i,j in enumerate(l):\r\n if i==j:\r\n c+=1\r\n else:\r\n if l[j]==i:\r\n flg=1\r\nprint(c if c==n else [c+1,c+2][flg==1])", "# author: violist\n# created: 01.03.2022 12:04:49\n\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\ncnt = 0\nvalid = [0] * n\nfor i in range(n):\n if (a[i] == i):\n valid[i] = 1\n cnt += 1\nif (cnt == n):\n print(n)\n sys.exit()\nh = []\nused = 0\nfor i in range(n):\n if (not valid[i]):\n if (not valid[a[a[i]]]):\n if (i == a[a[i]]):\n used = 1\nprint(cnt + 2 if used else cnt + 1)\n", "n=int(input())\na=list(map(int, input().split()))\nc=0;\nans=0\nfor i in range(n):\n if a[i]==i:\n ans+=1\n elif c<2 :\n if i==a[a[i]]:\n c=2\n else:\n c=1\nprint(ans+c)\n", "n = int(input())\nx = list(map(int, input().split()))\nd = {}\nans = 0\nfor i in range(n):\n d[x[i]] = i\n if x[i] == i:\n ans += 1\nif ans == n:\n print(ans)\n exit()\nfor j in range(n):\n if d[d[x[j]]] == x[j] and j != x[j]:\n ans += 2\n print(ans)\n exit()\nprint(ans + 1)\n", "'''input\n3\n0 1 2\n'''\nn = int(input())\na = list(map(int, input().split()))\ns, t = 0, 0\nfor x in range(n):\n\tif a[x] == x:\n\t\ts += 1\n\telif t == 0 and a[a[x]] == x:\n\t\tt = 1\nprint(s + t + int(s != n))", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nf=0\r\nfor i in range(n):\r\n if a[i]==i:\r\n c+=1\r\nfor i in range(n):\r\n if a[i]!=i:\r\n if a[a[i]]==i:\r\n f=1\r\n break\r\nif f==0 and c!=n:\r\n c+=1\r\nelif f==1 and c!=n:\r\n c+=2\r\nprint(c)\r\n\r\n", "input()\r\na = [int(x) for x in input().split()]\r\nc = f = 0\r\nfor i in a:\r\n\tif a[i] == i:\r\n\t\tc = c + 1\r\n\telif a[a[i]] == i:\r\n\t\tf = 1\r\nans = min(len(a), c + f + 1)\r\nprint(ans)\r\n\t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncounter = 0\r\nx1 = 0\r\nx2 = 0\r\nfor i in range(len(l)):\r\n if l[i] == i:\r\n counter+=1\r\n else:\r\n if i == l[l[i]]:\r\n x1 = 2\r\nif x1 == 0:\r\n for j in range(len(l)):\r\n if j!=l[j] and j in l:\r\n x1 = 1\r\n break\r\n\r\nprint(counter+x1+x2)", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nc = 0\r\nt = 0\r\n\r\nfor i in range(n):\r\n if a[i] == i:\r\n c+=1\r\n elif i == a[a[i]]:\r\n t=1\r\nprint(c+t+int(c!=n))", "n=int(input())\r\na=[int(_) for _ in input().split()]\r\ncount,s=0,0\r\nfor i in range(n):\r\n if a[i]==i:\r\n count+=1\r\n elif s<2:\r\n if a[a[i]]==i:\r\n s=2\r\n else:\r\n s=1\r\nprint(count+s)", "n = int(input())\r\nperm = [int(s) for s in input().split()]\r\nvis = [0 for i in range(n)]\r\nans = 0\r\nswap = 1\r\nfor i in range(n):\r\n if perm[i] == i and vis[i] == 0:\r\n ans += 1\r\n\r\nfor i in range(n):\r\n vis[i] = 1\r\n if perm[perm[i]] == i and vis[perm[i]]==0:\r\n ans += 2\r\n swap = 0\r\n break\r\nif swap == 1 and ans < n:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "# @Chukamin ZZU_TRAIN\n\ndef main():\n n = int(input())\n data = list(map(int, input().split()))\n flat = {}\n flag = 0\n wrong = 0\n for i in range(n):\n if data[i] != i:\n flat[i] = data[i]\n if data[i] in flat and flat[data[i]] == i:\n flag = 1\n wrong += 1\n if wrong == 0:\n print(n)\n elif flag:\n print(n - wrong + 2)\n else:\n print(n - wrong + 1)\n \nif __name__ == '__main__':\n main()\n\n\t \t \t\t \t\t \t\t \t \t \t \t \t\t \t \t", "x=int(input())\r\ny=[int(p) for p in input().split()]\r\ntemp=0\r\nb=0\r\nc=0\r\nfor ind,val in enumerate(y):\r\n if(val==ind):\r\n b+=1\r\n elif(y[val]==ind):\r\n c=2\r\n elif(c==0):\r\n c=1 \r\n\r\nprint(b+c)\r\n \r\n\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nhave = sum(a[x] == x for x in range(n))\r\nans = have\r\nfor i in range(n):\r\n if i == a[i] or a[i] == a[a[i]]: continue\r\n ans = max(ans, have + 1)\r\n if a[a[i]] == i:\r\n ans = max(ans, have + 2)\r\nprint(ans)", "cnt = 0\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nhop = 1\r\nfor i in range(len(a)):\r\n if a[i] == i:\r\n cnt += 1\r\n else:\r\n if a[a[i]] == i:\r\n hop = 2\r\nif cnt == len(a):\r\n print(cnt)\r\nelse:\r\n print(cnt + hop)", "import sys\r\nlength = int(sys.stdin.readline())\r\narr = list(map(int, sys.stdin.readline().split()))\r\nvalue_to_index = {}\r\nindex_to_value = {}\r\ncnt = 0\r\ntemp = 0\r\nfinal = 0\r\nfor index, x in enumerate(arr):\r\n value_to_index[x] = index\r\n index_to_value[index] = x\r\n\r\nfor index, x in enumerate(arr):\r\n if index == x:\r\n cnt += 1\r\n else:\r\n try:\r\n z = value_to_index[index]\r\n if z == x:\r\n temp = 2\r\n else:\r\n temp = 1\r\n final = max(final, temp)\r\n except KeyError:\r\n pass\r\nprint(cnt + final)\r\n", "def solve (n,seq) :\r\n times = 0\r\n temp_fixed = 0\r\n done = 0\r\n \r\n s = list(enumerate(seq))\r\n \r\n for i,j in s :\r\n if i == j :\r\n times += 1\r\n elif done == 0 :\r\n if s[j][1] == i and j == s[j][0] :\r\n temp_fixed = 2\r\n done = 1\r\n elif s[j][1] == i or j == s[j][0] :\r\n temp_fixed = 1\r\n \r\n return times + temp_fixed\r\n \r\n \r\nn = int(input())\r\nseq = list(map(int,input().split()))\r\nprint (solve(n,seq)) \r\n \r\n ", "input()\r\na=list(map(int,input().split()))\r\nans=0\r\ncheck=0\r\ng={}\r\nfor i,val in enumerate(a):\r\n if a[i]==i:\r\n ans=ans+1 \r\n else:\r\n g[i]=val\r\n if val in g:\r\n if g[val]==i:\r\n check=2\r\n else:\r\n check=max(check,1)\r\nprint(ans+check)", "n = int(input())\r\nA = [*map(int,input().split())]\r\nx = y = 0\r\n\r\nfor i in range(n):\r\n if A[i] == i:\r\n x += 1\r\n elif A[A[i]] == i:\r\n y = 1\r\n\r\nprint(x + y + (x!=n))", "class CodeforcesTask347BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.permutation = []\n\n def read_input(self):\n self.n = int(input())\n self.permutation = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n fixed_points = sum([1 if self.permutation[x] == x else 0 for x in range(self.n)])\n if fixed_points == self.n:\n self.result = str(self.n)\n else:\n double = False\n for x in range(self.n):\n if self.permutation[x] != x:\n if self.permutation[self.permutation[x]] == x:\n double = True\n break\n if double:\n fixed_points += 2\n else:\n fixed_points += 1\n self.result = str(fixed_points)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask347BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\na = list(map(int, input().rstrip().split()))\nt = 0\nflag = 0\nfor i in range(n):\n if i == a[i]:\n t += 1\n else:\n if a[i] < n and a[a[i]] == i:\n flag = 1\nif t < n and flag == 1:\n t += 2\nelif t < n:\n t += 1\nprint(t)", "#!/usr/bin/python3\n\nn = int(input())\nlst = list(map(int, input().split()))\ngood = len([i for i in range(n) if lst[i] == i])\nbest = len([i for i in range(n) if i != lst[i] and lst[lst[i]] == i])\nvar = len([i for i in range(n) if i != lst[i] and lst[lst[i]] != lst[i]])\nprint(good + (2 if best else (var > 0)))\n", "n = int(input())\nl = list(map(int, input().split(' ')))\n\ncertos = 0\nachou_2 = False\nerrados = 0\n\nfor i in range(len(l)):\n\tif l[i] == i:\n\t\tcertos += 1\n\telse:\n\t\terrados += 1\n\n\t\tif l[l[i]] == i:\n\t\t\tachou_2 = True\n\nif errados > 1:\n\tif achou_2:\n\t\tcertos += 2\n\telse:\n\t\tcertos += 1\n\nprint(certos)\n# 1518733072890\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns=0\r\nt=0\r\nfor i in range(n):\r\n if i==a[i]:\r\n s=s+1\r\n elif a[a[i]]==i:\r\n t=1\r\nprint(s+(s<n)*(1+t))", "#python3\r\nimport sys, threading, os.path\r\nimport collections, heapq, math,bisect\r\nimport string\r\nfrom platform import python_version\r\nimport itertools\r\nsys.setrecursionlimit(10**6)\r\nthreading.stack_size(2**27) \r\n\r\ndef main():\r\n if os.path.exists('input.txt'):\r\n input = open('input.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n #--------------------------------INPUT---------------------------------\r\n n = int(input.readline())\r\n lis = list(map(int, input.readline().split()))\r\n count = 0\r\n for i,x in enumerate(lis):\r\n if x == i:\r\n count+=1\r\n gotit = False\r\n for i,x in enumerate(lis):\r\n if x != i:\r\n if lis[x]==i: \r\n count+=2\r\n gotit = True\r\n break\r\n if gotit:\r\n output = count\r\n elif count<n:\r\n output = count+1\r\n else:\r\n output = count\r\n #-------------------------------OUTPUT----------------------------------\r\n if os.path.exists('output.txt'):\r\n open('output.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n#threading.Thread(target=main).start()", "n = int(input())\na = list(map(int,input().split()))\n\ncount = 0\ngood =False\nfor i,j in enumerate(a):\n if i==j:\n count+=1\n elif a[j]==i:\n good=True\n\n\nif count ==n:\n print(n)\nelif good:\n print(min(n, count+2))\nelse:\n print(count+1)\n\n\n", "def newEra(lst):\r\n ans=0\r\n f=False\r\n for i in range(len(lst)):\r\n if i==lst[i]:\r\n ans+=1\r\n else:\r\n if lst[lst[i]]==i:\r\n f=True\r\n if ans==len(lst):\r\n return ans\r\n if f==True:\r\n return ans+2\r\n return ans+1\r\n\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(newEra(lst))\r\n" ]

[ "ans = 2e18\r\nnow = []\r\np = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]\r\n\r\ndef dfs(x):\r\n global ans\r\n if x == 1:\r\n res = 1\r\n for i in range(len(now)):\r\n res *= pow(p[i], now[i] - 1)\r\n if res > 1e18:\r\n return\r\n ans = min(ans, res)\r\n for i in range(x, 1, -1):\r\n if x % i == 0:\r\n now.append(i)\r\n dfs(x // i)\r\n now.pop()\r\n\r\nn = int(input())\r\ndfs(n)\r\nprint(ans)", "import math \r\ndef POW(x, n):\r\n if n == 0:\r\n return 1\r\n if n % 2:\r\n return POW(x, n - 1) * x\r\n res = POW(x, n / 2)\r\n return res * res;\r\n\r\ndef rec(n, k):\r\n ans = POW(p[k], n - 1);\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n ans = min(ans, rec(n // i, k + 1) * POW(p[k], i - 1))\r\n return ans\r\np = []\r\nn = int(input())\r\nfor i in range(2, 1001):\r\n k = int(math.sqrt(i))\r\n for j in range(2, k + 1):\r\n if i % j == 0:\r\n break\r\n else:\r\n p.append(i)\r\nprint(rec(n, 0))\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53]\r\nans = int(1e18)\r\n\r\ndef dfs(idx, cur, cnt, p):\r\n global ans\r\n if cnt > n or idx == 16:\r\n return\r\n if cnt == n:\r\n ans = cur\r\n return\r\n for i in range(1, p + 1):\r\n if cur * primes[idx] > ans:\r\n return\r\n cur *= primes[idx]\r\n dfs(idx + 1, cur, cnt * (i + 1), i)\r\n\r\ndfs(0, 1, 1, 63)\r\nprint(ans)", "dc={}\r\n\r\ndef slv (n, prime=2):\r\n if (n == 1):\r\n return 1\r\n \r\n global dc \r\n \r\n for i in range (2, 10000):\r\n if(i*i>prime):\r\n continue \r\n if(prime%i==0):\r\n return slv(n,prime+1)\r\n if ((n, prime) in dc):\r\n return dc[(n, prime)]\r\n \r\n ans = 10**50\r\n for i in range (2, n+1):\r\n if (n%i==0):\r\n ans=min(ans, prime**(i-1) * slv(n//i, prime+1))\r\n \r\n dc[(n,prime)]=ans\r\n return ans\r\n \r\nn = int(input())\r\nprint(slv(n))", "n = int(input())\n\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353]\nfactors = []\nfor p in primes:\n while n % p == 0:\n factors.append(p)\n n //= p\n if n < p:\n break\nif n > 1:\n factors.append(n)\n# print(factors)\nfactors.sort(reverse=True)\n\ndp = {tuple()}\nfor f in factors:\n ndp = set()\n for b in dp:\n buf = list(b)\n for i in range(len(buf)):\n ndp.add(tuple(sorted(buf[:i] + [buf[i] * f] + buf[i+1:], reverse=True)))\n buf.append(f)\n buf.sort(reverse=True)\n ndp.add(tuple(buf))\n dp = ndp\n\n# print(dp)\n \nresult = 1 << 1024\nfor combine in dp:\n test = 1\n for i, f in enumerate(combine):\n test *= primes[i] ** (f - 1)\n result = min(result, test)\nprint(result)", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]\r\n\r\n\r\ndef rec(x, i):\r\n res = primes[i]**(x - 1)\r\n for j in range(2, x):\r\n if x % j == 0:\r\n res = min(res, primes[i]**(x // j - 1) * rec(j, i + 1))\r\n\r\n return res\r\n\r\n\r\nprint(rec(n, 0))\r\n", "n = int(input())\r\ndef factorz(bc):\r\n fs = []; f = 2\r\n while f * f <= bc:\r\n if bc % f == 0:\r\n fs.append(f)\r\n bc //= f\r\n else:\r\n f += 1\r\n fs.append(bc)\r\n return fs\r\nps = factorz(n)\r\nrs = []\r\nfor i in range(2, n+1):\r\n if(n % i == 0): rs.append(i)\r\nway = []; rem = n\r\nprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41]\r\n# this will use at most 10 primes\r\ndef best(i, remi):\r\n if remi == 1: return 1\r\n m = 10**19\r\n for d in rs:\r\n if remi % d == 0:\r\n # i-th prime will use d\r\n mm = primes[i] ** (d-1) * best(i+1, remi // d)\r\n if mm < m:\r\n m = mm\r\n return m\r\nprint(best(0,n))", "def prime(x):\r\n for i in range(2,x):\r\n if(x%i==0):\r\n return False\r\n return True\r\ndef Solve(i,Cnt):\r\n if(i==len(L)):\r\n ans=1\r\n for j in range(9):\r\n ans*=P[j]**Cnt[j]\r\n Min[0]=min(Min[0],ans)\r\n return\r\n for j in range(9):\r\n if(Cnt[j]==0):\r\n Cnt[j]=L[i]-1\r\n Solve(i+1,Cnt)\r\n Cnt[j]=0\r\n break\r\n e=Cnt[j]\r\n t=Cnt[j]+1\r\n t*=L[i]\r\n t-=1\r\n Cnt[j]=t\r\n Solve(i+1,Cnt)\r\n Cnt[j]=e\r\n return\r\nn=int(input())\r\n\r\nL=[]\r\n\r\nfor i in range(2,n+1):\r\n if(n%i==0 and prime(i)):\r\n x=n\r\n while(x%i==0):\r\n x//=i\r\n L.append(i)\r\n\r\nL.sort(reverse=True)\r\nP=[2,3,5,7,11,13,17,19,23,29,31]\r\nMin=[10**18]\r\nSolve(0,[0,0,0,0,0,0,0,0,0])\r\nprint(Min[0])\r\n", "\"\"\"\r\n @author : quynx\r\n @created : 10/03/2021 20:35:11 +07\r\n @filename : 27E\r\n @source : https://codeforces.com/problemset/problem/27/E\r\n\"\"\"\r\nfrom math import sqrt\r\n\r\ndef isPrime(n):\r\n for i in range(2, int(sqrt(n))+1):\r\n if n%i==0:\r\n return False\r\n return n > 1\r\n\r\ndef main():\r\n prime = []\r\n i = 2\r\n while len(prime) < 10:\r\n if isPrime(i):\r\n prime.append(i)\r\n i += 1\r\n dp = [[int(1e18+10) for __ in range(1001)] for _ in range(15)]\r\n n = int(input())\r\n for i in range(10):\r\n dp[i][1] = 1\r\n for j in range(2,n+1):\r\n primePower = 1\r\n for k in range(j):\r\n if j % (k+1):\r\n primePower *= prime[i]\r\n continue\r\n if i:\r\n dp[i][j] = min([dp[i][j], dp[i-1][j//(k+1)]*primePower])\r\n else:\r\n dp[i][j] = primePower\r\n primePower *= prime[i]\r\n print(dp[9][n])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n=int(input())\r\np = [2, 3, 5, 7, 11, 13, 17, 19, 23]\r\n\r\ndef f(n, sig):\r\n if n == 1:\r\n return 1\r\n actual = 10**20\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n actual = min(actual, p[sig] ** (i - 1) * f(n // i, sig + 1))\r\n return actual\r\n \r\nprint(f(n, 0))\r\n", "def main():\n def f(x, i, aa):\n if x == 1:\n return 1\n bb = [q for q in aa if not x % q]\n p = (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43)[i]\n return min(p ** (d - 1) * f(x // d, i + 1, bb) for d in bb)\n\n n = int(input())\n print(f(n, 0, [d for d in range(2, n + 1) if not n % d]))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\n\r\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\n\r\nans = 1000000000000000000\r\n\r\ndef dfs(idx, cur, cnt, p):\r\n global ans\r\n if cnt > n or idx == 15:\r\n return\r\n if cnt == n:\r\n ans = cur\r\n return\r\n for i in range(1, p + 1):\r\n t = cur * primes[idx]\r\n if t > ans:\r\n return\r\n cur = t\r\n dfs(idx + 1, cur, cnt * (i + 1), i)\r\n\r\ndfs(0, 1, 1, 59)\r\nprint(ans)\r\n\r\n", "# https://codeforces.com/problemset/problem/27/E\n\nfrom itertools import count\n\n\nMAX = 10 ** 18\n\n\ndef gen_primes(max_size):\n result = []\n for i in count(2):\n if any(i % p == 0 for p in result):\n continue\n result.append(i)\n if len(result) >= max_size:\n return result\n\n\ndef solve(value):\n primes = gen_primes(10)\n\n def dfs(n, level):\n if n == 1:\n return 1\n result = MAX\n p = primes[level]\n for d in range(2, n + 1):\n front = p ** (d - 1)\n if MAX < front:\n break\n if n % d == 0:\n result = min(result, front * dfs(n // d, level + 1))\n return result\n\n return dfs(value, 0)\n\n\nif __name__ == '__main__':\n value = int(input())\n print(solve(value))\n", "PRIMOS = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]\n\ndef solucion(n, prim_i=0, numero=1, divisores=1):\n if divisores == n:\n return numero\n sol = 10**18\n primo = PRIMOS[prim_i]\n for i in range(1, 64):\n if numero * primo > sol:\n break\n if divisores * (i+1) > n:\n break\n numero *= primo\n aux = solucion(n, prim_i+1, numero, divisores * (i+1))\n if aux < sol:\n sol = aux\n return sol\n\n\n\nn = int(input())\nif n == 1:\n print(1)\nelse:\n print(solucion(n))\n\n", "prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47]\r\ndp = [[10**18 for i in range(15)] for j in range(1006)]\r\nfor pw in range(64):\r\n\tdp[pw + 1][0] = 2**pw\r\nfor idx in range(1,13):\r\n\tfor i in range(1005):\r\n\t\tfor pw in range(64):\r\n\t\t\tif(i % (pw + 1)==0):\r\n\t\t\t\tdp[i][idx] = min(dp[i][idx],dp[i // (pw + 1)][idx-1] *(prime[idx]**pw))\r\nprint(dp[int(input())][12])", "n=int(input())\r\np=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29]\r\nans=int(1e19)\r\ndef calc(i, cur, val):\r\n\tglobal ans\r\n\tif cur == n:\r\n\t\t\r\n\t\tans = min(ans, val)\r\n\t\treturn\r\n\tif cur>n or i>10:\r\n\t\treturn\r\n\tt = p[i]\r\n\t\r\n\tfor j in range(1, 61):\r\n\t\tif ans >= t*val:\r\n\t\t\tcalc(i+1, cur*(j+1), val*t)\r\n\t\tt = t*p[i]\r\ncalc(0,1,1)\r\nprint(ans);\r\n\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\ny=[2,3,5,7,11,13,17,23,29,31]\r\ndef dfs(n,pos):\r\n v=[1,10**18][n>1]\r\n for i in range(2,n+1):\r\n if n%i==0:\r\n v=min(v,y[pos]**(i-1)*dfs(n//i,pos+1))\r\n return v\r\nprint(dfs(n,0))", "import sys\r\nlist1 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997]\r\ninpt = int(input())\r\na = 1\r\nif inpt == 8:\r\n print(24)\r\n sys.exit()\r\ndef prime_factorization(num):\r\n list2 = []\r\n for i in list1:\r\n while num%i == 0:\r\n list2.append(i)\r\n num=num/i\r\n return list2\r\nprimefactor = prime_factorization(inpt)\r\nfor i in range(len(primefactor)):\r\n a *= list1[i]**(primefactor[-(i+1)]-1)\r\nprint(a)", "n=int(input())\n\npr=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61]\npprr=set(pr)\n\ndp=[[0 for i in range(9)] for j in range(1005)]\n\ndef it(n,pref):\n global dp\n if dp[n][pref]>0:\n return dp[n][pref]\n if n in pprr or pref==0:\n dp[n][pref]=2**(n-1)\n return dp[n][pref]\n dp[n][pref]=it(n,pref-1)\n d=2\n while d*d<=n:\n if n%d==0:\n dd=d\n t=pr[pref]**(dd-1)*it(n//dd,pref-1)\n dp[n][pref]=min(t,dp[n][pref])\n dd=n//d\n t=pr[pref]**(dd-1)*it(n//dd,pref-1)\n dp[n][pref]=min(t,dp[n][pref])\n d+=1\n return dp[n][pref]\n\n\nprint(it(n,8))\n \n \n", "a=[0]*50010\r\nv=[0]*50010\r\npri=[0]*50010\r\ntot=0\r\nn=int(input())\r\nfor i in range(2,n+1):\r\n if not v[i]:\r\n tot+=1\r\n pri[tot]=i\r\n for j in range(1,tot+1):\r\n if i*pri[j]>n:\r\n break\r\n v[i*pri[j]]=1\r\n if i%pri[j]==0:\r\n break\r\nans=10**1000\r\ndef dfs(dep,tmp,num,up):\r\n global ans\r\n if num>n or dep>=18:\r\n return\r\n if num==n and ans>tmp:\r\n ans=tmp\r\n return\r\n for i in range(1,up+1):\r\n if tmp*pri[dep]>ans:\r\n break\r\n tmp*=pri[dep]\r\n dfs(dep+1,tmp,num*(i+1),up+1)\r\n return\r\ndfs(1,1,1,64)\r\nprint(ans)\r\n", "p=[2,3,5,7,11,13,17,19,23,29]\r\nN=0\r\nans=1000000000000000000\r\n\r\ndef dfs(i,x,n):\r\n global ans\r\n if n>N: return\r\n if n==N and x<ans: ans=x\r\n for j in range(1,61):\r\n if ans<=x*p[i]: return\r\n x*=p[i]\r\n dfs(i+1,x, n*(j+1))\r\n\r\nN=int(input())\r\ndfs(0,1,1)\r\nprint(ans)\r\n", "n = int(input())\r\ng = lambda n: [q for q in range(2, n + 1) if n % q == 0]\r\nt = {k: g(k) for k in g(n)}\r\np = [2, 3, 5, 7, 11, 13, 17, 19, 23]\r\ndef f(i, k): return min(f(i + 1, k // s) * p[i] ** (s - 1) for s in t[k]) if k > 1 else 1\r\nprint(f(0, n))", "## KALAM\np = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]\nn = int(input())\ndp = []\nfor i in range(n + 1):\n t = []\n for j in range(len(p)):\n t.append(0)\n dp.append(t)\n\nfor i in range(10):\n dp[1][i] = 1\nfor i in range(2 , n + 1):\n dp[i][0] = p[0] ** (i - 1)\n for j in range(1 , len(p)):\n dp[i][j] = dp[i][j - 1]\n for k in range(2 , i + 1):\n if(i % k > 0):\n continue\n dp[i][j] = min(dp[i][j] , dp[i // k][j - 1] * (p[j] ** (k - 1)))\nA = dp[n][0]\nfor i in range(len(p)):\n A = min(A , dp[n][i])\nprint(A)\n", "ans = [0, 1, 2, 4, 6, 16, 12, 64, 24, 36, 48, 1024, 60, 14096, 192, 144, 120, 65536, 180, 262144, 240, 576, 3072, 4194304, 360, 1296, 12288, 900, 960, 268435456, 720, 1073741824, 840, 9216, 196608, 5184, 1260, 68719476736, 786432, 36864, 1680, 1099511627776, 2880, 4398046511104, 15360, 3600, 12582912, 70368744177664, 2520, 46656, 6480, 589824, 61440, 4503599627370496, 6300, 82944, 6720, 2359296, 805306368, 288230376151711744, 5040, 1152921504606846976, 3221225472, 14400, 7560, 331776, 46080, 73786976294838206464, 983040, 37748736, 25920, 1180591620717411303424, 10080, 4722366482869645213696, 206158430208, 32400, 3932160, 746496, 184320, 302231454903657293676544, 15120, 44100, 3298534883328, 4835703278458516698824704, 20160, 5308416, 13194139533312, 2415919104, 107520, 309485009821345068724781056, 25200, 2985984, 62914560, 9663676416, 211106232532992, 21233664, 27720, 79228162514264337593543950336, 233280, 230400, 45360, 1267650600228229401496703205376, 2949120, 5070602400912917605986812821504, 430080, 129600, 13510798882111488, 81129638414606681695789005144064, 50400, 324518553658426726783156020576256, 414720, 618475290624, 60480, 5192296858534827628530496329220096, 11796480, 339738624, 4026531840, 921600, 864691128455135232, 47775744, 55440, 60466176, 3458764513820540928, 9895604649984, 16106127360, 810000, 100800, 85070591730234615865843651857942052864, 83160, 39582418599936, 1658880, 1361129467683753853853498429727072845824, 322560, 191102976, 221360928884514619392, 176400, 6881280, 87112285931760246646623899502532662132736, 188743680, 348449143727040986586495598010130648530944, 181440, 633318697598976, 3541774862152233910272, 241864704, 110880, 21743271936, 14167099448608935641088, 1166400, 1030792151040, 356811923176489970264571492362373784095686656, 226800, 1427247692705959881058285969449495136382746624, 27525120, 14745600, 3732480, 86973087744, 1290240, 91343852333181432387730302044767688728495783936, 906694364710971881029632, 40532396646334464, 166320, 3057647616, 352800, 5846006549323611672814739330865132078623730171904, 16492674416640, 2073600, 14507109835375550096474112, 93536104789177786765035829293842113257979682750464, 221760, 2176782336, 26542080, 58982400, 65970697666560, 5986310706507378352962293074805895248510699696029696, 12079595520, 3240000, 967680, 2594073385365405696, 928455029464035206174343168, 383123885216472214589586756787577295904684780545900544, 277200, 1532495540865888858358347027150309183618739122183602176, 14929920, 10376293541461622784, 440401920, 5566277615616, 48318382080, 3869835264, 1055531162664960, 705600, 106168320, 1569275433846670190958947355801916604025588861116008628224, 332640, 6277101735386680763835789423207666416102355444464034512896, 237684487542793012780631851008, 8294400, 1632960, 100433627766186892221372630771322662657637687111424552206336, 1612800, 401734511064747568885490523085290650630550748445698208825344, 498960, 664082786653543858176, 3802951800684688204490109616128, 195689447424, 20643840, 89060441849856, 15211807202738752817960438464512, 943718400, 3870720, 15479341056, 907200, 1645504557321206042154969182557350504982735865633579863348609024, 67553994410557440, 10625324586456701730816, 243388915243820045087367015432192, 356241767399424, 554400, 782757789696, 973555660975280180349468061728768, 42501298345826806923264, 2903040, 34828517376, 3092376453120, 6739986666787659948666753771754907668409286105635143120275902562304, 665280, 1587600, 15576890575604482885591488987660288, 107839786668602559178668060348078522694548577690162289924414440996864, 82575360, 431359146674410236714672241392314090778194310760649159697657763987456, 1698693120, 18662400, 28185722880, 6901746346790563787434755862277025452451108972170386555162524223799296, 6451200, 5699868278390784, 4323455642275676160, 2720083094132915643088896, 238878720, 441711766194596082395824375185729628956870974218904739530401550323154944, 720720, 1766847064778384329583297500742918515827483896875618958121606201292619776, 302330880, 2822400, 17293822569102704640, 29160000, 49478023249920, 139314069504, 112742891520, 43521329506126650289422336, 5670000, 1809251394333065553493296640760748560207343510400633813116524750123642650624, 1108800, 247669456896, 255211775190703847597530955573826158592, 132710400, 1081080, 115792089237316195423570985008687907853269984665640564039457584007913129639936, 197912092999680, 50096498540544, 11612160, 60397977600, 4083388403051261561560495289181218537472, 7410693711188236507108543040556026102609279018600996098525285376506440296955904, 3548160, 364791569817010176, 955514880, 2785365088392105618523029504, 1106804644422573096960, 474284397516047136454946754595585670566993857190463750305618264096412179005177856, 1940400, 1897137590064188545819787018382342682267975428761855001222473056385648716020711424, 61931520, 74649600, 261336857795280739939871698507597986398208, 51840000, 1321205760, 121416805764108066932466369176469931665150427440758720078238275608681517825325531136, 1045347431181122959759486794030391945592832, 241591910400, 1995840, 1942668892225729070919461906823518906642406839052139521251812409738904285205208498176, 3166593487994880, 7770675568902916283677847627294075626569627356208558085007249638955617140820833992704, 17708874310761169551360, 530841600, 1209323520, 801543976648704, 1441440, 2821109907456, 108716359680, 713053462628379038341895553024, 70835497243044678205440, 7957171782556586274486115970349133441607298412757563479047423630290551952200534008528896, 8164800, 23346660468288651264, 7215545057280, 11289600, 1070435769529469910793714477087121352287059968, 2229025112064, 2494800, 3206175906594816, 4281743078117879643174857908348485409148239872, 11408855402054064613470328848384, 247726080, 93386641873154605056, 103219200, 130370302485407109521180524058200202307293977194619920040712988758680403184853549195737432064, 26127360, 45635421608216258453881315393536, 434865438720, 2085924839766513752338888384931203236916703635113918720651407820138886450957656787131798913024, 14192640, 8343699359066055009355553539724812947666814540455674882605631280555545803830627148527195652096, 274031556999544297163190906134303066185487351808, 6350400, 4533471823554859405148160, 133499189745056880149688856635597007162669032647290798121690100488888732861290034376435130433536, 202661983231672320, 15850845241344, 2162160, 730166745731460135262101046296576, 15288238080, 11284439629824, 3880800, 207360000, 17538019647970835018444217992595396235871190515712, 2920666982925840541048404185186304, 115448720916480, 51298814505517056, 14515200, 2187250724783011924372502227117621365353169430893212436425770606409952999199375923223513177023053824, 72535549176877750482370560, 15461882265600, 280608314367533360295107487881526339773939048251392, 5976745079881894723584, 2882880, 139984046386112763159840142535527767382602843577165595931249318810236991948760059086304843329475444736, 10883911680, 46730671726813448656774466962980864, 185794560, 63403380965376, 412876800, 729000000, 461794883665920, 8493465600, 17958932119522135058886879224417685745532099088089088, 143343663499379469475676305956380433799785311823017570233599302461682679755530300504376159569382855409664, 84557168640, 573374653997517877902705223825521735199141247292070280934397209846730719022121202017504638277531421638656, 22680000, 45158400, 10644480, 9173994463960286046443283581208347763186259956673124494950355357547691504353939232280074212440502746218496, 12970366926827028480, 95627921278110315577344, 4642275147320176030871715840, 1194393600, 1149371655649416643768760270362731887714054341637701632, 587135645693458306972370149197334256843920637227079967676822742883052256278652110865924749596192175757983744, 3603600, 101559956668416, 4597486622597666575075041081450927550856217366550806528, 1511654400, 104509440, 382511685112441262309376, 51881467707308113920, 150306725297525326584926758194517569752043683130132471725266622178061377607334940381676735896625196994043838464, 3963617280, 247390116249600, 27831388078080, 3283124128353091584, 338228674560, 9619630419041620901435312524449124464130795720328478190417063819395928166869436184427311097384012607618805661696, 19349176320, 39690000, 7388718138654720, 142657607172096, 7761600, 615656346818663737691860001564743965704370926101022604186692084441339402679643915803347910232576806887603562348544, 743178240, 765635325572111542792592866721478475776, 4707826301540010572876842067405749812076766583348025884672, 9850501549098619803069760025035903451269934817616361666987073351061430442874302652853566563721228910201656997576704, 4324320, 466560000, 18831305206160042291507368269622999248307066333392103538688, 989560464998400, 1188422437713965063903159255040, 630432099142311667396464641602297820881275828327447146687172694467931548343955369782628260078158650252906047844909056, 58060800, 180551034077184, 17962560, 12250165209153784684681485867543655612416, 301300883298560676664117892313967987972913061334273656619008, 24480747847196240787800064, 17740800, 161390617380431786853494948250188242145606612051826469551916209783790476376052574664352834580008614464743948248296718336, 1205203533194242706656471569255871951891652245337094626476032, 4777574400, 6486480, 2582249878086908589655919172003011874329705792829223512830659356540647622016841194629645353280137831435903171972747493376, 3320413933267719290880, 570630428688384, 19014759003423441022450548080640, 21344400, 978447237120, 4057816381784064, 227082240, 661055968790248598951915308032771039828404682964281219284648795274405791236311345825189210439715284847591212025023358304256, 445302209249280, 784010573385842219819615095522793959194624, 76059036013693764089802192322560, 210119944214597861376, 6606028800, 391691965555139852604801024, 42577920, 3136042293543368879278460382091175836778496, 77396705280, 676921312041214565326761275425557544784286395355423968547480366360991530225982818124993751490268451683933401113623918903558144, 9979200, 2707685248164858261307045101702230179137145581421695874189921465443966120903931272499975005961073806735733604454495675614232576, 4936513671963618126464907547672051514948207596900739590045827072, 15832967439974400, 472877960873902080, 3317760000, 53126622932283508654080, 840479776858391445504, 1216944576219100225436835077160960, 6046617600, 1781208836997120, 2772669694120814859578414184143083703436437075375816575170479580614621307805625623039974406104139578097391210961403571828974157824, 7207200, 11090678776483259438313656736572334813745748301503266300681918322458485231222502492159897624416558312389564843845614287315896631296, 3913788948480, 543581798400, 4867778304876400901747340308643840, 1624959306694656, 212506491729134034616320, 709803441694928604052074031140629428079727891296209043243642772637343054798240159498233447962659731992932150006119314388217384402944, 31933440, 57153600, 174142586880, 11356855067118857664833184498250070849275646260739344691898284362197488876771842551971735167402555711886914400097909030211478150447104, 21646635171840, 25068285795528950566707265536, 20219960000362979846000261315264723005227858316905429360827707686912, 3211307308588409732381143431261364056861179904, 8648640, 726838724295606890549323807888004534353641360687318060281490199180639288113397923326191050713763565560762521606266177933534601628614656, 17463600, 64925062108545024, 77884452878022414427957444938301440, 12845229234353638929524573725045456227444719616, 323519360005807677536004181044235568083645733070486869773243322990592, 1866240000, 908328960, 186070713419675363980626894819329160794532188335953423432061490990243657757029868371504908982723472783555205531204141550984858016925351936, 1294077440023230710144016724176942272334582932281947479092973291962368, 722534400, 11890851840, 2977131414714805823690030317109266572712515013375254774912983855843898524112477893944078543723575564536883288499266264815757728270805630976, 130636800, 11908525658859223294760121268437066290850060053501019099651935423375594096449911575776314174894302258147533153997065059263030913083222523904, 253671505920, 2174327193600, 20705239040371691362304267586831076357353326916511159665487572671397888, 190536410541747572716161940294993060653600960856016305594430966774009505543198585212421026798308836130360530463953040948208494609331560382464, 70963200, 53790705718937052512256, 28499341391953920, 822094670998632891489572718402909198556462055424, 30264189495929733120, 259700248434180096, 13600415470664578215444480, 13271040000, 1672151040, 1013309916158361600, 1325135298583788247187473125557188886870612922656714218591204650969464832, 780437137578998057845399307448291576437149535666242787714789239906342934704941405030076525765872992789956732780351655723861993919822071326572544, 10810800, 36520347436056576, 5300541194335152988749892502228755547482451690626856874364818603877859328, 76441190400, 2116316160, 6417481163655411345077059977216, 31046400, 199791907220223502808422222706762643567910281130558153654986045416023791284464999687699590596063486154228923591770023865308670443474450259602571264, 121056757983718932480, 52614058943912505055332653977786188707613571547136, 204120000, 3196670515523576044934755563308202297086564498088930458479776726656380660551439995003193449537015778467662777468320381844938727095591204153641140224, 346346162749440, 11555266180939776, 696570347520, 101606400, 1014686023680, 860651291502992840196096, 217606647530633251447111680, 818347651974035467503297424206899788054160511510766197370822842024033449101168638720817523081476039287721671031890017752304314136471348263332131897344, 62370000, 841824943102600080885322463644579019321817144754176, 5427754182999196660479889922282245680622030531201901439349574250370927951872, 13093562431584567480052758787310396608866568184172259157933165472384535185618698219533080369303616628603546736510240284036869026183541572213314110357504, 14414400, 102679698618486581521232959635456, 1238347284480, 54419558400, 1276058875953519237987654777869130792960, 837987995621412318723376562387865382967460363787024586107722590232610251879596686050117143635431464230626991136655378178359617675746660621652103062880256, 928972800, 3442605166011971360784384, 17297280, 2890137600, 347376267711948586270712955026063723559809953996921692118372752023739388919808, 410718794473946326084931838541824, 1385384650997760, 4155203974946881536, 250482492702720, 53876796358566405176660637673253057236596297264267264, 127733760, 3432398830065304857490950399540696608634717650071652704697231729592771591698828026061279820330727277488648155695740429018560993999858321906287014145557528576, 422785843200, 13729595320261219429963801598162786434538870600286610818788926918371086366795312104245119281322909109954592622782961716074243975999433287625148056582230114304, 20416942015256307807802476445906092687360, 158760000, 22232081133564709521325629121668078307827837055802988295575856129519320890867712, 46221064723759104, 46126080, 131621703842267136, 1823957849085050880, 64851834634135142400, 6688604160, 584325558976905216, 13926825441960528092615147520, 6571500711583141217358909416669184, 7747632510958011678720, 3448114966948249931306280811088195663142163024913104896, 1422853192548141409364840263786757011700981571571391250916854792289236537015533568, 11664000000, 25225200, 3599131035634557106248430806148785487095757694641533306480604458089470064537190296255232548883112685719936728506816716098566612844395439751206812144692131084107776, 5691412770192565637459361055147028046803926286285565003667419169156946148062134272, 13792459867792999725225123244352782652568652099652419584, 681246720, 26286002846332564869435637666676736, 522547200, 230344386280611654799899571593522271174128492457058131614758685317726084130380178960334883128519211886075950624436269830308263222041308144077235977260296389382897664, 1306684288976403699699358492537989931991040, 259407338536540569600, 362880000, 103997395628457984, 14533263360, 220326730624766167090200576, 364250417292324200797399107529409794995451282322276160234714826826044553475976593408, 139156940390400, 5226737155905614798797433970151959727964160, 235872651551346334515097161311766805682307576276027526773512893765351510149509303255382920323603672971341773439422740306235661539370299539535089640714543502728087207936, 1691143372800, 2337302235907620864, 25945920, 96745881600, 5828006676677187212758385720470556719927220517156418563755437229216712855615625494528, 15095849699286165408966218323953075563667684881665761713504825200982496649568595408344506900710635070165873500123055379599082338519699170530245737005730784174597581307904, 22166154415964160, 420576045541321037910970202666827776, 23312026706708748851033542881882226879708882068625674255021748916866851422462501978112, 85377600, 123962120175328186859520, 966134380754314586173837972732996836074731832426608749664308812862879785572390106134048441645480644490615904007875544294341269665260746913935727168366770187174245203705856, 3715891200, 3864537523017258344695351890931987344298927329706434998657235251451519142289560424536193766581922577962463616031502177177365078661042987655742908673467080748696980814823424, 8465264640, 14123478904620031718630526202217249436230299750044077654016, 4007719883243520, 212336640000, 21621600, 247330401473104534060502521019647190035131349101211839914063056092897225106531867170316401061243044989597671426016139339351365034306751209967546155101893167916606772148699136, 14105549537280, 56493915618480126874522104808868997744921199000176310616064, 761014517760, 3525227689996258673443209216, 3565267313141895191709477765120, 265933054396600418304, 495848480701312747438080, 406425600, 23871515347669758823458347911047400324821895238272690437142270890871655856601602025586688, 253266331108459042877954581524118722595974501479640924072000569439126758509088631982403994686712878069348015540240526683495797795130113239006767262824338603946605334680267915264, 89812800, 415989582513831936, 116733302341443256320, 903902649895682029992353676941903963918739184002820969857024, 64939905515520, 16209045190941378744189093217543598246142368094697019140608036444104112544581672446873855659949624196438272994575393707743731058888327247296433104820757670652582741419537146576896, 124185600, 29859840000, 5352178847647349553968572385435606761435299840, 3615610599582728119969414707767615855674956736011283879428096, 11145125560320, 1037378892220248239628101965922790287753111558060609224998914332422663202853227036599926762236775948572049471652825197295598787768852943826971718708528490921765295450850377380921344, 32432400, 4149515568880992958512407863691161151012446232242436899995657329690652811412908146399707048947103794288197886611300789182395151075411775307886874834113963687061181803401509523685376, 16030879532974080, 16602069666338596454400, 21408715390589398215874289541742427045741199360, 37791360000, 57044277010270323067351644241920, 265568996408383549344794103276234313664796558863515961599722069100201779930426121369581251132614642834444664743123250507673289668826353619704759989383293675971915635417696609515864064, 2724986880, 4892236185600, 466933209365773025280, 37396835774521933824, 1135411200, 16996415770136547158066822609678996074546979767265021542382212422412913915547271767653200072487337141404458543559888032491090538804886631661104639320530795262202600666732583009015300096, 391110907456221328563541572174600606921881931583859760122138966276041209554560647587212296192, 2226511046246400, 287400960, 271942652322184754529069161754863937192751676276240344678115398758606622648756348282451201159797394262471336696958208519857448620878186106577674229128492724195241610667721328144244801536, 228177108041081292269406576967680, 1087770609288739018116276647019455748771006705104961378712461595034426490595025393129804804639189577049885346787832834079429794483512744426310696916513970896780966442670885312576979206144, 3044058071040, 46242201600, 6257774519299541257016665154793609710750110905341756161954223460416659352872970361395396739072, 225614572159760555100365389824, 184504320, 1944810000, 25031098077198165028066660619174438843000443621367024647816893841666637411491881445581586956288, 386983526400, 1370157784997721485815954530671515330927436759040, 2958148142320582656, 69854400, 4455508415646675018204269146191690746966043464109921807206242693261010905477224010259680479802120507596330380442963288389344438204468201170168614570041224793214838549179946240315306828365824, 31734302764884015836037120, 14809541015890854379394722643016154544844622790702218770137481216, 400497569235170640449066569906791021488007097941872394365070301466666198583870103129305391300608, 6890717930149003885133335800493306281984, 1418633882621706240, 46656000000, 79254226206720, 265633114661417543270400, 36756720, 4562440617622195218641171605700291324893228507248559930579192517899275167208677386505912811317371399778642309573594407310688704721375437998252661319722214188251994674360264950082874192246603776, 3650833728657300676310505231482880, 18249762470488780874564686422801165299572914028994239722316770071597100668834709546023651245269485599114569238294377629242754818885501751993010645278888856753007978697441059800331496768986415104, 107017666560, 8906044184985600, 56422198149120, 291996199527820493993034982764818644793166624463907835557068321145553610701355352736378419924311769585833107812710042067884077102168028031888170324462221708048127659159056956805303948303782641664, 50450400, 17019715481382426771456, 1451520000, 19568944742400, 87690098239854175092221089962976981179355952578560, 18687756769780511615554238896948393266762663965690101475652372553315431084886742575128218875155953253493318900013442692344580934538753794040842900765582189315080170186179645235539452691442089066496, 14603334914629202705242020925931520, 110251486882384062162133372807892900511744, 1039038488248320, 1062532458645670173081600, 256494072527585280, 1196016433265952743395471289404697169072810493804166494441751843412187589432751524808206008009981008223572409600860332310053179810480242818613945648997260116165130891915497295074524972252293700255744, 159667200, 4784065733063810973581885157618788676291241975216665977767007373648750357731006099232824032039924032894289638403441329240212719241920971274455782595989040464660523567661989180298099889009174801022976, 6561752174349035773117506681352864096059508292679637309277311819229858997598127769670539531069161472, 870712934400, 507748844238144253376593920, 119439360000, 108233175859200, 8423789045905096704, 1403041571837666801475537439407631698869695241256960, 60659880001088939538000783945794169015683574950716288082483123060736, 29883725399409473617920, 68078861925529707085824, 43243200, 19595533242629369747791401605606558418088927130487463844933662202465281465266200982457647235235528838735010358900495684567911298014908298340170885513171109743249504533143507682501017145381579984990109696, 419952139158338289479520427606583302147808530731496787793747956430710975846280177258914529988426334208, 192099600, 76187381760, 313528531882069915964662425689704934689422834087799421518938595239444503444259215719322355763768461419760165742407930953086580768238532773442734168210737755891992072530296122920016274326105279759841755136, 233653358634067243283872334814904320, 57757330472898702105693539794944, 2043740160, 970558080017423032608012543132706704250937199211460609319729968971776, 317016904826880, 20065826040452474621738395244141115820123061381619162977212070095324448220432589806036630768881181530864650607514107580997541169167266097500334986765487216377087492641938951866881041556870737904629872328704, 4541644800, 7056095160472579978376535859705145632751616, 5103000000, 3882232320069692130432050172530826817003748796845842437278919875887104, 4156153952993280, 2393397489569403764736, 59454259200, 5136851466355833503165029182500125649951503713694505722166289944403058744430742990345377476833582471901350555523611540735370539306820120960085756611964727392534398116336371677921546638558908903585247316148224, 89794660597610675294434396122088428727660495440445440, 914457600, 430030990498138408427028917869141301399355935469052710700797907385048039266590901513128478708148566228992, 28224380641890319913506143438820582531006464, 930128855040, 47330370277129322496, 1720123961992553633708115671476565205597423741876210842803191629540192157066363606052513914832594264915968, 62115717121115074086912802760493229072059980749533478996462718014193664, 249480000, 5260135901548373507240989882880128665550339802823173859498280903068732154297080822113666536277588451226982968856178217713019432250183803863127814770651880849955223671128444598191663757884322717271293251735781376, 496742400, 26623333280885243904, 138378240, 142496706959769600, 27521983391880858139329850743625043289558779870019373484851066072643074513061817696840222637321508238655488, 924117287566379233691096636719104, 90792568487789199360, 1346594790796383617853693410017312938380886989522732508031559911185595431500052690461098633287062643514107640027181623734532974656047053788960720581286881497588537259808881817137065922018386615621451072444360032256, 478139606390551577886720, 68002077353322891077222400, 32495926031241232216102010880, 33695156183620386816, 8360755200, 151165440000, 5746858278247083218843801351813659438570271708188508160, 3975405895751364741562419376671566660611838767970142655773613952908394496, 1761406937080374920917110447592002770531761911681239903030468228649156768835956332597774248788576527273951232, 1378913065775496824682182051857728448902028277271278088224317349054049721856053955032165000485952146958446223387833982704161766047792183079895777875237766653530662154044294980748355504146827894396365898183024673030144, 61261200, 3696469150265516934764386546876416, 507799783342080, 15901623583005458966249677506686266642447355071880570623094455811633577984, 22987433112988332875375205407254637754281086832754032640, 13589544960000, 10581580800, 353001744838527187118638605275578482918919238981447190585425241357836728795149812488234240124403749621362233187285499572265412108234798868453319136060868263303849511435339515071579009061587940965469669934854316295716864, 1149603840, 341510400, 1912558425562206311546880, 189321481108517289984, 363170273951156797440, 22592111669665739975592870737637022906810831294812620197467215446901550642889587999246991367961839975767182923986271972624986374927027127581012424707895568851446368731861728964581056579941628221790058875830676242925879296, 450920175892575979754780274583552709256131049390397415175799866534184132822004821145030207689875590982131515392, 1428840000, 43599790080, 4357047163233901253492736, 1731730813747200, 1445895146858607358437943727208769466035893202868007692637901788601699241144933631951807447549557758449099707135121406247999127995329736165184795181305316406492567598839150653733187621116264206194563768053163279547256274944, 194819716546560, 3482851737600, 16415620641765457920, 23134322349737717735007099635340311456574291245888123082206428617627187858318938111228919160792924135185595314161942499967986047925275778642956722900885062503881081581426410459731001937860227299113020288850612472756100399104, 3720515420160, 28901765777295687591430290881352276511750619136, 28858891257124862704305937573347373392392387160985434571251191458187784500608308553281933292152037822856416985088, 1088033237653166257235558400, 135444234240, 59143506404248270956230184750022656, 436590000, 5922386521532855740161817506647119732883018558947359509044845726112560091729648156474603305162988578607512400425457279991804428268870599332596921062626576000993556884845161077691136496092218188572933193945756793025561702170624, 66498463247892480, 16283262548997589981439669766846737041866091593605704318048722751112783855616, 713288035860480, 115607063109182750365721163525409106047002476544, 100900800, 379032737378102767370356320425415662904513187772631008578870126471203845870697482014374611530431269030880793627229265919475483409207718357286202948008100864063587640630090308972232735749901964068667724412528434753635948938919936, 1846969040455991213075580004694231897113112778303067812560076253324018208038931747410043730697730420662810687045632, 6191736422400, 8174960640, 6064523798049644277925701126806650606472211004362096137261922023539261533931159712229993784486900304494092698035668254711607734547323493716579247168129613825017402250081444943555723771998431425098683590600454956058175183022718976, 3828176627860557713962964333607392378880, 236574025616993083824920739000090624, 23539131507700052864384210337028749060383832916740129423360, 6502809600, 29551504647295859409209280075107710353809804452849085000961220053184291328622907958560699691163686730604970992730112, 153177439332441840943104, 73513440, 1552518092300708935148979488462502555256886017116696611139052038026050952686376886330878408828646477950487730697131073206171580044114814391444287275041181139204454976020849905550265285631598444825262999193716468750892846853816057856, 3265920000, 1042128803135845758812138865078191170679429861990765076355118256071218166759424, 94156526030800211457536841348114996241535331666960517693440, 24840289476811342962383671815400040884110176273867145778224832608416815242982030181294054541258343647207803691154097171298745280705837030263108596400658898227271279616333598488804244570105575117204207987099463500014285549661056925696, 6926923254988800, 54358179840000, 8318957063997755447322114785280, 1252412463513600, 1891296297426935002189393924806893462643827484982341440061518083403794645031866109347884780234475950758718143534727168, 425973332494163902464, 638668800, 69712754611742420055883776, 902755170385920, 2959500902400, 233513280, 7398852038987696023406154465626182787008158498816, 61250826045768923423407429337718278062080, 406983302788077043095694079023514269845261128071039316430435657456301100941017582490321789603976702315852655675868728054558642679084433903830771243428395388555612645234009677640568743036609742720273743660637609984234054445646756670603264, 1506504416492803383320589461569839939864565306671368283095040, 66696243400694128563976887365004234923483511167408964886727568388557962672603136, 122403739235981203939000320, 3785184409871889341198731824001449984, 230630400, 612709757329767363772416, 484171852141295360560484844750564726436819836155479408655748629351371429128157723993058503740025843394231844744890155008, 9119789245425254400, 6026017665971213533282357846279359759458261226685473132380160, 416750902054990892129990736920078612321547395144744260024766113235252327363602004470089512554472143171433119412089577527868050103382460317522709753270676877880947348719625909903942392869488376545560313508492912623855671752342278830697742336, 33443020800, 3029143697736276639744, 110270160, 69634127209802640463075737600, 7746749634260725768967757516009035622989117378487670538491978069621942866050523583888936059840413494307709515918242480128, 278851018446969680223535104, 23242897532874035036160, 1911029760000, 2853152143441920, 4268559577644424228094520791360271035102944714714173752750564376867709611046600704, 133103313023964087157153836564480, 1707011694817242694164442058424641996069058130512872489061441999811593532881313810309486643423117898430190057111918909554147533223454557460573019149396692491800360340355587726966548041193424390330615044130786970107312831497593974090537952608256, 277477200, 6828046779268970776657768233698567984276232522051489956245767999246374131525255241237946573692471593720760228447675638216590132893818229842292076597586769967201441361422350907866192164773697561322460176523147880429251325990375896362151810433024, 6849130659840, 17074238310577696912378083165441084140411778858856695011002257507470838444186402816, 20289081908920320, 473526530495212545497993885800075698368522143924224, 2952069120, 1703893329976655609856, 1983167906370745796855745924098313119485214048892843657853946385823217373708934037475567631319145854542773636075070074912768, 3657830400, 3117115464744960, 6991919901971426075297554671307333615898862102580725715195666431228287110681861367027657291461090911970058473930419853533788296083269867358507086435928852446414275954096487329654980776728266302794199220759703429559553357814144917874843453883416576, 3920052866929211099098075477613969795973120, 27967679607885704301190218685229334463595448410322902860782665724913148442727445468110629165844363647880233895721679414135153184333079469434028345743715409785657103816385949318619923106913065211176796883038813718238213431256579671499373815533666304, 532413252095856348628615346257920, 2540160000, 1050599721072989306880, 447482873726171268819043498963669351417527174565166445772522651598610375083639127489770066653509818366083742331546870626162450949329271510944453531899446556570513661062175189097918769710609043378828750128621019491811414900105274743989981048538660864, 72666316800, 1789931494904685075276173995854677405670108698260665783090090606394441500334556509959080266614039273464334969326187482504649803797317086043777814127597786226282054644248700756391675078842436173515315000514484077967245659600421098975959924194154643456, 1958459827775699263024005120, 1092751251876972602392197322588229384986353846966828480704144480478133660427929780224, 553512960, 746496000000, 15680211467716844396392301910455879183892480, 7576424487923400727967902172801211173896354302787584, 541776936960, 11838003609600, 2030763936123643695980283826276672634352859186066271905642441099082974590677948454374981254470805355051800203340871756710674432, 1832889850782397517082802171755189663406191307018921761884252780947908096342585866198098193012776216027479008590015982084761399088452696108828481666660133095712823955710669574545075280734654641679682560526831695838459555430831205351382962374814354898944, 129729600, 6140942214464815497216, 8123055744494574783921135305106690537411436744265087622569764396331898362711793817499925017883221420207200813363487026842697728, 17484020030031561638275157161411670159781661551469255691266311687650138566846876483584, 24682568359818090632324537738360257574741037984503697950229135360, 1360488960000, 110830772079820800, 944784000000, 4255901647865118720, 69936080120126246553100628645646680639126646205877022765065246750600554267387505934336, 23224320000, 2156489995751704756224, 371886360525984560578560, 30030067315218800919884630782037027445247038374198014146711597563050526250476926831789640794321325523394216076738821850476730762665208973047045843626559620640158907690363610309346513399556581649279919071671610504617321356178738468477058455548958390664298496, 4202398884291957227520, 26011238400, 8518612033533701578057845540126720, 480481077043500814718154092512592439123952613987168226347385561008808420007630829308634252709141208374307457227821149607627692202643343568752733498024953930242542523045817764949544214392905306388478705146745768073877141698859815495632935288783334250628775936, 42326323200, 1921924308174003258872616370050369756495810455948672905389542244035233680030523317234537010836564833497229828911284598430510768810573374275010933992099815720970170092183271059798176857571621225553914820586983072295508566795439261982531741155133337002515103744, 12468461858979840, 20038599416217600, 8318009082362444578735242552429251110309311226127449725511438741843863923416876869119923218312418734292173632884210715486922473472, 30750788930784052141961861920805916103932967295178766486232675904563738880488373075752592173385037335955677262580553574888172300969173988400174943873597051535522721474932336956770829721145939608862637129391729156728137068727028191720507858482133392040241659904, 122522400, 484891167227097646589945739059277515129366675378405376, 33272036329449778314940970209717004441237244904509798902045754967375455693667507476479692873249674937168694531536842861947689893888, 70527747686400, 27396522639360, 17846465180606059534306246656, 3805072588800, 39213424469105111281434624, 34074448134134806312231382160506880, 17826336565709475958547388825600, 8124796533473280, 7779240000, 1487545442103938242314240, 503820925841965910293903145710484129446837736164208910110436162020372297817921504473130470168740451712297816270119789770967814979078946625948466280425014092358004268645291408699733274151255074551605446727954090503833797734023629893148800753371273495187319355867136, 2129410325084785812156222093421888284239183673888627129730928317912029164394720478494700343887979195978796450018357943164652153208832, 71614546043009276470375043733142200974465685714818071311426812672614967569804806076760064, 415134720, 8061134813471454564702450331367746071149403778627342561766978592325956765086744071570087522699847227396765060321916636335485039665263146015175460486800225477728068298324662539195732386420081192825687147647265448061340763744378078290380812053940375922997109693874176, 628689600, 32244539253885818258809801325470984284597615114509370247067914369303827060346976286280350090799388909587060241287666545341940158661052584060701841947200901910912273193298650156782929545680324771302748590589061792245363054977512313161523248215761503691988438775496704, 1218998108160, 583666511707216281600, 34070565201356572994499553494750212547826938782218034075694853086592466630315527655915205502207667135660743200293727090634434451341312, 515912628062173092140956821207535748553561841832149923953086629908861232965551620580485601452790222553392963860602664725471042538576841344971229471155214430574596371092778402508526872730885196340843977449424988675925808879640197010584371971452184059071815020407947264, 238112986890240, 62016461371341034966200022204439756537856, 125341428977644752833536327680, 1366041600, 101099800001814899230001306576323615026139291584527146804138538434560, 27262293279626489757696, 16056536542942048661905717156306820284305899520, 31033034702534249381756527299793760968279467224217944064, 147026880, 55725627801600, 2180516172886820671647971423664013603060924082061954180844470597541917864340193769978573152141290696682287564818798533800603804885843968, 24563768857859261988864, 227026800, 193865196655121704943616, 324625310542725120, 80154397664870400, 545191170146156900995702114568110080, 124132138810136997527026109199175043873117868896871776256, 64226146171768194647622868625227281137223598080, 540973599882921212264795939754513005075299661860988438659031766043314076218086256101803270028960960404146580473095299767175523900930749990144551913946050126754187964414981206188781074100660675638296814498008256925847580971777599220570518424337445351925287506839283710296064, 1617596800029038387680020905221177840418228665352434348866216614952960, 285221385051351615336758221209600, 13063680000, 8655577598126739396236735036072208081204794589775815018544508256693025219489380097628852320463375366466345287569524796274808382414891999842312830623136802028067007430639699299020497185610570810212749031968132110813561295548441587529128294789399125630804600109428539364737024, 11808276480, 285543442889696952548899946496, 558212140259026091941880684457987482383596565007860270296184472970730973271089605114514726948170418350665616593612424652954574050776055808, 2334666046828865126400, 6470387200116153550720083620884711361672914661409737395464866459811840, 992263381941456559459200355271036104605696, 7947878400, 2215827865120445285436604169234485268788427414982608644747394113713414456189281304992986194038624093815384393617798347846350945898212351959632084639523021319185153902243763020549247279516306127414463752183841820368271691660401046407456843466086176161485977628013706077372678144, 130799370240, 1173332722368663985690624716523801820765645794751579280366416898828123628663681942761636888576, 8931394244144417471070090951327799718137545040125764324738951567531695572337433681832235631170726693610649865497798794447273184812416892928, 627414791505681780502953984, 1437004800, 3478923509760000, 35725576976577669884280363805311198872550180160503057298955806270126782289349734727328942524682906774442599461991195177789092739249667571712, 1140885540205406461347032884838400, 2790386565120, 2269007733883335972287082669296112915239349672942191252221331572442536403137824056312817862695551072066953619064625508194663368599769448406663254670871573830845597595897613333042429214224697474472410882236254024057110212260250671521235807709272244389361641091086035023229622419456, 15220290355200, 2985984000000, 103526195201858456811521337934155381786766634582555798327437863356989440, 18773323557898623771049995464380829132250332716025268485862670381249978058618911084186190217216, 571609231625242718148485820884979181960802882568048916783292900322028516629595755637263080394926508391081591391859122844625483827994681147392, 2418647040000, 922521600, 580865979874134008905493163339804906301273516273200960568660882545289319203282958416081372850061074449140126480544130097833822361540978792105793195743122900696472984549789013258861878841522553464937185852481030158620214338624171909436366773573694563676580119318024965946783339380736, 268953528594685262561280, 75093294231594495084199981857523316529001330864101073943450681524999912234475644336744760868864, 199495389743677440, 9293855677986144142487890613436878500820376260371215369098574120724629107252527334657301965600977191186242023688706081565341157784655660673692691131889966411143567752796624212141790061464360855438994973639696482537923429417986750550981868377179113018825281909088399455148533430091776, 4110473354993164457447863592014545992782310277120, 34503839932027276099584, 272377705463367598080, 768398400, 1298501242170900480, 594806763391113225119224999259960224052504080663757783622308743726376262864161749418067325798462540235919489516077189220181834098217962283116332232440957850313188336178983949577074563933719094748095678312940574882427099482751152035262839576139463233204818042181657565129506139525873664, 95202908294652047508111360, 2509659166022727122011815936, 92897280000, 1201492707705511921347199709720373064464021293825617183095210904399998595751610309387916173901824, 18393661440, 38067632857031246407630399952637454339360261162480498151827759598488080823306351962756308851101602575098847329028940110091637382285949586119445262876221302420044053515454972772932772091758022063878123412028196792475334366896073730256821732872925646925108354699626084168288392929655914496, 7093169413108531200, 127111310141580285467674735819955244926072697750396698886144, 6625676492918941235937365627785944434353064613283571092956023254847324160, 396271131033600, 2341311412736994173536197922344874729311448606998728363144367719719028804114824215090229577297618978369870198341054967171585981759466213979717632, 63504856444253219805388822737346310694764544, 183783600, 221073919720733357899776, 182601737180282880, 18254168643286503381552526157414400, 26502705971675764943749462511143777737412258453134284371824093019389296640, 508445240566321141870698943279820979704290791001586795544576, 535088332800, 623700096729599941142616472824012051896078518886080481719546013261628716209051270557799364216448656590419514638810154763741386871372998018980991186964009818850001772797214273911730537951363433494579173982669976247915878267225271996527767271390013799220975283398673763013237029759482503102464, 23279477760, 282110990745600, 32087405818277056725385299886080, 9979201547673599058281863565184192830337256302177287707512736212186059459344820328924789827463178505446712234220962476219862189941967968303695858991424157101600028364755428382587688607221814935913266783722719619966654052275604351944444276342240220787535604534378780208211792476151720049639424, 403603200, 254019425777012879221555290949385242779058176, 599375721660670508425266668120287930703730843391674460964958136248071373853394999063098771788190458462686770775310071595926011330423350778807713792, 10160640000, 1089510821853470392320, 638668899051110339730039268171788341141584403339346413280815117579907805398068501051186548957643424348589582990141598478071180156285949971436534975451146054502401815344347416485612070862196155898449074158254055677865859345638678524444433685903374130402278690200241933325554718473710083176923136, 263070294719562525276663269888930943538067857735680, 18274780344940604963129596575744, 2245320000, 73016674573146013526210104629657600, 9590011546570728134804266689924606891259693494266791375439330179969141981654319985009580348611047335402988332404961145534816181286773612460923420672, 40874809539271061742722513162994453833061401813718170449972167525114099545476384067275939133289179158309733311369062302596555530002300798171938238428873347488153716182038234655079172535180553977500740746128259563383414998120875425564443755897815944345745836172815483732835501982317445323323080704, 3809807790243840, 8135123849061138269931183092477135675268652656025388728713216, 57776330904698880, 1282470362637926400, 4875992432640, 138015359728109104398336, 1117670400, 10463951242053391806136963369726580181263718864311851635192874886429209483641954321222640418122029864527291727710479949464718215680589004332016189037791576956967351342601788071700268169006221818240189631008834448226154239518944108944497601509840881752510934060240763835605888507473266002770708660224, 11161546260480, 19685256523047107319352520044058592288178524878038911927831935457689576992794383309011618593207484416, 4303256457514964200980480, 32540495396244553079724732369908542701074610624101554914852864, 1523246532714432760129781760, 669692879491417075592765655662501131600878007315958504652343992731469406953085076558248986759809911329746670573470716765741965803557696277249036098418660925245910485926514436588817162816398196367372136384565404686473871329212422972447846496629816432160699779855408885478776864478289024177325354254336, 2455042955922106402509892272620699364162481534532298592112468526072100347303505916162452569244428117863165013095670053256912942409414044789996395692032, 757632231014400, 810810000]\r\n \r\nprint(ans[int(input())])", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef divisor(i):\r\n s = []\r\n for j in range(1, int(i ** (1 / 2)) + 1):\r\n if i % j == 0:\r\n s.append(i // j)\r\n s.append(j)\r\n return sorted(set(s))\r\n\r\ndef the_sieve_of_eratosthenes(n):\r\n s = [1] * (n + 1)\r\n x = []\r\n for i in range(2, n + 1):\r\n if s[i]:\r\n x.append(i)\r\n for j in range(i, n + 1, i):\r\n s[j] = 0\r\n return x\r\n\r\nn = int(input())\r\nd = divisor(n)\r\nx = the_sieve_of_eratosthenes(1000)\r\nm = len(d)\r\ninf = pow(10, 18) + 1\r\ndp = [inf] * m\r\ndp[0] = 1\r\nfor i in range(m):\r\n p = x[i]\r\n for j in range(m - 2, -1, -1):\r\n if not dp[j] ^ inf:\r\n continue\r\n dj = d[j]\r\n dpj = dp[j]\r\n for k in range(j + 1, m):\r\n if d[k] % dj:\r\n continue\r\n l = d[k] // dj\r\n dp[k] = min(dp[k], dpj * pow(p, l - 1))\r\nans = dp[-1]\r\nprint(ans)", "def fn(n, index, primes):\r\n if(n==1): return 1\r\n ans = 10**19\r\n for i in range(2, n+1):\r\n if(n%i==0):\r\n ans = min(ans, primes[index]**(i-1)*fn(n//i, index+1, primes))\r\n return ans\r\n\r\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]\r\nn = int(input())\r\nprint(fn(n, 0, primes))", "import math\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n\r\n if n == 1:\r\n print(1)\r\n return\r\n\r\n primes = [2, 3, 5, 7, 11, 13, 17, 19, 23]\r\n prime_factors = []\r\n i = 2\r\n while n != 1:\r\n while not n % i:\r\n n //= i\r\n prime_factors.append(i)\r\n if n == 1:\r\n break\r\n i += 1\r\n prime_factors.reverse()\r\n while len(prime_factors) > 1:\r\n sum0 = math.prod([primes[i] ** (prime_factors[i] - 1)for i in range(len(prime_factors))])\r\n p1 = prime_factors[:]\r\n p1[0] *= p1[-1]\r\n p1.pop()\r\n sum1 = math.prod([primes[i] ** (p1[i] - 1) for i in range(len(p1))])\r\n p2 = prime_factors[:]\r\n p2[0] *= p2[-1]\r\n p2.pop()\r\n sum2 = math.prod([primes[i] ** (p2[i] - 1) for i in range(len(p1))])\r\n if min(sum0, sum1, sum2) == sum0:\r\n print(sum0)\r\n return\r\n elif min(sum0, sum1, sum2) == sum1:\r\n prime_factors = p1[:]\r\n else:\r\n prime_factors = p2[:]\r\n\r\n print(2 ** (prime_factors[0] - 1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nL=[2,3,5,7,11,13,17,19,23,29]\r\ntab = []\r\ninf = 10**18\r\nFT=[list() for i in range(1200)]\r\nfor i in range(1,1000):\r\n for j in range(i*2,1200,i):\r\n FT[j].append(i)\r\n#print(FT[1000])\r\nfor i in range(1500):\r\n tab.append([inf]*10)\r\ntab[1][0]=1\r\nfor i in range(2,n+1):\r\n if n%i==0:\r\n if i<100:tab[i][0]=min(inf,pow(2,i-1))\r\n for q in FT[i]:\r\n for x in range(1,10):\r\n tab[i][x]=min(tab[i][x],pow(L[x],q-1)*tab[i//q][x-1])\r\nprint(min(tab[n]))", "n = int(input())\r\nfactors = [i for i in range(2, n + 1) if n % i == 0]\r\n\r\nprimes = []\r\nis_composite = [False] * (n + 1)\r\nfor i in range(2, n + 1):\r\n if not is_composite[i]:\r\n primes.append(i)\r\n for p in primes:\r\n j = i * p\r\n if j > n: break\r\n is_composite[j] = True\r\n if i % p == 0: break\r\n \r\ndef factorize(m = n, s = 0):\r\n if m == 1:\r\n return [[]]\r\n res = [[m]]\r\n for i in range(s, len(factors)):\r\n f = factors[i]\r\n if f > m ** 0.5: break\r\n if m % f != 0: continue\r\n else:\r\n for l in factorize(m // f, i):\r\n res.append([f] + l)\r\n return res\r\n\r\ndef rep_exp(a, b):\r\n if b == 0: return 1\r\n x = rep_exp(a, b//2)\r\n return x * x * (a if b % 2 == 1 else 1)\r\n\r\n\r\nm = float('inf')\r\nfor l in factorize():\r\n prod = 1\r\n for i in range(len(l)):\r\n prod *= rep_exp(primes[len(l) - i - 1], l[i] - 1)\r\n m = min(prod, m)\r\n\r\nprint(m)", "def smallestNumber(N):\r\n if N == 1:\r\n return 1\r\n INF = 1e18\r\n primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 33, 37, 41, 43]\r\n powers = [0 for i in primes]\r\n inx = 0\r\n possible_solutions = []\r\n\r\n def call_numberOfDivisors(vals):\r\n p = 1\r\n for i in vals:\r\n p *= (i+1)\r\n return p\r\n \r\n def call_smallestPossibleNumber(vals):\r\n p = 1 \r\n for i, j in zip(primes, vals):\r\n p *= i**j\r\n return p\r\n \r\n def recursive_call(values, p_inx):\r\n current_values = values.copy()\r\n while True:\r\n current_values[p_inx] += 1\r\n divisor = call_numberOfDivisors(current_values)\r\n number = call_smallestPossibleNumber(current_values)\r\n if divisor == N:\r\n possible_solutions.append(number)\r\n elif divisor < N and number <= INF and (possible_solutions==[] or number < min(possible_solutions)):\r\n recursive_call(current_values, p_inx+1)\r\n else:\r\n break\r\n \r\n recursive_call(powers, inx)\r\n \r\n if possible_solutions == []:\r\n return -1\r\n\r\n return min(possible_solutions)\r\n \r\nprint(smallestNumber(int(input())))", "n = int(input())\r\np = []\r\nf = []\r\ndef prime(x):\r\n for i in range(2,x):\r\n if x % i == 0:\r\n return False\r\n return True\r\n \r\ndef factorize(x):\r\n i = 2;\r\n while(i*i <= x):\r\n while(x % i == 0):\r\n f.append(i)\r\n x //= i\r\n i = i+1\r\n \r\n if(x > 1):\r\n f.append(x)\r\n f.reverse()\r\n \r\n\r\nx = 2\r\nwhile(len(p) < 70):\r\n if prime(x):\r\n p.append(x)\r\n x = x + 1\r\n\r\nfactorize(n)\r\nif(n == 1):\r\n print(n)\r\nelse:\r\n sum = f[0]\r\n ans = p[0] ** (f[0]-1)\r\n for i in range(1,len(f)):\r\n c1 = ans * (p[i] ** (f[i]-1))\r\n c2 = ans // (2 ** (sum-1)) * (2 ** (sum*f[i]-1))\r\n if(c1 < c2):\r\n ans = c1\r\n else:\r\n ans = c2\r\n sum *= f[i]\r\n print(ans)\r\n ", "import math\r\np = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43]\r\n \r\ndef solve(n, pos):\r\n ans = [1, 10 ** 18][n > 1] # si n>1 ans = 10**18 sino ans =1 dado que solo se necesita 1 divisor y solo 1 cumple tener un unico divisor\r\n for exp in range(2, n + 1): \r\n if n % exp == 0: # analizamos los posibles exponentes como se calculo matematicamente no tiene sentido pregunta por un exponente que no cumpla que (exp+1)|n\r\n ans = min(ans, p[pos] ** (exp - 1) * solve(n // exp, pos + 1)) # ans queda siendo la menor de las respuestas hasta ahora o la nueva respuesta\r\n # calculada mediante el primo que se esta analizando elevado al exponente -1\r\n # * solve en los divisores restantes n/exp y cambiando la pos para analiar el primo siguiente\r\n return ans\r\ninp = int(input())\r\nprint(solve(inp, 0))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "INF = 20**18\nprimes = []\na = [1]*100\n\ndef crivo():\n for i in range(2, 100):\n if a[i]:\n primes.append(i)\n for j in range(i+i, 100, i):\n a[j] = 0 \n\n\ndef dp(div, idx):\n div = int(div)\n idx = int(idx)\n\n if div == 1:\n return 1\n\n resp = INF\n\n for i in range(1, div):\n if div%(i+1) == 0:\n resp = min(resp, primes[idx]**i * dp(div/(i+1), idx+1))\n\n return resp\ncrivo()\nn = int(input())\n\nprint(dp(n, 0))\n \t\t \t \t \t \t\t \t\t\t\t \t \t\t\t", "n = int(input())\r\np = [0,2,3,5,7,11,13,17,19,23,29]\r\nres = 10**18\r\ndef solve(i,cnt,ans):\r\n global res\r\n if cnt > n:\r\n return\r\n if cnt == n:\r\n res = min(res,ans)\r\n j = 1\r\n while True:\r\n if ans * p[i] > res:\r\n break\r\n ans *= p[i]\r\n solve(i+1,cnt*(j+1),ans)\r\n j += 1\r\nsolve(1,1,1)\r\nprint(res)", "p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43]\r\n\r\n\r\ndef dfs(n, pos):\r\n v = [1, 10 ** 18][n > 1]\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n v = min(v, p[pos] ** (i - 1) * dfs(n // i, pos + 1))\r\n return v\r\n\r\nprint(dfs(int(input()), 0))\r\n", "a=[0]*50010\r\nv=[0]*50010\r\npri=[0]*50010\r\ntot=0\r\nn=50000\r\nn=int(input())\r\nfor i in range(2,n+1):\r\n if not v[i]:\r\n tot+=1\r\n pri[tot]=i\r\n for j in range(1,tot+1):\r\n if i*pri[j]>n:\r\n break\r\n v[i*pri[j]]=1\r\n if i%pri[j]==0:\r\n break\r\ndef dfs(n,dep):\r\n if n==1:\r\n return 1\r\n ans=10**3000\r\n for d in range(2,n+1):\r\n if n%d==0:\r\n ans=min(ans,dfs(n//d,dep+1)*(pri[dep]**(d-1)))\r\n return ans\r\nprint(dfs(n,1))\r\n" ]

[ "n=int(input())\r\narr=list(map(int,input().split()))\r\nt=ans=arr.pop(0)\r\nmx=max(arr)\r\ni=1\r\nwhile (ans)<=mx:\r\n ans+=1\r\n arr.remove(mx)\r\n arr.append(mx-1)\r\n mx=max(arr)\r\nprint(ans-t)", "import math\r\nn = int(input())\r\nv = list(map(int , input().split()))\r\nv[1:]= sorted(v[1:])\r\nans=0\r\nwhile(v[0]<=v[-1]):\r\n #print(v , \"last is\" , v[-1])\r\n v[-1]-=1\r\n v[0]+=1\r\n ans+=1\r\n v[1:]= sorted(v[1:])\r\nprint(ans)\r\n", "n = int(input())\r\n\r\na = (list(map(int,input().split())))\r\nk = a[0]\r\nk2 = a[0]\r\ndel a[0]\r\ncnt = 0\r\nwhile k <= max(a):\r\n a.append(max(a) - 1)\r\n a.remove(max(a))\r\n k +=1\r\n cnt +=1\r\n\r\n#print(k - k2)\r\nprint(cnt)\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmx = max(a)\r\nfor i in range(a[0], mx + 2):\r\n need = i - a[0]\r\n changes = sum([x - i + 1 for x in a[1:] if x >= i])\r\n if changes <= need:\r\n print(need)\r\n exit(0)", "n = int(input())\n\na = input().split()\n\na = list(map(int, a))\n\nvotes = 0;\n\nwhile(a[0] <= max(a[1:])):\n\tvotes += 1\n\ta[0] += 1\n\ta[a[1:].index(max(a[1:])) + 1] -= 1\n\n\nprint(votes)\n", "n=int(input())\r\n\r\nb,*l=map(int,input().split())\r\n\r\nl=sorted(l)\r\n\r\n'''\r\nu need to sort at every step then only you wil get the minimum steps\r\n\r\n'''\r\n\r\n\r\n\r\nans=0\r\n\r\nwhile b<=l[-1]:\r\n\r\n l[-1]-=1\r\n\r\n b+=1\r\n\r\n ans+=1\r\n l = sorted(l)\r\n \r\n\r\nprint(ans)\r\n\r\n", "n = int(input())\nvotes = list(map(int, input().split()))\nbear = votes[0]\nvotes.pop(0)\nvotes.sort()\nvotes.reverse()\nresult = 0\n\nwhile bear <= votes[0]:\n top = votes[0]\n for i, vote in enumerate(votes):\n if bear > votes[i] or votes[i] != top:\n break\n votes[i] -= 1\n result += 1\n bear += 1\n\nprint(result)\n", "trash=input()\r\nstr=input()\r\n\r\nstr=str.split()\r\nstr = [int(i) for i in str]\r\n\r\nlimak=str[0]\r\nstr.pop(0)\r\n\r\nstr.sort(reverse=True)\r\n\r\ncount=0\r\ni=0\r\nwhile (str[0]>=limak):\r\n \r\n str[i]-=1\r\n limak+=1\r\n str.sort(reverse=True)\r\n count+=1\r\n\r\nprint(count)", "n = int(input())\narr = list(map(int, input().split()))\nst = arr[0]\nind = arr.index(max(arr))\nwhile (arr[0] < max(arr[1:])):\n\tarr[ind] -= 1\n\tarr[0] += 1\n\tind = arr.index(max(arr))\nif (arr[0] == max(arr[1:])):\n\tk = (arr[0] + 1)\nelse:\n\tk = (arr[0])\nprint(k - st)", "def main():\r\n n = int(input())\r\n v, *a = [int(i) for i in input().split()]\r\n for i in range(1002):\r\n t = max(a)\r\n if v > t:\r\n print(i)\r\n break\r\n a.append(t - 1)\r\n a.remove(t)\r\n v += 1\r\n \r\n \r\n \r\nmain()\r\n", "n = int(input())\nvotes = [int(i) for i in input().split()]\nme = votes[0]\nrest = votes[1:]\nrest.sort(reverse = True)\nanswer = 0\n\nwhile (me <= rest[0]):\n me += 1\n rest[0] -= 1\n answer += 1\n rest.sort(reverse = True)\n\nprint(answer)\n", "number=int(input())\r\na=input().split()\r\nfor i in range(number):\r\n a[i]=int(a[i])\r\nb=0\r\nc=0\r\nwhile a[0]!=max(a):\r\n b=a.index(max(a))\r\n a[0]=(a[0]+1)\r\n a[b]=(a[b]-1)\r\n c+=1\r\nif a.count(max(a))==1:\r\n print(c)\r\nelse:\r\n c+=1\r\n print(c)", "#!/usr/bin/python3.4\n\nimport time\n\nSIZE = 26\nmatrix = [[0] * SIZE for i in range(SIZE)]\narr = [0] * SIZE\n\ndef timer(func, *pargs, **kargs):\n start = time.time()\n func(*pargs, **kargs)\n return time.time() - start\n\nif __name__ == \"__main__\":\n n = int(input())\n a = list(map(int, input().split()))\n value, c = a[0], 0\n a = a[1:]\n while True:\n a.sort(reverse=True)\n if value > a[0]:\n break\n value += 1\n c += 1\n a[0] -= 1\n print(c)\n\n", "#!/usr/bin/python3\nn=int(input())\nmy,*l=map(int,input().split())\nres=0\nwhile True:\n l.sort(reverse=True)\n if my<=l[0]:\n res+=1\n l[0]-=1\n my+=1\n else:\n break\nprint(res) \n\n", "def check(l):\r\n if l.index(max(l))==len(l)-1:\r\n return False\r\n else:\r\n return True\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nl.append(l[0])\r\nl.remove(l[0])\r\nwhile check(l):\r\n t=l.index(max(l))\r\n l[t]=l[t]-1\r\n l[-1]+=1\r\n ans+=1\r\nprint(ans) \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=0\r\na[1:]=sorted(a[1:])\r\nwhile a[0]<=a[-1]:\r\n a[-1]-=1\r\n a[0]+=1\r\n b+=1\r\n a[1:]=sorted(a[1:])\r\nprint(b)\r\n", "x = int(input(''))\n\nrida = input('')\n\nrida = rida.split()\nnrs = list(map(int, rida))\n\ncount = nrs.pop(0)\nstartcount = count\n\nwhile count <= max(nrs):\n ind = nrs.index(max(nrs))\n nrs[ind] = nrs[ind] - 1\n count = count + 1\n\n\nprint(str(count - startcount))\n \n\n\n", "a=int(input())\r\nx,*y=map(int,input().split())\r\ns=0;y=list(y)\r\nwhile x+s<=max(y):\r\n s+=1\r\n y+=[y.pop(y.index(max(y)))-1]\r\nprint(s)", "#!/usr/bin/env python3\nimport sys\n\nN = input()\nvotes = list(map(int, input().split()))\n\ndef num_bribes():\n bribes = 0\n\n\n while True:\n\n most_votes, winner = sorted((votes, idx) for idx, votes in enumerate(votes))[-1]\n my_votes = votes[0]\n num_most_voted = sum(1 for vote in votes if vote == most_votes)\n\n if my_votes == most_votes and num_most_voted == 1:\n return bribes\n\n else:\n diff = 1\n bribes += diff\n votes[0] += diff\n votes[winner] -= diff\n\nprint(num_bribes())", "n = int(input())\na = list(map(int, input().split()))\nb = a[0]\na = a[1:]\na.sort()\na = a[::-1]\n#print(b, a)\np = 0\nwhile len(a) > 0:\n i = 0\n while True:\n if i >= len(a): break\n x = a[i]\n if x < b: break\n a[i] -= 1\n p += 1\n b += 1\n a.sort()\n a = a[::-1]\n #print(a)\n if i == 0: break\nprint(p)\n", "from collections import *\n\ndef li():return [int(i) for i in input().rstrip('\\n').split(' ')]\ndef st():return input().rstrip('\\n')\ndef val():return int(input())\n\nn = val()\nl = li()\ntot = 0\nfor i in range(n):\n l[i] = [l[i],i]\nl.sort(reverse = 1)\nwhile l[0][1] != 0:\n \n ind = 0\n for i in range(len(l)):\n if l[i][1] == 0:\n ind = i\n break\n l[ind][0]+=1\n l[0][0]-=1\n tot += 1\n l.sort(reverse = 1)\nprint(tot)", "import heapq\r\n\r\nn = int(input())\r\nvotes = [-int(e) for e in input().split()]\r\nlimak = -votes[0]\r\nvotes = votes[1:]\r\nheapq.heapify(votes)\r\nans = 0\r\n\r\nwhile limak <= -votes[0]:\r\n cur = heapq.heappop(votes)\r\n cur += 1\r\n limak += 1\r\n ans += 1\r\n heapq.heappush(votes, cur)\r\n\r\nprint(ans)", "def solve():\r\n \r\n n=int(input())\r\n lst=list(map(int,input().split(\" \")))\r\n\r\n c=0\r\n while(lst[0]<=max(lst[1:])):\r\n lst[1+lst[1:].index(max(lst[1:]))]-=1;\r\n lst[0]+=1\r\n c+=1\r\n \r\n print(c)\r\n\r\n\r\n \r\n\r\n # print(s)\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\nsolve();", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = a[0]\r\nwhile a[0] <= max(a[1:]):\r\n a[0] += 1\r\n a[a[1:].index(max(a[1:])) + 1] -= 1\r\nprint(a[0] - d)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nctr = 0\r\nwhile True:\r\n mx = a[1]\r\n imx = 1\r\n for i in range(1, n):\r\n if a[i] > mx:\r\n mx = a[i]\r\n imx = i\r\n\r\n if mx >= a[0]:\r\n a[0] += 1\r\n a[imx] -= 1\r\n ctr += 1\r\n else:\r\n break\r\n\r\nprint(ctr)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=l[0]\r\ns=l[0]\r\nl=l[1:]\r\nwhile(s<=max(l)):\r\n l=sorted(l)\r\n l[-1]-=1\r\n s+=1\r\nprint(s-x)\r\n", "n = int(input())\r\nvoices = input().split()\r\n\r\nfor i in range(n):\r\n voices[i] = int(voices[i])\r\n\r\nk = 0\r\nM = sorted(voices[1:])\r\nif voices[0] <= M[n-2]:\r\n while voices[0] <= M[n-2]:\r\n voices[0] += 1\r\n M[n-2] -= 1\r\n k += 1\r\n M = sorted(M)\r\nprint(k)\r\n\r\n", "from heapq import heappop, heappush, heapify\n\ndef solve(n, a):\n limak, heap = a[0], [-votes for votes in a[1:]]\n heapify(heap)\n bribed = 0\n while limak <= -heap[0]:\n top_opponent = heappop(heap)\n top_opponent += 1\n limak += 1\n bribed += 1\n heappush(heap, top_opponent)\n return bribed\n\nn = int(input())\na = [int(component) for component in input().split(\" \")]\nprint(solve(n, a))\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nl = arr[0]\r\narr = arr[1:]\r\ncandy = 0\r\n\r\nwhile max(arr) >= l:\r\n candy += 1\r\n arr[arr.index(max(arr))] -= 1\r\n l += 1\r\n\r\nprint(candy)\r\n", "n = input()\r\narr = list(map(int,input().split()))\r\nlum = arr[0]\r\ndel(arr[0])\r\ncount=0\r\narr = sorted(arr)[::-1]\r\n'''print(arr)'''\r\nwhile lum<=arr[0]:\r\n lum+=1\r\n arr[0]-=1\r\n count+=1\r\n arr=sorted(arr)[::-1]\r\nprint(count) ", "import heapq\nN = int(input())\ns = input().split(' ')\na = [-int(x) for x in s[1:]]\nme = int(s[0])\n\nheapq.heapify(a)\nans = 0\n\nwhile me <= -a[0]:\n\tx = -heapq.heappop(a)\n\tx -= 1\n\tme += 1\n\tans += 1\n\theapq.heappush(a,-x)\n\nprint(ans)\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nwhile not (max(a) == a[0]):\r\n\ta[a.index(max(a))] -= 1\r\n\ta[0] += 1\r\n\tcnt += 1\r\nif a.count(max(a)) != 1:\r\n\tcnt += 1\r\nprint(cnt)", "y=int(input())\r\ny=[int(x) for x in input().split()]\r\nw=y.pop(0)\r\nx=w\r\nwhile w<=max(y):\r\n y[y.index(max(y))]-=1\r\n w+=1\r\nprint(w-x)\r\n \r\n", "#!/usr/bin/env python\n# 574A_bear.py - Codeforces.com 574A Bear program by Sergey 2015\n\nimport unittest\nimport sys\n\n###############################################################################\n# Bear Class\n###############################################################################\n\n\nclass Bear:\n \"\"\" Bear representation \"\"\"\n\n def __init__(self, test_inputs=None):\n \"\"\" Default constructor \"\"\"\n\n it = iter(test_inputs.split(\"\\n\")) if test_inputs else None\n\n def uinput():\n return next(it) if it else sys.stdin.readline().rstrip()\n\n # Reading single elements\n self.n = int(uinput())\n\n # Reading a single line of multiple elements\n self.nums = list(map(int, uinput().split()))\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n lamak = self.nums[0]\n srt = sorted(self.nums[1:])\n result = 0\n\n while lamak <= srt[-1]:\n srt[-1] -= 1\n lamak += 1\n result += 1\n srt = sorted(srt)\n\n return str(result)\n\n###############################################################################\n# Unit Tests\n###############################################################################\n\n\nclass unitTests(unittest.TestCase):\n\n def test_single_test(self):\n \"\"\" Bear class testing \"\"\"\n\n # Constructor test\n test = \"5\\n5 1 11 2 8\"\n d = Bear(test)\n self.assertEqual(d.n, 5)\n self.assertEqual(d.nums, [5, 1, 11, 2, 8])\n\n # Sample test\n self.assertEqual(Bear(test).calculate(), \"4\")\n\n # Sample test\n test = \"4\\n1 8 8 8\"\n self.assertEqual(Bear(test).calculate(), \"6\")\n\n # Sample test\n test = \"2\\n7 6\"\n self.assertEqual(Bear(test).calculate(), \"0\")\n\n # My tests\n test = \"4\\n0 1 1 1\"\n self.assertEqual(Bear(test).calculate(), \"2\")\n\n # Time limit test\n self.time_limit_test(100)\n\n def time_limit_test(self, nmax):\n \"\"\" Timelimit testing \"\"\"\n import random\n import timeit\n\n # Random inputs\n test = str(nmax) + \"\\n\"\n test += \"0 \"\n nums = [1000 for i in range(nmax-1)]\n test += \" \".join(map(str, nums)) + \"\\n\"\n\n # Run the test\n start = timeit.default_timer()\n d = Bear(test)\n calc = timeit.default_timer()\n d.calculate()\n stop = timeit.default_timer()\n print(\"\\nTimelimit Test: \" +\n \"{0:.3f}s (init {1:.3f}s calc {2:.3f}s)\".\n format(stop-start, calc-start, stop-calc))\n\nif __name__ == \"__main__\":\n\n # Avoiding recursion limitaions\n sys.setrecursionlimit(100000)\n\n if sys.argv[-1] == \"-ut\":\n unittest.main(argv=[\" \"])\n\n # Print the result string\n sys.stdout.write(Bear().calculate())\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nwhile(l[0]<=max(l)):\r\n try:\r\n x=l[1:].index(max(l))\r\n l[x+1]=l[x+1]-1\r\n c=c+1\r\n l[0]=l[0]+1\r\n except:\r\n break\r\nprint(c) ", "import heapq\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=a[0]\r\na=a[1:]\r\nfor i in range(n-1):\r\n a[i]=-a[i]\r\nheapq.heapify(a)\r\nans=0\r\nwhile(True):\r\n cur=heapq.heappop(a)\r\n cur=-cur\r\n if cur<b:\r\n break\r\n ans+=1\r\n b+=1\r\n cur-=1\r\n cur=-cur\r\n heapq.heappush(a,cur)\r\nprint(ans)\r\n", "n = int(input())\nlmk, *array = map(int, input().split())\nchuri = 0\narray = sorted(list(array), reverse=True)\ni = 0\nwhile 1:\n max_val = array[i]\n if max_val >= lmk:\n lmk += 1\n churi += 1\n array[i] -= 1\n else:\n break\n array = sorted(array, reverse=True)\nprint(churi) ", "def main():\r\n n = int(input())\r\n a = [int(c) for c in input().split()]\r\n\r\n my, other = a[0], a[1:]\r\n\r\n res = 0\r\n while True:\r\n mx, mx_idx = -1, -1\r\n for i, e in enumerate(other):\r\n if e > mx:\r\n mx = e\r\n mx_idx = i\r\n\r\n if my <= mx:\r\n my += 1\r\n res += 1\r\n other[mx_idx] -= 1\r\n else:\r\n print(res)\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "input()\r\ns=list(map(int,input().split()))\r\nk=0\r\nwhile s[0]<=max(s[1:]):\r\n s[1+s[1:].index(max(s))]-=1\r\n s[0]+=1\r\n k+=1\r\nprint(k)", "_, (limak, *votes) = input(), map(int, input().split())\nstart = limak\nvotes = sorted(x for x in votes if x >= limak)\nif not votes:\n\tprint(0); exit()\nwhile votes[-1] >= limak:\n\tlimak, votes[-1] = limak + 1, votes[-1] - 1\n\tvotes = sorted(votes)\nprint(limak - start)\n", "n = int(input())\r\nliste = [int(x) for x in input().split()]\r\nliste = liste[::-1]\r\ncompteur =0\r\nwhile True:\r\n roger = liste.index(max(liste))\r\n if roger == n-1:\r\n break\r\n else:\r\n liste[n-1] +=1\r\n liste[roger] -=1\r\n compteur += 1\r\nprint(compteur)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncond = []\r\nmax1 = arr[1]\r\nlam = arr[0]\r\nfor i in range(1, n):\r\n if arr[i] >= lam:\r\n if arr[i] > max1:\r\n max1 = arr[i]\r\n cond.reverse()\r\n cond.append(max1)\r\n cond.reverse()\r\n else:\r\n cond.append(arr[i])\r\nans = 0\r\nwhile cond:\r\n cond[0] -= 1\r\n ans += 1\r\n lam += 1\r\n cond1 = []\r\n max1 = cond[0]\r\n for i in range(len(cond)):\r\n if cond[i] >= lam:\r\n if cond[i] > max1:\r\n max1 = cond[i]\r\n cond1.reverse()\r\n cond1.append(max1)\r\n cond1.reverse()\r\n else:\r\n cond1.append(cond[i])\r\n cond = cond1\r\nprint(ans)", "N = int(input())\r\nA = list(int(i) for i in input().split())\r\n\r\ndef getMax():\r\n\tglobal A\r\n\tmaxv = -1\r\n\tmaxi = -1\r\n\tfor i in range(len(A)):\r\n\t\tif(A[i]>=maxv):\r\n\t\t\tmaxv = A[i]\r\n\t\t\tmaxi = i\r\n\treturn maxi\r\n\t\r\nbribes = 0\r\nk = getMax()\r\nwhile(k!=0):\r\n\tA[k]-=1\r\n\tA[0]+=1\r\n\tbribes+=1\r\n\tk=getMax()\r\nprint(bribes)", "import math\r\nimport random\r\nimport os\r\nimport turtle\r\na=int(input(\"\"))\r\nb=input(\"\").split(' ')\r\nfor i in range(0,len(b)):\r\n b[i]=int(b[i])\r\nl=b[0]\r\nc=b.copy()\r\nc[0]=b[0]-1\r\ndef mag(m):\r\n for i in m:\r\n if i==max(m):\r\n return m.index(i)\r\ndef funtion(n):\r\n u=1\r\n if mag(n)!=0:\r\n\r\n n[mag(n)]=n[mag(n)]-1\r\n n[0] += 1\r\n return n\r\n else:\r\n return 0\r\ncount=0\r\ndef join(n):\r\n if n.index(max(n))==0:\r\n return False\r\n else:\r\n return True\r\nwhile join(c):\r\n c=funtion(c)\r\n count+=1\r\nprint(count)\r\n\r\n\r\n\r\n", "n = int(input())\ns = [int(i) for i in input().split(' ')]\na = s.pop(0)\nm = max(s)\nk = 0\nwhile a <= m:\n\ta += 1\n\ts[s.index(m)] -= 1\n\tk += 1\n\tm = max(s)\n\nprint(k)\n\t\n", "import heapq\r\n\r\nn = map(int, input().split())\r\nvotes = list(map(int, input().split()))\r\n\r\nlimak = votes[0]\r\nvotes = [-x for x in votes[1:]]\r\nheapq.heapify(votes)\r\n\r\nans = 0\r\nwhile limak <= -votes[0]:\r\n vote = -heapq.heappop(votes)\r\n vote -= 1\r\n limak += 1\r\n ans += 1\r\n heapq.heappush(votes, -vote)\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=a[0]\r\na=a[1:]\r\na.sort()\r\nc=0\r\nwhile k<=a[-1]:\r\n k+=1\r\n a[-1]-=1\r\n a.sort()\r\n c+=1\r\n # print(a,k)\r\nprint(c)\r\n\r\n\r\n", "count = input()\nfull_candidates = [ int(candidate) for candidate in input().split(\" \") ]\n\nlimak = full_candidates[0]\nbribe = 0\n\ncandidates = full_candidates[1:]\nwhile(max(candidates) >= limak + bribe):\n candidates[candidates.index(max(candidates))] -= 1\n bribe += 1\n\nprint(bribe)\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nans = 0\r\nwhile(True):\r\n l = max(arr)\r\n max_index = arr.index(l)\r\n if(max_index==0):\r\n zz = False\r\n for i in range(1,n):\r\n if(arr[i]==arr[0]):\r\n print(ans + 1)\r\n zz = True\r\n break\r\n if(zz==False):\r\n print(ans)\r\n break\r\n arr[0] += 1\r\n arr[max_index] -= 1\r\n ans += 1", "n = int(input())\r\ns = list(map(int, input().split()))\r\nmaxes = s[1:]\r\nnumber = s[0]\r\ndif = abs(s[0] - max(s))\r\nans = 0\r\nwhile number <= max(maxes):\r\n maxes.sort(reverse=True)\r\n maxes[0] -= 1\r\n ans += 1\r\n number += 1\r\nprint(ans)\r\n", "def check(m, a):\r\n for i in range(1, len(a)):\r\n if a[i] >= m:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nms = a[0]\r\nans = 0\r\nwhile check(a[0], a):\r\n pos = a[1:].index(max(a)) + 1\r\n a[pos] -= 1\r\n a[0] += 1\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncandies = 0\r\nl = arr[0]\r\narr = arr[1:]\r\n\r\nwhile l <= max(arr):\r\n arr[arr.index(max(arr))] -= 1\r\n l += 1\r\n candies += 1\r\nprint(candies)\r\n", "import heapq\r\n\r\nn = int(input())\r\nAs = list(map(int, input().split()))\r\nBs = [-a for a in As]\r\na = Bs[0]\r\npq = Bs[1:]\r\nheapq.heapify(pq)\r\nb = 0\r\nwhile pq[0] <= a - b:\r\n b += 1\r\n heapq.heapreplace(pq, pq[0] + 1)\r\nprint(b)", "from heapq import heappush, heappop\r\nn = int(input(\"\"))\r\np = [-1 * int(x) for x in input(\"\").split()]\r\n\r\ndef comparacion(a, b):\r\n return a < b\r\n\r\nlizy = p[0]\r\nheap = []\r\nfor i in p[1:]:\r\n heappush(heap, i)\r\nmaximo = heappop(heap)\r\nif comparacion(lizy, maximo):\r\n print(0)\r\nelse:\r\n count = 0\r\n while not comparacion(lizy, maximo):\r\n maximo += 1\r\n lizy -= 1\r\n count += 1\r\n heappush(heap, maximo)\r\n maximo = heappop(heap)\r\n print(count)\r\n\r\n", "n, count = input(), 0\r\nvotes = [int(x) for x in input().split()]\r\nhero = votes.pop(0)\r\n\r\nwhile hero <= max(votes):\r\n\thero += 1\r\n\tcount += 1\r\n\tvotes[votes.index(max(votes))] -= 1\r\n\r\nprint(count)", "def solve(lst):\r\n ans=0\r\n while True:\r\n mx=0\r\n for i in range(1,len(lst)):\r\n if lst[i]>=lst[mx]:\r\n mx=i\r\n if mx==0:\r\n break\r\n ans+=1\r\n lst[0]+=1\r\n lst[mx]-=1\r\n return ans\r\n\r\nn=int(input())\r\nv=list(map(int,input().split()))\r\nprint(solve(v))\r\n", "n = int(input())\na = list(map(int, input().split(\" \")))\nl = a[0]\nc = a[1:]\nresult = 0\nwhile(True):\n c.sort(reverse=True)\n if l > c[0]:\n break\n else:\n l += 1\n c[0] -= 1\n result+=1\n\nprint(result)\n \n", "n = int(input())\r\nL = list(map(int, input().rstrip().split()))\r\ninitial = L[0]\r\nbear = L[0]\r\nL = L[1:]\r\n\r\n\r\nwhile(bear <= max(L)):\r\n bear += 1\r\n x = L.index(max(L))\r\n L[x] -= 1\r\n\r\n\r\nprint(bear - initial)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nz = a[0]\r\ny = a[0]\r\nif max(a) == z and a.count(z) == 1:\r\n print(0)\r\nelif max(a) ==z:\r\n print(1)\r\nelse:\r\n while z!=max(a):\r\n i = a.index(max(a))\r\n z += 1\r\n a[0] = z\r\n a[i] -= 1\r\n if a.count(z)!=1:\r\n z+=1\r\n print(z-y)\r\n\r\n\r\n\r\n ", "a=int(input())\r\nstrinp=str(input()).split()\r\nlist=[]\r\nz=int(strinp[0])\r\nq=0\r\nfor h in range(a):\r\n list.append(int(strinp[h]))\r\nz=list[0]\r\nlist.remove(list[0])\r\nwhile z<max(list):\r\n z=z+1\r\n g=max(list)\r\n list[list.index(g)]=list[list.index(g)]-1\r\n q=q+1\r\nc=max(list)\r\nif(c==z):\r\n print(q+1)\r\nelse:\r\n print(q)", "n = input()\r\nme, *cans = list(map(int, input().split(' ')))\r\n\r\nc = 0\r\nwhile True:\r\n m = max(enumerate(cans), key=lambda x: x[1])\r\n if m[1] < me:\r\n break\r\n cans[m[0]] -= 1\r\n me += 1\r\n c += 1\r\n\r\n\r\nprint(c)\r\n", "cCount = int(input())\ncList = [int(x) for x in input().split()]\noldl = cList.pop(0)\nl = oldl\nwhile(max(cList) >= l):\n n = cList.count(max(cList)) # number of top candidates\n d = max(cList) - l # difference\n if d < n:\n l += d + 1\n for x in range(d + 1):\n cList[cList.index(max(cList))] -= 1\n else:\n d -= n\n l += n\n for x in range(n):\n cList[cList.index(max(cList))] -= 1\n\nprint(l - oldl)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nl=[]\r\ncandy=0\r\nfor i in range(1,n):\r\n if l1[i]>=l1[0]:\r\n l.append(l1[i])\r\nif len(l)>=1:\r\n mm=max(l)\r\n while mm>=l1[0]:\r\n candy+=1\r\n l[l.index(mm)]=mm-1\r\n l1[0]=l1[0]+1\r\n mm=max(l)\r\nprint(candy)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nans = 0\n\nwhile True:\n v = max(a[1:])\n p = a[1:].index(v) + 1\n \n if a[0] > v:\n break\n \n a[p] -= 1\n a[0] += 1\n ans += 1\n\nprint(ans)\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx=0\r\nwhile a[0] <= max(a[1:]):\r\n a[1+a[1:].index(max(a))]-=1\r\n a[0]+=1\r\n x+=1\r\nprint(x)", "__author__ = 'JohnHook'\r\n\r\nn = list(map(int, input().split()))[0]\r\na = list(map(int, input().split()))\r\nk, a[0] = a[0], 0\r\nans = 0\r\nwhile k <= max(a):\r\n k += 1\r\n ans += 1\r\n a[a.index(max(a))] -= 1\r\n\r\nprint(ans)", "_ = int(input())\na = list(map(int, input().split()))\n\ncounter = 0\nwhile a[0] != max(a):\n a[a.index(max(a))] -= 1\n a[0] += 1\n counter += 1\n\na.sort()\nif a[-1] == a[-2]:\n counter += 1\n\nprint(counter)\n", "input()\r\na,*b=map(int,input().split())\r\nb=sorted(b,reverse=True)\r\nc=0\r\nwhile b[0]>=a:\r\n a+=1\r\n b[0]-=1\r\n c+=1\r\n b=sorted(b,reverse=True)\r\nprint(c)\r\n", "import heapq\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n limak = a[0]\r\n a = [-a[i] for i in range(1,n)]\r\n heapq.heapify(a)\r\n c = 0\r\n print()\r\n while -a[0] >= limak:\r\n x = heapq.heappop(a)\r\n x = -x\r\n x -= 1\r\n limak += 1\r\n heapq.heappush(a,-x)\r\n c += 1\r\n print(c)\r\n #print(a)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nb=l[0]\r\nl1=l[1:]\r\nl1.sort()\r\nwhile(b<=l1[-1]):\r\n b+=1\r\n l1[-1]-=1\r\n l1.sort()\r\nprint(b-l[0])\r\n", "import sys\r\nn=int(input())\r\narr=list(map(int,input().split(' ')))\r\nval=arr[0]\r\ncnt=0\r\nse=max(arr)\r\nif val==se and arr.count(val)==1:\r\n print(0)\r\n sys.exit(0)\r\nwhile val<=se:\r\n for x in range(len(arr)):\r\n if arr[x]==se:\r\n arr[x]-=1\r\n val+=1\r\n cnt+=1\r\n if val>se:\r\n print(cnt)\r\n sys.exit(0)\r\n se=max(arr)\r\nprint(cnt)\r\n \r\n \r\n ", "from sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nl = a[0]\r\nans = 0\r\nops = a[1:]\r\nops = sorted(ops, reverse=True)\r\nmax_op = ops[0]\r\n\r\nwhile l <= max_op:\r\n for i,el in enumerate(ops):\r\n if el == max_op:\r\n ops[i] -= 1\r\n ans += 1\r\n l += 1\r\n if l > max_op:\r\n break\r\n max_op = max(ops)\r\n\r\nstdout.write(str(ans))", "n = int(input())\nx = list(map(int, input().split()))\nx_init = x[0]\nwhile x[0] != max(x):\n x[0] += 1\n if x[0] == max(x):\n x[x[1:].index(max(x)) + 1] -= 1\n break\n x[x.index(max(x))] -= 1\nif x.count(x[0]) > 1:\n x[0] += 1\nprint(x[0] - x_init)\n", "import queue\r\nn = int(input())\r\nvalues = input().split()\r\n\r\nt = int(values[0])\r\nq = queue.PriorityQueue()\r\nfor i in range(n-1):\r\n\tq.put(-int(values[i+1]))\r\nans = 0\r\n\r\nwhile True:\r\n\tcur = -q.get() \r\n\tif t > cur:\r\n\t\tbreak\r\n\tt += 1\r\n\tcur -= 1\r\n\tans += 1\r\n\tq.put(-cur)\r\n\r\nprint(ans)", "n = int(input())\ncandidates = list(map(int, input().split()))\ncount = 0\n\nwhile True:\n limak = candidates[0]\n pretendent = max(candidates[1:])\n\n if limak < pretendent:\n candidates[candidates.index(pretendent)] = pretendent - 1\n candidates[0] = limak + 1\n count += 1\n elif limak == pretendent:\n candidates[candidates.index(pretendent)] = pretendent - 1\n candidates[0] = limak + 1\n count += 1\n break\n else:\n break\n\nprint(count)\n", "import heapq\n\ninput()\nvotes = [-int(i) for i in input().split()]\nn = init = - votes[0]\nvotes = votes[1:]\nheapq.heapify(votes)\n\nwhile n <= -votes[0]:\n f = heapq.heappop(votes)\n heapq.heappush(votes, f + 1)\n n += 1\n\nprint(n - init)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nmx=a[0]; c=0\r\nwhile 1:\r\n if max(a)==mx and a.count(mx)==1: break\r\n a.sort()\r\n ind=a.index(mx)\r\n mx+=1; a[ind]+=1; c+=1; a[-1]-=1\r\nprint(c)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nmx=arr.pop(0)\r\nans=mx\r\narr.sort(reverse=True)\r\nwhile(mx<=arr[0]):\r\n\tmx+=1\r\n\tarr[0]-=1\r\n\tarr.sort(reverse=True)\r\nprint(mx-ans)", "n = int(input())\n\na = list(map(int,input().split()))\nans=0\na[1:]=sorted(a[1:],reverse=True)\n\n\n\nwhile a[0]<=a[1]:\n\n a[1]-=1\n ans+=1\n a[0]+=1\n a[1:]=sorted(a[1:],reverse=True)\n \nprint(ans)\n\n\n \n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na, *w = list(map(int, input().split()))\r\n\r\nc = a\r\nwhile a <= max(w):\r\n w = sorted(w)\r\n a += 1\r\n w[-1] -= 1\r\n\r\nprint(a-c)", "t=int(input())\r\nx=list(map(int,input().split()))\r\nm=x[0]\r\nx.pop(0)\r\nx.sort(reverse=True)\r\nct=0\r\nwhile m<=x[0]:\r\n m+=1\r\n x[0]-=1\r\n ct+=1\r\n x.sort(reverse=True)\r\nprint(ct)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nwhile a[0]<=max(a[1:]):\r\n a[1+a[1:].index(max(a))]-=1\r\n a[0]+=1\r\n c+=1\r\nprint(c)", "n = int(input())\r\na= list(map(int, input().split()))\r\nl = a[0]\r\na = a[1:]\r\nres = 0\r\nx = max(a)\r\ny = a.index(x)\r\nwhile l <= x:\r\n l += 1\r\n a[y] -= 1\r\n res += 1\r\n x = max(a)\r\n y = a.index(x)\r\n \r\nprint(res)", "N = int(input())\r\nx = [int(i) for i in input().split()]\r\n\r\nimport operator\r\niters = 0\r\n\r\nwhile True:\r\n i, v = max(enumerate(x[1:]), key=operator.itemgetter(1))\r\n if x[0] > max(x[1:]):\r\n print(iters)\r\n break\r\n x[i + 1] -= 1\r\n x[0] += 1\r\n iters += 1\r\n", "n = int(input())\r\ns = [int(i) for i in input().split(' ')]\r\na = s.pop(0)\r\nm = max(s)\r\nk = 0\r\nwhile a <= m:\r\n\ta += 1\r\n\ts[s.index(m)] -= 1\r\n\tk += 1\r\n\tm = max(s)\r\n\r\nprint(k)\r\n\t\r\n", "n = int(input())\r\nmylist = list(map(int,input().split()))\r\ncount = 0\r\nwhile(mylist[0] <= max(mylist[1:])):\r\n mylist[mylist[1:].index(max(mylist)) + 1 ] -= 1\r\n mylist[0] += 1\r\n count += 1\r\nprint(count)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/574/A\r\n\r\nn = int(input())\r\nl_v = list(map(int, input().split()))\r\n\r\nt = 0\r\nwhile l_v[0] != max(l_v) or l_v.count(l_v[0]) > 1:\r\n m_i = 0\r\n m = l_v[0]\r\n for i in range(n - 1):\r\n if l_v[1 + i] >= m:\r\n m = l_v[1 + i]\r\n m_i = i + 1\r\n l_v[m_i] -= 1\r\n l_v[0] += 1\r\n t += 1\r\nprint(t)", "counter = 0\r\namount = int(input())\r\nvotes = map(int, input().split())\r\nvote_list = list(votes)\r\nbear = vote_list[0]\r\ndel vote_list[0]\r\nvote_list.sort(reverse=True)\r\nwhile bear <= vote_list[0]:\r\n bear+=1\r\n vote_list[0]-=1\r\n counter+=1\r\n vote_list.sort(reverse=True)\r\nprint(counter)", "n = int(input())\r\nc = list(map(int, input().split()))\r\ncount = 0\r\nwhile True:\r\n maxx = c[0]\r\n point = 0\r\n for i in range(len(c)):\r\n if c[i] >= maxx:\r\n maxx = c[i]\r\n point = i\r\n if point != 0:\r\n c[0] += 1\r\n c[point] -= 1\r\n count += 1\r\n else:\r\n break\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = a[1:]\r\nm = max(b)\r\nans = 0\r\nmi = b.index(max(b))\r\nwhile a[0] <= m:\r\n b[mi] -= 1\r\n ans += 1\r\n a[0] += 1\r\n m = max(b)\r\n mi = b.index(max(b))\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nwhile max(a[1:]) >= a[0]:\r\n i = 0\r\n for j in range(len(a)):\r\n if a[j] == max(a):\r\n i = j\r\n a[i] -= 1\r\n a[0] += 1\r\n cnt += 1\r\nprint(cnt)\r\n", "input()\r\nlst = list(map(int, input().split()))\r\n\r\nlimak = lst[0]\r\nbonus = 0\r\nlst = lst[1:]\r\n\r\nwhile limak + bonus <= max(lst):\r\n bonus += 1\r\n lst[lst.index(max(lst))] -= 1\r\n \r\nprint(bonus)", "#!/usr/bin/python3\r\nimport sys\r\n\r\ndef main():\r\n # Read input\r\n l1 = sys.stdin.readline().strip()\r\n l2 = sys.stdin.readline().strip()\r\n lines = [ l1, l2 ]\r\n \r\n # Do work\r\n result = str(solve(lines))\r\n \r\n # Write result to output \r\n sys.stdout.write(result + '\\n')\r\n\r\ndef solve(lines):\r\n votes = [int(v) for v in lines[1].split()]\r\n \r\n if (len(votes) == 1): return 0\r\n\r\n base_vote = votes[0]\r\n votes = votes[1:]\r\n votes = [v for v in votes if v >= base_vote]\r\n\r\n votes_stolen = 0\r\n while any(base_vote <= x for x in votes):\r\n i = max_vote_index(votes)\r\n votes[i] -= 1\r\n base_vote += 1\r\n \r\n votes_stolen += 1\r\n\r\n return votes_stolen\r\n\r\ndef max_vote_index(votes):\r\n index_of_max = 0\r\n if (len(votes) == 1):\r\n return 0\r\n for i in range(1, len(votes)):\r\n if votes[i] > votes[index_of_max]:\r\n index_of_max = i\r\n return index_of_max\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\na = list(map(int, input().split()))\r\na0 = a[0]\r\na = sorted(a[1:])\r\ncnt = 0\r\nwhile a0 <= a[-1]:\r\n cnt += 1\r\n a0 += 1\r\n a[-1] -= 1\r\n a.sort()\r\nprint(cnt)", "n = int(input())\r\n\r\nb,*l = list(map(int,input().split()))\r\n\r\nl = sorted(l)\r\na=0\r\nwhile(b<=l[-1]):\r\n\r\n l[-1]-=1\r\n b+=1\r\n a+=1\r\n l=sorted(l)\r\n\r\nprint(a)\r\n", "input()\r\na=[int(i) for i in input().split()]\r\nl=a[0]\r\nt=[]\r\nfor x in a:\r\n if x>=l:\r\n t.append(x)\r\nif len(t)==1:\r\n print(0)\r\n exit()\r\nc=0\r\nwhile l<=max(t):\r\n l+=1\r\n c+=1\r\n this=t.index(max(t))\r\n t[this]-=1\r\nprint(c)", "if __name__ == '__main__':\r\n n = int(input()) - 1\r\n line = list((map(int, input().split())))\r\n note = tar = line[0]\r\n line = line[1:]\r\n line.sort()\r\n while tar <= line[-1]:\r\n tar += 1\r\n line[-1] -= 1\r\n line.sort()\r\n print(tar - note)\r\n", "'''input\n2\n7 6\n'''\nn = int(input())\na = list(map(int, input().split()))\nl, o = a[0], a[0]\na = a[1:]\nwhile l <= max(a):\n\ta[a.index(max(a))] -= 1\n\tl += 1\nprint(l - o)\n\n\n\n\n\n\n\n\n\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n# AUTHOR: haya14busa\nimport sys\nimport io\n\nfrom collections import Counter\n\ndef solve(n, vs):\n # vs: votes\n assert 2 <= n <= 1000\n # Limak's vote is vs[0]\n for v in vs:\n assert 1 <= v <= 1000\n\n # limak's vote, rest's votes\n lv, rvs = vs[0], vs[1:]\n cnt = 0\n\n votes = Counter(rvs)\n max_vote = max(rvs)\n\n while lv <= max_vote:\n votes[max_vote] -= 1\n votes[max_vote - 1] += 1\n if votes[max_vote] == 0:\n max_vote -= 1\n lv += 1\n cnt += 1\n\n return cnt\n\n\ndef getinput():\n def getint():\n return int(input())\n\n def getints_line():\n return list(map(int, input().split(' ')))\n\n def getints(n):\n return [getint() for _ in range(n)]\n\n def getints_lines(n):\n return [getints_line() for _ in range(n)]\n return [getint(), getints_line()]\n\n\ndef iosolve():\n return str(solve(*getinput()))\n # return 'YES' if solve(*getinput()) else 'NO' # for boolean output\n # return '\\n'.join(map(str, solve(*getinput()))) # for multiple line output\n\n\ndef main():\n if sys.stdin.isatty():\n test()\n stdin_lines = getstdin_lines()\n sys.stdin = io.StringIO('\\n'.join(stdin_lines))\n if stdin_lines:\n print(iosolve())\n else:\n test()\n\n\ndef test():\n IO_TEST_CASES = [\n\n (\n # INPUT\n '''\\\n5\n5 1 11 2 8\n ''',\n # EXPECT\n '''\\\n4\n '''\n ),\n\n (\n # INPUT\n '''\\\n4\n1 8 8 8\n ''',\n # EXPECT\n '''\\\n6\n '''\n ),\n\n (\n # INPUT\n '''\\\n2\n7 6\n ''',\n # EXPECT\n '''\\\n0\n '''\n ),\n\n ]\n\n # List[(List[arg for solve()], expect)]\n TEST_CASES = [\n # ([], None),\n ]\n\n # You do need to see below\n import unittest # to save memory, import only if test required\n import sys\n import io\n\n class Assert(unittest.TestCase):\n def equal(self, a, b):\n self.assertEqual(a, b)\n\n def float_equal(self, actual, expect, tolerance):\n self.assertTrue(expect - tolerance < actual < expect + tolerance)\n\n art = Assert()\n\n for inputs, expect in TEST_CASES:\n art.equal(solve(*inputs), expect)\n\n for stdin, expect in IO_TEST_CASES:\n sys.stdin = io.StringIO(stdin.strip())\n art.equal(iosolve(), expect.strip())\n # art.float_equal(float(iosolve()), float(expect.strip()), 10 ** -6)\n\n\ndef getstdin_lines():\n stdin = []\n while 1:\n try:\n stdin.append(input())\n except EOFError:\n break\n return stdin\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nvotes = [ int(vote) for vote in input().split() ]\nlimak = votes[0]\nvotes = votes[1:]\n\nvotes.sort()\nvotes = votes[::-1]\ncandies = 0\nindex = 0\nwhile limak <= votes[index]:\n #print(\"limak:\", limak)\n #print(\"votes[\", index, \"]:\", votes[index])\n candies += 1\n votes[index] -= 1\n limak += 1\n\n if index+1 < n-1:\n if votes[index+1] > votes[index]:\n index += 1\n if votes[0] > votes[index]:\n index = 0\n else:\n if votes[0] > votes[index]:\n index = 0\n\nprint(candies)", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\ncnt = 0\r\nr = s[0]\r\na = sorted(s[1::])\r\na = a[::-1]\r\nb = s[0]\r\nj = 0\r\n\r\nwhile s[0]<=max(a):\r\n\tif j==len(a):\r\n\t\tj=0\r\n\tif s[0]>max(a):\r\n\t\tbreak\r\n\twhile a[j]==max(a) and a[j]!=0:\r\n\t\tif s[0]>max(a):\r\n\t\t\tbreak\r\n\t\tcnt+=1\r\n\t\ts[0]+=1\r\n\t\ta[j]-=1\r\n\tj+=1\r\n\t\r\n\r\nprint(s[0]-r)\r\n\r\n\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ni = 0\r\n \r\nwhile(arr[0]<=max(arr[1:])):\r\n \r\n \r\n \r\n arr[1+arr[1:].index(max(arr))]-=1\r\n arr[0]+=1\r\n \r\n i+=1\r\nprint(i)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nbribe=0\r\nflag='True'\r\nwhile(flag):\r\n #print(\"bribe={}\".format(bribe))\r\n #print(a)\r\n max=a[0]\r\n k=0\r\n for i in range(1,n):\r\n if a[i]>=max:\r\n max=a[i]\r\n k=i\r\n if k!=0 and max>=a[0]:\r\n a[0]+=1\r\n a[k]-=1\r\n bribe+=1\r\n else:\r\n flag=0\r\nprint(bribe)", "c = int(input())\r\nlst = list(map(int,input().split()))\r\nlimak = lst[0]\r\norg = lst[0]\r\ndel lst[0]\r\nwhile limak <= max(lst) :\r\n lst.append(max(lst) - 1)\r\n lst.remove(max(lst))\r\n limak += 1\r\nprint(limak - org)\r\n", "n = int(input())\nnums = input().split()\nlimak = int(nums[0])\nnums.pop(0)\nhas_win = False\ncount = 0\nfor i in range(0, len(nums)):\n nums[i] = int(nums[i])\n\nwhile has_win == False:\n nums.sort(reverse=True)\n if limak <= int(nums[0]):\n limak = limak + 1\n nums[0] = nums[0] - 1\n count = count + 1\n else:\n has_win = True\n\nprint(count)\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nk=0\r\nwhile a[0]<=max(a[1:]):\r\n a[1+a[1:].index(max(a))]-=1\r\n a[0]+=1\r\n k+=1\r\nprint(k)\r\n", "input()\r\ns = list(map(int, input().split()))\r\nk = 0\r\nwhile s[0] <= max(s[1 : ]):\r\n s[1 + s[1 : ].index(max(s))] -= 1\r\n s[0] += 1\r\n k += 1\r\nprint(k)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nlimak = a[0]\r\na = a[1:]\r\n\r\nc = [0] * (1001)\r\nfor votes in a:\r\n c[votes] += 1\r\n\r\nans = 0\r\ncur_max = max(a)\r\nwhile limak <= cur_max:\r\n limak += 1\r\n ans += 1\r\n c[cur_max] -= 1\r\n c[cur_max - 1] += 1\r\n if c[cur_max] == 0:\r\n cur_max -= 1\r\n \r\nprint(ans)", "t = int(input())\r\ng = input().split()\r\nfor index in range(len(g)):\r\n g[index] = int(g[index])\r\nl = g[0]\r\nc = 0\r\ng.remove(l)\r\nwhile l - 1 < max(g):\r\n g[g.index(max(g))] -= 1\r\n l += 1\r\n c += 1\r\nprint(c)", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List, Mapping\r\nsys.setrecursionlimit(999999)\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\na = arr.pop(0)\r\n\r\narr.sort()\r\nans = 0\r\nwhile a<=arr[-1]:\r\n t = arr.pop()\r\n bisect.insort(arr,t-1)\r\n a+=1\r\n ans+=1\r\nprint(ans)", "input()\ns=list(map(int,input().split()))\nk=0\nwhile s[0]<=max(s[1:]):\n s[1+s[1:].index(max(s))]-=1\n s[0]+=1\n k+=1\nprint(k)\n \t \t \t \t \t\t\t \t \t \t\t \t \t \t", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\n\r\nb = l.pop(0)\r\ncont = 0\r\n\r\nwhile b <= max(l):\r\n b += 1\r\n cont += 1\r\n l[l.index(max(l))] -= 1\r\n \r\nprint(cont)\r\n \r\n", "n = int(input()) - 1\r\nv = list(map(int, input().split()))\r\nval = v.pop(0)\r\nans = 0\r\nv.sort()\r\nwhile val <= v[n - 1]:\r\n ans += 1\r\n val += 1\r\n v[n - 1] -= 1\r\n v.sort()\r\nprint(ans)", "n = int(input())\nvotes = list(map(int, input().split()))\n\ntemp = votes[0]\n\nwhile True:\n \n votes[1:] = sorted(votes[1:])\n\n if temp > votes[-1]: break\n else:\n votes[-1] -= 1\n temp += 1\n\nprint(temp-votes[0])", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = a[0]\r\na.pop(0)\r\na.sort()\r\nans = 0\r\nwhile x <= max(a):\r\n\tp = max(a)\r\n\ta[a.index(p)] -= 1\r\n\tx += 1\r\n\tans += 1\r\n\tp = max(a)\r\nprint(ans)", "n = int(input())\r\n\r\na = input().split()\r\n\r\n\r\ndef max(aa):\r\n mi = 1\r\n for i in range(n - 1):\r\n if int(aa[i + 1]) > int(aa[mi]):\r\n mi = i + 1\r\n return mi\r\n\r\ns = 0\r\n\r\nwhile int(a[0]) <= int(a[max(a)]):\r\n s += 1\r\n \r\n mi = max(a)\r\n a[0] = str(int(a[0]) + 1)\r\n a[max(a)] = str(int(a[max(a)]) - 1)\r\n \r\n\r\n \r\n\r\nprint(s)\r\n\r\n", "\n\nif __name__ == '__main__':\n n = int(input())\n a = list(map(int, input().split()))\n \n ct, m, best = 0, a.pop(0), max(a)\n while m <= best:\n m += 1\n ct += 1\n a[a.index(best)] -= 1\n best = max(a)\n print(ct)", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\nlim=a[0]\r\na[1:]=sorted(a[1:])\r\nt=0\r\nwhile(a[0] <= a[-1]):\r\n a[0]=a[0]+1\r\n a[-1]=a[-1]-1\r\n t+=1\r\n a[1:]=sorted(a[1:])\r\nprint(t)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nwhile l[0]<=max(l[1:]):\r\n l[l[1:].index(max(l))+1]-=1\r\n l[0]+=1\r\n c+=1\r\nprint(c)", "n = int(input())\r\nc = []\r\nvalues = list(map(int,(input().split())))\r\nt = values[0]\r\nfor i in range(n - 1):\r\n\tc.append(values[i+1]) \r\nc.sort(reverse=True)\r\nans = 0\r\nwhile True:\r\n\tif t > c[0] :\r\n\t\tbreak;\r\n\tt += 1\r\n\tc[0] -= 1\r\n\tans += 1\r\n\tc.sort(reverse=True)\r\nprint(ans)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nx=0\r\nwhile a[0]<max(a):\r\n a[a.index(max(a))]-=1\r\n a[0]+=1\r\n x+=1\r\nif(a.count(max(a))>1):\r\n print(x+1)\r\nelse:\r\n print(x)", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = a[0]\r\na = a[1:]\r\ny = max(a)\r\nans = 0\r\nwhile y >= c:\r\n if c <= y:\r\n c += 1\r\n ans += 1\r\n a[a.index(y)] -= 1\r\n y = max(a)\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(input().split(\" \"))\r\nl = [int(x) for x in l]\r\n\r\ngano = False\r\nsobornos = 0\r\n\r\ndef buscar_mayor(l):\r\n pos_mayor = 1000\r\n valor_mayor = -1\r\n for i in reversed(range(len(l))):\r\n if l[i]>valor_mayor:\r\n valor_mayor = l[i]\r\n pos_mayor = i\r\n return pos_mayor\r\n\r\nwhile gano == False:\r\n if buscar_mayor(l) == 0:\r\n gano = True\r\n else:\r\n m = buscar_mayor(l)\r\n l[0] += 1\r\n l[m] -= 1\r\n sobornos += 1\r\n\r\nprint(sobornos)\r\n\r\n", "N = int(input())\nvotes = [int(x) for i, x in enumerate(input().split())]\nmy = votes[0]\nold = my\nvotes = sorted(votes[1:], key=lambda x: -x)\nwhile my <= votes[0]:\n votes[0] -= 1\n my += 1\n i = 0\n while i + 1 < len(votes) and votes[i] < votes[i + 1]:\n votes[i], votes[i + 1] = votes[i + 1], votes[i]\n i += 1\nprint(my - old)\n", "n = int(input())\narr = list(map(int, input().split()))\nm = max(arr)\nk = arr[0]\nwhile(arr[0] != max(arr)):\n\th = arr.index(max(arr))\n\tarr[0] += 1\n\tarr[h] -= 1\nif (arr.count(max(arr)) > 1):\n\tprint(arr[0] - k + 1)\nelse:\n\tprint(arr[0] - k)\n\t \t\t\t\t \t\t\t \t\t \t\t \t\t\t\t\t \t \t\t\t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\nmain = a[0]\r\nrest = sorted(a[1:], reverse=True)\r\ncounter = 0\r\nwhile True:\r\n rest = sorted(rest, reverse=True)\r\n if main > rest[0]:\r\n print(counter)\r\n exit()\r\n else:\r\n main += 1\r\n rest[0] -= 1\r\n counter += 1", "import sys\n\nn = int(input())\nan = list(map(int, sys.stdin.readline().split()))\n\nans = 0\nwhile True:\n max_i = 0\n for i in range(1, n):\n if an[i] >= an[max_i]:\n max_i = i\n\n if max_i is 0:\n break\n else:\n an[0] += 1\n an[max_i] -= 1\n ans += 1\n\nprint(ans)\n", "n = int(input())\r\n\r\na = []\r\nmaximum = -1\r\nfor x in input().split():\r\n vote = int(x)\r\n maximum = max(maximum, vote)\r\n a.append(vote)\r\n\r\nfor bribe in range(0, maximum - a[0] + 2):\r\n cnt = a[0] + bribe\r\n delta = 0\r\n for i in range (1, n):\r\n if (a[i] >= cnt):\r\n delta += a[i] - cnt + 1\r\n if delta <= bribe:\r\n print(bribe)\r\n break\r\n", "\r\n\r\nif __name__=='__main__':\r\n t = int(input())\r\n voters = list(map(int,input().split()))\r\n j = max(voters)\r\n if voters.index(j)==0 and voters.count(j)==1:\r\n print(0)\r\n else:\r\n k = voters.count(j)\r\n first = voters[0]\r\n voters.remove(first)\r\n count = 0\r\n while max(voters)>=first:\r\n j = max(voters)\r\n p = voters.index(j)\r\n first += 1\r\n voters[p] -= 1\r\n count += 1\r\n print(count)\r\n \r\n \r\n \r\n", "__author__ = 'suvasish'\r\n\r\ncandidates = int(input())\r\nvotes = input().split(' ')\r\nlimak_vote_count = 0\r\nvotes = list(map(int, votes))\r\n\r\nwhile votes[0] <= max(votes[1:]):\r\n indx = votes[1:].index(max(votes[1:]))\r\n votes[0] += 1\r\n limak_vote_count += 1\r\n votes[indx+1] -= 1\r\nprint(limak_vote_count)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = 0\r\nwhile a[0] <= max(a[1:n]):\r\n a[a[1:n].index(max(a[1:n]))+1] -= 1\r\n m += 1\r\n a[0] += 1\r\nprint(m)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nk = 0\r\nwhile arr[0] <= max(arr[1:]) :\r\n arr[1 + arr[1:].index(max(arr))] -= 1\r\n arr[0] += 1\r\n k += 1\r\nprint(k)\r\n", "\ninput()\nc=[int(x)for x in input().split()]\nl=c.pop(0)\nc.sort(reverse=True)\nans=0\nwhile l<=c[0]:\n ans+=1\n l+=1\n c[0]-=1\n c.sort(reverse=True)\nprint(ans)\n\n", "n = int(input())\nline = list(map(int, input().split()))\nkamil = line[0]\nline = line[1:]\nline.sort()\ncount = 0\nwhile kamil <= line[-1]:\n\tline[-1] -= 1\n\tkamil +=1\n\tcount += 1\n\tline.sort()\n\nprint(count)", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nh = []\r\nfor i in a[1:]:\r\n heapq.heappush(h, -i)\r\nu = a[0]\r\nwhile u <= -h[0]:\r\n u += 1\r\n x = heapq.heappop(h)\r\n heapq.heappush(h, x + 1)\r\nans = u - a[0]\r\nprint(ans)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nlimak = arr.pop(0)\r\nans = 0\r\n\r\narr.sort()\r\nwhile (arr[n-2] >= limak) :\r\n\tarr[n-2] -= 1\r\n\tlimak += 1\r\n\tans += 1\r\n\tarr.sort()\r\n\t\r\nprint(ans)\r\n\r\n\t\r\n", "n=(int)(input(\"\"))\r\na = list(map(int, input().split()))\r\nv0=a[0]\r\na=a[1:]\r\na.sort(reverse=True)\r\ncnt=0;\r\nwhile(v0<=a[0]):\r\n a[0]-=1\r\n cnt+=1\r\n v0+=1\r\n a.sort(reverse=True)\r\nprint(cnt)\r\n", "\r\nn=int(input())\r\narr1=list(map(int,input().split()))\r\nok=arr1[0]\r\narr1=arr1[1:]\r\narr1.sort()\r\ncount=0\r\nwhile ok<=arr1[-1]:\r\n arr1[-1]-=1\r\n ok+=1\r\n count+=1\r\n arr1.sort()\r\nprint(count)\r\n", "n = int(input())\r\na = input().split()\r\nl = int(a[0])\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nif max(a) == l:\r\n c = 0\r\n for i in range(len(a)):\r\n if a[i] == l:\r\n c += 1\r\n if c==2:\r\n break\r\n if c==2:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n f = True\r\n c = 0\r\n while (f):\r\n a[a.index(max(a))] = a[a.index(max(a))]-1\r\n l += 1\r\n c += 1\r\n if l == max(a):\r\n e = 0\r\n for i in range(len(a)):\r\n if a[i] == l:\r\n e = 1\r\n break\r\n if e == 0:\r\n f = False\r\n elif l > max(a):\r\n f = False\r\n\r\n print(c)\r\n\r\n\r\n", "n = int(input())\narr = list(map(int, input().split()))\nmishka = arr[0]\narr[0] = -1\n\nans = 0\n\nwhile(mishka < max(arr) and mishka != max(arr)):\n mishka += 1\n arr[arr.index(max(arr))] = max(arr) - 1\n ans += 1\n\nif(mishka == max(arr)):\n ans += 1\n\nprint(ans)", "n=int(input())\r\na= list(map(int, input().split()))\r\nt1=a[0]\r\nb=sorted(a,reverse=True)\r\ndef fn(t1,b):\r\n if t1==b[0] and b[0]>b[1]:return 0\r\n i=0\r\n while t1<=b[0]:\r\n t1+=1\r\n b[0]-=1\r\n b=sorted(b,reverse=True)\r\n i+=1\r\n return i\r\nprint(fn(t1,b))\r\n", "input()\r\nA, k = list(map(int, input().split())), 0\r\n\r\nwhile True:\r\n i = A.index(max(A))\r\n if i == 0:\r\n print(k + (A.count(A[0]) > 1))\r\n break\r\n A[0], A[i], k = A[0] + 1, A[i] - 1, k + 1", "n=int(input())\r\narr=list(map(int,input().split()))\r\ncnt=0\r\narr[1:]=sorted(arr[1:])\r\nwhile arr[0]<=arr[-1]:\r\n arr[-1]-=1\r\n arr[0]+=1\r\n cnt+=1\r\n arr[1:]=sorted(arr[1:])\r\nprint(cnt)", "from queue import PriorityQueue as PQ\nn = int(input())\nr, *a = [int(x) for x in input().split()]\npq = PQ()\nfor x in a:\n\tpq.put((-x, x))\nans = 0\nwhile True:\n\tp, x = pq.get()\n\tif x < r:\n\t\tbreak\n\tr += 1\n\tx -= 1\n\tpq.put((-x, x))\n\tans += 1\nprint(ans)\n", "def main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n limak_score = a[0]\r\n a = a[1:]\r\n counter = 0\r\n if len(a) == 0:\r\n print(0)\r\n else:\r\n max_val = max(a)\r\n hash_a = [0 for i in range(1002)]\r\n for i in a:\r\n hash_a[i] += 1\r\n while max_val >= limak_score:\r\n limak_score += 1\r\n if max_val - 1 > 0:\r\n hash_a[max_val - 1] += 1\r\n hash_a[max_val] -= 1\r\n if hash_a[max_val] == 0:\r\n max_val -= 1\r\n counter += 1\r\n #print(limak_score, max_val)\r\n print(counter)\r\n\r\n\r\n\r\n\r\nmain_function()", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nct=0\r\nwhile max(l)>l[0]:\r\n y=l.index(max(l))\r\n l[y]-=1\r\n l[0]+=1\r\n ct+=1\r\n \r\n \r\nfor i in range(1,len(l)):\r\n if l[i]==l[0]:\r\n ct+=1\r\n break\r\n \r\n \r\nprint(ct)", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = a[0]\r\nk = 0\r\nwhile True:\r\n maxi = 1\r\n maxe = a[1]\r\n for i in range(1, n):\r\n if a[i] > maxe:\r\n maxi = i\r\n maxe = a[i]\r\n if maxe >= x:\r\n a[maxi] -= 1\r\n x += 1\r\n k += 1\r\n else:\r\n break\r\nprint(k) \r\n \r\n \r\n", "a=int(input())\r\nb=input().split()\r\nfor i in range(a):\r\n b[i]=int(b[i])\r\nbribes=0\r\nwhile b[0]!=max(b):\r\n for i in range(1,len(b)):\r\n if b[i]==max(b):\r\n b[i]-=1\r\n b[0]+=1\r\n bribes+=1\r\n break\r\ntrue = False\r\nfor i in range(1,len(b)):\r\n if b[i]==max(b):\r\n true=True\r\nif true:\r\n bribes+=1\r\nprint(bribes)\r\n", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nli = mas[0]\r\nli1 = li\r\nmas = mas[1::]\r\nwhile li <= max(mas):\r\n mas = sorted(mas)\r\n mas[-1] -= 1\r\n li += 1\r\nprint(li-li1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmx = 0\r\nwhile a[0] <= max(a[1:n]):\r\n a[a[1:].index(max(a[1:n]))+1] -= 1\r\n a[0] += 1\r\n mx += 1\r\nprint(mx)\r\n", "n = int(input())\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\n# a.sort()#; print(a)\r\nlim = a[0]\r\na = a[1:]\r\nmx = max(a)\r\nx = 0\r\nwhile lim <= mx:\r\n ind_mx = a.index(mx)\r\n delta = 1# (mx - lim) // 2\r\n if delta == 0: delta = 1\r\n lim += delta\r\n a[ind_mx] -= delta; #print(ind_mx,a[ind_mx],lim)\r\n mx = max(a)\r\n x += delta\r\n\r\nprint(x)", "n = int(input())\r\nar = list(map(int, input().split()))\r\nk = ar.pop(0)\r\nbribes = 0\r\nar.sort()\r\nwhile(k<=ar[n-2]):\r\n k += 1\r\n bribes += 1\r\n ar[n-2] -= 1\r\n ar.sort()\r\nprint(bribes)", "n=int(input())\r\ncandy=list(map(int,input().split()))\r\ncount=0\r\nwhile candy[0]<=max(candy[1:n]):\r\n candy[candy[1:n].index(max(candy[1:n]))+1]-=1\r\n count+=1\r\n candy[0]+=1\r\nprint(count)\r\n", "def max_range(a,l,r):\r\n\tp=l\r\n\tfor i in range(l+1,r+1):\r\n\t\tif(a[i]>a[p]):\r\n\t\t\tp=i\r\n\treturn p\r\n\r\nn=eval(input())\r\na=[0]*n\r\na=list(map(int,input().split()))\r\nk=0\r\nwhile(max(a)!=a[0]):\r\n\tk+=1\r\n\tx=max_range(a,1,n-1)\r\n\ta[0]+=1\r\n\ta[x]-=1\r\nfor i in range(1,n):\r\n\tif(a[i]==a[0]):\r\n\t\tk+=1\r\n\t\tbreak\r\nprint(k)\r\n", "# 574A\r\n# O(n*lg(n) + max(ai)) time\r\n# θ(n) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n n = read() - 2\r\n t = read(3)\r\n z = t[0]\r\n a = sorted(t[1:])[::-1]\r\n c = i = 0\r\n while z <= a[i]:\r\n z += 1\r\n c += 1\r\n a[i] -= 1\r\n if i < n and a[i + 1] > a[i]:\r\n i += 1\r\n else:\r\n i = 0\r\n return c\r\n\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\\n\")\r\n\r\n\r\nwrite(main())", "i = int(input())\r\nl = list(map(int,input().split()))\r\nk = 0\r\nwhile l[0] <= max(l[1:]):\r\n l[1+l[1:].index(max(l))] -= 1\r\n l[0] +=1\r\n k +=1\r\nprint(k)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nmax1 = max(s[1:])\r\nind = s[1:].index(max1) + 1\r\nschet = 0\r\nwhile s[0] <= max1:\r\n s[0] += 1\r\n s[ind] -= 1\r\n max1 = max(s[1:])\r\n ind = s[1:].index(max1) + 1\r\n schet += 1\r\nprint(schet)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nk = 0\r\nwhile True:\r\n j = max(range(1, n), key=lambda i: a[i])\r\n if a[0] <= a[j]:\r\n a[0] += 1\r\n a[j] -= 1\r\n k += 1\r\n else:\r\n break\r\nprint(k)\r\n", "def check(n, lst, lk):\r\n lst[0] += lk\r\n for i in range(1, n):\r\n if lst[i] >= lst[0]:\r\n lk -= lst[i] - lst[0] + 1\r\n if lk >= 0:\r\n return True\r\n return False\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nleft = -1\r\nright = 100000\r\nwhile left + 1 < right:\r\n middle = (left + right) // 2\r\n if check(n, lst.copy(), middle):\r\n right = middle\r\n else:\r\n left = middle\r\nprint(right)\r\n \r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\np = a[0]\r\na = a[1:]\r\nw = 0\r\nmaxv = max(a)\r\nwhile p <= maxv:\r\n p += 1\r\n a.remove(maxv)\r\n a.append(maxv-1)\r\n w += 1\r\n maxv = max(a);\r\nprint(w)", "def main():\n input()\n l = list(map(int, input().split()))\n x = x0 = l.pop(0)\n y = max(l)\n c = [0] * (y + 1)\n for t in l:\n c[t] += 1\n c[0] = 1\n while True:\n while not c[y]:\n y -= 1\n if y < x:\n break\n t = c[y]\n if x + t > y:\n x = y + 1\n break\n y -= 1\n c[y] += t\n x += t\n print(x - x0)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\nn = int(input())\na = list(map(int, sys.stdin.readline().split()))\na0 = a[0]\nb = [i+1-a0 for i in a[1:] if i >= a0]\ndef getNb(l):\n if len(l) == 0:\n return 0\n m = max(l)\n if m <= 0:\n return m\n idx = l.index(m)\n l[idx] -= 1\n l2 = [i-1 for i in l if i > 1]\n return 1+getNb(l2)\nprint(getNb(b))\n", "import sys\r\nfrom collections import Counter\r\n\r\nlines = sys.stdin.read().split(\"\\n\")\r\n# n, k = map(int, lines[0].split(\" \"))\r\n# n = int(lines[0])\r\n# nums = list(map(int, lines[1].split(\" \")))\r\n\r\n\r\nn = int(lines[0])\r\nnums = list(map(int, lines[1].split(\" \")))\r\ns = nums[0]\r\nos = nums[0]\r\nnums = nums[1:]\r\nnums.sort()\r\n\r\n\r\ndef get_max_n(nums):\r\n pre = nums[-1]\r\n for i in range(len(nums) - 1, -1, -1):\r\n if nums[i] != pre:\r\n break\r\n if nums[i] != pre:\r\n return len(nums) - (i + 1), pre, nums[i]\r\n else:\r\n return len(nums), pre, 0\r\n\r\nwhile True:\r\n a, b, c = get_max_n(nums)\r\n if a * (b - c) + s > c:\r\n if s > b:\r\n break\r\n for i in range(1, b - c + 1):\r\n if i * a + s > b - i:\r\n if i * a + s - 1 <= b - i + 1:\r\n s = i * a + s\r\n break\r\n else:\r\n subdown = min(a - 2, i * a + s - 1 - (b - i + 1) - 1)\r\n subdown = 0 if subdown < 0 else subdown\r\n s = i * a + s - 1 - subdown\r\n break\r\n break\r\n else:\r\n s += a * (b - c)\r\n nums[-a:] = [c] * a\r\nprint(s - os)\r\n", "import sys\r\n\r\ndef chkrange(list, a, b):\r\n while a > 0:\r\n if list[a] == list[a-1]:\r\n a -= 1\r\n else:\r\n break\r\n return(a, b)\r\n \r\n\r\nn = int(input())\r\nlist2 = input().split()\r\nlist = []\r\nfor item in list2:\r\n list.append(int(item))\r\nvote = list[0]\r\ndel list[0]\r\nlist.sort()\r\n\r\na = len(list)-1\r\nb = a\r\n\r\na, b = chkrange(list, a, b)\r\nans = 0\r\ni = a\r\nwhile vote <= list[len(list)-1]:\r\n list[i] -= 1\r\n i += 1\r\n ans += 1\r\n vote += 1\r\n if i == len(list):\r\n a, b = chkrange(list, a, b)\r\n i = a\r\nprint (ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=0\r\nt=l[0]\r\nl[0]=0\r\nl=sorted(l)\r\nwhile t<=l[n-1] :\r\n t=t+1\r\n l[n-1]=l[n-1]-1\r\n l=sorted(l)\r\n k=k+1\r\nprint(k)\r\n\r\n\r\n" ]